{"id":"https://openalex.org/W7159674195","doi":"https://doi.org/10.48550/arxiv.2604.27802","title":"Separating Feasibility and Movement in Solution Discovery: The Case of Path Discovery","display_name":"Separating Feasibility and Movement in Solution Discovery: The Case of Path Discovery","publication_year":2026,"publication_date":"2026-04-30","ids":{"openalex":"https://openalex.org/W7159674195","doi":"https://doi.org/10.48550/arxiv.2604.27802"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2604.27802","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.27802","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":false,"raw_source_name":null,"raw_type":"article"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2604.27802","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5134974487","display_name":"Hanno von Bergen","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"von Bergen, Hanno","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5134963634","display_name":"Larissa Fastenau","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Fastenau, Larissa","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5092819380","display_name":"Enna Gerhard","orcid":"https://orcid.org/0000-0002-7767-6637"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Gerhard, Enna","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5134939377","display_name":"Nicola Lorenz","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Lorenz, Nicola","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5047464461","display_name":"Stephanie Maaz","orcid":"https://orcid.org/0000-0001-7188-8834"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Maaz, Stephanie","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5051065386","display_name":"Amer E. Mouawad","orcid":"https://orcid.org/0000-0003-2481-4968"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Mouawad, Amer E.","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5073512540","display_name":"Roman Rabinovich","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Rabinovich, Roman","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5043312324","display_name":"Nicole Schirrmacher","orcid":"https://orcid.org/0000-0002-1740-7478"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Schirrmacher, Nicole","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5087608313","display_name":"Daniel Schmand","orcid":"https://orcid.org/0000-0001-7776-3426"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Schmand, Daniel","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5073548944","display_name":"Sebastian Siebertz","orcid":"https://orcid.org/0000-0002-6347-1198"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Siebertz, Sebastian","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5134974800","display_name":"Mai Trinh","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Trinh, Mai","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":11,"corresponding_author_ids":["https://openalex.org/A5134974487"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.15160000324249268,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T12292","display_name":"Graph Theory and Algorithms","score":0.15160000324249268,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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.1509999930858612,"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/T11106","display_name":"Data Management and Algorithms","score":0.11659999936819077,"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/bounded-function","display_name":"Bounded function","score":0.5422999858856201},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5151000022888184},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5116000175476074},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.4805999994277954},{"id":"https://openalex.org/keywords/directed-graph","display_name":"Directed graph","score":0.453000009059906},{"id":"https://openalex.org/keywords/security-token","display_name":"Security token","score":0.41449999809265137},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.3714999854564667},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.3686999976634979}],"concepts":[{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5422999858856201},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5151000022888184},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5116000175476074},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5084999799728394},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.4805999994277954},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.453000009059906},{"id":"https://openalex.org/C48145219","wikidata":"https://www.wikidata.org/wiki/Q1335365","display_name":"Security token","level":2,"score":0.41449999809265137},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.39570000767707825},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.39430001378059387},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3831999897956848},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.3714999854564667},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.3686999976634979},{"id":"https://openalex.org/C157951044","wikidata":"https://www.wikidata.org/wiki/Q1400910","display_name":"Feedback arc set","level":5,"score":0.3684999942779541},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.3637999892234802},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3531999886035919},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.32420000433921814},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.31380000710487366},{"id":"https://openalex.org/C38754835","wikidata":"https://www.wikidata.org/wiki/Q2003238","display_name":"Strongly connected component","level":2,"score":0.3077000081539154},{"id":"https://openalex.org/C831591","wikidata":"https://www.wikidata.org/wiki/Q59750","display_name":"Bidirectional search","level":5,"score":0.30410000681877136},{"id":"https://openalex.org/C177067428","wikidata":"https://www.wikidata.org/wiki/Q17013331","display_name":"Feasible region","level":2,"score":0.30239999294281006},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.29660001397132874},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.2802000045776367},{"id":"https://openalex.org/C76444178","wikidata":"https://www.wikidata.org/wiki/Q72897900","display_name":"Connectivity","level":3,"score":0.27970001101493835},{"id":"https://openalex.org/C96333769","wikidata":"https://www.wikidata.org/wiki/Q907955","display_name":"Graph traversal","level":3,"score":0.2752000093460083}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2604.27802","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.27802","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"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2604.27802","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.27802","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":false,"raw_source_name":null,"raw_type":"article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0,133,222],"study":[1],"solution":[2,12],"discovery,":[3],"where":[4,144],"the":[5,31,42,45,69,73,97,145,161,179,185,201,219],"goal":[6],"is":[7,40,147,205],"to":[8,13,148],"obtain":[9,223],"a":[10,14,21,82,102,113,150,157,224],"feasible":[11,39],"problem":[15,70,94,162,204],"from":[16,91],"an":[17,154],"initial":[18],"configuration":[19],"by":[20,77],"bounded":[22],"sequence":[23],"of":[24],"local":[25],"moves.":[26],"In":[27],"many":[28],"applications,":[29,170],"however,":[30],"graph":[32,46,71,95,104],"that":[33,47,87,116,193,210],"defines":[34],"which":[35],"vertex":[36,151],"sets":[37],"are":[38,166,177],"not":[41,67],"same":[43,186],"as":[44,59,130,231,233],"governs":[48],"how":[49],"tokens,":[50],"agents,":[51],"or":[52,156],"resources":[53],"may":[54],"move.":[55],"Existing":[56],"models":[57,129],"such":[58],"token":[60,63],"sliding":[61],"and":[62,72,108,122,140,173,214],"jumping":[64],"typically":[65],"do":[66],"distinguish":[68],"movement":[74,103,120],"graph.":[75,163],"Motivated":[76],"this":[78,135,211],"mismatch,":[79],"we":[80],"introduce":[81],"directed":[83,172],"weighted":[84,123,174],"two-graph":[85,220],"model":[86,136],"cleanly":[88],"separates":[89],"feasibility":[90],"movement.":[92],"A":[93],"specifies":[96,105],"desired":[98],"combinatorial":[99],"objects,":[100],"while":[101,125],"admissible":[106],"relocations":[107],"their":[109],"costs.":[110],"This":[111],"yields":[112],"flexible":[114],"framework":[115],"captures":[117],"asymmetry,":[118],"heterogeneous":[119],"constraints,":[121],"transitions,":[124],"subsuming":[126],"classical":[127],"discovery":[128,194],"special":[131],"cases.":[132],"investigate":[134],"through":[137],"\\textsc{Path":[138],"Discovery}":[139],"\\textsc{Shortest":[141],"Path":[142],"Discovery},":[143],"task":[146],"realize":[149],"set":[152],"containing":[153],"$s$-$t$-path":[155,159],"shortest":[158,175],"in":[160,169,218],"These":[164],"problems":[165],"particularly":[167],"natural":[168],"since":[171],"paths":[176],"among":[178],"most":[180],"fundamental":[181],"algorithmic":[182],"primitives.":[183],"At":[184],"time,":[187],"previous":[188],"work":[189],"has":[190],"already":[191],"shown":[192],"can":[195],"be":[196],"computationally":[197],"hard":[198],"even":[199],"when":[200],"underlying":[202],"optimization":[203],"easy.":[206],"Our":[207],"results":[208],"show":[209],"phenomenon":[212],"persists,":[213],"becomes":[215],"especially":[216],"rich,":[217],"setting.":[221],"detailed":[225],"complexity":[226],"picture,":[227],"identifying":[228],"tractable":[229],"cases":[230],"well":[232],"strong":[234],"hardness":[235],"results.":[236]},"counts_by_year":[],"updated_date":"2026-05-05T08:41:31.759640","created_date":"2026-05-02T00:00:00"}