{"about":{"site":"https://codewithpapers.app","non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page"},"url":"/code/dijkstra","entry":"dijkstra","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-09-24T18:15:14+00:00","claim":"Names are grouped by exact entry-name string. Same-named routines are NOT asserted to be equivalent; 'ran' means executed on a synthesized fixture, not correctness. n_samples_ran = sum of by_status over every status except 'unverified' (ran_draft_wrong and ran_fixture are failures of Syntology's instrument, not of the code); n_papers_ran = papers with at least one such sample.","status_vocabulary":{"ran_honours":"ran, honoured the contract we drafted","ran_violates":"ran, violated the contract we drafted","ran_draft_wrong":"ran; our contract draft was wrong, not the code","ran_fixture":"ran; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":6,"n_papers_ran":2,"units":"n_samples, n_samples_ran, n_samples_fingerprinted and by_status count distinct code bodies (code_sha256); n_places and n_places_pointer_only count places, one per (paper, code body) pair, which is also the unit of the samples list","n_samples":6,"n_samples_ran":2,"n_samples_fingerprinted":0,"n_places":6,"n_places_pointer_only":1,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":2,"unverified":4},"syntology":{"atlas_url":null,"mcp":null,"mcp_per_sample":{"tool":"get_code","arguments_in":"samples[].mcp_get_code"},"developers":"https://syntology.ai/developers"},"samples":[{"arxiv_id":"2607.14545","paper":"/paper/arxiv-2607-14545","title":"CASP: Learning-Augmented Offline Approximation with Verifiable Certificates and Bounded-Loss PAC Guarantees","date":null,"month_inferred_from_arxiv_id":"2026-07","title_source":"syntology","repo":"llfuture/casp","path":"codes/steiner_casp.py","file_url":"https://github.com/llfuture/casp/blob/HEAD/codes/steiner_casp.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"c07f6d5f5ff813db","mcp_get_code":{"code_sha256":"c07f6d5f5ff813db"}},{"arxiv_id":"2410.07096","paper":"/paper/identifying-and-addressing-delusions-for","title":"Rejecting Hallucinated State Targets during Planning","date":"2024-10-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mila-iqia/delusions","path":"experiments/Dyna/RandDistShift.py","file_url":"https://github.com/mila-iqia/delusions/blob/HEAD/experiments/Dyna/RandDistShift.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"cbbf3a5fe2aa63f0","mcp_get_code":{"code_sha256":"cbbf3a5fe2aa63f0"}},{"arxiv_id":"2210.08864","paper":"/paper/reducing-collision-checking-for-sampling-1","title":"Reducing Collision Checking for Sampling-Based Motion Planning Using Graph Neural Networks","date":"2022-10-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rainorangelemon/gnn-motion-planning","path":"algorithm/dijkstra.py","file_url":"https://github.com/rainorangelemon/gnn-motion-planning/blob/HEAD/algorithm/dijkstra.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"8450a8a532acd68a","mcp_get_code":{"code_sha256":"8450a8a532acd68a"}},{"arxiv_id":"2109.02066","paper":"/paper/hierarchical-object-to-zone-graph-for-object","title":"Hierarchical Object-to-Zone Graph for Object Navigation","date":"2021-09-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sx-zhang/HOZ","path":"models/hoztpn.py","file_url":"https://github.com/sx-zhang/HOZ/blob/HEAD/models/hoztpn.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"9d3afbea1f937a36","mcp_get_code":{"code_sha256":"9d3afbea1f937a36"}},{"arxiv_id":"2003.11657","paper":"/paper/deep-graph-matching-via-blackbox","title":"Deep Graph Matching via Blackbox Differentiation of Combinatorial Solvers","date":"2020-03-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"martius-lab/blackbox-backprop","path":"blackbox_backprop/shortest_path.py","file_url":"https://github.com/martius-lab/blackbox-backprop/blob/HEAD/blackbox_backprop/shortest_path.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"79d845c43088342b","mcp_get_code":{"code_sha256":"79d845c43088342b"}},{"arxiv_id":"2024.acl-demos.24","paper":null,"title":"arXiv:2024.acl-demos.24","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"mhulden/pyfoma","path":"src/pyfoma/algorithms.py","file_url":"https://github.com/mhulden/pyfoma/blob/HEAD/src/pyfoma/algorithms.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"317947dd993072b0","mcp_get_code":{"code_sha256":"317947dd993072b0"}}]}