Home › Code › calculate_distance

calculate_distance

Syntologyentry name in harvested coderead from the graph 2026-09-24

calculate_distance appears in the code Syntology harvested for 8 papers, as 8 distinct code bodies found in 8 places (a place is one code body under one paper). At least one of them ran in 4 of the papers; 2 of the code bodies carry a behaviour fingerprint.

What this page is not. Routines are grouped here by the exact string of their function or class name. Nothing asserts that two samples named calculate_distance do the same thing, share code, or are comparable; the name is a string, not an identity. Behaviour outputs (what a fingerprinted sample returned on the shared battery) are not in this export and are not shown here; the graph at syntology.ai holds them. "Ran" means executed on a synthesized fixture, not that the code is correct or reproduces a paper.

Samples Syntology

Syntology ran 4 of the 8 distinct code bodies named calculate_distance; 4 are unverified. One tile per status, in the site's fixed vocabulary, each code body counted once:

0ran · honoured contract
0ran · violated contract
1ran · our draft was wrong
1ran · fixture could not drive it
2ran
4unverified
2fingerprinted

Licence is a property of each copy, so it is counted per place: 2 of the 8 places are pointer only (Syntology does not serve that copy's text). This site shows no code text for any sample; every row below links to the file in its repository where the record names one.

“Ran” means the sample executed on a synthesized input; it does not mean the output is correct. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code, and those samples did run. The ran count above is every status except unverified, the same rule as each paper page.

Papers

8 papers shown of 8, newest first; 8 places in the table. A paper with no recorded date is placed by the month its arXiv id encodes, shown in the Date column as YYYY-MM (from id). One row per place: a paper whose repository defines the name more than once appears more than once, and the same code body held for several papers appears once under each, with the same status. Titles and dates are the archive's archive 2025-07-28 for papers in the archive, and the graph's for 2 papers added by Syntology. Status and fingerprint are Syntology's record of each code body; licence is recorded for each place. The File cell ends with the code body's code_sha256, Syntology's identity for that exact code: an agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

PaperDateFileStatus SyntologyLicence
Vesselpose: Vessel Graph Reconstruction from Learned Voxel-wise Direction Vectors in 3D Vascular Images added by Syntology 2026-05 (from id) Kainmueller-Lab/Vesselpose/vector/vector_generation.py 30d9b0148e5ab698 ran · fixture could not drive it MIT (permissive)
Towards Efficient Constraint Handling in Neural Solvers for Routing Problems added by Syntology 2026-02 (from id) jieyibi/CaR-constraint/baselines/greedy_parallel.py a2d50d249f007e4e unverified MIT (permissive)
Unraveling the Effects of Synthetic Data on End-to-End Autonomous Driving 23 Mar 2025 cancaries/SceneCrafter/data_utils/cal_utils.py a0ea412ad84325d8 unverified MIT (permissive)
SG-BEV: Satellite-Guided BEV Fusion for Cross-View Semantic Segmentation 3 Apr 2024 yejy53/SG-BEV/models/utils/st_bev_old.py 1071eb4b2d043ca4 ran fingerprinted no licence file found · pointer only
Fine-Grained Cross-View Geo-Localization Using a Correlation-Aware Homography Estimator 31 Aug 2023 xlwangdev/hc-net/models/utils/Mercator.py 2461c47ca2c7ed13 ran fingerprinted no licence file found · pointer only
AnyStar: Domain randomized universal star-convex 3D instance segmentation 13 Jul 2023 neel-dey/anystar/scripts/step1_label_synthesis.py 455f3c99acd06c06 ran · our draft was wrong MIT (permissive)
Combinatorial Optimization by Graph Pointer Networks and Hierarchical Reinforcement Learning 12 Nov 2019 danifuertes/top_transformer/problems/top/compass.py 70bb4fdd552dec0b unverified MIT (permissive)
Perfect Match: A Simple Method for Learning Representations For Counterfactual Inference With Neural Networks 1 Oct 2018 d909b/perfect_match/perfect_match/models/distributions.py 97e939c3bfec21fb unverified MIT (permissive)

This site shows no code text; each File cell links to the file on GitHub at the repository's current default branch, which may have changed since the harvest. "Pointer only" means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence cell for the reason. Per-sample records for a paper are on its paper page under "Code Syntology ran".

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections