{"id":"https://openalex.org/W7133360624","doi":"https://doi.org/10.48550/arxiv.2603.01786","title":"Learning Shortest Paths with Generative Flow Networks","display_name":"Learning Shortest Paths with Generative Flow Networks","publication_year":2026,"publication_date":"2026-03-02","ids":{"openalex":"https://openalex.org/W7133360624","doi":"https://doi.org/10.48550/arxiv.2603.01786"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2603.01786","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.01786","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","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.2603.01786","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5128020864","display_name":"Nikita Morozov","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Morozov, Nikita","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5128034089","display_name":"Ian Maksimov","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Maksimov, Ian","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5050920275","display_name":"Daniil Tiapkin","orcid":"https://orcid.org/0000-0002-8832-7926"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Tiapkin, Daniil","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5127935185","display_name":"Sergey Samsonov","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Samsonov, Sergey","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":4,"corresponding_author_ids":[],"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/T11273","display_name":"Advanced Graph Neural Networks","score":0.3684000074863434,"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"}},"topics":[{"id":"https://openalex.org/T11273","display_name":"Advanced Graph Neural Networks","score":0.3684000074863434,"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"}},{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.18449999392032623,"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/T10036","display_name":"Advanced Neural Network Applications","score":0.09619999676942825,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/pathfinding","display_name":"Pathfinding","score":0.7455000281333923},{"id":"https://openalex.org/keywords/traverse","display_name":"Traverse","score":0.6978999972343445},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.517799973487854},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.504800021648407},{"id":"https://openalex.org/keywords/relation","display_name":"Relation (database)","score":0.4618000090122223},{"id":"https://openalex.org/keywords/flow-network","display_name":"Flow network","score":0.4327000081539154},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.4212999939918518}],"concepts":[{"id":"https://openalex.org/C25321074","wikidata":"https://www.wikidata.org/wiki/Q1969601","display_name":"Pathfinding","level":4,"score":0.7455000281333923},{"id":"https://openalex.org/C176809094","wikidata":"https://www.wikidata.org/wiki/Q15401496","display_name":"Traverse","level":2,"score":0.6978999972343445},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5788000226020813},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.517799973487854},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.504800021648407},{"id":"https://openalex.org/C25343380","wikidata":"https://www.wikidata.org/wiki/Q277521","display_name":"Relation (database)","level":2,"score":0.4618000090122223},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4374000132083893},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.4327000081539154},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.4212999939918518},{"id":"https://openalex.org/C38349280","wikidata":"https://www.wikidata.org/wiki/Q1434290","display_name":"Flow (mathematics)","level":2,"score":0.4153999984264374},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.40549999475479126},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3718000054359436},{"id":"https://openalex.org/C21308566","wikidata":"https://www.wikidata.org/wiki/Q7169365","display_name":"Permutation (music)","level":2,"score":0.35179999470710754},{"id":"https://openalex.org/C27458966","wikidata":"https://www.wikidata.org/wiki/Q1187693","display_name":"Control flow graph","level":2,"score":0.35179999470710754},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33660000562667847},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3287999927997589},{"id":"https://openalex.org/C39890363","wikidata":"https://www.wikidata.org/wiki/Q36108","display_name":"Generative grammar","level":2,"score":0.30649998784065247},{"id":"https://openalex.org/C167966045","wikidata":"https://www.wikidata.org/wiki/Q5532625","display_name":"Generative model","level":3,"score":0.303600013256073},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.2904999852180481},{"id":"https://openalex.org/C168451585","wikidata":"https://www.wikidata.org/wiki/Q7502159","display_name":"Shortest Path Faster Algorithm","level":5,"score":0.2892000079154968},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.25529998540878296}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2603.01786","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.01786","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2603.01786","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.01786","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","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":{"In":[0],"this":[1,64,122],"paper,":[2],"we":[3,21,66],"present":[4],"a":[5,81],"novel":[6],"learning":[7,117],"framework":[8],"for":[9,121],"finding":[10],"shortest":[11,33,54],"paths":[12,55],"in":[13,27,30,72,95,97,101,124],"graphs":[14],"utilizing":[15],"Generative":[16],"Flow":[17],"Networks":[18],"(GFlowNets).":[19],"First,":[20],"examine":[22],"theoretical":[23],"properties":[24],"of":[25,92,126],"GFlowNets":[26],"non-acyclic":[28,82],"environments":[29,99],"relation":[31],"to":[32],"paths.":[34],"We":[35,87],"prove":[36],"that,":[37],"if":[38],"the":[39,49,57,69,90,106,127],"total":[40],"flow":[41,85],"is":[42],"minimized,":[43],"forward":[44],"and":[45,59,100],"backward":[46],"policies":[47],"traverse":[48],"environment":[50],"graph":[51,75],"exclusively":[52],"along":[53],"between":[56],"initial":[58],"terminal":[60],"states.":[61],"Building":[62],"on":[63],"result,":[65],"show":[67],"that":[68],"pathfinding":[70,96],"problem":[71],"an":[73],"arbitrary":[74],"can":[76],"be":[77],"solved":[78],"by":[79],"training":[80],"GFlowNet":[83],"with":[84,114],"regularization.":[86],"experimentally":[88],"demonstrate":[89],"performance":[91],"our":[93,109],"method":[94],"permutation":[98],"solving":[102],"Rubik's":[103],"Cubes.":[104],"For":[105],"latter":[107],"problem,":[108],"approach":[110],"shows":[111],"competitive":[112],"results":[113],"state-of-the-art":[115],"machine":[116],"approaches":[118],"designed":[119],"specifically":[120],"task":[123],"terms":[125],"solution":[128],"length,":[129],"while":[130],"requiring":[131],"smaller":[132],"search":[133],"budget":[134],"at":[135],"test-time.":[136]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2026-03-04T00:00:00"}