{"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/get-distances","entry":"get_distances","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":12,"n_papers_ran":6,"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":11,"n_samples_ran":6,"n_samples_fingerprinted":3,"n_places":12,"n_places_pointer_only":4,"by_status":{"ran_honours":2,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":2,"ran":2,"unverified":5},"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":"2412.05430","paper":"/paper/dart-eval-a-comprehensive-dna-language-model","title":"DART-Eval: A Comprehensive DNA Language Model Evaluation Benchmark on Regulatory DNA","date":"2024-12-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kundajelab/dart-eval","path":"src/dnalm_bench/task_2_5_single/experiments/task_2_transcription_factor_binding/footprint_eval_embeddings.py","file_url":"https://github.com/kundajelab/dart-eval/blob/HEAD/src/dnalm_bench/task_2_5_single/experiments/task_2_transcription_factor_binding/footprint_eval_embeddings.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"ba9e7c54f2991e6a","mcp_get_code":{"code_sha256":"ba9e7c54f2991e6a"}},{"arxiv_id":"2406.07897","paper":"/paper/when-do-skills-help-reinforcement-learning-a","title":"When Do Skills Help Reinforcement Learning? A Theoretical Analysis of Temporal Abstractions","date":"2024-06-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"uranium11010/rl-skill-theory","path":"rldiff_envs.py","file_url":"https://github.com/uranium11010/rl-skill-theory/blob/HEAD/rldiff_envs.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"0ce8a3a924c022d6","mcp_get_code":{"code_sha256":"0ce8a3a924c022d6"}},{"arxiv_id":"2308.08774","paper":"/paper/differential-privacy-linguistic-fairness-and","title":"Differential Privacy, Linguistic Fairness, and Training Data Influence: Impossibility and Possibility Theorems for Multilingual Language Models","date":"2023-08-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xplip/multilingual-lm-objectives","path":"evaluation/evaluation_utils.py","file_url":"https://github.com/xplip/multilingual-lm-objectives/blob/HEAD/evaluation/evaluation_utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"f613227e9f1c6c9c","mcp_get_code":{"code_sha256":"f613227e9f1c6c9c"}},{"arxiv_id":"2304.04782","paper":"/paper/reinforcement-learning-from-passive-data-via","title":"Reinforcement Learning from Passive Data via Latent Intentions","date":"2023-04-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dibyaghosh/icvf_release","path":"experiments/xmagical/train_icvf.py","file_url":"https://github.com/dibyaghosh/icvf_release/blob/HEAD/experiments/xmagical/train_icvf.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"1e41eedaedbe22c3","mcp_get_code":{"code_sha256":"1e41eedaedbe22c3"}},{"arxiv_id":"2303.14668","paper":"/paper/ceflow-a-robust-and-efficient-counterfactual","title":"CeFlow: A Robust and Efficient Counterfactual Explanation Framework for Tabular Data using Normalizing Flows","date":"2023-03-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tridungduong16/fairce","path":"src/carla/evaluation/distances.py","file_url":"https://github.com/tridungduong16/fairce/blob/HEAD/src/carla/evaluation/distances.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"dd26c560863fb6ee","mcp_get_code":{"code_sha256":"dd26c560863fb6ee"}},{"arxiv_id":"2303.03770","paper":"/paper/guiding-pseudo-labels-with-uncertainty","title":"Guiding Pseudo-labels with Uncertainty Estimation for Source-free Unsupervised Domain Adaptation","date":"2023-03-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mattialitrico/guiding-pseudo-labels-with-uncertainty-estimation-for-test-time-adaptation","path":"train_target.py","file_url":"https://github.com/mattialitrico/guiding-pseudo-labels-with-uncertainty-estimation-for-test-time-adaptation/blob/HEAD/train_target.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"1b15378197f0a873","mcp_get_code":{"code_sha256":"1b15378197f0a873"}},{"arxiv_id":"2205.00742","paper":"/paper/firmtruss-community-search-in-multilayer","title":"FirmTruss Community Search in Multilayer Networks","date":null,"month_inferred_from_arxiv_id":"2022-05","title_source":"archive","repo":"joint-em/ftcs","path":"Code/Utils/Distance.py","file_url":"https://github.com/joint-em/ftcs/blob/HEAD/Code/Utils/Distance.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"99db67e0c5f78ccd","mcp_get_code":{"code_sha256":"99db67e0c5f78ccd"}},{"arxiv_id":"2204.10377","paper":"/paper/contrastive-test-time-adaptation","title":"Contrastive Test-Time Adaptation","date":"2022-04-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"DianCh/AdaContrast","path":"target.py","file_url":"https://github.com/DianCh/AdaContrast/blob/HEAD/target.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"9a1f0bd5002fe561","mcp_get_code":{"code_sha256":"9a1f0bd5002fe561"}},{"arxiv_id":"2203.06768","paper":"/paper/algorithmic-recourse-in-the-face-of-noisy","title":"Probabilistically Robust Recourse: Navigating the Trade-offs between Costs and Robustness in Algorithmic Recourse","date":"2022-03-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"MartinPawel/ProbabilisticallyRobustRecourse","path":"carla/evaluation/distances.py","file_url":"https://github.com/MartinPawel/ProbabilisticallyRobustRecourse/blob/HEAD/carla/evaluation/distances.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"dd26c560863fb6ee","mcp_get_code":{"code_sha256":"dd26c560863fb6ee"}},{"arxiv_id":"2112.14718","paper":"/paper/shallow-decision-trees-for-explainable-k","title":"Shallow decision trees for explainable $k$-means clustering","date":"2021-12-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lmurtinho/shallowtree","path":"ShallowTree/ShallowTree.py","file_url":"https://github.com/lmurtinho/shallowtree/blob/HEAD/ShallowTree/ShallowTree.py","status":"ran_honours","verification_level":2,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"70b02ab5802a4ae1","mcp_get_code":{"code_sha256":"70b02ab5802a4ae1"}},{"arxiv_id":"2011.12737","paper":"/paper/ranking-deep-learning-generalization-using","title":"Ranking Deep Learning Generalization using Label Variation in Latent Geometry Graphs","date":"2020-11-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cadurosar/pgdl","path":"VPM_1/complexity.py","file_url":"https://github.com/cadurosar/pgdl/blob/HEAD/VPM_1/complexity.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NOASSERTION","inline_ok":false,"code_sha256_prefix":"2a55ae733f97a45f","mcp_get_code":{"code_sha256":"2a55ae733f97a45f"}},{"arxiv_id":"1909.01300","paper":"/paper/the-oxford-radar-robotcar-dataset-a-radar","title":"The Oxford Radar RobotCar Dataset: A Radar Extension to the Oxford RobotCar Dataset","date":null,"month_inferred_from_arxiv_id":"2019-09","title_source":"archive","repo":"mttgdd/oord-dataset","path":"src/compute_distance_matrix.py","file_url":"https://github.com/mttgdd/oord-dataset/blob/HEAD/src/compute_distance_matrix.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"2aa1c8370d9d7f81","mcp_get_code":{"code_sha256":"2aa1c8370d9d7f81"}}]}