{"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/get-kth-value","entry":"get_kth_value","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":8,"n_papers_ran_no_instrument_failure":1,"n_papers_ran_instrument_only":7,"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":5,"n_samples_ran":4,"n_samples_constructed":0,"n_samples_ran_checked":1,"n_samples_instrument":3,"n_samples_unverified":1,"n_samples_fingerprinted":1,"n_places":10,"n_places_pointer_only":4,"n_places_pointer_only_link_open":2,"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":0,"ran_violates":0,"ran_draft_wrong":2,"ran_fixture":1,"ran":1,"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":"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":"online_reproducible.py","file_url":"https://github.com/rezaei-parham/mixture-ucb/blob/HEAD/online_reproducible.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"547662aecde999ed","code_sha256_prefix":"547662aecde999ed","mcp_get_code":{"code_sha256":"547662aecde999ed"}},{"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","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":"77070877f999ddf8","code_sha256_prefix":"77070877f999ddf8","mcp_get_code":{"code_sha256":"77070877f999ddf8"}},{"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_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from AlexVerine/PrecisionRecallGan, and GitHub detected no licence in that repository when it was checked","code_sha256":"bcc716018b80b027","code_sha256_prefix":"bcc716018b80b027","mcp_get_code":{"code_sha256":"bcc716018b80b027"}},{"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_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"280348f666658113","code_sha256_prefix":"280348f666658113","mcp_get_code":{"code_sha256":"280348f666658113"}},{"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_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from AlexVerine/PrecisionRecallGan, and GitHub detected no licence in that repository when it was checked","code_sha256":"bcc716018b80b027","code_sha256_prefix":"bcc716018b80b027","mcp_get_code":{"code_sha256":"bcc716018b80b027"}},{"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_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"547662aecde999ed","code_sha256_prefix":"547662aecde999ed","mcp_get_code":{"code_sha256":"547662aecde999ed"}},{"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_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"547662aecde999ed","code_sha256_prefix":"547662aecde999ed","mcp_get_code":{"code_sha256":"547662aecde999ed"}},{"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_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","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":"547662aecde999ed","code_sha256_prefix":"547662aecde999ed","mcp_get_code":{"code_sha256":"547662aecde999ed"}},{"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":"366a31e98268c0e3","code_sha256_prefix":"366a31e98268c0e3","mcp_get_code":{"code_sha256":"366a31e98268c0e3"}},{"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_fixture","verification_level":1,"contract_check":"RAISES","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, AlexVerine/PrecisionRecallGan when it was checked","code_sha256":"bcc716018b80b027","code_sha256_prefix":"bcc716018b80b027","mcp_get_code":{"code_sha256":"bcc716018b80b027"}}],"record_sha256":"0b106086a5e5e57de6de1970111a9d847d54a835799265c85a4c0d63d42862d3","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}