{"about":{"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.","site":"https://codewithpapers.app","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","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/code/compute-pairwise-distances","entry":"compute_pairwise_distances","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-10-05T00:36:11+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 = n_papers_ran_no_instrument_failure (papers with a run with no instrument failure) + n_papers_ran_instrument_only (papers where every run was a failure of Syntology's instrument); n_samples_ran = n_samples_ran_checked (honoured, violated, no contract) + n_samples_instrument (failures of Syntology's instrument, not of the code).","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; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":8,"n_papers_ran":7,"n_papers_ran_no_instrument_failure":6,"n_papers_ran_instrument_only":1,"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":6,"n_samples_constructed":0,"n_samples_ran_checked":5,"n_samples_instrument":1,"n_samples_unverified":1,"n_samples_fingerprinted":5,"n_places":9,"n_places_pointer_only":2,"n_places_pointer_only_link_open":0,"inline_ok_is":"inline_ok is true only when both licence gates allow Syntology to serve this code's text: this paper's link (inline_ok_link, from the licence of this paper's copy) and the stored copy of the same code that Syntology serves, which may have been first harvested from another repository. withheld_clause is Syntology's own wording of which gate keeps the text a pointer and why, and is null when inline_ok is true. This site shows no code text either way; n_places_pointer_only_link_open counts the places where this paper's link allows the text and the stored copy does not","by_status":{"ran_honours":2,"ran_violates":0,"ran_draft_wrong":1,"ran_fixture":0,"ran":3,"unverified":1},"key_notes":{"n_samples_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_samples_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"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","arxiv_id_is_arxiv":true,"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":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"54a01589a9986a91","code_sha256_prefix":"54a01589a9986a91","mcp_get_code":{"code_sha256":"54a01589a9986a91"}},{"arxiv_id":"2503.08305","arxiv_id_is_arxiv":true,"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":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"7709a70ba89c3325","code_sha256_prefix":"7709a70ba89c3325","mcp_get_code":{"code_sha256":"7709a70ba89c3325"}},{"arxiv_id":"2412.08480","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"af985ecf236605b0","code_sha256_prefix":"af985ecf236605b0","mcp_get_code":{"code_sha256":"af985ecf236605b0"}},{"arxiv_id":"2404.07117","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, skangasl/continuous-lm-interpolation when it was checked","code_sha256":"7d56b26920f68394","code_sha256_prefix":"7d56b26920f68394","mcp_get_code":{"code_sha256":"7d56b26920f68394"}},{"arxiv_id":"2304.07574","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"af985ecf236605b0","code_sha256_prefix":"af985ecf236605b0","mcp_get_code":{"code_sha256":"af985ecf236605b0"}},{"arxiv_id":"2010.09546","arxiv_id_is_arxiv":true,"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":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"70012af633b122df","code_sha256_prefix":"70012af633b122df","mcp_get_code":{"code_sha256":"70012af633b122df"}},{"arxiv_id":"1904.06991","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, AlexVerine/PrecisionRecallGan when it was checked","code_sha256":"462603bdd8ffe544","code_sha256_prefix":"462603bdd8ffe544","mcp_get_code":{"code_sha256":"462603bdd8ffe544"}},{"arxiv_id":"1904.06991","arxiv_id_is_arxiv":true,"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,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"af985ecf236605b0","code_sha256_prefix":"af985ecf236605b0","mcp_get_code":{"code_sha256":"af985ecf236605b0"}},{"arxiv_id":"1603.04779","arxiv_id_is_arxiv":true,"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":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"2f4fd28cb1f014f2","code_sha256_prefix":"2f4fd28cb1f014f2","mcp_get_code":{"code_sha256":"2f4fd28cb1f014f2"}}],"record_sha256":"ce7af6bd7d206e8581fe86f2fd42de21fec30cc5367e4067e2aa9c65001bc183","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}