{"id":"https://openalex.org/W4383223408","doi":"https://doi.org/10.1007/s00453-023-01140-0","title":"Traversability, Reconfiguration, and Reachability in the Gadget Framework","display_name":"Traversability, Reconfiguration, and Reachability in the Gadget Framework","publication_year":2023,"publication_date":"2023-07-05","ids":{"openalex":"https://openalex.org/W4383223408","doi":"https://doi.org/10.1007/s00453-023-01140-0"},"language":"en","primary_location":{"id":"doi:10.1007/s00453-023-01140-0","is_oa":true,"landing_page_url":"http://dx.doi.org/10.1007/s00453-023-01140-0","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00453-023-01140-0.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":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s00453-023-01140-0.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5033221267","display_name":"Joshua Ani","orcid":null},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Joshua Ani","raw_affiliation_strings":["Computer Science and Artificial Intelligence Laboratory, Massachusetts Institute of Technology, Cambridge, MA, 02139, USA"],"affiliations":[{"raw_affiliation_string":"Computer Science and Artificial Intelligence Laboratory, Massachusetts Institute of Technology, Cambridge, MA, 02139, USA","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5083684609","display_name":"Erik D. Demaine","orcid":"https://orcid.org/0000-0003-3803-5703"},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Erik D. Demaine","raw_affiliation_strings":["Computer Science and Artificial Intelligence Laboratory, Massachusetts Institute of Technology, Cambridge, MA, 02139, USA"],"affiliations":[{"raw_affiliation_string":"Computer Science and Artificial Intelligence Laboratory, Massachusetts Institute of Technology, Cambridge, MA, 02139, USA","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Yevhenii Diomidov","orcid":null},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Yevhenii Diomidov","raw_affiliation_strings":["Computer Science and Artificial Intelligence Laboratory, Massachusetts Institute of Technology, Cambridge, MA, 02139, USA"],"affiliations":[{"raw_affiliation_string":"Computer Science and Artificial Intelligence Laboratory, Massachusetts Institute of Technology, Cambridge, MA, 02139, USA","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5058171451","display_name":"Dylan Hendrickson","orcid":null},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Dylan Hendrickson","raw_affiliation_strings":["Computer Science and Artificial Intelligence Laboratory, Massachusetts Institute of Technology, Cambridge, MA, 02139, USA"],"affiliations":[{"raw_affiliation_string":"Computer Science and Artificial Intelligence Laboratory, Massachusetts Institute of Technology, Cambridge, MA, 02139, USA","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5083517445","display_name":"Jayson Lynch","orcid":"https://orcid.org/0000-0003-0801-1671"},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jayson Lynch","raw_affiliation_strings":["Computer Science and Artificial Intelligence Laboratory, Massachusetts Institute of Technology, Cambridge, MA, 02139, USA"],"affiliations":[{"raw_affiliation_string":"Computer Science and Artificial Intelligence Laboratory, Massachusetts Institute of Technology, Cambridge, MA, 02139, USA","institution_ids":["https://openalex.org/I63966007"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5033221267"],"corresponding_institution_ids":["https://openalex.org/I63966007"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":{"value":2290,"currency":"EUR","value_usd":2890},"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.08640241,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"85","issue":"11","first_page":"3453","last_page":"3486"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9969000220298767,"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"}},"topics":[{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9969000220298767,"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/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9958000183105469,"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/T11241","display_name":"Advanced Malware Detection Techniques","score":0.9947999715805054,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/reachability","display_name":"Reachability","score":0.9465314149856567},{"id":"https://openalex.org/keywords/gadget","display_name":"Gadget","score":0.8818073272705078},{"id":"https://openalex.org/keywords/traverse","display_name":"Traverse","score":0.8055258393287659},{"id":"https://openalex.org/keywords/control-reconfiguration","display_name":"Control reconfiguration","score":0.79521644115448},{"id":"https://openalex.org/keywords/tree-traversal","display_name":"Tree traversal","score":0.7660235166549683},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7514982223510742},{"id":"https://openalex.org/keywords/reachability-problem","display_name":"Reachability problem","score":0.5984412431716919},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5827878713607788},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.5426381826400757},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5275903344154358},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.5250760912895203},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.5215887427330017},{"id":"https://openalex.org/keywords/recursion","display_name":"Recursion (computer science)","score":0.4959035813808441},{"id":"https://openalex.org/keywords/graph-traversal","display_name":"Graph traversal","score":0.4796086549758911},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.43874385952949524},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.32019346952438354},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2821417450904846},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.1154119074344635}],"concepts":[{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.9465314149856567},{"id":"https://openalex.org/C119770614","wikidata":"https://www.wikidata.org/wiki/Q5516347","display_name":"Gadget","level":2,"score":0.8818073272705078},{"id":"https://openalex.org/C176809094","wikidata":"https://www.wikidata.org/wiki/Q15401496","display_name":"Traverse","level":2,"score":0.8055258393287659},{"id":"https://openalex.org/C119701452","wikidata":"https://www.wikidata.org/wiki/Q5165881","display_name":"Control reconfiguration","level":2,"score":0.79521644115448},{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.7660235166549683},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7514982223510742},{"id":"https://openalex.org/C2777669093","wikidata":"https://www.wikidata.org/wiki/Q17141570","display_name":"Reachability problem","level":3,"score":0.5984412431716919},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5827878713607788},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.5426381826400757},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5275903344154358},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.5250760912895203},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.5215887427330017},{"id":"https://openalex.org/C168773036","wikidata":"https://www.wikidata.org/wiki/Q264164","display_name":"Recursion (computer science)","level":2,"score":0.4959035813808441},{"id":"https://openalex.org/C96333769","wikidata":"https://www.wikidata.org/wiki/Q907955","display_name":"Graph traversal","level":3,"score":0.4796086549758911},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.43874385952949524},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.32019346952438354},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2821417450904846},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.1154119074344635},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C149635348","wikidata":"https://www.wikidata.org/wiki/Q193040","display_name":"Embedded system","level":1,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s00453-023-01140-0","is_oa":true,"landing_page_url":"http://dx.doi.org/10.1007/s00453-023-01140-0","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00453-023-01140-0.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"}],"best_oa_location":{"id":"doi:10.1007/s00453-023-01140-0","is_oa":true,"landing_page_url":"http://dx.doi.org/10.1007/s00453-023-01140-0","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00453-023-01140-0.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":[],"funders":[{"id":"https://openalex.org/F4320309369","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44"}],"has_content":{"grobid_xml":false,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4383223408.pdf"},"referenced_works_count":11,"referenced_works":["https://openalex.org/W1484040084","https://openalex.org/W1491169489","https://openalex.org/W1982129592","https://openalex.org/W2036722182","https://openalex.org/W2043360684","https://openalex.org/W2087818742","https://openalex.org/W2092395565","https://openalex.org/W2902956600","https://openalex.org/W3023230561","https://openalex.org/W4226108859","https://openalex.org/W4290017147"],"related_works":["https://openalex.org/W2200188075","https://openalex.org/W4230405657","https://openalex.org/W4254594467","https://openalex.org/W4252596799","https://openalex.org/W244044452","https://openalex.org/W2552915643","https://openalex.org/W3213135344","https://openalex.org/W3183956626","https://openalex.org/W4250225510","https://openalex.org/W1979520342"],"abstract_inverted_index":{"Abstract":[0],"Consider":[1],"an":[2],"agent":[3,22,38],"traversing":[4],"a":[5,41,44,123],"graph":[6],"of":[7,34,65,75,82,110,120],"\u201cgadgets\u201d,":[8],"where":[9],"each":[10,18],"gadget":[11,92],"has":[12,29],"local":[13],"state":[14],"that":[15,74,136],"changes":[16],"with":[17],"traversal":[19,84],"by":[20],"the":[21,31,37,56,62,69,80,86,108,113,118],"according":[23],"to":[24,59,89,116,122],"specified":[25,42,124],"rules.":[26],"Prior":[27],"work":[28],"studied":[30],"computational":[32,63],"complexity":[33,64,81,109],"deciding":[35],"whether":[36],"can":[39],"reach":[40],"location,":[43],"problem":[45],"we":[46,78,106],"call":[47],"reachability":[48,147],".":[49],"This":[50],"paper":[51],"introduces":[52],"new":[53],"goals":[54],"for":[55],"agent,":[57],"aiming":[58],"characterize":[60,79],"when":[61],"these":[66],"problems":[67],"is":[68,88,115,138,148],"same":[70],"or":[71],"differs":[72],"from":[73],"reachability.":[76],"First":[77],"universal":[83],"\u2014where":[85,112],"goal":[87,114],"traverse":[90],"every":[91],"at":[93],"least":[94],"once\u2014for":[95],"DAG":[96],"gadgets":[97,121],"(partially),":[98],"one-state":[99],"gadgets,":[100],"and":[101,131],"reversible":[102],"deterministic":[103],"gadgets.":[104],"Then":[105],"study":[107],"reconfiguration":[111,137],"bring":[117],"system":[119],"state.":[125],"We":[126],"prove":[127],"many":[128],"cases":[129,135],"PSPACE-complete,":[130],"show":[132],"in":[133,144],"some":[134],"strictly":[139,149],"harder":[140,150],"than":[141,151],"reachability,":[142],"while":[143],"other":[145],"cases,":[146],"reconfiguration.":[152]},"counts_by_year":[],"updated_date":"2026-04-17T18:11:37.981687","created_date":"2025-10-10T00:00:00"}