{"id":"https://openalex.org/W2884665822","doi":"https://doi.org/10.1007/s00453-019-00649-7","title":"The Parameterised Complexity of Computing the Maximum Modularity of a Graph","display_name":"The Parameterised Complexity of Computing the Maximum Modularity of a Graph","publication_year":2019,"publication_date":"2019-11-08","ids":{"openalex":"https://openalex.org/W2884665822","doi":"https://doi.org/10.1007/s00453-019-00649-7","mag":"2884665822"},"language":"en","primary_location":{"id":"doi:10.1007/s00453-019-00649-7","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-019-00649-7","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00453-019-00649-7.pdf","source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},"type":"preprint","indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s00453-019-00649-7.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5088807601","display_name":"Kitty Meeks","orcid":"https://orcid.org/0000-0001-5299-3073"},"institutions":[{"id":"https://openalex.org/I7882870","display_name":"University of Glasgow","ror":"https://ror.org/00vtgdb53","country_code":"GB","type":"education","lineage":["https://openalex.org/I7882870"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Kitty Meeks","raw_affiliation_strings":["School of Computing Science, University of Glasgow, Glasgow, UK","*University of Glasgow"],"affiliations":[{"raw_affiliation_string":"School of Computing Science, University of Glasgow, Glasgow, UK","institution_ids":["https://openalex.org/I7882870"]},{"raw_affiliation_string":"*University of Glasgow","institution_ids":["https://openalex.org/I7882870"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5037558079","display_name":"Fiona Skerman","orcid":"https://orcid.org/0000-0003-4141-7059"},"institutions":[{"id":"https://openalex.org/I36234482","display_name":"University of Bristol","ror":"https://ror.org/0524sp257","country_code":"GB","type":"education","lineage":["https://openalex.org/I36234482"]},{"id":"https://openalex.org/I4210166532","display_name":"Heilbronn Institute for Mathematical Research","ror":"https://ror.org/05ttdgs63","country_code":"GB","type":"facility","lineage":["https://openalex.org/I4210166532"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Fiona Skerman","raw_affiliation_strings":["Department of Mathematics, Heilbronn Institute for Mathematical Research, University of Bristol, Bristol, UK","University of Bristol"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Heilbronn Institute for Mathematical Research, University of Bristol, Bristol, UK","institution_ids":["https://openalex.org/I4210166532","https://openalex.org/I36234482"]},{"raw_affiliation_string":"University of Bristol","institution_ids":["https://openalex.org/I36234482"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5088807601"],"corresponding_institution_ids":["https://openalex.org/I7882870"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":{"value":2290,"currency":"EUR","value_usd":2890},"fwci":0.2,"has_fulltext":true,"cited_by_count":2,"citation_normalized_percentile":{"value":0.50011077,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"82","issue":"8","first_page":"2174","last_page":"2199"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9990000128746033,"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.9990000128746033,"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/T10064","display_name":"Complex Network Analysis Techniques","score":0.996999979019165,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11476","display_name":"Graph theory and applications","score":0.9864000082015991,"subfield":{"id":"https://openalex.org/subfields/2608","display_name":"Geometry and Topology"},"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/treewidth","display_name":"Treewidth","score":0.7910590171813965},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6142473220825195},{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.5784497857093811},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5774180889129639},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.5764651298522949},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.562629222869873},{"id":"https://openalex.org/keywords/modularity","display_name":"Modularity (biology)","score":0.5550148487091064},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.5399918556213379},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.5341317653656006},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5139362215995789},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5109452605247498},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3772352337837219},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.35420289635658264},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.2327558994293213},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.15646693110466003}],"concepts":[{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.7910590171813965},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6142473220825195},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.5784497857093811},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5774180889129639},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.5764651298522949},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.562629222869873},{"id":"https://openalex.org/C2779478453","wikidata":"https://www.wikidata.org/wiki/Q6889748","display_name":"Modularity (biology)","level":2,"score":0.5550148487091064},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.5399918556213379},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.5341317653656006},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5139362215995789},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5109452605247498},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3772352337837219},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.35420289635658264},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2327558994293213},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.15646693110466003},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":9,"locations":[{"id":"doi:10.1007/s00453-019-00649-7","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-019-00649-7","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00453-019-00649-7.pdf","source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},{"id":"pmh:oai:research-information.bris.ac.uk:openaire/9b3b48fa-34ac-438a-b5c4-ea2017e966a2","is_oa":true,"landing_page_url":"https://research-information.bris.ac.uk/en/publications/9b3b48fa-34ac-438a-b5c4-ea2017e966a2","pdf_url":null,"source":{"id":"https://openalex.org/S4306400895","display_name":"Bristol Research (University of Bristol)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I36234482","host_organization_name":"University of Bristol","host_organization_lineage":["https://openalex.org/I36234482"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Meeks, K & Skerman, F 2019, 'The Parameterised Complexity of Computing the Maximum Modularity of a Graph', Algorithmica. https://doi.org/10.1007/s00453-019-00649-7","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:eprints.gla.ac.uk:166003","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4210235606","display_name":"ENLIGHTEN (Jurnal Bimbingan dan Konseling Islam)","issn_l":"2622-8912","issn":["2622-8912","2622-8920"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"","raw_type":"Conference Proceedings"},{"id":"pmh:oai:arXiv.org:1807.06965","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1807.06965","pdf_url":"https://arxiv.org/pdf/1807.06965","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":"mag:2884665822","is_oa":true,"landing_page_url":"https://arxiv.org/pdf/1807.06965.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:DiVA.org:uu-569734","is_oa":true,"landing_page_url":"http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-569734","pdf_url":null,"source":{"id":"https://openalex.org/S4306401559","display_name":"KTH Publication Database DiVA (KTH Royal Institute of Technology)","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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:drops-oai.dagstuhl.de:10210","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2018.9","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":"doi:10.48550/arxiv.1807.06965","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.1807.06965","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":"article-journal"},{"id":"doi:10.4230/lipics.ipec.2018.9","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.ipec.2018.9","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","issn_l":null,"issn":[],"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":""}],"best_oa_location":{"id":"doi:10.1007/s00453-019-00649-7","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-019-00649-7","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00453-019-00649-7.pdf","source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G7819609808","display_name":null,"funder_award_id":"Fellowship","funder_id":"https://openalex.org/F4320322581","funder_display_name":"Vetenskapsr\u00e5det"}],"funders":[{"id":"https://openalex.org/F4320309816","display_name":"Ragnar S\u00f6derbergs stiftelse","ror":"https://ror.org/03f1pm042"},{"id":"https://openalex.org/F4320313269","display_name":"Scottish Government","ror":"https://ror.org/04v2xmd71"},{"id":"https://openalex.org/F4320320041","display_name":"Royal Society of Edinburgh","ror":"https://ror.org/03kx2pj14"},{"id":"https://openalex.org/F4320322581","display_name":"Vetenskapsr\u00e5det","ror":"https://ror.org/03zttf063"},{"id":"https://openalex.org/F4320324119","display_name":"Uppsala Universitet","ror":"https://ror.org/048a87296"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2884665822.pdf","grobid_xml":"https://content.openalex.org/works/W2884665822.grobid-xml"},"referenced_works_count":25,"referenced_works":["https://openalex.org/W143512583","https://openalex.org/W1556562107","https://openalex.org/W1966183956","https://openalex.org/W1978787982","https://openalex.org/W2024291212","https://openalex.org/W2094934391","https://openalex.org/W2095189226","https://openalex.org/W2095293504","https://openalex.org/W2109726592","https://openalex.org/W2116087731","https://openalex.org/W2127048411","https://openalex.org/W2131681506","https://openalex.org/W2137172591","https://openalex.org/W2239770983","https://openalex.org/W2247411266","https://openalex.org/W2743743529","https://openalex.org/W2898482334","https://openalex.org/W2914414140","https://openalex.org/W2951271819","https://openalex.org/W2963376563","https://openalex.org/W2964214348","https://openalex.org/W3123255541","https://openalex.org/W3126033509","https://openalex.org/W4213368513","https://openalex.org/W6631662886"],"related_works":["https://openalex.org/W2405404538","https://openalex.org/W2363330530","https://openalex.org/W2922172358","https://openalex.org/W1508435774","https://openalex.org/W1962032444","https://openalex.org/W3196710240","https://openalex.org/W2062879469","https://openalex.org/W2164433924","https://openalex.org/W2991613589","https://openalex.org/W2952335282","https://openalex.org/W50404825","https://openalex.org/W2952477027","https://openalex.org/W2526493294","https://openalex.org/W3149110984","https://openalex.org/W2286129431","https://openalex.org/W2062135503","https://openalex.org/W3126291939","https://openalex.org/W2805404656","https://openalex.org/W1607118338","https://openalex.org/W2951152776"],"abstract_inverted_index":{"Abstract":[0],"The":[1],"maximum":[2,26,65,92,170],"modularity":[3,27,66,93],"of":[4,16,28,49,56,89,101,125,146,199],"a":[5,8,22,29,47,126,200],"graph":[6,30,104],"is":[7,31,134,148,181],"parameter":[9],"widely":[10],"used":[11,52],"to":[12,33,53,77,96,113,163,168,186],"describe":[13],"the":[14,25,57,64,78,86,91,102,110,123,140,169,173,179,197],"level":[15],"clustering":[17],"or":[18,142],"community":[19],"structure":[20],"in":[21,42,45,136],"network.":[23],"Determining":[24],"known":[32],"be":[34],"$$\\textsf":[35,114],"{NP}$$":[36],"<mml:math":[37,116],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\">":[38,117],"<mml:mi>NP</mml:mi>":[39],"</mml:math>":[40,119],"-complete":[41],"general,":[43],"and":[44,133,196],"practice":[46],"range":[48],"heuristics":[50],"are":[51,76],"construct":[54],"partitions":[55],"vertex-set":[58],"which":[59],"give":[60],"lower":[61],"bounds":[62,75],"on":[63,71],"but":[67],"without":[68],"any":[69,165],"guarantee":[70],"how":[72],"close":[73],"these":[74],"true":[79],"maximum.":[80],"In":[81],"this":[82],"paper":[83],"we":[84,154,176],"investigate":[85],"parameterised":[87,121,160,192],"complexity":[88],"determining":[90],"with":[94],"respect":[95],"various":[97],"standard":[98],"structural":[99],"parameterisations":[100],"input":[103],"G":[105,131,147],".":[106],"We":[107],"show":[108,177],"that":[109,178],"problem":[111,180],"belongs":[112],"{FPT}$$":[115],"<mml:mi>FPT</mml:mi>":[118],"when":[120,191],"by":[122,150,161,194],"size":[124,198],"minimum":[127,201],"vertex":[128,203],"cover":[129],"for":[130],",":[132],"solvable":[135],"polynomial":[137],"time":[138],"whenever":[139],"treewidth":[141],"max":[143],"leaf":[144],"number":[145],"bounded":[149],"some":[151],"fixed":[152],"constant;":[153],"also":[155],"obtain":[156],"an":[157,188],"FPT":[158,189],"algorithm,":[159],"treewidth,":[162],"compute":[164],"constant-factor":[166],"approximation":[167],"modularity.":[171],"On":[172],"other":[174],"hand":[175],"W[1]-hard":[182],"(and":[183],"hence":[184],"unlikely":[185],"admit":[187],"algorithm)":[190],"simultaneously":[193],"pathwidth":[195],"feedback":[202],"set.":[204]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2018,"cited_by_count":1}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}