{"id":"https://openalex.org/W2968783941","doi":"https://doi.org/10.1145/3325116","title":"On the Parameterized Complexity of Approximating Dominating Set","display_name":"On the Parameterized Complexity of Approximating Dominating Set","publication_year":2019,"publication_date":"2019-08-12","ids":{"openalex":"https://openalex.org/W2968783941","doi":"https://doi.org/10.1145/3325116","mag":"2968783941"},"language":"en","primary_location":{"id":"doi:10.1145/3325116","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3325116","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3325116","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":"bronze","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3325116","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5066903534","display_name":"C. S. Karthik","orcid":null},"institutions":[{"id":"https://openalex.org/I53964585","display_name":"Weizmann Institute of Science","ror":"https://ror.org/0316ej306","country_code":"IL","type":"education","lineage":["https://openalex.org/I53964585"]}],"countries":["IL"],"is_corresponding":true,"raw_author_name":"Karthik C. S.","raw_affiliation_strings":["Weizmann Institute of Science, Rehovot, Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Weizmann Institute of Science, Rehovot, Israel","institution_ids":["https://openalex.org/I53964585"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5005632876","display_name":"Bundit Laekhanukit","orcid":"https://orcid.org/0000-0002-4476-8914"},"institutions":[{"id":"https://openalex.org/I181679659","display_name":"Shanghai University of Finance and Economics","ror":"https://ror.org/00wtvfq62","country_code":"CN","type":"education","lineage":["https://openalex.org/I181679659"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Bundit Laekhanukit","raw_affiliation_strings":["Shanghai University of Finance and Economics, Yangpu, Shanghai, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Shanghai University of Finance and Economics, Yangpu, Shanghai, China","institution_ids":["https://openalex.org/I181679659"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5001520779","display_name":"Pasin Manurangsi","orcid":"https://orcid.org/0000-0002-1052-2801"},"institutions":[{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Pasin Manurangsi","raw_affiliation_strings":["University of California, Berkeley, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of California, Berkeley, USA","institution_ids":["https://openalex.org/I95457486"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5066903534"],"corresponding_institution_ids":["https://openalex.org/I53964585"],"apc_list":null,"apc_paid":null,"fwci":4.2451,"has_fulltext":true,"cited_by_count":31,"citation_normalized_percentile":{"value":0.94737817,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"66","issue":"5","first_page":"1","last_page":"38"},"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.9998999834060669,"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.9998999834060669,"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.9997000098228455,"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/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9926999807357788,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"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.8704022169113159},{"id":"https://openalex.org/keywords/exponential-time-hypothesis","display_name":"Exponential time hypothesis","score":0.7744570970535278},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7336902618408203},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6883814334869385},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5866599678993225},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.5696908831596375},{"id":"https://openalex.org/keywords/computable-function","display_name":"Computable function","score":0.5465301871299744},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.516839325428009},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.5046099424362183},{"id":"https://openalex.org/keywords/dominating-set","display_name":"Dominating set","score":0.475129634141922},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4730091392993927},{"id":"https://openalex.org/keywords/exponential-function","display_name":"Exponential function","score":0.47073495388031006},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.44354912638664246},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.41217565536499023},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.32210853695869446},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.22663402557373047},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.11829257011413574}],"concepts":[{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.8704022169113159},{"id":"https://openalex.org/C71017364","wikidata":"https://www.wikidata.org/wiki/Q5421532","display_name":"Exponential time hypothesis","level":3,"score":0.7744570970535278},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7336902618408203},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6883814334869385},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5866599678993225},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.5696908831596375},{"id":"https://openalex.org/C54271186","wikidata":"https://www.wikidata.org/wiki/Q1148456","display_name":"Computable function","level":2,"score":0.5465301871299744},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.516839325428009},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.5046099424362183},{"id":"https://openalex.org/C146661039","wikidata":"https://www.wikidata.org/wiki/Q2915204","display_name":"Dominating set","level":4,"score":0.475129634141922},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4730091392993927},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.47073495388031006},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.44354912638664246},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.41217565536499023},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.32210853695869446},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.22663402557373047},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.11829257011413574},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","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/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"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":1,"locations":[{"id":"doi:10.1145/3325116","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3325116","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3325116","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"}],"best_oa_location":{"id":"doi:10.1145/3325116","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3325116","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3325116","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"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1049157113","display_name":null,"funder_award_id":"CCF 1655215","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G3468740753","display_name":null,"funder_award_id":"772839","funder_id":"https://openalex.org/F4320320946","funder_display_name":"Weizmann Institute of Science"},{"id":"https://openalex.org/G4100588459","display_name":"Developments in Gaussian Processes and Beyond: Applications in Geostatistics and Deep Learning","funder_award_id":"2014371","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G4252799795","display_name":"RCN: DIMACS/Simons Collaboration on Bridging Continuous and Discrete Optimization","funder_award_id":"1740425","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G4304470407","display_name":null,"funder_award_id":"621/12","funder_id":"https://openalex.org/F4320322252","funder_display_name":"Israel Science Foundation"},{"id":"https://openalex.org/G5623205823","display_name":"EAGER:   New Graph and CSP Algorithms Based on Spectral and SDP Techniques","funder_award_id":"1655215","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5950445586","display_name":null,"funder_award_id":"CCF-174042, CCF 1540685 and CCF 1655215","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6484393709","display_name":"AF: Small: Graph Partitioning and Spectral Methods","funder_award_id":"1540685","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7346351820","display_name":null,"funder_award_id":"CCF 1540685","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8196236912","display_name":null,"funder_award_id":"CCF-1740425","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320320946","display_name":"Weizmann Institute of Science","ror":"https://ror.org/0316ej306"},{"id":"https://openalex.org/F4320322252","display_name":"Israel Science Foundation","ror":"https://ror.org/04sazxf24"},{"id":"https://openalex.org/F4320334164","display_name":"Simons Institute for the Theory of Computing, University of California Berkeley","ror":null},{"id":"https://openalex.org/F4320335016","display_name":"Israeli Centers for Research Excellence","ror":"https://ror.org/03w2v9593"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2968783941.pdf","grobid_xml":"https://content.openalex.org/works/W2968783941.grobid-xml"},"referenced_works_count":80,"referenced_works":["https://openalex.org/W15998695","https://openalex.org/W605043455","https://openalex.org/W1487579480","https://openalex.org/W1492330052","https://openalex.org/W1516574938","https://openalex.org/W1521238083","https://openalex.org/W1552693528","https://openalex.org/W1586797185","https://openalex.org/W1598441350","https://openalex.org/W1611546574","https://openalex.org/W1842876744","https://openalex.org/W1968633117","https://openalex.org/W1969665089","https://openalex.org/W1970259241","https://openalex.org/W1973113631","https://openalex.org/W1976493784","https://openalex.org/W1980223785","https://openalex.org/W1984477611","https://openalex.org/W1985572324","https://openalex.org/W1995725694","https://openalex.org/W1996118782","https://openalex.org/W2002501531","https://openalex.org/W2003159902","https://openalex.org/W2003979824","https://openalex.org/W2006252547","https://openalex.org/W2007654329","https://openalex.org/W2012948111","https://openalex.org/W2014860393","https://openalex.org/W2019578639","https://openalex.org/W2029910715","https://openalex.org/W2030965968","https://openalex.org/W2038225707","https://openalex.org/W2038691311","https://openalex.org/W2040924621","https://openalex.org/W2044471216","https://openalex.org/W2059453880","https://openalex.org/W2061513598","https://openalex.org/W2070486524","https://openalex.org/W2073276518","https://openalex.org/W2079401865","https://openalex.org/W2084166252","https://openalex.org/W2084732238","https://openalex.org/W2098207812","https://openalex.org/W2107917944","https://openalex.org/W2116087731","https://openalex.org/W2119461694","https://openalex.org/W2126479983","https://openalex.org/W2130190334","https://openalex.org/W2143996311","https://openalex.org/W2148352980","https://openalex.org/W2150123893","https://openalex.org/W2157054705","https://openalex.org/W2157124529","https://openalex.org/W2159193690","https://openalex.org/W2163322487","https://openalex.org/W2164770202","https://openalex.org/W2240262109","https://openalex.org/W2293231900","https://openalex.org/W2340787257","https://openalex.org/W2401312511","https://openalex.org/W2401610261","https://openalex.org/W2408084357","https://openalex.org/W2461430093","https://openalex.org/W2547025167","https://openalex.org/W2556940513","https://openalex.org/W2557748541","https://openalex.org/W2576456765","https://openalex.org/W2579035965","https://openalex.org/W2787648812","https://openalex.org/W2914414140","https://openalex.org/W2963046172","https://openalex.org/W2963439929","https://openalex.org/W2963456765","https://openalex.org/W2963964051","https://openalex.org/W2964642894","https://openalex.org/W3137191742","https://openalex.org/W3137429815","https://openalex.org/W4213071546","https://openalex.org/W4255005259","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2087638517","https://openalex.org/W2800485060","https://openalex.org/W2007607373","https://openalex.org/W2953073202","https://openalex.org/W1917327560","https://openalex.org/W4299290985","https://openalex.org/W1787126581","https://openalex.org/W3172736027","https://openalex.org/W3102280101","https://openalex.org/W4287804545"],"abstract_inverted_index":{"We":[0],"study":[1],"the":[2,7,29,48,106,117,137,161,195,227,265,335,360,371,409,437],"parameterized":[3,123,434],"complexity":[4,403],"of":[5,37,55,109,116,139,337,362,370,406,416,429,431,436,461,476],"approximating":[6],"k":[8,16,43,46,57,68,91,96,186,191,205,209,216,222,236,244,248,255,259,266,272,280,284,291,296,321,341,375],"-Dominating":[9],"Set":[10],"(DomSet)":[11],"problem":[12,451,472],"where":[13],"an":[14,61,88,100,128,141,338],"integer":[15,235,271],"and":[17,28,111,147,170,316,330,404],"a":[18,34,52,399,412,432,445,449,470,474],"graph":[19,49],"G":[20,50],"on":[21,454],"n":[22,73,219,258,294,373],"vertices":[23],"are":[24,395],"given":[25],"as":[26,114],"input,":[27],"goal":[30],"is":[31,84,103,182,201,240,276],"to":[32,86,132,359,426,443,467,481,486],"find":[33],"dominating":[35,53],"set":[36,54],"size":[38,56],"at":[39],"most":[40],"F":[41,89,169,184,203,242,278,339,347],"(":[42,67,72,90,185,204,215,221,243,254,279,290,340],")":[44,69,74,217,223,256,292],"\u22c5":[45,70,218,257,293],"whenever":[47],"has":[51],".":[58],"When":[59],"such":[60,99,140],"algorithm":[62,94,101,142,189,207,246,282,343],"runs":[63,212,251,287],"in":[64,105,122,213,252,288],"time":[65,152,367],"T":[66,81,167,214,253,289],"poly":[71],"(i.e.,":[75],"FPT-time)":[76],"for":[77,95,163,190,208,233,247,269,283,344,376,387,448],"some":[78],"computable":[79,165],"function":[80,346],",":[82,168],"it":[83,441],"said":[85],"be":[87,468],")-":[92,187],"FPT-approximation":[93,188,306],"-DomSet.":[97,192],"Whether":[98],"exists":[102],"listed":[104],"seminal":[107],"book":[108],"Downey":[110],"Fellows":[112],"(2013)":[113],"one":[115],"\u201cmost":[118],"infamous\u201d":[119],"open":[120],"problems":[121,464],"complexity.":[124],"This":[125],"work":[126,415],"gives":[127],"almost":[129],"complete":[130],"answer":[131],"this":[133,478],"question":[134],"by":[135,397],"showing":[136],"non-existence":[138,336],"under":[143,155,311,327,350],"W[1]":[144,178,313],"\u2260":[145,179,314],"FPT":[146,315],"further":[148],"providing":[149],"tighter":[150],"running":[151,366],"lower":[153,368],"bounds":[154],"stronger":[156],"hypotheses.":[157],"Specifically,":[158,422],"we":[159,423,457],"prove":[160,427],"following":[162],"every":[164,171,234,270],"functions":[166],"constant":[172,304,379,389],"\u03b5":[173,261,300,320],">":[174,381],"0:":[175],"\u2022":[176,193,225,263],"Assuming":[177,194,226,264],"FPT,":[180],"there":[181,200,239,275],"no":[183,202,241,277,365],"Exponential":[196,229],"Time":[197,230],"Hypothesis":[198,231],"(ETH),":[199],")-approximation":[206,245,281],"-DomSet":[210,249,285],"that":[211,250,286,425,452],"o":[220],"time.":[224,262,301],"Strong":[228],"(SETH),":[232],"\u2265":[237,273],"2,":[238],"\u2212":[260,299],"-SUM":[267],"Hypothesis,":[268],"3,":[274],"\u2308":[295],"/2":[297],"\u2309":[298],"Previously,":[302],"only":[303],"ratio":[305],"algorithms":[307,323],"were":[308,324],"ruled":[309,325],"out":[310,326,466],"sf":[312],"(log":[317],"1/4":[318],"&minus":[319],")-FPT-approximation":[322,342],"ETH":[328],"[Chen":[329],"Lin,":[331],"FOCS":[332,355],"2016].":[333],"Recently,":[334],"any":[345,377,388],"was":[348,383],"shown":[349],"Gap-ETH":[351],"[Chalermsook":[352],"et":[353,418],"al.,":[354],"2017].":[356,421],"Note":[357],"that,":[358],"best":[361],"our":[363],"knowledge,":[364],"bound":[369],"form":[372],"&delta":[374],"absolute":[378],"\u03b4":[380],"0":[382],"known":[384,484],"before":[385],"even":[386],"factor":[390],"inapproximation":[391],"ratio.":[392],"Our":[393],"results":[394],"obtained":[396],"establishing":[398],"connection":[400],"between":[401],"communication":[402,450,463],"hardness":[405,428],"approximation,":[407],"generalizing":[408],"ideas":[410],"from":[411],"recent":[413],"breakthrough":[414],"Abboud":[417],"al.":[419],"[FOCS":[420],"show":[424],"approximation":[430],"certain":[433],"variant":[435,475],"label":[438],"cover":[439],"problem,":[440],"suffices":[442],"devise":[444],"specific":[446],"protocol":[447],"depends":[453],"which":[455],"hypothesis":[456],"rely":[458],"on.":[459],"Each":[460],"these":[462],"turns":[465],"either":[469],"well-studied":[471],"or":[473],"one;":[477],"allows":[479],"us":[480],"easily":[482],"apply":[483],"techniques":[485],"solve":[487],"them.":[488]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":6},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":11},{"year":2020,"cited_by_count":6},{"year":2019,"cited_by_count":2}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}