{"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-nearest-neighbour-distances","entry":"compute_nearest_neighbour_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":5,"n_papers_ran":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":3,"n_samples_ran":1,"n_samples_fingerprinted":1,"n_places":6,"n_places_pointer_only":2,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":1,"ran":0,"unverified":2},"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.17622","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":"online_reproducible.py","file_url":"https://github.com/rezaei-parham/mixture-ucb/blob/HEAD/online_reproducible.py","status":"unverified","verification_level":0,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"a408e16ed43950a5","mcp_get_code":{"code_sha256":"a408e16ed43950a5"}},{"arxiv_id":"2412.17622","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":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"0e166911b5278ad1","mcp_get_code":{"code_sha256":"0e166911b5278ad1"}},{"arxiv_id":"2402.10693","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_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"GPL-3.0","inline_ok":false,"code_sha256_prefix":"4bf3c41c581f5379","mcp_get_code":{"code_sha256":"4bf3c41c581f5379"}},{"arxiv_id":"2105.14230","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":"unverified","verification_level":0,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"a408e16ed43950a5","mcp_get_code":{"code_sha256":"a408e16ed43950a5"}},{"arxiv_id":"2103.09396","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":null,"path":"","file_url":null,"status":"unverified","verification_level":0,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":null,"inline_ok":false,"code_sha256_prefix":"a408e16ed43950a5","mcp_get_code":{"code_sha256":"a408e16ed43950a5"}},{"arxiv_id":"2002.09797","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,"code_sha256_prefix":"a408e16ed43950a5","mcp_get_code":{"code_sha256":"a408e16ed43950a5"}}]}