Home › Code › get_distances

get_distances

Syntologyentry name in harvested code

Syntology's record for this page has not changed since , the first build that kept a record date for it; when this build read Syntology's graph is in the build record.

get_distances appears in the code Syntology harvested for 12 papers, as 11 distinct code bodies found in 12 places (a place is one code body under one paper). Of the 12 papers, 9 with a sample that ran: 7 with a run with no instrument failure, 2 where every run was a failure of Syntology's instrument. 3 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 get_distances 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; get_code(code_sha256="…") returns this sample's fingerprint on the shared battery, with the battery's shuffled null and lift; not shown on this site (how to connect). "Ran" means executed on a synthesized fixture, not that the code is correct or reproduces a paper.

Samples Syntology

The 11 distinct code bodies named get_distances: 9 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 2 honoured, 0 violated, 5 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified. “Where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. One tile per status, in the site's fixed vocabulary, each code body counted once:

2ran · honoured contract
0ran · violated contract
0ran · our draft was wrong
2ran; the contract check could not run
5ran
2unverified
3fingerprinted

Licence is a property of each copy, so it is counted per place: 4 of the 12 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 “the contract check could not run” (RAISES, DEP_MISSING or TIMEOUT; hover a row's label for which) 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; “with no instrument failure” is honoured, violated and ran with no contract checked. A metamorphic tier, where shown, is evidence of the output's shape, not that the sample implements the method.

Papers

12 papers shown of 12, newest first; 12 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. 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. A sample's code_sha256 is Syntology's identity for that exact code. It is printed in full (16 hexadecimal characters for every sample in this build), and get_code(code_sha256="…") takes it exactly as printed. An agent calls it on Syntology's MCP service (how to connect); click an identity to copy that call.

PaperDateFileStatus SyntologyLicence
DART-Eval: A Comprehensive DNA Language Model Evaluation Benchmark on Regulatory DNA 6 Dec 2024 kundajelab/dart-eval/src/dnalm_bench/task_2_5_single/experiments/task_2_transcription_factor_binding/footprint_eval_embeddings.py ba9e7c54f2991e6a ran no licence file found · pointer only
When Do Skills Help Reinforcement Learning? A Theoretical Analysis of Temporal Abstractions 12 Jun 2024 uranium11010/rl-skill-theory/rldiff_envs.py 0ce8a3a924c022d6 ran MIT (permissive)
Differential Privacy, Linguistic Fairness, and Training Data Influence: Impossibility and Possibility Theorems for Multilingual Language Models 17 Aug 2023 xplip/multilingual-lm-objectives/evaluation/evaluation_utils.py f613227e9f1c6c9c ran fingerprinted MIT (permissive)
Reinforcement Learning from Passive Data via Latent Intentions 10 Apr 2023 dibyaghosh/icvf_release/experiments/xmagical/train_icvf.py 1e41eedaedbe22c3 unverified MIT (permissive)
CeFlow: A Robust and Efficient Counterfactual Explanation Framework for Tabular Data using Normalizing Flows 26 Mar 2023 tridungduong16/fairce/src/carla/evaluation/distances.py dd26c560863fb6ee unverified MIT (permissive)
Guiding Pseudo-labels with Uncertainty Estimation for Source-free Unsupervised Domain Adaptation 7 Mar 2023 mattialitrico/guiding-pseudo-labels-with-uncertainty-estimation-for-test-time-adaptation/train_target.py 1b15378197f0a873 ran; the contract check could not run (RAISES) · metamorphic tier: invariant no licence file found · pointer only
FirmTruss Community Search in Multilayer Networks 2022-05 (from id) joint-em/ftcs/Code/Utils/Distance.py 99db67e0c5f78ccd ran MIT (permissive)
Contrastive Test-Time Adaptation 21 Apr 2022 DianCh/AdaContrast/target.py 9a1f0bd5002fe561 ran; the contract check could not run (RAISES) no licence file found · pointer only
Probabilistically Robust Recourse: Navigating the Trade-offs between Costs and Robustness in Algorithmic Recourse 13 Mar 2022 MartinPawel/ProbabilisticallyRobustRecourse/carla/evaluation/distances.py dd26c560863fb6ee unverified MIT (permissive)
Shallow decision trees for explainable $k$-means clustering 29 Dec 2021 lmurtinho/shallowtree/ShallowTree/ShallowTree.py 70b02ab5802a4ae1 ran · honoured contract fingerprinted MIT (permissive)
Ranking Deep Learning Generalization using Label Variation in Latent Geometry Graphs 25 Nov 2020 cadurosar/pgdl/VPM_1/complexity.py 2a55ae733f97a45f ran · honoured contract fingerprinted licence not identified · pointer only
The Oxford Radar RobotCar Dataset: A Radar Extension to the Oxford RobotCar Dataset 2019-09 (from id) mttgdd/oord-dataset/src/compute_distance_matrix.py 2aa1c8370d9d7f81 ran 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 six 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; the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar); this paper's copy was not located, so its licence is not recorded; or this paper's copy is under a permissive licence, but the stored copy of the same code that Syntology serves is not cleared for its text. 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