{"id":"https://openalex.org/W2797886920","doi":"https://doi.org/10.1137/15m1027267","title":"Achieving New Upper Bounds for the Hypergraph Duality Problem through Logic","display_name":"Achieving New Upper Bounds for the Hypergraph Duality Problem through Logic","publication_year":2018,"publication_date":"2018-01-01","ids":{"openalex":"https://openalex.org/W2797886920","doi":"https://doi.org/10.1137/15m1027267","mag":"2797886920"},"language":"en","primary_location":{"id":"doi:10.1137/15m1027267","is_oa":false,"landing_page_url":"https://doi.org/10.1137/15m1027267","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://kclpure.kcl.ac.uk/portal/en/publications/470a739e-3e7e-40d8-b068-fbc5a9f9ed3e","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5050151740","display_name":"Georg Gottlob","orcid":"https://orcid.org/0000-0002-2353-5230"},"institutions":[{"id":"https://openalex.org/I40120149","display_name":"University of Oxford","ror":"https://ror.org/052gg0110","country_code":"GB","type":"education","lineage":["https://openalex.org/I40120149"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Georg Gottlob","raw_affiliation_strings":["Department of Computer Science, University of Oxford, UK"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Oxford, UK","institution_ids":["https://openalex.org/I40120149"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5066443441","display_name":"Enrico Malizia","orcid":"https://orcid.org/0000-0002-6780-4711"},"institutions":[{"id":"https://openalex.org/I23923803","display_name":"University of Exeter","ror":"https://ror.org/03yghzc09","country_code":"GB","type":"education","lineage":["https://openalex.org/I23923803"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Enrico Malizia","raw_affiliation_strings":["Department of Computer Science, University of Exeter, UK"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Exeter, UK","institution_ids":["https://openalex.org/I23923803"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5050151740"],"corresponding_institution_ids":["https://openalex.org/I40120149"],"apc_list":null,"apc_paid":null,"fwci":1.9236,"has_fulltext":true,"cited_by_count":20,"citation_normalized_percentile":{"value":0.87406437,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"47","issue":"2","first_page":"456","last_page":"492"},"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.9925000071525574,"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.9925000071525574,"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/T12072","display_name":"Machine Learning and Algorithms","score":0.9902999997138977,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9900000095367432,"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/combinatorics","display_name":"Combinatorics","score":0.7599166631698608},{"id":"https://openalex.org/keywords/hypergraph","display_name":"Hypergraph","score":0.711961030960083},{"id":"https://openalex.org/keywords/nondeterministic-algorithm","display_name":"Nondeterministic algorithm","score":0.6664009690284729},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.6434553265571594},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.559199333190918},{"id":"https://openalex.org/keywords/duality","display_name":"Duality (order theory)","score":0.4994015693664551},{"id":"https://openalex.org/keywords/order","display_name":"Order (exchange)","score":0.4981701374053955},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.47075608372688293},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.431816041469574}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7599166631698608},{"id":"https://openalex.org/C2781221856","wikidata":"https://www.wikidata.org/wiki/Q840247","display_name":"Hypergraph","level":2,"score":0.711961030960083},{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.6664009690284729},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.6434553265571594},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.559199333190918},{"id":"https://openalex.org/C2778023678","wikidata":"https://www.wikidata.org/wiki/Q554403","display_name":"Duality (order theory)","level":2,"score":0.4994015693664551},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.4981701374053955},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.47075608372688293},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.431816041469574},{"id":"https://openalex.org/C10138342","wikidata":"https://www.wikidata.org/wiki/Q43015","display_name":"Finance","level":1,"score":0.0},{"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/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":8,"locations":[{"id":"doi:10.1137/15m1027267","is_oa":false,"landing_page_url":"https://doi.org/10.1137/15m1027267","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},{"id":"pmh:oai:kclpure.kcl.ac.uk:openaire/470a739e-3e7e-40d8-b068-fbc5a9f9ed3e","is_oa":true,"landing_page_url":"https://kclpure.kcl.ac.uk/portal/en/publications/470a739e-3e7e-40d8-b068-fbc5a9f9ed3e","pdf_url":null,"source":{"id":"https://openalex.org/S4306400216","display_name":"Research Portal (King's College London)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I183935753","host_organization_name":"King's College London","host_organization_lineage":["https://openalex.org/I183935753"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Gottlob, G & Malizia, E 2018, 'Achieving New Upper Bounds for the Hypergraph Duality Problem through Logic', SIAM JOURNAL ON COMPUTING, vol. 47, no. 2, pp. 456-492. https://doi.org/10.1137/15M1027267","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:ore.exeter.ac.uk:10871/30485","is_oa":false,"landing_page_url":"http://hdl.handle.net/10871/30485","pdf_url":null,"source":{"id":"https://openalex.org/S4306401998","display_name":"Open Research Exeter (University of Exeter)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I23923803","host_organization_name":"University of Exeter","host_organization_lineage":["https://openalex.org/I23923803"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":null,"raw_type":"Article"},{"id":"pmh:oai:ore.exeter.ac.uk:10871/33327","is_oa":false,"landing_page_url":"http://hdl.handle.net/10871/33327","pdf_url":null,"source":{"id":"https://openalex.org/S4306401998","display_name":"Open Research Exeter (University of Exeter)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I23923803","host_organization_name":"University of Exeter","host_organization_lineage":["https://openalex.org/I23923803"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":null,"raw_type":"Article"},{"id":"pmh:oai:arXiv.org:1407.2912","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1407.2912","pdf_url":"https://arxiv.org/pdf/1407.2912","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"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":"text"},{"id":"pmh:oai:kclpure.kcl.ac.uk:publications/470a739e-3e7e-40d8-b068-fbc5a9f9ed3e","is_oa":true,"landing_page_url":"http://www.scopus.com/inward/record.url?scp=85046792964&partnerID=8YFLogxK","pdf_url":"https://arxiv.org/abs/1407.2912","source":{"id":"https://openalex.org/S4306400216","display_name":"Research Portal (King's College London)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I183935753","host_organization_name":"King's College London","host_organization_lineage":["https://openalex.org/I183935753"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Gottlob, G & Malizia, E 2018, 'Achieving New Upper Bounds for the Hypergraph Duality Problem through Logic', SIAM JOURNAL ON COMPUTING, vol. 47, no. 2, pp. 456-492. https://doi.org/10.1137/15M1027267","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:cris.unibo.it:11585/788133","is_oa":false,"landing_page_url":"https://epubs.siam.org/doi/10.1137/15M1027267","pdf_url":null,"source":{"id":"https://openalex.org/S4306402579","display_name":"Archivio istituzionale della ricerca (Alma Mater Studiorum Universit\u00e0 di Bologna)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210117483","host_organization_name":"Istituto di Ematologia di Bologna","host_organization_lineage":["https://openalex.org/I4210117483"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:cris.unibo.it:11585/788281","is_oa":false,"landing_page_url":"http://hdl.handle.net/11585/788281","pdf_url":null,"source":{"id":"https://openalex.org/S4306402579","display_name":"Archivio istituzionale della ricerca (Alma Mater Studiorum Universit\u00e0 di Bologna)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210117483","host_organization_name":"Istituto di Ematologia di Bologna","host_organization_lineage":["https://openalex.org/I4210117483"],"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":"info:eu-repo/semantics/other"}],"best_oa_location":{"id":"pmh:oai:kclpure.kcl.ac.uk:openaire/470a739e-3e7e-40d8-b068-fbc5a9f9ed3e","is_oa":true,"landing_page_url":"https://kclpure.kcl.ac.uk/portal/en/publications/470a739e-3e7e-40d8-b068-fbc5a9f9ed3e","pdf_url":null,"source":{"id":"https://openalex.org/S4306400216","display_name":"Research Portal (King's College London)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I183935753","host_organization_name":"King's College London","host_organization_lineage":["https://openalex.org/I183935753"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Gottlob, G & Malizia, E 2018, 'Achieving New Upper Bounds for the Hypergraph Duality Problem through Logic', SIAM JOURNAL ON COMPUTING, vol. 47, no. 2, pp. 456-492. https://doi.org/10.1137/15M1027267","raw_type":"info:eu-repo/semantics/publishedVersion"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G4710092007","display_name":null,"funder_award_id":"246858","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G5374134968","display_name":null,"funder_award_id":"European Social Fund","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G5458651130","display_name":null,"funder_award_id":"M025268","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G8051717526","display_name":null,"funder_award_id":"Grant","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G8400180575","display_name":null,"funder_award_id":"EP/M025268/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G8891597062","display_name":null,"funder_award_id":"EP/M025268/","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"}],"funders":[{"id":"https://openalex.org/F4320320300","display_name":"European Commission","ror":"https://ror.org/00k4n6c32"},{"id":"https://openalex.org/F4320326073","display_name":"Regione Calabria","ror":null},{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"},{"id":"https://openalex.org/F4320338080","display_name":"European Social Fund","ror":"https://ror.org/00k4n6c32"},{"id":"https://openalex.org/F4320338335","display_name":"H2020 European Research Council","ror":"https://ror.org/0472cxd90"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":56,"referenced_works":["https://openalex.org/W4514142","https://openalex.org/W41330591","https://openalex.org/W51516856","https://openalex.org/W1484529399","https://openalex.org/W1489366126","https://openalex.org/W1491931107","https://openalex.org/W1501399373","https://openalex.org/W1513731467","https://openalex.org/W1531519240","https://openalex.org/W1537230380","https://openalex.org/W1542263829","https://openalex.org/W1542486035","https://openalex.org/W1543515168","https://openalex.org/W1561272249","https://openalex.org/W1564907238","https://openalex.org/W1570425181","https://openalex.org/W1790852663","https://openalex.org/W1902941631","https://openalex.org/W1965529758","https://openalex.org/W1972004026","https://openalex.org/W1976127067","https://openalex.org/W2005389099","https://openalex.org/W2008756825","https://openalex.org/W2010386444","https://openalex.org/W2012628629","https://openalex.org/W2017181131","https://openalex.org/W2024091095","https://openalex.org/W2025271293","https://openalex.org/W2045519569","https://openalex.org/W2045583484","https://openalex.org/W2052960791","https://openalex.org/W2053540099","https://openalex.org/W2054784808","https://openalex.org/W2065895258","https://openalex.org/W2077053297","https://openalex.org/W2080947358","https://openalex.org/W2083786039","https://openalex.org/W2084095551","https://openalex.org/W2087134747","https://openalex.org/W2087502667","https://openalex.org/W2088113003","https://openalex.org/W2094097101","https://openalex.org/W2094525983","https://openalex.org/W2108309071","https://openalex.org/W2125227861","https://openalex.org/W2142133061","https://openalex.org/W2151310684","https://openalex.org/W2152927719","https://openalex.org/W2169245654","https://openalex.org/W2337710787","https://openalex.org/W2490706771","https://openalex.org/W2797886920","https://openalex.org/W2963908121","https://openalex.org/W3036236905","https://openalex.org/W4236835455","https://openalex.org/W4250408134"],"related_works":["https://openalex.org/W4376608589","https://openalex.org/W3138003926","https://openalex.org/W4300037846","https://openalex.org/W1630514295","https://openalex.org/W1537073411","https://openalex.org/W4288275998","https://openalex.org/W2963081352","https://openalex.org/W4376608938","https://openalex.org/W2472555608","https://openalex.org/W4214498971"],"abstract_inverted_index":{"The":[0],"hypergraph":[1,43],"duality":[2],"problem":[3,47,72,130,179],"Dual":[4,229],"is":[5,34,48,65,75,112,139,246],"defined":[6],"as":[7],"follows:":[8],"given":[9,54,254],"two":[10,53,173,255],"simple":[11],"hypergraphs":[12,256],"$\\mathcal{G}$":[13,26,33,257,267],"and":[14,124,258],"$\\mathcal{H}$,":[15,259],"decide":[16],"whether":[17,52],"$\\mathcal{H}$":[18,38],"consists":[19],"precisely":[20],"of":[21,25,37,44,87,95,142,153,206,266],"all":[22,88],"minimal":[23],"transversals":[24],"(in":[27],"which":[28,138,155,241],"case":[29],"we":[30,120,182,248],"say":[31],"that":[32,67,90,109,191,228],"the":[35,41,70,84,127,132,150,169,222,238,242],"dual":[36],"or,":[39],"equivalently,":[40],"transversal":[42,265],"$\\mathcal{H}$).":[45],"This":[46],"equivalent":[49],"to":[50,73,149,157,194,211,232],"deciding":[51],"nonredundant":[55],"monotone":[56],"disjunctive":[57],"normal":[58,60],"forms/conjunctive":[59],"forms":[61],"are":[62],"dual.":[63],"It":[64,106],"known":[66],"$\\overline{{\\sc":[68,110,128,189],"Dual}}$,":[69],"complementary":[71],"Dual,":[74],"in":[76,113,172,216,261,269],"GC($\\log^2":[77,114,135,143],"n$,":[78,115,136,144],"PTIME),":[79],"where":[80],"GC($f(n)$,":[81],"$\\mathcal{C}$)":[82],"denotes":[83],"complexity":[85,103,133],"class":[86,104,134],"problems":[89],"after":[91],"a":[92,140,184,203,250,264],"nondeterministic":[93,186,244],"guess":[94,195],"$O(f(n))$":[96],"bits":[97],"can":[98],"be":[99],"decided":[100],"(checked)":[101],"within":[102],"$\\mathcal{C}$.":[105],"was":[107],"conjectured":[108],"Dual}}$":[111,129,190],"LOGSPACE).":[116,145],"In":[117],"this":[118,122,207,219],"paper":[119],"prove":[121],"conjecture":[123],"actually":[125],"place":[126],"into":[131],"TC$^{0}$)":[137],"subclass":[141],"We":[146,167,199],"here":[147],"refer":[148],"logtime-uniform":[151],"version":[152],"TC$^{0}$,":[154],"corresponds":[156],"FO(COUNT),":[158],"i.e.,":[159],"first":[160],"order":[161],"logic":[162],"augmented":[163],"by":[164,202,221,236],"counting":[165],"quantifiers.":[166],"achieve":[168],"latter":[170],"bound":[171],"steps.":[174],"First,":[175],"based":[176],"on":[177,240],"existing":[178],"decomposition":[180],"methods,":[181],"develop":[183],"new":[185],"algorithm":[187,245,252],"for":[188],"requires":[192],"one":[193],"$O(\\log^2":[196],"n)$":[197],"bits.":[198],"then":[200],"proceed":[201],"logical":[204],"analysis":[205],"algorithm,":[208],"allowing":[209],"us":[210],"formulate":[212],"its":[213],"deterministic":[214,251],"part":[215],"FO(COUNT).":[217],"From":[218],"result,":[220],"well-known":[223],"inclusion":[224],"${TC$^0$}\\subseteq{LOGSPACE}$,":[225],"it":[226],"follows":[227],"also":[230],"belongs":[231],"${DSPACE}[\\log^2":[233],"n]$.":[234],"Finally,":[235],"exploiting":[237],"principles":[239],"proposed":[243],"based,":[247],"devise":[249],"that,":[253],"computes":[260],"quadratic":[262],"logspace":[263],"missing":[268],"$\\mathcal{H}$.":[270]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":5},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2020-11-23T00:00:00"}