{"id":"https://openalex.org/W1755753347","doi":"https://doi.org/10.1145/2716307","title":"Exponential Lower Bounds for Polytopes in Combinatorial Optimization","display_name":"Exponential Lower Bounds for Polytopes in Combinatorial Optimization","publication_year":2015,"publication_date":"2015-05-06","ids":{"openalex":"https://openalex.org/W1755753347","doi":"https://doi.org/10.1145/2716307","mag":"1755753347"},"language":"en","primary_location":{"id":"doi:10.1145/2716307","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2716307","pdf_url":null,"source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the ACM","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://ir.cwi.nl/pub/25730/ACM-Wolf.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5001781037","display_name":"Samuel Fiorini","orcid":"https://orcid.org/0000-0002-6845-9008"},"institutions":[{"id":"https://openalex.org/I132053463","display_name":"Universit\u00e9 Libre de Bruxelles","ror":"https://ror.org/01r9htc13","country_code":"BE","type":"education","lineage":["https://openalex.org/I132053463"]}],"countries":["BE"],"is_corresponding":true,"raw_author_name":"Samuel Fiorini","raw_affiliation_strings":["Universit\u00e9 libre de Bruxelles, Brussels, Belgium"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universit\u00e9 libre de Bruxelles, Brussels, Belgium","institution_ids":["https://openalex.org/I132053463"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5024306150","display_name":"Serge Massar","orcid":"https://orcid.org/0000-0002-4381-2485"},"institutions":[{"id":"https://openalex.org/I132053463","display_name":"Universit\u00e9 Libre de Bruxelles","ror":"https://ror.org/01r9htc13","country_code":"BE","type":"education","lineage":["https://openalex.org/I132053463"]}],"countries":["BE"],"is_corresponding":false,"raw_author_name":"Serge Massar","raw_affiliation_strings":["Universit\u00e9 libre de Bruxelles, Brussels, Belgium"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universit\u00e9 libre de Bruxelles, Brussels, Belgium","institution_ids":["https://openalex.org/I132053463"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5043574831","display_name":"Sebastian Pokutta","orcid":"https://orcid.org/0000-0001-7365-3000"},"institutions":[{"id":"https://openalex.org/I130701444","display_name":"Georgia Institute of Technology","ror":"https://ror.org/01zkghx44","country_code":"US","type":"education","lineage":["https://openalex.org/I130701444"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Sebastian Pokutta","raw_affiliation_strings":["Georgia Institute of Technology, Atlanta, GA","Georgia Institute of Technology Atlanta, GA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Georgia Institute of Technology, Atlanta, GA","institution_ids":["https://openalex.org/I130701444"]},{"raw_affiliation_string":"Georgia Institute of Technology Atlanta, GA","institution_ids":["https://openalex.org/I130701444"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5036380953","display_name":"Hans Raj Tiwary","orcid":"https://orcid.org/0000-0003-1903-1600"},"institutions":[{"id":"https://openalex.org/I132053463","display_name":"Universit\u00e9 Libre de Bruxelles","ror":"https://ror.org/01r9htc13","country_code":"BE","type":"education","lineage":["https://openalex.org/I132053463"]}],"countries":["BE"],"is_corresponding":false,"raw_author_name":"Hans Raj Tiwary","raw_affiliation_strings":["Universit\u00e9 libre de Bruxelles"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universit\u00e9 libre de Bruxelles","institution_ids":["https://openalex.org/I132053463"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5066563480","display_name":"Ronald de Wolf","orcid":"https://orcid.org/0000-0001-5147-6090"},"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","https://openalex.org/I4405262988"]},{"id":"https://openalex.org/I887064364","display_name":"University of Amsterdam","ror":"https://ror.org/04dkp9463","country_code":"NL","type":"education","lineage":["https://openalex.org/I887064364"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Ronald de Wolf","raw_affiliation_strings":["CWI and University of Amsterdam"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"CWI and University of Amsterdam","institution_ids":["https://openalex.org/I1341640284","https://openalex.org/I887064364"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5001781037"],"corresponding_institution_ids":["https://openalex.org/I132053463"],"apc_list":null,"apc_paid":null,"fwci":20.7126,"has_fulltext":true,"cited_by_count":121,"citation_normalized_percentile":{"value":0.99597977,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":100},"biblio":{"volume":"62","issue":"2","first_page":"1","last_page":"23"},"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.7353000044822693,"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.7353000044822693,"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/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.07670000195503235,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.044199999421834946,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/polytope","display_name":"Polytope","score":0.9185618162155151},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6874146461486816},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6541656255722046},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.5633816719055176},{"id":"https://openalex.org/keywords/birkhoff-polytope","display_name":"Birkhoff polytope","score":0.5624431371688843},{"id":"https://openalex.org/keywords/semidefinite-programming","display_name":"Semidefinite programming","score":0.559275209903717},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.5412476062774658},{"id":"https://openalex.org/keywords/connection","display_name":"Connection (principal bundle)","score":0.4950672686100006},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.47713255882263184},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"Combinatorial optimization","score":0.44048547744750977},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.41863611340522766},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.246913880109787},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.24281585216522217},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.06428402662277222}],"concepts":[{"id":"https://openalex.org/C145691206","wikidata":"https://www.wikidata.org/wiki/Q747980","display_name":"Polytope","level":2,"score":0.9185618162155151},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6874146461486816},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6541656255722046},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.5633816719055176},{"id":"https://openalex.org/C206304794","wikidata":"https://www.wikidata.org/wiki/Q4916482","display_name":"Birkhoff polytope","level":5,"score":0.5624431371688843},{"id":"https://openalex.org/C101901036","wikidata":"https://www.wikidata.org/wiki/Q2269096","display_name":"Semidefinite programming","level":2,"score":0.559275209903717},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.5412476062774658},{"id":"https://openalex.org/C13355873","wikidata":"https://www.wikidata.org/wiki/Q2920850","display_name":"Connection (principal bundle)","level":2,"score":0.4950672686100006},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.47713255882263184},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.44048547744750977},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.41863611340522766},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.246913880109787},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.24281585216522217},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.06428402662277222},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C49870271","wikidata":"https://www.wikidata.org/wiki/Q193657","display_name":"Convex set","level":4,"score":0.0},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1145/2716307","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2716307","pdf_url":null,"source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the ACM","raw_type":"journal-article"},{"id":"pmh:oai:dare.uva.nl:openaire_cris_publications/9e629996-2964-4457-a701-b753b9bb97a8","is_oa":false,"landing_page_url":"https://dare.uva.nl/personal/pure/en/publications/exponential-lower-bounds-for-polytopes-in-combinatorial-optimization(9e629996-2964-4457-a701-b753b9bb97a8).html","pdf_url":null,"source":{"id":"https://openalex.org/S4306400088","display_name":"UvA-DARE (University of Amsterdam)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I887064364","host_organization_name":"University of Amsterdam","host_organization_lineage":["https://openalex.org/I887064364"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Fiorini, S, Massar, S, Pokutta, S, Tiwary, H R & de Wolf, R 2015, 'Exponential Lower Bounds for Polytopes in Combinatorial Optimization', Journal of the Association for Computing Machinery, vol. 62, no. 2, 17. https://doi.org/10.1145/2716307","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:cwi:oai:cwi.nl:25730","is_oa":true,"landing_page_url":"https://ir.cwi.nl/pub/25730","pdf_url":"https://ir.cwi.nl/pub/25730/ACM-Wolf.pdf","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":"Journal of the ACM, 62(2)","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:dare.uva.nl:publications/9e629996-2964-4457-a701-b753b9bb97a8","is_oa":false,"landing_page_url":"https://handle.uba.uva.nl/personal/pure/en/publications/exponential-lower-bounds-for-polytopes-in-combinatorial-optimization(9e629996-2964-4457-a701-b753b9bb97a8).html","pdf_url":null,"source":{"id":"https://openalex.org/S4306400088","display_name":"UvA-DARE (University of Amsterdam)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I887064364","host_organization_name":"University of Amsterdam","host_organization_lineage":["https://openalex.org/I887064364"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Fiorini, S, Massar, S, Pokutta, S, Tiwary, H R & de Wolf, R 2015, 'Exponential Lower Bounds for Polytopes in Combinatorial Optimization', Journal of the Association for Computing Machinery, vol. 62, no. 2, 17. https://doi.org/10.1145/2716307","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:dipot.ulb.ac.be:2013/205444","is_oa":false,"landing_page_url":"http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/205444","pdf_url":null,"source":{"id":"https://openalex.org/S4306401063","display_name":"D\u00e9p\u00f4t institutionnel de l'Universit\u00e9 libre de Bruxelles (Universit\u00e9 Libre de Bruxelles)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I132053463","host_organization_name":"Universit\u00e9 Libre de Bruxelles","host_organization_lineage":["https://openalex.org/I132053463"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Journal of the Association for Computing Machinery, 62 (2","raw_type":"info:ulb-repo/semantics/openurl/article"}],"best_oa_location":{"id":"pmh:cwi:oai:cwi.nl:25730","is_oa":true,"landing_page_url":"https://ir.cwi.nl/pub/25730","pdf_url":"https://ir.cwi.nl/pub/25730/ACM-Wolf.pdf","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":"Journal of the ACM, 62(2)","raw_type":"info:eu-repo/semantics/article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3261977963","display_name":null,"funder_award_id":"600700","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G5830303806","display_name":null,"funder_award_id":"255961","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G8956504186","display_name":null,"funder_award_id":"255961, 600700","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"}],"funders":[{"id":"https://openalex.org/F4320320300","display_name":"European Commission","ror":"https://ror.org/00k4n6c32"},{"id":"https://openalex.org/F4320321390","display_name":"Fonds De La Recherche Scientifique - FNRS","ror":"https://ror.org/03q83t159"},{"id":"https://openalex.org/F4320321584","display_name":"F\u00e9d\u00e9ration Wallonie-Bruxelles","ror":"https://ror.org/04q01pf08"},{"id":"https://openalex.org/F4320321800","display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek","ror":"https://ror.org/04jsz6e67"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W1755753347.pdf","grobid_xml":"https://content.openalex.org/works/W1755753347.grobid-xml"},"referenced_works_count":81,"referenced_works":["https://openalex.org/W153015188","https://openalex.org/W203690387","https://openalex.org/W566766357","https://openalex.org/W605043455","https://openalex.org/W1485993952","https://openalex.org/W1496447390","https://openalex.org/W1541505008","https://openalex.org/W1585955818","https://openalex.org/W1587123489","https://openalex.org/W1597196612","https://openalex.org/W1631356911","https://openalex.org/W1656332724","https://openalex.org/W1794612339","https://openalex.org/W1816633297","https://openalex.org/W1832679686","https://openalex.org/W1841418289","https://openalex.org/W1967232806","https://openalex.org/W1968321268","https://openalex.org/W1970193303","https://openalex.org/W1972997295","https://openalex.org/W1980575345","https://openalex.org/W1982283204","https://openalex.org/W1985123706","https://openalex.org/W1990029940","https://openalex.org/W1994584977","https://openalex.org/W1998919258","https://openalex.org/W2000211775","https://openalex.org/W2005285611","https://openalex.org/W2012824096","https://openalex.org/W2023546589","https://openalex.org/W2031923588","https://openalex.org/W2033040247","https://openalex.org/W2033871299","https://openalex.org/W2038907843","https://openalex.org/W2039156581","https://openalex.org/W2049143039","https://openalex.org/W2061987651","https://openalex.org/W2066620631","https://openalex.org/W2068422506","https://openalex.org/W2070486524","https://openalex.org/W2078289947","https://openalex.org/W2080740807","https://openalex.org/W2081052967","https://openalex.org/W2081254453","https://openalex.org/W2083858754","https://openalex.org/W2083896132","https://openalex.org/W2087038607","https://openalex.org/W2091039687","https://openalex.org/W2095739278","https://openalex.org/W2097192020","https://openalex.org/W2106264302","https://openalex.org/W2111517082","https://openalex.org/W2138677859","https://openalex.org/W2148016452","https://openalex.org/W2148146542","https://openalex.org/W2148294996","https://openalex.org/W2158907148","https://openalex.org/W2159584454","https://openalex.org/W2246801328","https://openalex.org/W2337855014","https://openalex.org/W2340787257","https://openalex.org/W2400109196","https://openalex.org/W2401280342","https://openalex.org/W2477453038","https://openalex.org/W2534717833","https://openalex.org/W2568023417","https://openalex.org/W2611147814","https://openalex.org/W2949885909","https://openalex.org/W2949953710","https://openalex.org/W2950916686","https://openalex.org/W2951693280","https://openalex.org/W2951982454","https://openalex.org/W2952775235","https://openalex.org/W2988480584","https://openalex.org/W3022030295","https://openalex.org/W3023447009","https://openalex.org/W3105023213","https://openalex.org/W3105094916","https://openalex.org/W3123950972","https://openalex.org/W4230909286","https://openalex.org/W4253760504"],"related_works":["https://openalex.org/W2953076628","https://openalex.org/W2085110259","https://openalex.org/W2963837916","https://openalex.org/W2530777107","https://openalex.org/W2773485609","https://openalex.org/W1854884900","https://openalex.org/W2949863507","https://openalex.org/W4297969877","https://openalex.org/W2572756133","https://openalex.org/W1563568831"],"abstract_inverted_index":{"We":[0],"solve":[1],"a":[2,58],"20-year":[3],"old":[4],"problem":[5],"posed":[6],"by":[7],"Yannakakis":[8],"and":[9,48,69],"prove":[10,39],"that":[11,40,61],"no":[12],"polynomial-size":[13],"linear":[14],"program":[15],"(LP)":[16],"exists":[17],"whose":[18],"associated":[19],"polytope":[20,47],"projects":[21],"to":[22,34],"the":[23,29,45,49],"traveling":[24],"salesman":[25],"polytope,":[26],"even":[27],"if":[28],"LP":[30],"is":[31],"not":[32],"required":[33],"be":[35],"symmetric.":[36],"Moreover,":[37],"we":[38,62],"this":[41],"holds":[42],"also":[43],"for":[44],"cut":[46],"stable":[50],"set":[51],"polytope.":[52],"These":[53],"results":[54],"were":[55],"discovered":[56],"through":[57],"new":[59],"connection":[60],"make":[63],"between":[64],"one-way":[65],"quantum":[66],"communication":[67],"protocols":[68],"semidefinite":[70],"programming":[71],"reformulations":[72],"of":[73],"LPs.":[74]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":5},{"year":2023,"cited_by_count":8},{"year":2022,"cited_by_count":9},{"year":2021,"cited_by_count":10},{"year":2020,"cited_by_count":12},{"year":2019,"cited_by_count":11},{"year":2018,"cited_by_count":13},{"year":2017,"cited_by_count":17},{"year":2016,"cited_by_count":22},{"year":2015,"cited_by_count":5},{"year":2014,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}