{"id":"https://openalex.org/W2776845434","doi":"https://doi.org/10.1145/3158092","title":"String constraints with concatenation and transducers solved efficiently","display_name":"String constraints with concatenation and transducers solved efficiently","publication_year":2017,"publication_date":"2017-12-27","ids":{"openalex":"https://openalex.org/W2776845434","doi":"https://doi.org/10.1145/3158092","mag":"2776845434"},"language":"en","primary_location":{"id":"doi:10.1145/3158092","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3158092","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3158092?download=true","source":{"id":"https://openalex.org/S4210216081","display_name":"Proceedings of the ACM on Programming Languages","issn_l":"2475-1421","issn":["2475-1421"],"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":"Proceedings of the ACM on Programming Languages","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/3158092?download=true","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5059358773","display_name":"Luk\u00e1\u0161 Hol\u00edk","orcid":"https://orcid.org/0000-0001-6957-1651"},"institutions":[{"id":"https://openalex.org/I60587646","display_name":"Brno University of Technology","ror":"https://ror.org/03613d656","country_code":"CZ","type":"education","lineage":["https://openalex.org/I60587646"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"Luk\u00e1\u0161 Hol\u00edk","raw_affiliation_strings":["Brno University of Technology, Czechia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Brno University of Technology, Czechia","institution_ids":["https://openalex.org/I60587646"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5102974672","display_name":"Petr Jank\u016f","orcid":"https://orcid.org/0000-0002-6306-8294"},"institutions":[{"id":"https://openalex.org/I60587646","display_name":"Brno University of Technology","ror":"https://ror.org/03613d656","country_code":"CZ","type":"education","lineage":["https://openalex.org/I60587646"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"Petr Jank\u016f","raw_affiliation_strings":["Brno University of Technology, Czechia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Brno University of Technology, Czechia","institution_ids":["https://openalex.org/I60587646"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5034129725","display_name":"Anthony W. Lin","orcid":"https://orcid.org/0000-0003-4715-5096"},"institutions":[{"id":"https://openalex.org/I40120149","display_name":"University of Oxford","ror":"https://ror.org/052gg0110","country_code":"GB","type":"education","lineage":["https://openalex.org/I40120149"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Anthony W. Lin","raw_affiliation_strings":["University of Oxford, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Oxford, UK","institution_ids":["https://openalex.org/I40120149"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5022025835","display_name":"Philipp R\u00fcmmer","orcid":"https://orcid.org/0000-0002-2733-7098"},"institutions":[{"id":"https://openalex.org/I123387679","display_name":"Uppsala University","ror":"https://ror.org/048a87296","country_code":"SE","type":"education","lineage":["https://openalex.org/I123387679"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Philipp R\u00fcmmer","raw_affiliation_strings":["Uppsala University, Sweden"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Uppsala University, Sweden","institution_ids":["https://openalex.org/I123387679"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5086446392","display_name":"Tom\u00e1\u0161 Vojnar","orcid":"https://orcid.org/0000-0002-2746-8792"},"institutions":[{"id":"https://openalex.org/I60587646","display_name":"Brno University of Technology","ror":"https://ror.org/03613d656","country_code":"CZ","type":"education","lineage":["https://openalex.org/I60587646"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"Tom\u00e1\u0161 Vojnar","raw_affiliation_strings":["Brno University of Technology, Czechia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Brno University of Technology, Czechia","institution_ids":["https://openalex.org/I60587646"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":5,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":11.6484,"has_fulltext":true,"cited_by_count":57,"citation_normalized_percentile":{"value":0.98436646,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":"2","issue":"POPL","first_page":"1","last_page":"32"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12479","display_name":"Web Application Security Vulnerabilities","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/T12479","display_name":"Web Application Security Vulnerabilities","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/T10743","display_name":"Software Testing and Debugging Techniques","score":0.996999979019165,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"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/T11424","display_name":"Security and Verification in Computing","score":0.9919000267982483,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/string","display_name":"String (physics)","score":0.6662766933441162},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.647725522518158},{"id":"https://openalex.org/keywords/concatenation","display_name":"Concatenation (mathematics)","score":0.5960405468940735},{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.5955377817153931},{"id":"https://openalex.org/keywords/undecidable-problem","display_name":"Undecidable problem","score":0.532481849193573},{"id":"https://openalex.org/keywords/fragment","display_name":"Fragment (logic)","score":0.48398900032043457},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4817907214164734},{"id":"https://openalex.org/keywords/symbolic-execution","display_name":"Symbolic execution","score":0.45260491967201233},{"id":"https://openalex.org/keywords/finite-state-machine","display_name":"Finite-state machine","score":0.4109935760498047},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.32329875230789185},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.23972079157829285},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.22828617691993713},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.11429986357688904}],"concepts":[{"id":"https://openalex.org/C157486923","wikidata":"https://www.wikidata.org/wiki/Q1376436","display_name":"String (physics)","level":2,"score":0.6662766933441162},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.647725522518158},{"id":"https://openalex.org/C87619178","wikidata":"https://www.wikidata.org/wiki/Q126002","display_name":"Concatenation (mathematics)","level":2,"score":0.5960405468940735},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.5955377817153931},{"id":"https://openalex.org/C192034797","wikidata":"https://www.wikidata.org/wiki/Q3502995","display_name":"Undecidable problem","level":3,"score":0.532481849193573},{"id":"https://openalex.org/C2776235265","wikidata":"https://www.wikidata.org/wiki/Q18392052","display_name":"Fragment (logic)","level":2,"score":0.48398900032043457},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4817907214164734},{"id":"https://openalex.org/C2779639559","wikidata":"https://www.wikidata.org/wiki/Q7661178","display_name":"Symbolic execution","level":3,"score":0.45260491967201233},{"id":"https://openalex.org/C167822520","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite-state machine","level":2,"score":0.4109935760498047},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.32329875230789185},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.23972079157829285},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.22828617691993713},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.11429986357688904},{"id":"https://openalex.org/C37914503","wikidata":"https://www.wikidata.org/wiki/Q156495","display_name":"Mathematical physics","level":1,"score":0.0},{"id":"https://openalex.org/C2777904410","wikidata":"https://www.wikidata.org/wiki/Q7397","display_name":"Software","level":2,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/3158092","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3158092","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3158092?download=true","source":{"id":"https://openalex.org/S4210216081","display_name":"Proceedings of the ACM on Programming Languages","issn_l":"2475-1421","issn":["2475-1421"],"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":"Proceedings of the ACM on Programming Languages","raw_type":"journal-article"},{"id":"pmh:oai:DiVA.org:uu-368719","is_oa":true,"landing_page_url":"http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-368719","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":"","raw_type":"Article in journal"},{"id":"pmh:oai:ora.ox.ac.uk:uuid:b51915b4-f55f-4b8d-8cbc-327abad90f11","is_oa":false,"landing_page_url":"https://ora.ox.ac.uk/objects/uuid:b51915b4-f55f-4b8d-8cbc-327abad90f11","pdf_url":null,"source":{"id":"https://openalex.org/S4306402636","display_name":"Oxford University Research Archive (ORA) (University of Oxford)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I40120149","host_organization_name":"University of Oxford","host_organization_lineage":["https://openalex.org/I40120149"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Journal article"}],"best_oa_location":{"id":"doi:10.1145/3158092","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3158092","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3158092?download=true","source":{"id":"https://openalex.org/S4210216081","display_name":"Proceedings of the ACM on Programming Languages","issn_l":"2475-1421","issn":["2475-1421"],"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":"Proceedings of the ACM on Programming Languages","raw_type":"journal-article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions","score":0.6100000143051147}],"awards":[{"id":"https://openalex.org/G1603911","display_name":null,"funder_award_id":"2014-5484","funder_id":"https://openalex.org/F4320322581","funder_display_name":"Vetenskapsr\u00e5det"},{"id":"https://openalex.org/G2506384661","display_name":null,"funder_award_id":"16-24707Y","funder_id":"https://openalex.org/F4320321006","funder_display_name":"Grantov\u00e1 Agentura \u010cesk\u00e9 Republiky"},{"id":"https://openalex.org/G6575745401","display_name":null,"funder_award_id":"LQ1602","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G8519669335","display_name":"Algorithmic Verification of String Manipulating Programs","funder_award_id":"759969","funder_id":"https://openalex.org/F4320338335","funder_display_name":"H2020 European Research Council"},{"id":"https://openalex.org/G853342598","display_name":null,"funder_award_id":"LQ1602","funder_id":"https://openalex.org/F4320321006","funder_display_name":"Grantov\u00e1 Agentura \u010cesk\u00e9 Republiky"},{"id":"https://openalex.org/G8694558082","display_name":null,"funder_award_id":"759969","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"}],"funders":[{"id":"https://openalex.org/F4320320300","display_name":"European Commission","ror":"https://ror.org/00k4n6c32"},{"id":"https://openalex.org/F4320321006","display_name":"Grantov\u00e1 Agentura \u010cesk\u00e9 Republiky","ror":"https://ror.org/01pv73b02"},{"id":"https://openalex.org/F4320322581","display_name":"Vetenskapsr\u00e5det","ror":"https://ror.org/03zttf063"},{"id":"https://openalex.org/F4320338335","display_name":"H2020 European Research Council","ror":"https://ror.org/0472cxd90"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2776845434.pdf","grobid_xml":"https://content.openalex.org/works/W2776845434.grobid-xml"},"referenced_works_count":76,"referenced_works":["https://openalex.org/W5815757","https://openalex.org/W8218418","https://openalex.org/W233122475","https://openalex.org/W254881558","https://openalex.org/W1495266209","https://openalex.org/W1497805930","https://openalex.org/W1505482284","https://openalex.org/W1507039213","https://openalex.org/W1510368738","https://openalex.org/W1512310098","https://openalex.org/W1528837436","https://openalex.org/W1530609294","https://openalex.org/W1535839566","https://openalex.org/W1543926679","https://openalex.org/W1555798330","https://openalex.org/W1566704763","https://openalex.org/W1572832005","https://openalex.org/W1584451387","https://openalex.org/W1586417893","https://openalex.org/W1588454361","https://openalex.org/W1599228120","https://openalex.org/W1787380291","https://openalex.org/W1810306334","https://openalex.org/W1917555234","https://openalex.org/W1952344271","https://openalex.org/W1964874178","https://openalex.org/W1965940079","https://openalex.org/W1982132104","https://openalex.org/W1987469449","https://openalex.org/W1987647365","https://openalex.org/W1993370765","https://openalex.org/W2002447170","https://openalex.org/W2011367000","https://openalex.org/W2011875300","https://openalex.org/W2017035494","https://openalex.org/W2023036777","https://openalex.org/W2023887108","https://openalex.org/W2028685566","https://openalex.org/W2037286444","https://openalex.org/W2044901139","https://openalex.org/W2052958416","https://openalex.org/W2075573771","https://openalex.org/W2094568767","https://openalex.org/W2096449544","https://openalex.org/W2097444001","https://openalex.org/W2099837287","https://openalex.org/W2111487235","https://openalex.org/W2117402063","https://openalex.org/W2117657788","https://openalex.org/W2130370455","https://openalex.org/W2137351629","https://openalex.org/W2159595840","https://openalex.org/W2161510308","https://openalex.org/W2164622707","https://openalex.org/W2169092431","https://openalex.org/W2169868363","https://openalex.org/W2181775248","https://openalex.org/W2194959641","https://openalex.org/W2295723447","https://openalex.org/W2295791966","https://openalex.org/W2330747214","https://openalex.org/W2339322325","https://openalex.org/W2482729551","https://openalex.org/W2499720498","https://openalex.org/W2501292226","https://openalex.org/W2528110499","https://openalex.org/W2735438339","https://openalex.org/W2752885492","https://openalex.org/W2753891615","https://openalex.org/W2911375523","https://openalex.org/W2913459036","https://openalex.org/W2945259913","https://openalex.org/W2963648651","https://openalex.org/W4206635485","https://openalex.org/W4237492309","https://openalex.org/W4242157899"],"related_works":["https://openalex.org/W2972379433","https://openalex.org/W1501430220","https://openalex.org/W2989332944","https://openalex.org/W2021891065","https://openalex.org/W2583549044","https://openalex.org/W2119045600","https://openalex.org/W2584984136","https://openalex.org/W2962928105","https://openalex.org/W2170336571","https://openalex.org/W2020140696"],"abstract_inverted_index":{"String":[0],"analysis":[1,32,320],"is":[2,151,154,201,212],"the":[3,45,63,77,81,100,145,149,164,199,202,207,216,280,283,325],"problem":[4],"of":[5,22,79,88,102,148,206,238,261,267,270,274,282],"reasoning":[6,113],"about":[7,55,114,171,279],"how":[8],"strings":[9,61,103],"are":[10,109,315],"manipulated":[11],"by":[12,91],"a":[13,89,182,226,265,287],"program.":[14],"It":[15],"has":[16,181],"numerous":[17],"applications":[18],"including":[19],"automatic":[20,26],"detection":[21],"cross-site":[23,318],"scripting,":[24],"and":[25,125,153,176,184,276,308,321],"test-case":[27],"generation.":[28],"A":[29],"popular":[30],"string":[31,46,49,90,107,166,239],"technique":[33],"includes":[34],"symbolic":[35,236],"executions,":[36],"which":[37,211,295],"at":[38],"their":[39],"core":[40],"use":[41,297],"constraint":[42],"solvers":[43,52],"over":[44,60],"domain,":[47],"a.k.a.":[48],"solvers.":[50],"Such":[51,106],"typically":[53,110],"reason":[54,170],"constraints":[56,172],"expressed":[57],"in":[58,99,117,134,138,157,198,255,290,324],"theories":[59,101],"with":[62,104],"concatenation":[64,175],"operator":[65,83],"as":[66,234],"an":[67,135,291],"atomic":[68],"constraint.":[69],"In":[70,159,241],"recent":[71],"years,":[72],"researchers":[73],"started":[74],"to":[75,243],"recognise":[76],"importance":[78],"incorporating":[80],"replace-all":[82],"(i.e.":[84],"replace":[85],"all":[86],"occurrences":[87],"another":[92],"string)":[93],"and,":[94],"more":[95],"generally,":[96],"finite-state":[97,177,219,232],"transductions":[98,128],"concatenation.":[105,277],"operations":[108],"crucial":[111],"for":[112,121,187,294],"XSS":[115],"vulnerabilities":[116],"web":[118],"applications,":[119],"especially":[120],"modelling":[122],"sanitisation":[123],"functions":[124],"implicit":[126],"browser":[127],"(e.g.":[129,191,301],"innerHTML).":[130],"Although":[131],"this":[132,160,222],"results":[133],"undecidable":[136],"theory":[137,150,208],"general,":[139],"it":[140,180],"was":[141],"recently":[142],"shown":[143],"that":[144,168,228,314],"straight-line":[146,192],"fragment":[147],"decidable,":[152],"sufficiently":[155],"expressive":[156],"practice.":[158],"paper,":[161],"we":[162,224,296],"provide":[163],"first":[165],"solver":[167],"can":[169],"involving":[173],"both":[174],"transductions.":[178,220],"Moreover,":[179],"completeness":[183],"termination":[185],"guarantee":[186],"several":[188],"important":[189],"fragments":[190],"fragment).":[193],"The":[194],"main":[195],"challenge":[196],"addressed":[197],"paper":[200],"prohibitive":[203],"worst-case":[204],"complexity":[205],"(double-exponential":[209],"time),":[210],"exponentially":[213],"harder":[214],"than":[215],"case":[217],"without":[218],"To":[221],"end,":[223],"propose":[225],"method":[227],"exploits":[229],"succinct":[230,268],"alternating":[231],"automata":[233],"concise":[235],"representations":[237],"constraints.":[240],"contrast":[242],"previous":[244],"approaches":[245],"using":[246],"nondeterministic":[247],"automata,":[248],"alternation":[249],"offers":[250],"not":[251],"only":[252],"exponential":[253],"savings":[254],"space":[256],"when":[257],"representing":[258],"Boolean":[259],"combinations":[260,273],"transducers,":[262],"but":[263],"also":[264],"possibility":[266],"representation":[269],"otherwise":[271],"costly":[272],"transducers":[275],"Reasoning":[278],"emptiness":[281],"AFA":[284],"language":[285],"requires":[286],"state-space":[288],"exploration":[289],"exponential-sized":[292],"graph,":[293],"model":[298],"checking":[299],"algorithms":[300],"IC3).":[302],"We":[303],"have":[304],"implemented":[305],"our":[306],"algorithm":[307],"demonstrated":[309],"its":[310],"efficacy":[311],"on":[312],"benchmarks":[313],"derived":[316],"from":[317],"scripting":[319],"other":[322],"examples":[323],"literature.":[326]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":9},{"year":2022,"cited_by_count":7},{"year":2021,"cited_by_count":11},{"year":2020,"cited_by_count":8},{"year":2019,"cited_by_count":7},{"year":2018,"cited_by_count":8}],"updated_date":"2026-06-19T17:40:00.097472","created_date":"2025-10-10T00:00:00"}