{"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/calculate-distance","entry":"calculate_distance","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":8,"n_papers_ran":4,"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":8,"n_samples_ran":4,"n_samples_fingerprinted":2,"n_places":8,"n_places_pointer_only":2,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":1,"ran_fixture":1,"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":"2605.00538","paper":"/paper/arxiv-2605-00538","title":"Vesselpose: Vessel Graph Reconstruction from Learned Voxel-wise Direction Vectors in 3D Vascular Images","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"Kainmueller-Lab/Vesselpose","path":"vector/vector_generation.py","file_url":"https://github.com/Kainmueller-Lab/Vesselpose/blob/HEAD/vector/vector_generation.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"30d9b0148e5ab698","mcp_get_code":{"code_sha256":"30d9b0148e5ab698"}},{"arxiv_id":"2602.16012","paper":"/paper/arxiv-2602-16012","title":"Towards Efficient Constraint Handling in Neural Solvers for Routing Problems","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"jieyibi/CaR-constraint","path":"baselines/greedy_parallel.py","file_url":"https://github.com/jieyibi/CaR-constraint/blob/HEAD/baselines/greedy_parallel.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"a2d50d249f007e4e","mcp_get_code":{"code_sha256":"a2d50d249f007e4e"}},{"arxiv_id":"2503.18108","paper":"/paper/unraveling-the-effects-of-synthetic-data-on","title":"Unraveling the Effects of Synthetic Data on End-to-End Autonomous Driving","date":"2025-03-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cancaries/SceneCrafter","path":"data_utils/cal_utils.py","file_url":"https://github.com/cancaries/SceneCrafter/blob/HEAD/data_utils/cal_utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"a0ea412ad84325d8","mcp_get_code":{"code_sha256":"a0ea412ad84325d8"}},{"arxiv_id":"2404.02638","paper":"/paper/sg-bev-satellite-guided-bev-fusion-for-cross","title":"SG-BEV: Satellite-Guided BEV Fusion for Cross-View Semantic Segmentation","date":"2024-04-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yejy53/SG-BEV","path":"models/utils/st_bev_old.py","file_url":"https://github.com/yejy53/SG-BEV/blob/HEAD/models/utils/st_bev_old.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"1071eb4b2d043ca4","mcp_get_code":{"code_sha256":"1071eb4b2d043ca4"}},{"arxiv_id":"2308.16906","paper":"/paper/fine-grained-cross-view-geo-localization-1","title":"Fine-Grained Cross-View Geo-Localization Using a Correlation-Aware Homography Estimator","date":"2023-08-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xlwangdev/hc-net","path":"models/utils/Mercator.py","file_url":"https://github.com/xlwangdev/hc-net/blob/HEAD/models/utils/Mercator.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"2461c47ca2c7ed13","mcp_get_code":{"code_sha256":"2461c47ca2c7ed13"}},{"arxiv_id":"2307.07044","paper":"/paper/anystar-domain-randomized-universal-star","title":"AnyStar: Domain randomized universal star-convex 3D instance segmentation","date":"2023-07-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"neel-dey/anystar","path":"scripts/step1_label_synthesis.py","file_url":"https://github.com/neel-dey/anystar/blob/HEAD/scripts/step1_label_synthesis.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"455f3c99acd06c06","mcp_get_code":{"code_sha256":"455f3c99acd06c06"}},{"arxiv_id":"1911.04936","paper":"/paper/combinatorial-optimization-by-graph-pointer","title":"Combinatorial Optimization by Graph Pointer Networks and Hierarchical Reinforcement Learning","date":"2019-11-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"danifuertes/top_transformer","path":"problems/top/compass.py","file_url":"https://github.com/danifuertes/top_transformer/blob/HEAD/problems/top/compass.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"70bb4fdd552dec0b","mcp_get_code":{"code_sha256":"70bb4fdd552dec0b"}},{"arxiv_id":"1810.00656","paper":"/paper/perfect-match-a-simple-method-for-learning","title":"Perfect Match: A Simple Method for Learning Representations For Counterfactual Inference With Neural Networks","date":"2018-10-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"d909b/perfect_match","path":"perfect_match/models/distributions.py","file_url":"https://github.com/d909b/perfect_match/blob/HEAD/perfect_match/models/distributions.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"97e939c3bfec21fb","mcp_get_code":{"code_sha256":"97e939c3bfec21fb"}}]}