{"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/compute-pairwise-distances","entry":"compute_pairwise_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":8,"n_papers_ran":3,"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":7,"n_samples_ran":2,"n_samples_fingerprinted":2,"n_places":9,"n_places_pointer_only":2,"by_status":{"ran_honours":2,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":0,"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":"2510.25808","paper":"/paper/arxiv-2510-25808","title":"PRESTO: Preimage-Informed Instruction Optimization for Prompting Black-Box LLMs","date":null,"month_inferred_from_arxiv_id":"2025-10","title_source":"syntology","repo":"mlvlab/PRESTO","path":"Induction/experiments/group_init.py","file_url":"https://github.com/mlvlab/PRESTO/blob/HEAD/Induction/experiments/group_init.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"54a01589a9986a91","mcp_get_code":{"code_sha256":"54a01589a9986a91"}},{"arxiv_id":"2503.08305","paper":"/paper/electra-a-symmetry-breaking-cartesian-network","title":"ELECTRA: A Cartesian Network for 3D Charge Density Prediction with Floating Orbitals","date":"2025-03-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Jotels/ELECTRA_2025","path":"models/electra_hotpp/model/miao.py","file_url":"https://github.com/Jotels/ELECTRA_2025/blob/HEAD/models/electra_hotpp/model/miao.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"7709a70ba89c3325","mcp_get_code":{"code_sha256":"7709a70ba89c3325"}},{"arxiv_id":"2412.08480","paper":"/paper/invdiff-invariant-guidance-for-bias","title":"InvDiff: Invariant Guidance for Bias Mitigation in Diffusion Models","date":"2024-12-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hundredl/invdiff","path":"src/utils/score/improved_prd.py","file_url":"https://github.com/hundredl/invdiff/blob/HEAD/src/utils/score/improved_prd.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"af985ecf236605b0","mcp_get_code":{"code_sha256":"af985ecf236605b0"}},{"arxiv_id":"2404.07117","paper":"/paper/continuous-language-model-interpolation-for","title":"Continuous Language Model Interpolation for Dynamic and Controllable Text Generation","date":"2024-04-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"skangasl/continuous-lm-interpolation","path":"evaluation/evaluate_distances.py","file_url":"https://github.com/skangasl/continuous-lm-interpolation/blob/HEAD/evaluation/evaluate_distances.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"7d56b26920f68394","mcp_get_code":{"code_sha256":"7d56b26920f68394"}},{"arxiv_id":"2304.07574","paper":"/paper/exploring-incompatible-knowledge-transfer-in","title":"Exploring Incompatible Knowledge Transfer in Few-shot Image Generation","date":"2023-04-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yunqing-me/RICK","path":"gan_metrics/precision_recall.py","file_url":"https://github.com/yunqing-me/RICK/blob/HEAD/gan_metrics/precision_recall.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"af985ecf236605b0","mcp_get_code":{"code_sha256":"af985ecf236605b0"}},{"arxiv_id":"2010.09546","paper":"/paper/model-based-policy-optimization-with","title":"Model-based Policy Optimization with Unsupervised Model Adaptation","date":"2020-10-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"RockySJ/ampo","path":"models/utils.py","file_url":"https://github.com/RockySJ/ampo/blob/HEAD/models/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"70012af633b122df","mcp_get_code":{"code_sha256":"70012af633b122df"}},{"arxiv_id":"1904.06991","paper":"/paper/improved-precision-and-recall-metric-for","title":"Improved Precision and Recall Metric for Assessing Generative Models","date":"2019-04-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AlexVerine/PrecisionRecallGan","path":"precision_recall_kyn_utils.py","file_url":"https://github.com/AlexVerine/PrecisionRecallGan/blob/HEAD/precision_recall_kyn_utils.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"462603bdd8ffe544","mcp_get_code":{"code_sha256":"462603bdd8ffe544"}},{"arxiv_id":"1904.06991","paper":"/paper/improved-precision-and-recall-metric-for","title":"Improved Precision and Recall Metric for Assessing Generative Models","date":"2019-04-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"youngjung/improved-precision-and-recall-metric-pytorch","path":"improved_precision_recall.py","file_url":"https://github.com/youngjung/improved-precision-and-recall-metric-pytorch/blob/HEAD/improved_precision_recall.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"af985ecf236605b0","mcp_get_code":{"code_sha256":"af985ecf236605b0"}},{"arxiv_id":"1603.04779","paper":"/paper/revisiting-batch-normalization-for-practical","title":"Revisiting Batch Normalization For Practical Domain Adaptation","date":"2016-03-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"erlendd/ddan","path":"ddan/mmd.py","file_url":"https://github.com/erlendd/ddan/blob/HEAD/ddan/mmd.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"2f4fd28cb1f014f2","mcp_get_code":{"code_sha256":"2f4fd28cb1f014f2"}}]}