{"id":"https://openalex.org/W7162012190","doi":"https://doi.org/10.5281/zenodo.20329103","title":"Residual Frontier Refinement: Exact Shortest-Path Propagation with Adaptive Partial Ordering","display_name":"Residual Frontier Refinement: Exact Shortest-Path Propagation with Adaptive Partial Ordering","publication_year":2026,"publication_date":"2026-05-22","ids":{"openalex":"https://openalex.org/W7162012190","doi":"https://doi.org/10.5281/zenodo.20329103"},"language":"en","primary_location":{"id":"doi:10.5281/zenodo.20329103","doi":"https://doi.org/10.5281/zenodo.20329103","is_oa":true,"landing_page_url":"https://doi.org/10.5281/zenodo.20329103","pdf_url":null,"source":{"id":"https://openalex.org/S4306400562","display_name":"Zenodo (CERN European Organization for Nuclear Research)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I67311998","host_organization_name":"European Organization for Nuclear Research","host_organization_lineage":["https://openalex.org/I67311998"],"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":"Preprint"},"volume":null,"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.5281/zenodo.20329103","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5136675992","display_name":"Morgan Petrik","orcid":"https://orcid.org/0009-0001-6696-4828","observed_orcids":["https://orcid.org/0009-0001-6696-4828"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Petrik, Morgan","raw_affiliation_strings":["Militant.AI"],"raw_orcid":"https://orcid.org/0009-0001-6696-4828","affiliations":[{"raw_affiliation_string":"Militant.AI","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5136723282","display_name":"Militant.AI","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Militant.AI","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.5957000255584717,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.5957000255584717,"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/T12292","display_name":"Graph Theory and Algorithms","score":0.34940001368522644,"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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.01080000028014183,"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/dijkstra-s-algorithm","display_name":"Dijkstra's algorithm","score":0.878000020980835},{"id":"https://openalex.org/keywords/batch-processing","display_name":"batch processing","score":0.4869999885559082},{"id":"https://openalex.org/keywords/python-implementation","display_name":"Python implementation","score":0.5130000114440918},{"id":"https://openalex.org/keywords/lean-formal-verification","display_name":"Lean formal verification","score":0.578000009059906},{"id":"https://openalex.org/keywords/performance-benchmarking","display_name":"performance benchmarking","score":0.5019999742507935},{"id":"https://openalex.org/keywords/a-comparison","display_name":"A* comparison","score":0.5580000281333923}],"concepts":[{"id":"https://openalex.org/C155512373","wikidata":"https://www.wikidata.org/wiki/Q287450","display_name":"Residual","level":2,"score":0.8113999962806702},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.5964999794960022},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.5605999827384949},{"id":"https://openalex.org/C161840515","wikidata":"https://www.wikidata.org/wiki/Q186131","display_name":"Terrain","level":2,"score":0.5429999828338623},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4997999966144562},{"id":"https://openalex.org/C2778571376","wikidata":"https://www.wikidata.org/wiki/Q1355821","display_name":"Frontier","level":2,"score":0.4941999912261963},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.46299999952316284},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.461899995803833},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4593999981880188},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4586000144481659},{"id":"https://openalex.org/C18762648","wikidata":"https://www.wikidata.org/wiki/Q42213","display_name":"Work (physics)","level":2,"score":0.41920000314712524},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.38589999079704285},{"id":"https://openalex.org/C519991488","wikidata":"https://www.wikidata.org/wiki/Q28865","display_name":"Python (programming language)","level":2,"score":0.361299991607666},{"id":"https://openalex.org/C2776867696","wikidata":"https://www.wikidata.org/wiki/Q3743777","display_name":"Telmatology","level":3,"score":0.3377000093460083},{"id":"https://openalex.org/C73301696","wikidata":"https://www.wikidata.org/wiki/Q5469984","display_name":"Formalism (music)","level":3,"score":0.3199999928474426},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.31439998745918274},{"id":"https://openalex.org/C159674985","wikidata":"https://www.wikidata.org/wiki/Q6823718","display_name":"Method of mean weighted residuals","level":4,"score":0.2890999913215637},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.289000004529953},{"id":"https://openalex.org/C180645754","wikidata":"https://www.wikidata.org/wiki/Q474715","display_name":"Partially ordered set","level":2,"score":0.28029999136924744},{"id":"https://openalex.org/C2993313656","wikidata":"https://www.wikidata.org/wiki/Q163082","display_name":"Metamorphic petrology","level":3,"score":0.2685999870300293},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2538999915122986},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.2526000142097473},{"id":"https://openalex.org/C34736171","wikidata":"https://www.wikidata.org/wiki/Q918333","display_name":"Preprocessor","level":2,"score":0.2522999942302704}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.5281/zenodo.20329103","doi":"https://doi.org/10.5281/zenodo.20329103","is_oa":true,"landing_page_url":"https://doi.org/10.5281/zenodo.20329103","pdf_url":null,"source":{"id":"https://openalex.org/S4306400562","display_name":"Zenodo (CERN European Organization for Nuclear Research)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I67311998","host_organization_name":"European Organization for Nuclear Research","host_organization_lineage":["https://openalex.org/I67311998"],"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":"Preprint"},{"id":"doi:10.5281/zenodo.20329104","doi":"https://doi.org/10.5281/zenodo.20329104","is_oa":true,"landing_page_url":"https://doi.org/10.5281/zenodo.20329104","pdf_url":null,"source":{"id":"https://openalex.org/S4306400562","display_name":"Zenodo (CERN European Organization for Nuclear Research)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I67311998","host_organization_name":"European Organization for Nuclear Research","host_organization_lineage":["https://openalex.org/I67311998"],"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":"Preprint"},{"id":"doi:10.5281/zenodo.21206454","doi":"https://doi.org/10.5281/zenodo.21206454","is_oa":true,"landing_page_url":"https://doi.org/10.5281/zenodo.21206454","pdf_url":null,"source":{"id":"https://openalex.org/S4306400562","display_name":"Zenodo (CERN European Organization for Nuclear Research)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I67311998","host_organization_name":"European Organization for Nuclear Research","host_organization_lineage":["https://openalex.org/I67311998"],"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":"Preprint"},{"id":"doi:10.5281/zenodo.21403659","doi":"https://doi.org/10.5281/zenodo.21403659","is_oa":true,"landing_page_url":"https://doi.org/10.5281/zenodo.21403659","pdf_url":null,"source":{"id":"https://openalex.org/S4306400562","display_name":"Zenodo (CERN European Organization for Nuclear Research)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I67311998","host_organization_name":"European Organization for Nuclear Research","host_organization_lineage":["https://openalex.org/I67311998"],"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":"Preprint"}],"best_oa_location":{"id":"doi:10.5281/zenodo.20329103","doi":"https://doi.org/10.5281/zenodo.20329103","is_oa":true,"landing_page_url":"https://doi.org/10.5281/zenodo.20329103","pdf_url":null,"source":{"id":"https://openalex.org/S4306400562","display_name":"Zenodo (CERN European Organization for Nuclear Research)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I67311998","host_organization_name":"European Organization for Nuclear Research","host_organization_lineage":["https://openalex.org/I67311998"],"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":"Preprint"},"sustainable_development_goals":[],"sustainable_development_goals_aurora":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":3,"referenced_works":["https://openalex.org/W2057112598","https://openalex.org/W2085917651","https://openalex.org/W4415306743"],"related_works":[],"abstract_inverted_index":{"Residual":[0],"Frontier":[1],"Refinement":[2],"(RFR)":[3],"is":[4,109],"an":[5],"exact":[6,52],"shortest-path":[7,42],"propagation":[8],"method":[9,25],"that":[10,37],"replaces":[11],"unconditional":[12],"global":[13,87],"priority-queue":[14],"ordering":[15,19,88],"with":[16,50],"adaptive":[17],"partial":[18],"over":[20,141],"residual":[21,103],"distance":[22],"bands.":[23],"The":[24,70,106],"processes":[26],"frontier":[27,104],"bands":[28,45],"in":[29,143],"batches":[30],"only":[31],"when":[32],"conservative":[33],"safety":[34],"checks":[35],"prove":[36],"doing":[38],"so":[39],"preserves":[40],"Dijkstra-equivalent":[41],"distances;":[43],"ambiguous":[44],"are":[46],"split":[47,98],"or":[48],"resolved":[49],"local":[51,100],"fallback.":[53],"This":[54],"release":[55],"contains":[56],"the":[57,115],"RFR":[58],"whitepaper,":[59],"Python":[60],"reference":[61],"implementation,":[62],"tests,":[63],"benchmark":[64],"artefacts,":[65],"and":[66,80,102,119,129],"topographic":[67],"routing":[68],"simulator.":[69],"work":[71,89,117],"validates":[72],"exactness":[73],"against":[74],"Dijkstra":[75,142],"across":[76],"tested":[77],"graph":[78],"families":[79],"demonstrates":[81,114],"how":[82],"structured":[83,123],"frontiers":[84],"can":[85],"reduce":[86],"while":[90],"exposing":[91],"useful":[92],"diagnostics":[93],"such":[94],"as":[95],"safe":[96],"batches,":[97],"pressure,":[99],"fallback,":[101],"ambiguity.":[105],"current":[107],"implementation":[108],"a":[110],"research":[111],"prototype.":[112],"It":[113],"algorithmic":[116],"model":[118],"operational":[120],"implications":[121],"for":[122],"maps,":[124],"grids,":[125],"rasters,":[126],"terrain":[127],"routing,":[128],"future":[130],"dynamic":[131],"repathing":[132],"systems,":[133],"but":[134],"does":[135],"not":[136],"claim":[137],"universal":[138],"wall-clock":[139],"superiority":[140],"Python.":[144]},"counts_by_year":[],"updated_date":"2026-10-08T09:06:37.294493","created_date":"2026-05-22T00:00:00"}