{"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-inception-score","entry":"get_inception_score","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":14,"n_papers_ran":6,"n_papers_ran_no_instrument_failure":5,"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":9,"n_samples_ran":3,"n_samples_constructed":0,"n_samples_ran_checked":2,"n_samples_instrument":1,"n_samples_unverified":6,"n_samples_fingerprinted":0,"n_places":14,"n_places_pointer_only":5,"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":1,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":1,"ran":1,"unverified":6},"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":"2407.15328","arxiv_id_is_arxiv":true,"paper":"/paper/iterative-ensemble-training-with-anti","title":"Iterative Ensemble Training with Anti-Gradient Control for Mitigating Memorization in Diffusion Models","date":"2024-07-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"liuxiao-guan/iet_agc","path":"score/inception_score.py","file_url":"https://github.com/liuxiao-guan/iet_agc/blob/HEAD/score/inception_score.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"WTFPL","inline_ok":false,"inline_ok_link":false,"withheld_clause":"WTFPL, as GitHub detects it on this paper's repository, liuxiao-guan/iet_agc, is not in the permissive set Syntology serves inline","code_sha256":"9b81ae7906ed29eb","code_sha256_prefix":"9b81ae7906ed29eb","mcp_get_code":{"code_sha256":"9b81ae7906ed29eb"}},{"arxiv_id":"2406.07548","arxiv_id_is_arxiv":true,"paper":"/paper/image-and-video-tokenization-with-binary","title":"Image and Video Tokenization with Binary Spherical Quantization","date":"2024-06-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhaoyue-zephyrus/bsq-vit","path":"transcoder/evaluations/inception_score.py","file_url":"https://github.com/zhaoyue-zephyrus/bsq-vit/blob/HEAD/transcoder/evaluations/inception_score.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"898e597a6eb684c2","code_sha256_prefix":"898e597a6eb684c2","mcp_get_code":{"code_sha256":"898e597a6eb684c2"}},{"arxiv_id":"2405.05846","arxiv_id_is_arxiv":true,"paper":"/paper/could-it-be-generated-towards-practical","title":"An Inversion-based Measure of Memorization for Diffusion Models","date":"2024-05-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Maryeon/InvMM","path":"ddpm/score/inception_score.py","file_url":"https://github.com/Maryeon/InvMM/blob/HEAD/ddpm/score/inception_score.py","status":"ran","verification_level":1,"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, Maryeon/InvMM when it was checked","code_sha256":"9b81ae7906ed29eb","code_sha256_prefix":"9b81ae7906ed29eb","mcp_get_code":{"code_sha256":"9b81ae7906ed29eb"}},{"arxiv_id":"2310.03337","arxiv_id_is_arxiv":true,"paper":"/paper/denoising-diffusion-step-aware-models","title":"Denoising Diffusion Step-aware Models","date":"2023-10-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"envision-research/ddsm","path":"score/inception_score.py","file_url":"https://github.com/envision-research/ddsm/blob/HEAD/score/inception_score.py","status":"ran","verification_level":1,"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 liuxiao-guan/iet_agc, and WTFPL, as GitHub detects it on that repository, is not in the permissive set Syntology serves inline","code_sha256":"9b81ae7906ed29eb","code_sha256_prefix":"9b81ae7906ed29eb","mcp_get_code":{"code_sha256":"9b81ae7906ed29eb"}},{"arxiv_id":"2305.19638","arxiv_id_is_arxiv":true,"paper":"/paper/a-unified-framework-for-u-net-design-and-1","title":"A Unified Framework for U-Net Design and Analysis","date":"2023-05-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"fabianfalck/unet-design","path":"diff_cifar/score/inception_score.py","file_url":"https://github.com/fabianfalck/unet-design/blob/HEAD/diff_cifar/score/inception_score.py","status":"ran","verification_level":1,"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 liuxiao-guan/iet_agc, and WTFPL, as GitHub detects it on that repository, is not in the permissive set Syntology serves inline","code_sha256":"9b81ae7906ed29eb","code_sha256_prefix":"9b81ae7906ed29eb","mcp_get_code":{"code_sha256":"9b81ae7906ed29eb"}},{"arxiv_id":"2210.17478","arxiv_id_is_arxiv":true,"paper":"/paper/tiada-a-time-scale-adaptive-algorithm-for","title":"TiAda: A Time-scale Adaptive Algorithm for Nonconvex Minimax Optimization","date":"2022-10-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ShawnLixx/time-scale_adaptive_minimax","path":"wgan-gp/utils/inception_score.py","file_url":"https://github.com/ShawnLixx/time-scale_adaptive_minimax/blob/HEAD/wgan-gp/utils/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":"34ee52b3500d63c0","code_sha256_prefix":"34ee52b3500d63c0","mcp_get_code":{"code_sha256":"34ee52b3500d63c0"}},{"arxiv_id":"1912.09784","arxiv_id_is_arxiv":true,"paper":"/paper/triple-generative-adversarial-networks","title":"Triple Generative Adversarial Networks","date":"2019-12-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"taufikxu/Triple-GAN","path":"library/eval_inception_score.py","file_url":"https://github.com/taufikxu/Triple-GAN/blob/HEAD/library/eval_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":"335de19ad40af504","code_sha256_prefix":"335de19ad40af504","mcp_get_code":{"code_sha256":"335de19ad40af504"}},{"arxiv_id":"1904.07482","arxiv_id_is_arxiv":true,"paper":"/paper/object-oriented-dynamics-learning-through","title":"Object-Oriented Dynamics Learning through Multi-Level Abstraction","date":"2019-04-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mig-zh/OODP","path":"tflib/inception_score.py","file_url":"https://github.com/mig-zh/OODP/blob/HEAD/tflib/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":"2c56d76ac1ac9531","code_sha256_prefix":"2c56d76ac1ac9531","mcp_get_code":{"code_sha256":"2c56d76ac1ac9531"}},{"arxiv_id":"1904.03349","arxiv_id_is_arxiv":true,"paper":"/paper/progressive-pose-attention-transfer-for","title":"Progressive Pose Attention Transfer for Person Image Generation","date":"2019-04-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tengteng95/Pose-Transfer","path":"tool/inception_score.py","file_url":"https://github.com/tengteng95/Pose-Transfer/blob/HEAD/tool/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":"ca6c3975c982ec08","code_sha256_prefix":"ca6c3975c982ec08","mcp_get_code":{"code_sha256":"ca6c3975c982ec08"}},{"arxiv_id":"1901.02477","arxiv_id_is_arxiv":true,"paper":"/paper/differentially-private-generative-adversarial","title":"Differentially Private Generative Adversarial Networks for Time Series, Continuous, and Discrete Open Data","date":null,"month_inferred_from_arxiv_id":"2019-01","title_source":"archive","repo":"SAP-samples/security-research-differentially-private-generative-models","path":"tflib/inception_score.py","file_url":"https://github.com/SAP-samples/security-research-differentially-private-generative-models/blob/HEAD/tflib/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":"2c56d76ac1ac9531","code_sha256_prefix":"2c56d76ac1ac9531","mcp_get_code":{"code_sha256":"2c56d76ac1ac9531"}},{"arxiv_id":"1812.10907","arxiv_id_is_arxiv":true,"paper":"/paper/divergence-triangle-for-joint-training-of","title":"Divergence Triangle for Joint Training of Generator Model, Energy-based Model, and Inference Model","date":"2018-12-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"enijkamp/triangle","path":"inception_score_v2_tf.py","file_url":"https://github.com/enijkamp/triangle/blob/HEAD/inception_score_v2_tf.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, enijkamp/triangle when it was checked","code_sha256":"7bd5e0a3b36a9f26","code_sha256_prefix":"7bd5e0a3b36a9f26","mcp_get_code":{"code_sha256":"7bd5e0a3b36a9f26"}},{"arxiv_id":"1802.08539","arxiv_id_is_arxiv":true,"paper":"/paper/computation-of-optimal-transport-and-related","title":"Computation of optimal transport and related hedging problems via penalization and neural networks","date":"2018-02-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"stephaneckstein/transport-and-related","path":"GAN_Toy/tflib/inception_score.py","file_url":"https://github.com/stephaneckstein/transport-and-related/blob/HEAD/GAN_Toy/tflib/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":"2c56d76ac1ac9531","code_sha256_prefix":"2c56d76ac1ac9531","mcp_get_code":{"code_sha256":"2c56d76ac1ac9531"}},{"arxiv_id":"1710.10196","arxiv_id_is_arxiv":true,"paper":"/paper/progressive-growing-of-gans-for-improved","title":"Progressive Growing of GANs for Improved Quality, Stability, and Variation","date":"2017-10-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"NikhitaMethwani/Deep-Fakes-Cars-Generation","path":"metrics/inception_score.py","file_url":"https://github.com/NikhitaMethwani/Deep-Fakes-Cars-Generation/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":"6d2ac42c34e9e725","code_sha256_prefix":"6d2ac42c34e9e725","mcp_get_code":{"code_sha256":"6d2ac42c34e9e725"}},{"arxiv_id":"1703.10593","arxiv_id_is_arxiv":true,"paper":"/paper/unpaired-image-to-image-translation-using","title":"Unpaired Image-to-Image Translation using Cycle-Consistent Adversarial Networks","date":"2017-03-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ranery/Bayesian-CycleGAN","path":"evaluation/inception_score.py","file_url":"https://github.com/ranery/Bayesian-CycleGAN/blob/HEAD/evaluation/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":"b49d09e26bebee3c","code_sha256_prefix":"b49d09e26bebee3c","mcp_get_code":{"code_sha256":"b49d09e26bebee3c"}}],"record_sha256":"4188e0404540d2b1e203b056b430686407573bccbf6e8e1e27d7e9044bcc0a3d","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}