{"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/torch-cov","entry":"torch_cov","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":14,"n_papers_ran_no_instrument_failure":7,"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":5,"n_samples_constructed":0,"n_samples_ran_checked":2,"n_samples_instrument":3,"n_samples_unverified":0,"n_samples_fingerprinted":5,"n_places":14,"n_places_pointer_only":6,"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":3,"ran_fixture":0,"ran":2,"unverified":0},"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.10193","arxiv_id_is_arxiv":true,"paper":"/paper/simple-guidance-mechanisms-for-discrete","title":"Simple Guidance Mechanisms for Discrete Diffusion Models","date":"2024-12-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"w86763777/pytorch-image-generation-metrics","path":"pytorch_image_generation_metrics/core.py","file_url":"https://github.com/w86763777/pytorch-image-generation-metrics/blob/HEAD/pytorch_image_generation_metrics/core.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"7f018aa22ac761c4","code_sha256_prefix":"7f018aa22ac761c4","mcp_get_code":{"code_sha256":"7f018aa22ac761c4"}},{"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/fid.py","file_url":"https://github.com/liuxiao-guan/iet_agc/blob/HEAD/score/fid.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"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":"b304af5c4fc5341a","code_sha256_prefix":"b304af5c4fc5341a","mcp_get_code":{"code_sha256":"b304af5c4fc5341a"}},{"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/fid.py","file_url":"https://github.com/Maryeon/InvMM/blob/HEAD/ddpm/score/fid.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"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":"b304af5c4fc5341a","code_sha256_prefix":"b304af5c4fc5341a","mcp_get_code":{"code_sha256":"b304af5c4fc5341a"}},{"arxiv_id":"2310.11440","arxiv_id_is_arxiv":true,"paper":"/paper/evalcrafter-benchmarking-and-evaluating-large","title":"EvalCrafter: Benchmarking and Evaluating Large Video Generation Models","date":"2023-10-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"EvalCrafter/EvalCrafter","path":"metrics/pytorch_gan_metrics/core.py","file_url":"https://github.com/EvalCrafter/EvalCrafter/blob/HEAD/metrics/pytorch_gan_metrics/core.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, EvalCrafter/EvalCrafter when it was checked","code_sha256":"7f018aa22ac761c4","code_sha256_prefix":"7f018aa22ac761c4","mcp_get_code":{"code_sha256":"7f018aa22ac761c4"}},{"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/fid.py","file_url":"https://github.com/envision-research/ddsm/blob/HEAD/score/fid.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"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":"b304af5c4fc5341a","code_sha256_prefix":"b304af5c4fc5341a","mcp_get_code":{"code_sha256":"b304af5c4fc5341a"}},{"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/fid.py","file_url":"https://github.com/fabianfalck/unet-design/blob/HEAD/diff_cifar/score/fid.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"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":"b304af5c4fc5341a","code_sha256_prefix":"b304af5c4fc5341a","mcp_get_code":{"code_sha256":"b304af5c4fc5341a"}},{"arxiv_id":"2210.02041","arxiv_id_is_arxiv":true,"paper":"/paper/natural-color-fool-towards-boosting-black-box","title":"Natural Color Fool: Towards Boosting Black-box Unrestricted Attacks","date":"2022-10-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ylhz/natural-color-fool","path":"torch_attack/attacks/NCF.py","file_url":"https://github.com/ylhz/natural-color-fool/blob/HEAD/torch_attack/attacks/NCF.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, ylhz/natural-color-fool when it was checked","code_sha256":"30d9f7fea949c13c","code_sha256_prefix":"30d9f7fea949c13c","mcp_get_code":{"code_sha256":"30d9f7fea949c13c"}},{"arxiv_id":"2201.12179","arxiv_id_is_arxiv":true,"paper":"/paper/plug-play-attacks-towards-robust-and-flexible","title":"Plug & Play Attacks: Towards Robust and Flexible Model Inversion Attacks","date":"2022-01-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ajbrock/BigGAN-PyTorch","path":"inception_utils.py","file_url":"https://github.com/ajbrock/BigGAN-PyTorch/blob/HEAD/inception_utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"4a2b2f288be2a186","code_sha256_prefix":"4a2b2f288be2a186","mcp_get_code":{"code_sha256":"4a2b2f288be2a186"}},{"arxiv_id":"2004.00917","arxiv_id_is_arxiv":true,"paper":"/paper/controllable-orthogonalization-in-training","title":"Controllable Orthogonalization in Training DNNs","date":"2020-04-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"huangleiBuaa/ONI","path":"ONI_PyTorch/GAN/inception_utils.py","file_url":"https://github.com/huangleiBuaa/ONI/blob/HEAD/ONI_PyTorch/GAN/inception_utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"BSD-2-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"4a2b2f288be2a186","code_sha256_prefix":"4a2b2f288be2a186","mcp_get_code":{"code_sha256":"4a2b2f288be2a186"}},{"arxiv_id":"1912.05270","arxiv_id_is_arxiv":true,"paper":"/paper/minegan-effective-knowledge-transfer-from","title":"MineGAN: effective knowledge transfer from GANs to target domains with few images","date":"2019-12-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yaxingwang/MineGAN","path":"inception_utils.py","file_url":"https://github.com/yaxingwang/MineGAN/blob/HEAD/inception_utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"4a2b2f288be2a186","code_sha256_prefix":"4a2b2f288be2a186","mcp_get_code":{"code_sha256":"4a2b2f288be2a186"}},{"arxiv_id":"1811.10597","arxiv_id_is_arxiv":true,"paper":"/paper/gan-dissection-visualizing-and-understanding","title":"GAN Dissection: Visualizing and Understanding Generative Adversarial Networks","date":"2018-11-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"alexandonian/ganocracy","path":"gan_training/ganocracy/metrics/inception_score.py","file_url":"https://github.com/alexandonian/ganocracy/blob/HEAD/gan_training/ganocracy/metrics/inception_score.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"764abafe62f0d3e9","code_sha256_prefix":"764abafe62f0d3e9","mcp_get_code":{"code_sha256":"764abafe62f0d3e9"}},{"arxiv_id":"1406.2661","arxiv_id_is_arxiv":true,"paper":"/paper/generative-adversarial-networks","title":"Generative Adversarial Networks","date":"2014-06-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"WANG-Chaoyue/EvolutionaryGAN-pytorch","path":"inception_pytorch/inception_utils.py","file_url":"https://github.com/WANG-Chaoyue/EvolutionaryGAN-pytorch/blob/HEAD/inception_pytorch/inception_utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"4a2b2f288be2a186","code_sha256_prefix":"4a2b2f288be2a186","mcp_get_code":{"code_sha256":"4a2b2f288be2a186"}},{"arxiv_id":"aaai_20902","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_20902","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"bxz9200/CLPA","path":"inception_utils.py","file_url":"https://github.com/bxz9200/CLPA/blob/HEAD/inception_utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"4a2b2f288be2a186","code_sha256_prefix":"4a2b2f288be2a186","mcp_get_code":{"code_sha256":"4a2b2f288be2a186"}},{"arxiv_id":"aaai_20247","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_20247","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"csmiler/ProbeGAN","path":"inception_utils.py","file_url":"https://github.com/csmiler/ProbeGAN/blob/HEAD/inception_utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"4a2b2f288be2a186","code_sha256_prefix":"4a2b2f288be2a186","mcp_get_code":{"code_sha256":"4a2b2f288be2a186"}}],"record_sha256":"2d85785152891be5de81ef672030b9f3664ce14e1c8eba68b1102a28c5ccd293","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}