{"id":"https://openalex.org/W2276707316","doi":"https://doi.org/10.1007/s10107-016-0987-5","title":"On the equivalence of the bidirected and hypergraphic relaxations for Steiner tree","display_name":"On the equivalence of the bidirected and hypergraphic relaxations for Steiner tree","publication_year":2016,"publication_date":"2016-02-18","ids":{"openalex":"https://openalex.org/W2276707316","doi":"https://doi.org/10.1007/s10107-016-0987-5","mag":"2276707316"},"language":"en","primary_location":{"id":"doi:10.1007/s10107-016-0987-5","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10107-016-0987-5","pdf_url":null,"source":{"id":"https://openalex.org/S193920097","display_name":"Mathematical Programming","issn_l":"0025-5610","issn":["0025-5610","1436-4646"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Programming","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://ir.cwi.nl/pub/25096/MAPO4945.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5000019988","display_name":"Andreas Emil Feldmann","orcid":"https://orcid.org/0000-0001-6229-5332"},"institutions":[{"id":"https://openalex.org/I21250087","display_name":"Charles University","ror":"https://ror.org/024d6js02","country_code":"CZ","type":"education","lineage":["https://openalex.org/I21250087"]},{"id":"https://openalex.org/I7597260","display_name":"Hungarian Academy of Sciences","ror":"https://ror.org/02ks8qq67","country_code":"HU","type":"funder","lineage":["https://openalex.org/I7597260"]}],"countries":["CZ","HU"],"is_corresponding":true,"raw_author_name":"Andreas Emil Feldmann","raw_affiliation_strings":["KAM, Charles University in Prague, Prague, Czech Republic","SZTAKI, Hungarian Academy of Sciences, Budapest, Hungary"],"affiliations":[{"raw_affiliation_string":"KAM, Charles University in Prague, Prague, Czech Republic","institution_ids":["https://openalex.org/I21250087"]},{"raw_affiliation_string":"SZTAKI, Hungarian Academy of Sciences, Budapest, Hungary","institution_ids":["https://openalex.org/I7597260"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5111545821","display_name":"Jochen K\u00f6nemann","orcid":null},"institutions":[{"id":"https://openalex.org/I151746483","display_name":"University of Waterloo","ror":"https://ror.org/01aff2v68","country_code":"CA","type":"education","lineage":["https://openalex.org/I151746483"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Jochen K\u00f6nemann","raw_affiliation_strings":["Department of Combinatorics and Optimization, University of Waterloo, Waterloo, Canada"],"affiliations":[{"raw_affiliation_string":"Department of Combinatorics and Optimization, University of Waterloo, Waterloo, Canada","institution_ids":["https://openalex.org/I151746483"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5071590414","display_name":"Neil Olver","orcid":"https://orcid.org/0000-0001-8897-5459"},"institutions":[{"id":"https://openalex.org/I1341640284","display_name":"Centrum Wiskunde & Informatica","ror":"https://ror.org/00x7ekv49","country_code":"NL","type":"facility","lineage":["https://openalex.org/I1341640284","https://openalex.org/I2800991832"]},{"id":"https://openalex.org/I865915315","display_name":"Vrije Universiteit Amsterdam","ror":"https://ror.org/008xxew50","country_code":"NL","type":"education","lineage":["https://openalex.org/I865915315"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Neil Olver","raw_affiliation_strings":["CWI, Amsterdam, The Netherlands","Vrije Universiteit Amsterdam, Amsterdam, The Netherlands"],"affiliations":[{"raw_affiliation_string":"CWI, Amsterdam, The Netherlands","institution_ids":["https://openalex.org/I1341640284"]},{"raw_affiliation_string":"Vrije Universiteit Amsterdam, Amsterdam, The Netherlands","institution_ids":["https://openalex.org/I865915315"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5051955401","display_name":"Laura Sanit\u00e0","orcid":"https://orcid.org/0000-0002-6384-1857"},"institutions":[{"id":"https://openalex.org/I151746483","display_name":"University of Waterloo","ror":"https://ror.org/01aff2v68","country_code":"CA","type":"education","lineage":["https://openalex.org/I151746483"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Laura Sanit\u00e0","raw_affiliation_strings":["Department of Combinatorics and Optimization, University of Waterloo, Waterloo, Canada"],"affiliations":[{"raw_affiliation_string":"Department of Combinatorics and Optimization, University of Waterloo, Waterloo, Canada","institution_ids":["https://openalex.org/I151746483"]}]}],"institutions":[],"countries_distinct_count":4,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5000019988"],"corresponding_institution_ids":["https://openalex.org/I21250087","https://openalex.org/I7597260"],"apc_list":{"value":2190,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":2.1557,"has_fulltext":true,"cited_by_count":17,"citation_normalized_percentile":{"value":0.87891324,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"160","issue":"1-2","first_page":"379","last_page":"406"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9962000250816345,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9950000047683716,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/steiner-tree-problem","display_name":"Steiner tree problem","score":0.9253171682357788},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7848795652389526},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7506760954856873},{"id":"https://openalex.org/keywords/linear-programming-relaxation","display_name":"Linear programming relaxation","score":0.5358641743659973},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5014345645904541},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.46187400817871094},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.45733198523521423},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.43182891607284546},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.42254745960235596},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4214271903038025},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.4133950471878052},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.3120540380477905},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.23553773760795593},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.14542526006698608}],"concepts":[{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.9253171682357788},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7848795652389526},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7506760954856873},{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.5358641743659973},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5014345645904541},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.46187400817871094},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.45733198523521423},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.43182891607284546},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.42254745960235596},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4214271903038025},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.4133950471878052},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.3120540380477905},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.23553773760795593},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.14542526006698608},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0},{"id":"https://openalex.org/C77805123","wikidata":"https://www.wikidata.org/wiki/Q161272","display_name":"Social psychology","level":1,"score":0.0}],"mesh":[],"locations_count":10,"locations":[{"id":"doi:10.1007/s10107-016-0987-5","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10107-016-0987-5","pdf_url":null,"source":{"id":"https://openalex.org/S193920097","display_name":"Mathematical Programming","issn_l":"0025-5610","issn":["0025-5610","1436-4646"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Programming","raw_type":"journal-article"},{"id":"pmh:oai:cwi.nl:25096","is_oa":true,"landing_page_url":"https://ir.cwi.nl/pub/25096","pdf_url":"https://ir.cwi.nl/pub/25096/MAPO4945.pdf","source":{"id":"https://openalex.org/S7407055335","display_name":"Centrum Wiskunde & Informatica (CWI), the national research institute for mathematics and computer science in the Netherlands","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Mathematical Programming vol. 160 no. 1-2, pp. 379-406","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:eprints.lse.ac.uk:103084","is_oa":true,"landing_page_url":"https://orcid.org/0000-0001-8897-5459>","pdf_url":"http://eprints.lse.ac.uk/103084/1/fkos.pdf","source":{"id":"https://openalex.org/S4306401593","display_name":"London School of Economics and Political Science Research Online (London School of Economics and Political Science)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I909854389","host_organization_name":"London School of Economics and Political Science","host_organization_lineage":["https://openalex.org/I909854389"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"PeerReviewed"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.1004.7256","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.1004.7256","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://oai.cwi.nl/oai/asset/23057/23057D.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.708.6019","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.708.6019","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.math.uwaterloo.ca/%7Ejochen/docs/bcr-14.pdf","raw_type":"text"},{"id":"pmh:oai:eprints.lse.ac.uk:103178","is_oa":false,"landing_page_url":"http://eprints.lse.ac.uk/103178/","pdf_url":null,"source":{"id":"https://openalex.org/S4306401593","display_name":"London School of Economics and Political Science Research Online (London School of Economics and Political Science)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I909854389","host_organization_name":"London School of Economics and Political Science","host_organization_lineage":["https://openalex.org/I909854389"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"NonPeerReviewed"},{"id":"pmh:oai:eprints.sztaki.hu:9059","is_oa":false,"landing_page_url":"http://eprints.sztaki.hu/9059/","pdf_url":null,"source":{"id":"https://openalex.org/S4306401907","display_name":"SZTAKI Publication Repository (Hungarian Academy of Sciences)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I7597260","host_organization_name":"Hungarian Academy of Sciences","host_organization_lineage":["https://openalex.org/I7597260"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Article"},{"id":"pmh:oai:research.vu.nl:openaire_cris_publications/d1bf2d7e-2bde-4f51-b619-d8eb0045fb29","is_oa":false,"landing_page_url":"https://research.vu.nl/en/publications/d1bf2d7e-2bde-4f51-b619-d8eb0045fb29","pdf_url":null,"source":{"id":"https://openalex.org/S4306401107","display_name":"VU Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I865915315","host_organization_name":"Vrije Universiteit Amsterdam","host_organization_lineage":["https://openalex.org/I865915315"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Feldmann , A E , K\u00f6nemann , J , Olver , N K & Sanit\u00e0 , L 2014 , On the Equivalence of the Bidirected and Hypergraphic Relaxations for Steiner Tree . in K Jansen , J D P Rolim , N R Devanur & C Moore (eds) , Proceedings of APPROX-RANDOM 2014 . Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik , pp. 176-191 , APPROX , 4/09/14 . https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2014.176","raw_type":"contributionToPeriodical"},{"id":"pmh:oai:research.vu.nl:openaire_cris_publications/f9d6557e-c5f0-48e1-9050-4cd6fe760e5c","is_oa":false,"landing_page_url":"https://hdl.handle.net/1871.1/f9d6557e-c5f0-48e1-9050-4cd6fe760e5c","pdf_url":null,"source":{"id":"https://openalex.org/S4306401107","display_name":"VU Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I865915315","host_organization_name":"Vrije Universiteit Amsterdam","host_organization_lineage":["https://openalex.org/I865915315"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Feldmann, A E, K\u00f6nemann, J, Olver, N K & Sanit\u00e0, L 2016, 'On the equivalence of the bidirected and hypergraphic relaxations for Steiner tree', Mathematical Programming, vol. 160, no. 1, pp. 397-406. https://doi.org/10.1007/s10107-016-0987-5","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:vu:oai:research.vu.nl:publications/f9d6557e-c5f0-48e1-9050-4cd6fe760e5c","is_oa":false,"landing_page_url":"https://research.vu.nl/en/publications/f9d6557e-c5f0-48e1-9050-4cd6fe760e5c","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Mathematical Programming, 160(1), 397 - 406. Springer-Verlag GmbH and Co. KG","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"pmh:oai:cwi.nl:25096","is_oa":true,"landing_page_url":"https://ir.cwi.nl/pub/25096","pdf_url":"https://ir.cwi.nl/pub/25096/MAPO4945.pdf","source":{"id":"https://openalex.org/S7407055335","display_name":"Centrum Wiskunde & Informatica (CWI), the national research institute for mathematics and computer science in the Netherlands","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Mathematical Programming vol. 160 no. 1-2, pp. 379-406","raw_type":"info:eu-repo/semantics/article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2998137668","display_name":null,"funder_award_id":"unknown","funder_id":"https://openalex.org/F4320334593","funder_display_name":"Natural Sciences and Engineering Research Council of Canada"},{"id":"https://openalex.org/G400116904","display_name":null,"funder_award_id":"unknow","funder_id":"https://openalex.org/F4320334593","funder_display_name":"Natural Sciences and Engineering Research Council of Canada"},{"id":"https://openalex.org/G6009445997","display_name":null,"funder_award_id":"unknown","funder_id":"https://openalex.org/F4320321800","funder_display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek"}],"funders":[{"id":"https://openalex.org/F4320321487","display_name":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","ror":"https://ror.org/01h531d29"},{"id":"https://openalex.org/F4320321800","display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek","ror":"https://ror.org/04jsz6e67"},{"id":"https://openalex.org/F4320334593","display_name":"Natural Sciences and Engineering Research Council of Canada","ror":"https://ror.org/01h531d29"}],"has_content":{"grobid_xml":false,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2276707316.pdf"},"referenced_works_count":34,"referenced_works":["https://openalex.org/W55191700","https://openalex.org/W109985799","https://openalex.org/W1519520700","https://openalex.org/W1550399701","https://openalex.org/W1598916021","https://openalex.org/W1680675806","https://openalex.org/W1928219016","https://openalex.org/W1965229006","https://openalex.org/W1975290397","https://openalex.org/W1975442866","https://openalex.org/W1976584101","https://openalex.org/W1979269423","https://openalex.org/W1990317614","https://openalex.org/W1990571240","https://openalex.org/W1991528957","https://openalex.org/W1993553699","https://openalex.org/W1998126097","https://openalex.org/W2012130001","https://openalex.org/W2020586530","https://openalex.org/W2039298646","https://openalex.org/W2042492403","https://openalex.org/W2042788891","https://openalex.org/W2056824842","https://openalex.org/W2086709935","https://openalex.org/W2097004206","https://openalex.org/W2119918317","https://openalex.org/W2121370879","https://openalex.org/W2122195804","https://openalex.org/W2153014861","https://openalex.org/W2401610261","https://openalex.org/W2950857613","https://openalex.org/W3127447045","https://openalex.org/W3149604617","https://openalex.org/W4246185962"],"related_works":["https://openalex.org/W2367195720","https://openalex.org/W1968497507","https://openalex.org/W132011890","https://openalex.org/W1998126097","https://openalex.org/W1980288485","https://openalex.org/W2009976792","https://openalex.org/W2004321562","https://openalex.org/W328736688","https://openalex.org/W2995411114","https://openalex.org/W2114997377"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":3},{"year":2017,"cited_by_count":3}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}