{"id":"https://openalex.org/W2951672858","doi":"https://doi.org/10.1007/s00453-019-00660-y","title":"Best-Case and Worst-Case Sparsifiability of Boolean CSPs","display_name":"Best-Case and Worst-Case Sparsifiability of Boolean CSPs","publication_year":2020,"publication_date":"2020-01-10","ids":{"openalex":"https://openalex.org/W2951672858","doi":"https://doi.org/10.1007/s00453-019-00660-y","mag":"2951672858"},"language":"en","primary_location":{"id":"doi:10.1007/s00453-019-00660-y","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-019-00660-y","pdf_url":null,"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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},"type":"preprint","indexed_in":["crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://research.tue.nl/en/publications/798c77dc-bb2a-4f03-bde6-5b3c4e43f4da","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5107271836","display_name":"Hubie Chen","orcid":null},"institutions":[{"id":"https://openalex.org/I98259816","display_name":"Birkbeck, University of London","ror":"https://ror.org/02mb95055","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947","https://openalex.org/I98259816"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Hubie Chen","raw_affiliation_strings":["Birkbeck, University of London, Malet Street, Bloomsbury, London, WC1E 7HX, UK","Birkbeck, University of London, London, UK"],"affiliations":[{"raw_affiliation_string":"Birkbeck, University of London, Malet Street, Bloomsbury, London, WC1E 7HX, UK","institution_ids":["https://openalex.org/I98259816"]},{"raw_affiliation_string":"Birkbeck, University of London, London, UK","institution_ids":["https://openalex.org/I98259816"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5048942396","display_name":"Bart M. P. Jansen","orcid":"https://orcid.org/0000-0001-8204-1268"},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Bart M. P. Jansen","raw_affiliation_strings":["Eindhoven University of Technology, P.O. Box 513, 5600 MB, Eindhoven, The Netherlands","Eindhoven University of Technology, Eindhoven, The Netherlands"],"affiliations":[{"raw_affiliation_string":"Eindhoven University of Technology, P.O. Box 513, 5600 MB, Eindhoven, The Netherlands","institution_ids":["https://openalex.org/I83019370"]},{"raw_affiliation_string":"Eindhoven University of Technology, Eindhoven, The Netherlands","institution_ids":["https://openalex.org/I83019370"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5047711767","display_name":"Astrid Pieterse","orcid":"https://orcid.org/0000-0003-3721-6721"},"institutions":[{"id":"https://openalex.org/I39343248","display_name":"Humboldt-Universit\u00e4t zu Berlin","ror":"https://ror.org/01hcx6992","country_code":"DE","type":"education","lineage":["https://openalex.org/I39343248"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Astrid Pieterse","raw_affiliation_strings":["Institut f\u00fcr Informatik, Humboldt-Universit\u00e4t zu Berlin, Unter den Linden 6, 10099, Berlin, Germany","Institut f\u00fcr Informatik, Humboldt Universit\u00e4t zu Berlin, Berlin, Germany"],"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Informatik, Humboldt-Universit\u00e4t zu Berlin, Unter den Linden 6, 10099, Berlin, Germany","institution_ids":["https://openalex.org/I39343248"]},{"raw_affiliation_string":"Institut f\u00fcr Informatik, Humboldt Universit\u00e4t zu Berlin, Berlin, Germany","institution_ids":["https://openalex.org/I39343248"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5107271836"],"corresponding_institution_ids":["https://openalex.org/I98259816"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":0.289,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.59844405,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"82","issue":"8","first_page":"2200","last_page":"2242"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.995199978351593,"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.995199978351593,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9944999814033508,"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"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9836999773979187,"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/arity","display_name":"Arity","score":0.9051832556724548},{"id":"https://openalex.org/keywords/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.7404748797416687},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6714034676551819},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5360437035560608},{"id":"https://openalex.org/keywords/constraint-satisfaction","display_name":"Constraint satisfaction","score":0.4934467375278473},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.4850713312625885},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.457723468542099},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.4481363892555237},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.42616719007492065},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.4205247759819031}],"concepts":[{"id":"https://openalex.org/C110546421","wikidata":"https://www.wikidata.org/wiki/Q1315869","display_name":"Arity","level":2,"score":0.9051832556724548},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.7404748797416687},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6714034676551819},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5360437035560608},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.4934467375278473},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.4850713312625885},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.457723468542099},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.4481363892555237},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.42616719007492065},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.4205247759819031},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":12,"locations":[{"id":"doi:10.1007/s00453-019-00660-y","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-019-00660-y","pdf_url":null,"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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},{"id":"pmh:oai:pure.tue.nl:openaire/798c77dc-bb2a-4f03-bde6-5b3c4e43f4da","is_oa":true,"landing_page_url":"https://research.tue.nl/en/publications/798c77dc-bb2a-4f03-bde6-5b3c4e43f4da","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","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":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Chen, H, Jansen, B M P & Pieterse, A 2018, Best-Case and Worst-Case Sparsifiability of Boolean CSPs. in C Paul & M Pilipczuk (eds), 13th International Symposium on Parameterized and Exact Computation, IPEC 2018. Leibniz International Proceedings in Informatics (LIPIcs), vol. 115, Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 13th International Symposium on Parameterized and Exact Computation, IPEC 2018, Helsinki, Finland, 20/08/18. https://doi.org/10.4230/LIPIcs.IPEC.2018.15","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:pure.tue.nl:openaire_cris_publications/13477a8d-7425-45c0-b246-b79607caf004","is_oa":false,"landing_page_url":"https://research.tue.nl/en/publications/13477a8d-7425-45c0-b246-b79607caf004","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Chen, H, Jansen, B M P & Pieterse, A 2020, 'Best-Case and Worst-Case Sparsifiability of Boolean CSPs', Algorithmica, vol. 82, no. 8, pp. 2200-2242. https://doi.org/10.1007/s00453-019-00660-y","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"mag:2951672858","is_oa":true,"landing_page_url":"http://export.arxiv.org/pdf/1809.06171","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:916866","is_oa":false,"landing_page_url":"http://library.tue.nl/csp/dare/LinkToRepository.csp?recordnumber=916866","pdf_url":null,"source":{"id":"https://openalex.org/S4406923046","display_name":"TU/e Research Portal (Eindhoven University 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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""},{"id":"pmh:916916","is_oa":false,"landing_page_url":"http://library.tue.nl/csp/dare/LinkToRepository.csp?recordnumber=916916","pdf_url":null,"source":{"id":"https://openalex.org/S4406923046","display_name":"TU/e Research Portal (Eindhoven University 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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ISSN:","raw_type":"Article / Letter to the editor"},{"id":"pmh:oai:drops-oai.dagstuhl.de:10216","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2018.15","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:library.tue.nl:916866","is_oa":false,"landing_page_url":"http://repository.tue.nl/916866","pdf_url":null,"source":{"id":"https://openalex.org/S4406923046","display_name":"TU/e Research Portal (Eindhoven University 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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""},{"id":"pmh:oai:library.tue.nl:916916","is_oa":false,"landing_page_url":"http://repository.tue.nl/916916","pdf_url":null,"source":{"id":"https://openalex.org/S4406923046","display_name":"TU/e Research Portal (Eindhoven University 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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ISSN:","raw_type":"Article / Letter to the editor"},{"id":"pmh:tue:oai:pure.tue.nl:publications/13477a8d-7425-45c0-b246-b79607caf004","is_oa":false,"landing_page_url":"https://research.tue.nl/nl/publications/13477a8d-7425-45c0-b246-b79607caf004","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithmica, 82(8), 2200 - 2242. Springer","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:tue:oai:pure.tue.nl:publications/798c77dc-bb2a-4f03-bde6-5b3c4e43f4da","is_oa":true,"landing_page_url":"https://research.tue.nl/nl/publications/798c77dc-bb2a-4f03-bde6-5b3c4e43f4da","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ISSUE=13;TITLE=13th International Symposium on Parameterized and Exact Computation, IPEC 2018","raw_type":"info:eu-repo/semantics/conferencepaper"},{"id":"doi:10.4230/lipics.ipec.2018.15","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.ipec.2018.15","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":"pmh:oai:pure.tue.nl:openaire/798c77dc-bb2a-4f03-bde6-5b3c4e43f4da","is_oa":true,"landing_page_url":"https://research.tue.nl/en/publications/798c77dc-bb2a-4f03-bde6-5b3c4e43f4da","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","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":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Chen, H, Jansen, B M P & Pieterse, A 2018, Best-Case and Worst-Case Sparsifiability of Boolean CSPs. in C Paul & M Pilipczuk (eds), 13th International Symposium on Parameterized and Exact Computation, IPEC 2018. Leibniz International Proceedings in Informatics (LIPIcs), vol. 115, Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 13th International Symposium on Parameterized and Exact Computation, IPEC 2018, Helsinki, Finland, 20/08/18. https://doi.org/10.4230/LIPIcs.IPEC.2018.15","raw_type":"info:eu-repo/semantics/publishedVersion"},"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16","score":0.44999998807907104}],"awards":[{"id":"https://openalex.org/G7830895999","display_name":null,"funder_award_id":"024.002.003","funder_id":"https://openalex.org/F4320321800","funder_display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek"}],"funders":[{"id":"https://openalex.org/F4320321800","display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek","ror":"https://ror.org/04jsz6e67"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W78721095","https://openalex.org/W1699753700","https://openalex.org/W1821538950","https://openalex.org/W1909439116","https://openalex.org/W1976430052","https://openalex.org/W1988790603","https://openalex.org/W2004984049","https://openalex.org/W2026753685","https://openalex.org/W2032980094","https://openalex.org/W2034437384","https://openalex.org/W2039100365","https://openalex.org/W2063191044","https://openalex.org/W2116087731","https://openalex.org/W2117427564","https://openalex.org/W2131202479","https://openalex.org/W2166566648","https://openalex.org/W2255673366","https://openalex.org/W2400908863","https://openalex.org/W2659011796","https://openalex.org/W2914414140","https://openalex.org/W2963300845","https://openalex.org/W2988908508","https://openalex.org/W3098486139"],"related_works":["https://openalex.org/W3158083379","https://openalex.org/W3023177507","https://openalex.org/W748893740","https://openalex.org/W2541797201","https://openalex.org/W101741123","https://openalex.org/W3129913172","https://openalex.org/W1964923287","https://openalex.org/W2776885602","https://openalex.org/W3156923007","https://openalex.org/W2151577278","https://openalex.org/W2913322957","https://openalex.org/W1966841310","https://openalex.org/W3081808117","https://openalex.org/W2107918022","https://openalex.org/W2067706177","https://openalex.org/W2950815211","https://openalex.org/W1201946073","https://openalex.org/W2341570704","https://openalex.org/W2951646392","https://openalex.org/W2080500557"],"abstract_inverted_index":null,"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2020,"cited_by_count":1}],"updated_date":"2026-04-09T08:11:56.329763","created_date":"2025-10-10T00:00:00"}