{"id":"https://openalex.org/W2810541579","doi":"https://doi.org/10.3390/a12080172","title":"Practical Access to Dynamic Programming on Tree Decompositions","display_name":"Practical Access to Dynamic Programming on Tree Decompositions","publication_year":2019,"publication_date":"2019-08-16","ids":{"openalex":"https://openalex.org/W2810541579","doi":"https://doi.org/10.3390/a12080172","mag":"2810541579"},"language":"en","primary_location":{"id":"doi:10.3390/a12080172","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a12080172","pdf_url":"https://www.mdpi.com/1999-4893/12/8/172/pdf?version=1565951172","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"type":"preprint","indexed_in":["arxiv","crossref","datacite","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://www.mdpi.com/1999-4893/12/8/172/pdf?version=1565951172","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5073994290","display_name":"Max Bannach","orcid":"https://orcid.org/0000-0002-6475-5512"},"institutions":[{"id":"https://openalex.org/I9341345","display_name":"University of L\u00fcbeck","ror":"https://ror.org/00t3r8h32","country_code":"DE","type":"education","lineage":["https://openalex.org/I9341345"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Max Bannach","raw_affiliation_strings":["Institute for Theoretical Computer Science, Universit\u00e4t zu L\u00fcbeck, 23562 L\u00fcbeck, Germany"],"raw_orcid":"https://orcid.org/0000-0002-6475-5512","affiliations":[{"raw_affiliation_string":"Institute for Theoretical Computer Science, Universit\u00e4t zu L\u00fcbeck, 23562 L\u00fcbeck, Germany","institution_ids":["https://openalex.org/I9341345"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5017991461","display_name":"Sebastian Berndt","orcid":"https://orcid.org/0000-0003-4177-8081"},"institutions":[{"id":"https://openalex.org/I32021983","display_name":"Christian-Albrechts-Universit\u00e4t zu Kiel","ror":"https://ror.org/04v76ef78","country_code":"DE","type":"education","lineage":["https://openalex.org/I32021983"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Sebastian Berndt","raw_affiliation_strings":["Department of Computer Science, Kiel University, 24103 Kiel, Germany"],"raw_orcid":"https://orcid.org/0000-0003-4177-8081","affiliations":[{"raw_affiliation_string":"Department of Computer Science, Kiel University, 24103 Kiel, Germany","institution_ids":["https://openalex.org/I32021983"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":1400,"currency":"CHF","value_usd":1515},"apc_paid":{"value":1400,"currency":"CHF","value_usd":1515},"fwci":0.7712,"has_fulltext":true,"cited_by_count":4,"citation_normalized_percentile":{"value":0.72823334,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"12","issue":"8","first_page":"172","last_page":"172"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9994000196456909,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9994000196456909,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9879999756813049,"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/T10142","display_name":"Formal Methods in Verification","score":0.9782999753952026,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.782009482383728},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7696199417114258},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5724090933799744},{"id":"https://openalex.org/keywords/implementation","display_name":"Implementation","score":0.5420949459075928},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5174351334571838},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.49565446376800537},{"id":"https://openalex.org/keywords/java","display_name":"Java","score":0.4881909489631653},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.48038679361343384},{"id":"https://openalex.org/keywords/fragment","display_name":"Fragment (logic)","score":0.4791354835033417},{"id":"https://openalex.org/keywords/field","display_name":"Field (mathematics)","score":0.46783319115638733},{"id":"https://openalex.org/keywords/tree-decomposition","display_name":"Tree decomposition","score":0.4387276768684387},{"id":"https://openalex.org/keywords/range","display_name":"Range (aeronautics)","score":0.4349396228790283},{"id":"https://openalex.org/keywords/decomposition","display_name":"Decomposition","score":0.4175386428833008},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.3863701820373535},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.31796562671661377},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.16890311241149902}],"concepts":[{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.782009482383728},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7696199417114258},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5724090933799744},{"id":"https://openalex.org/C26713055","wikidata":"https://www.wikidata.org/wiki/Q245962","display_name":"Implementation","level":2,"score":0.5420949459075928},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5174351334571838},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.49565446376800537},{"id":"https://openalex.org/C548217200","wikidata":"https://www.wikidata.org/wiki/Q251","display_name":"Java","level":2,"score":0.4881909489631653},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.48038679361343384},{"id":"https://openalex.org/C2776235265","wikidata":"https://www.wikidata.org/wiki/Q18392052","display_name":"Fragment (logic)","level":2,"score":0.4791354835033417},{"id":"https://openalex.org/C9652623","wikidata":"https://www.wikidata.org/wiki/Q190109","display_name":"Field (mathematics)","level":2,"score":0.46783319115638733},{"id":"https://openalex.org/C70501317","wikidata":"https://www.wikidata.org/wiki/Q462095","display_name":"Tree decomposition","level":5,"score":0.4387276768684387},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.4349396228790283},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.4175386428833008},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.3863701820373535},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.31796562671661377},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.16890311241149902},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.0},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"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/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":9,"locations":[{"id":"doi:10.3390/a12080172","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a12080172","pdf_url":"https://www.mdpi.com/1999-4893/12/8/172/pdf?version=1565951172","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1806.10176","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1806.10176","pdf_url":"https://arxiv.org/pdf/1806.10176","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":"","raw_type":null},{"id":"mag:2810541579","is_oa":true,"landing_page_url":"https://arxiv.org/pdf/1806.10176.pdf","pdf_url":null,"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":"arXiv (Cornell University)","raw_type":null},{"id":"pmh:oai:doaj.org/article:f46471519a9d4762aa74fca24579a9e1","is_oa":true,"landing_page_url":"https://doaj.org/article/f46471519a9d4762aa74fca24579a9e1","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","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":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms, Vol 12, Iss 8, p 172 (2019)","raw_type":"article"},{"id":"pmh:oai:drops-oai.dagstuhl.de:9469","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2018.6","pdf_url":null,"source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"InProceedings"},{"id":"pmh:oai:mdpi.com:/1999-4893/12/8/172/","is_oa":true,"landing_page_url":"http://dx.doi.org/10.3390/a12080172","pdf_url":null,"source":{"id":"https://openalex.org/S4306400947","display_name":"MDPI (MDPI AG)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210097602","host_organization_name":"Multidisciplinary Digital Publishing Institute (Switzerland)","host_organization_lineage":["https://openalex.org/I4210097602"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms","raw_type":"Text"},{"id":"doi:10.48550/arxiv.1806.10176","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.1806.10176","pdf_url":null,"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":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"},{"id":"doi:10.4230/lipics.esa.2018.6","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.esa.2018.6","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"ConferencePaper"},{"id":"mag:2964058227","is_oa":false,"landing_page_url":"https://drops.dagstuhl.de/opus/volltexte/2018/9469/pdf/LIPIcs-ESA-2018-6.pdf/","pdf_url":null,"source":{"id":"https://openalex.org/S4306418381","display_name":"European Symposium on Algorithms","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":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":"European Symposium on Algorithms","raw_type":null}],"best_oa_location":{"id":"doi:10.3390/a12080172","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a12080172","pdf_url":"https://www.mdpi.com/1999-4893/12/8/172/pdf?version=1565951172","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2810541579.pdf","grobid_xml":"https://content.openalex.org/works/W2810541579.grobid-xml"},"referenced_works_count":12,"referenced_works":["https://openalex.org/W2028357390","https://openalex.org/W2059372025","https://openalex.org/W2066585576","https://openalex.org/W2592611715","https://openalex.org/W2744965439","https://openalex.org/W2750561661","https://openalex.org/W2794267717","https://openalex.org/W2914414140","https://openalex.org/W2963352550","https://openalex.org/W2963886128","https://openalex.org/W6694295683","https://openalex.org/W6712619963"],"related_works":["https://openalex.org/W2964058227","https://openalex.org/W277793977","https://openalex.org/W2903041470","https://openalex.org/W2006724349","https://openalex.org/W2943702877","https://openalex.org/W2233529400","https://openalex.org/W3136969058","https://openalex.org/W2779041749","https://openalex.org/W1982703133","https://openalex.org/W2396464753","https://openalex.org/W1732971744","https://openalex.org/W900043438","https://openalex.org/W1608896035","https://openalex.org/W2951737822","https://openalex.org/W2017387872","https://openalex.org/W1830383289","https://openalex.org/W2040141876","https://openalex.org/W2529002779","https://openalex.org/W194524211","https://openalex.org/W1979201594"],"abstract_inverted_index":{"Parameterized":[0],"complexity":[1],"theory":[2],"has":[3,73],"led":[4],"to":[5,117,170,195,199,230,241],"a":[6,52,99,185,206,211],"wide":[7],"range":[8],"of":[9,20,35,37,41,66,88,102,127,150,157,160,188,214],"algorithmic":[10],"breakthroughs":[11],"within":[12],"the":[13,18,33,38,63,91,107,125,128,158],"last":[14],"few":[15],"decades,":[16],"but":[17],"practicability":[19,34],"these":[21],"methods":[22],"for":[23,82,136,210],"real-world":[24],"problems":[25],"is":[26,51,90,166,191,227],"still":[27,72],"not":[28,221],"well":[29,167],"understood.":[30],"We":[31,112,193],"investigate":[32],"one":[36],"fundamental":[39],"approaches":[40],"this":[42,50,67,83,132,200],"field:":[43],"dynamic":[44,120,134,161],"programming":[45,162],"on":[46,77,163],"tree":[47,164,186],"decompositions.":[48],"Indisputably,":[49],"key":[53],"technique":[54],"in":[55,69,146],"parameterized":[56],"algorithms":[57],"and":[58,235],"modern":[59],"algorithm":[60],"design.":[61],"Despite":[62],"enormous":[64],"impact":[65],"approach":[68],"theory,":[70],"it":[71],"very":[74,243],"little":[75],"influence":[76],"practical":[78,197],"implementations.":[79],"The":[80,154],"reasons":[81],"phenomenon":[84],"are":[85],"manifold.":[86],"One":[87],"them":[89],"simple":[92],"fact":[93],"that":[94,122,176],"such":[95,119,139],"an":[96,114],"implementation":[97],"requires":[98,124],"long":[100],"chain":[101],"non-trivial":[103],"tasks":[104],"(as":[105],"computing":[106],"decomposition,":[108],"preparing":[109],"it,":[110],"\u2026).":[111],"provide":[113,196],"easy":[115],"way":[116],"implement":[118],"programs":[121,135],"only":[123],"definition":[126],"update":[129],"rules.":[130],"With":[131],"interface,":[133],"various":[137],"problems,":[138,234],"as":[140,202],"3-coloring,":[141],"can":[142,180],"be":[143,181,242],"implemented":[144],"easily":[145],"about":[147],"100":[148],"lines":[149],"structured":[151],"Java":[152],"code.":[153],"theoretical":[155],"foundation":[156],"success":[159],"decompositions":[165],"understood":[168],"due":[169],"Courcelle\u2019s":[171],"celebrated":[172],"theorem,":[173],"which":[174],"states":[175],"every":[177],"MSO-definable":[178],"problem":[179],"efficiently":[182],"solved":[183],"if":[184],"decomposition":[187],"small":[189,212],"width":[190],"given.":[192],"seek":[194],"access":[198],"theorem":[201],"well,":[203],"by":[204],"presenting":[205],"lightweight":[207],"model":[208,237],"checker":[209,238],"fragment":[213,226],"MSO":[215],"1":[216],"(that":[217],"is,":[218],"we":[219],"do":[220],"consider":[222],"\u201cedge-set-based\u201d":[223],"problems).":[224],"This":[225],"powerful":[228],"enough":[229],"describe":[231],"many":[232],"natural":[233],"our":[236],"turns":[239],"out":[240],"competitive":[244],"against":[245],"similar":[246],"state-of-the-art":[247],"tools.":[248]},"counts_by_year":[{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}