{"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-is","entry":"compute_is","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":10,"n_papers_ran":0,"n_papers_ran_no_instrument_failure":0,"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":3,"n_samples_ran":0,"n_samples_constructed":0,"n_samples_ran_checked":0,"n_samples_instrument":0,"n_samples_unverified":3,"n_samples_fingerprinted":0,"n_places":10,"n_places_pointer_only":7,"n_places_pointer_only_link_open":4,"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":0,"ran_fixture":0,"ran":0,"unverified":3},"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":"2606.19802","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-19802","title":"Flow Map Denoisers: Traversing the Distortion-Perception Plane for Inverse Problems","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"nzilberstein/Flow-map-denoisers","path":"metrics/inception_score.py","file_url":"https://github.com/nzilberstein/Flow-map-denoisers/blob/HEAD/metrics/inception_score.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, nzilberstein/Flow-map-denoisers when it was checked","code_sha256":"290651a70c4fa3f2","code_sha256_prefix":"290651a70c4fa3f2","mcp_get_code":{"code_sha256":"290651a70c4fa3f2"}},{"arxiv_id":"2509.24526","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2509-24526","title":"CMT: Mid-Training for Efficient Learning of Consistency, Mean Flow, and Flow Map Models","date":null,"month_inferred_from_arxiv_id":"2025-09","title_source":"syntology","repo":"sony/cmt","path":"metrics/inception_score.py","file_url":"https://github.com/sony/cmt/blob/HEAD/metrics/inception_score.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":"47c7a1249e324f74","code_sha256_prefix":"47c7a1249e324f74","mcp_get_code":{"code_sha256":"47c7a1249e324f74"}},{"arxiv_id":"2502.06349","arxiv_id_is_arxiv":true,"paper":"/paper/provably-near-optimal-federated-ensemble","title":"Provably Near-Optimal Federated Ensemble Distillation with Negligible Overhead","date":"2025-02-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"autonomousvision/stylegan-xl","path":"metrics/inception_score.py","file_url":"https://github.com/autonomousvision/stylegan-xl/blob/HEAD/metrics/inception_score.py","status":"unverified","verification_level":0,"contract_check":null,"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 hse1032/Adversarial-Generation-of-Hierarchical-Gaussians-for-3D-Generative-Model, and GitHub detected no licence in that repository when it was checked","code_sha256":"fc49fa553c005268","code_sha256_prefix":"fc49fa553c005268","mcp_get_code":{"code_sha256":"fc49fa553c005268"}},{"arxiv_id":"2406.02968","arxiv_id_is_arxiv":true,"paper":"/paper/adversarial-generation-of-hierarchical","title":"GSGAN: Adversarial Learning for Hierarchical Generation of 3D Gaussian Splats","date":"2024-06-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hse1032/Adversarial-Generation-of-Hierarchical-Gaussians-for-3D-Generative-Model","path":"metrics/inception_score.py","file_url":"https://github.com/hse1032/Adversarial-Generation-of-Hierarchical-Gaussians-for-3D-Generative-Model/blob/HEAD/metrics/inception_score.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, hse1032/Adversarial-Generation-of-Hierarchical-Gaussians-for-3D-Generative-Model when it was checked","code_sha256":"fc49fa553c005268","code_sha256_prefix":"fc49fa553c005268","mcp_get_code":{"code_sha256":"fc49fa553c005268"}},{"arxiv_id":"2404.04057","arxiv_id_is_arxiv":true,"paper":"/paper/score-identity-distillation-exponentially","title":"Score identity Distillation: Exponentially Fast Distillation of Pretrained Diffusion Models for One-Step Generation","date":"2024-04-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mingyuanzhou/SiD","path":"metrics/sid_inception_score.py","file_url":"https://github.com/mingyuanzhou/SiD/blob/HEAD/metrics/sid_inception_score.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"47c7a1249e324f74","code_sha256_prefix":"47c7a1249e324f74","mcp_get_code":{"code_sha256":"47c7a1249e324f74"}},{"arxiv_id":"2311.17857","arxiv_id_is_arxiv":true,"paper":"/paper/gaussian-shell-maps-for-efficient-3d-human","title":"Gaussian Shell Maps for Efficient 3D Human Generation","date":"2023-11-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"computational-imaging/GSM","path":"main/gsm/metrics/inception_score.py","file_url":"https://github.com/computational-imaging/GSM/blob/HEAD/main/gsm/metrics/inception_score.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, computational-imaging/GSM when it was checked","code_sha256":"fc49fa553c005268","code_sha256_prefix":"fc49fa553c005268","mcp_get_code":{"code_sha256":"fc49fa553c005268"}},{"arxiv_id":"2311.17101","arxiv_id_is_arxiv":true,"paper":"/paper/robust-diffusion-gan-using-semi-unbalanced","title":"A High-Quality Robust Diffusion Framework for Corrupted Dataset","date":"2023-11-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"VinAIResearch/RDUOT","path":"pytorch_fid/inception_score_.py","file_url":"https://github.com/VinAIResearch/RDUOT/blob/HEAD/pytorch_fid/inception_score_.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"47c7a1249e324f74","code_sha256_prefix":"47c7a1249e324f74","mcp_get_code":{"code_sha256":"47c7a1249e324f74"}},{"arxiv_id":"2311.08403","arxiv_id_is_arxiv":true,"paper":"/paper/instant3d-instant-text-to-3d-generation","title":"Instant3D: Instant Text-to-3D Generation","date":"2023-11-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ming1993li/instant3dcodes","path":"metrics/inception_score.py","file_url":"https://github.com/ming1993li/instant3dcodes/blob/HEAD/metrics/inception_score.py","status":"unverified","verification_level":0,"contract_check":null,"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 hse1032/Adversarial-Generation-of-Hierarchical-Gaussians-for-3D-Generative-Model, and GitHub detected no licence in that repository when it was checked","code_sha256":"fc49fa553c005268","code_sha256_prefix":"fc49fa553c005268","mcp_get_code":{"code_sha256":"fc49fa553c005268"}},{"arxiv_id":"2306.04675","arxiv_id_is_arxiv":true,"paper":"/paper/exposing-flaws-of-generative-model-evaluation-1","title":"Exposing flaws of generative model evaluation metrics and their unfair treatment of diffusion models","date":"2023-06-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Zhendong-Wang/Diffusion-GAN","path":"diffusion-projected-gan/metrics/inception_score.py","file_url":"https://github.com/Zhendong-Wang/Diffusion-GAN/blob/HEAD/diffusion-projected-gan/metrics/inception_score.py","status":"unverified","verification_level":0,"contract_check":null,"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 hse1032/Adversarial-Generation-of-Hierarchical-Gaussians-for-3D-Generative-Model, and GitHub detected no licence in that repository when it was checked","code_sha256":"fc49fa553c005268","code_sha256_prefix":"fc49fa553c005268","mcp_get_code":{"code_sha256":"fc49fa553c005268"}},{"arxiv_id":"2202.00273","arxiv_id_is_arxiv":true,"paper":"/paper/stylegan-xl-scaling-stylegan-to-large-diverse","title":"StyleGAN-XL: Scaling StyleGAN to Large Diverse Datasets","date":"2022-02-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"autonomousvision/stylegan_xl","path":"metrics/inception_score.py","file_url":"https://github.com/autonomousvision/stylegan_xl/blob/HEAD/metrics/inception_score.py","status":"unverified","verification_level":0,"contract_check":null,"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 hse1032/Adversarial-Generation-of-Hierarchical-Gaussians-for-3D-Generative-Model, and GitHub detected no licence in that repository when it was checked","code_sha256":"fc49fa553c005268","code_sha256_prefix":"fc49fa553c005268","mcp_get_code":{"code_sha256":"fc49fa553c005268"}}],"record_sha256":"0983a5b2ddbb6ca67106bddce54b1fc2c6168bce2f0313d9cc10bfdeba78123d","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}