{"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-distance","entry":"compute_pairwise_distance","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":9,"n_papers_ran":8,"n_papers_ran_no_instrument_failure":8,"n_papers_ran_instrument_only":0,"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":5,"n_samples_constructed":0,"n_samples_ran_checked":5,"n_samples_instrument":0,"n_samples_unverified":2,"n_samples_fingerprinted":4,"n_places":10,"n_places_pointer_only":3,"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":4,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":1,"unverified":2},"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":"2501.18901","arxiv_id_is_arxiv":true,"paper":"/paper/lightspeed-geometric-dataset-distance-via","title":"Lightspeed Geometric Dataset Distance via Sliced Optimal Transport","date":"2025-01-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hainn2803/s-otdd","path":"otdd/pytorch/sotdd.py","file_url":"https://github.com/hainn2803/s-otdd/blob/HEAD/otdd/pytorch/sotdd.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"a8a074c26dbfa82c","code_sha256_prefix":"a8a074c26dbfa82c","mcp_get_code":{"code_sha256":"a8a074c26dbfa82c"}},{"arxiv_id":"2412.17622","arxiv_id_is_arxiv":true,"paper":"/paper/be-more-diverse-than-the-most-diverse-online","title":"Be More Diverse than the Most Diverse: Optimal Mixtures of Generative Models via Mixture-UCB Bandit Algorithms","date":"2024-12-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rezaei-parham/mixture-ucb","path":"offline_mixture.py","file_url":"https://github.com/rezaei-parham/mixture-ucb/blob/HEAD/offline_mixture.py","status":"ran_honours","verification_level":2,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"259ec7338be8a457","code_sha256_prefix":"259ec7338be8a457","mcp_get_code":{"code_sha256":"259ec7338be8a457"}},{"arxiv_id":"2407.11734","arxiv_id_is_arxiv":true,"paper":"/paper/generating-multi-modal-and-multi-attribute","title":"Multi-Modal and Multi-Attribute Generation of Single Cells with CFGen","date":"2024-07-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"theislab/CFGen","path":"cfgen/eval/distribution_distances.py","file_url":"https://github.com/theislab/CFGen/blob/HEAD/cfgen/eval/distribution_distances.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":"6e6ba2d3fe1b0791","code_sha256_prefix":"6e6ba2d3fe1b0791","mcp_get_code":{"code_sha256":"6e6ba2d3fe1b0791"}},{"arxiv_id":"2402.10693","arxiv_id_is_arxiv":true,"paper":"/paper/exploring-precision-and-recall-to-assess-the","title":"Exploring Precision and Recall to assess the quality and diversity of LLMs","date":"2024-02-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"alexverine/pr-4-llm","path":"pr_llm/PR/compute_PR.py","file_url":"https://github.com/alexverine/pr-4-llm/blob/HEAD/pr_llm/PR/compute_PR.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"GPL-3.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GPL-3.0, as GitHub detects it on this paper's repository, alexverine/pr-4-llm, is not in the permissive set Syntology serves inline","code_sha256":"1ee256faafb7fd97","code_sha256_prefix":"1ee256faafb7fd97","mcp_get_code":{"code_sha256":"1ee256faafb7fd97"}},{"arxiv_id":"2303.04842","arxiv_id_is_arxiv":true,"paper":"/paper/distributed-potential-ilqr-scalable-game","title":"Distributed Potential iLQR: Scalable Game-Theoretic Trajectory Planning for Multi-Agent Interactions","date":null,"month_inferred_from_arxiv_id":"2023-03","title_source":"archive","repo":"labicon/dp-ilqr","path":"dpilqr/util.py","file_url":"https://github.com/labicon/dp-ilqr/blob/HEAD/dpilqr/util.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":"306214f70893433d","code_sha256_prefix":"306214f70893433d","mcp_get_code":{"code_sha256":"306214f70893433d"}},{"arxiv_id":"2105.14230","arxiv_id_is_arxiv":true,"paper":"/paper/transforming-the-latent-space-of-stylegan-for","title":"Transforming the Latent Space of StyleGAN for Real Face Editing","date":"2021-05-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AnonSubm2021/TransStyleGAN","path":"metrics/prdc.py","file_url":"https://github.com/AnonSubm2021/TransStyleGAN/blob/HEAD/metrics/prdc.py","status":"ran_honours","verification_level":2,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"259ec7338be8a457","code_sha256_prefix":"259ec7338be8a457","mcp_get_code":{"code_sha256":"259ec7338be8a457"}},{"arxiv_id":"2103.09396","arxiv_id_is_arxiv":true,"paper":"/paper/pros-and-cons-of-gan-evaluation-measures-new","title":"Pros and Cons of GAN Evaluation Measures: New Developments","date":"2021-03-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"clovaai/generative-evaluation-prdc","path":"prdc/prdc.py","file_url":"https://github.com/clovaai/generative-evaluation-prdc/blob/HEAD/prdc/prdc.py","status":"ran_honours","verification_level":2,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"259ec7338be8a457","code_sha256_prefix":"259ec7338be8a457","mcp_get_code":{"code_sha256":"259ec7338be8a457"}},{"arxiv_id":"2002.09797","arxiv_id_is_arxiv":true,"paper":"/paper/reliable-fidelity-and-diversity-metrics-for","title":"Reliable Fidelity and Diversity Metrics for Generative Models","date":"2020-02-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_honours","verification_level":2,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"259ec7338be8a457","code_sha256_prefix":"259ec7338be8a457","mcp_get_code":{"code_sha256":"259ec7338be8a457"}},{"arxiv_id":"2002.09797","arxiv_id_is_arxiv":true,"paper":"/paper/reliable-fidelity-and-diversity-metrics-for","title":"Reliable Fidelity and Diversity Metrics for Generative Models","date":"2020-02-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"clovaai/generative-evaluation-prdc","path":"prdc/prdc.py","file_url":"https://github.com/clovaai/generative-evaluation-prdc/blob/HEAD/prdc/prdc.py","status":"unverified","verification_level":0,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"0c0553c682e66b85","code_sha256_prefix":"0c0553c682e66b85","mcp_get_code":{"code_sha256":"0c0553c682e66b85"}},{"arxiv_id":"1904.03608","arxiv_id_is_arxiv":true,"paper":"/paper/normalized-diversification","title":"Normalized Diversification","date":"2019-04-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"B1ueber2y/NDiv","path":"ndiv_pytorch.py","file_url":"https://github.com/B1ueber2y/NDiv/blob/HEAD/ndiv_pytorch.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, B1ueber2y/NDiv when it was checked","code_sha256":"1928ecc6633e13ee","code_sha256_prefix":"1928ecc6633e13ee","mcp_get_code":{"code_sha256":"1928ecc6633e13ee"}}],"record_sha256":"bb2522dcc215594f0fe0723c53670981eb5e8f36934c7f9384b456138cb1cc31","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}