{"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/make-image-grid","entry":"make_image_grid","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":9,"n_papers_ran":9,"n_papers_ran_no_instrument_failure":3,"n_papers_ran_instrument_only":6,"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":1,"n_places":9,"n_places_pointer_only":6,"n_places_pointer_only_link_open":0,"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":3,"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":"2407.21720","arxiv_id_is_arxiv":true,"paper":"/paper/detecting-explaining-and-mitigating","title":"Detecting, Explaining, and Mitigating Memorization in Diffusion Models","date":"2024-07-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yuxinwenrick/diffusion_memorization","path":"train_text_to_image.py","file_url":"https://github.com/yuxinwenrick/diffusion_memorization/blob/HEAD/train_text_to_image.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, yuxinwenrick/diffusion_memorization when it was checked","code_sha256":"302a044fe46029e6","code_sha256_prefix":"302a044fe46029e6","mcp_get_code":{"code_sha256":"302a044fe46029e6"}},{"arxiv_id":"2406.02366","arxiv_id_is_arxiv":true,"paper":"/paper/finding-nemo-localizing-neurons-responsible","title":"Finding NeMo: Localizing Neurons Responsible For Memorization in Diffusion Models","date":"2024-06-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"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":"302a044fe46029e6","code_sha256_prefix":"302a044fe46029e6","mcp_get_code":{"code_sha256":"302a044fe46029e6"}},{"arxiv_id":"2305.15798","arxiv_id_is_arxiv":true,"paper":"/paper/on-architectural-compression-of-text-to-image","title":"BK-SDM: A Lightweight, Fast, and Cheap Version of Stable Diffusion","date":"2023-05-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"segmind/distill-sd","path":"distill_training.py","file_url":"https://github.com/segmind/distill-sd/blob/HEAD/distill_training.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, segmind/distill-sd when it was checked","code_sha256":"302a044fe46029e6","code_sha256_prefix":"302a044fe46029e6","mcp_get_code":{"code_sha256":"302a044fe46029e6"}},{"arxiv_id":"2303.13495","arxiv_id_is_arxiv":true,"paper":"/paper/reversion-diffusion-based-relation-inversion","title":"ReVersion: Diffusion-Based Relation Inversion from Images","date":"2023-03-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ziqihuangg/reversion","path":"inference.py","file_url":"https://github.com/ziqihuangg/reversion/blob/HEAD/inference.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, ziqihuangg/reversion (NOASSERTION)","code_sha256":"4a616f806a2d4922","code_sha256_prefix":"4a616f806a2d4922","mcp_get_code":{"code_sha256":"4a616f806a2d4922"}},{"arxiv_id":"2010.11810","arxiv_id_is_arxiv":true,"paper":"/paper/factorized-neural-processes-for-neural","title":"Factorized Neural Processes for Neural Processes: $K$-Shot Prediction of Neural Responses","date":"2020-10-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"peabody124/fnp_neurips2020","path":"tuning_manifold/util.py","file_url":"https://github.com/peabody124/fnp_neurips2020/blob/HEAD/tuning_manifold/util.py","status":"ran","verification_level":1,"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":"c529c693c0b17eff","code_sha256_prefix":"c529c693c0b17eff","mcp_get_code":{"code_sha256":"c529c693c0b17eff"}},{"arxiv_id":"1807.07543","arxiv_id_is_arxiv":true,"paper":"/paper/understanding-and-improving-interpolation-in","title":"Understanding and Improving Interpolation in Autoencoders via an Adversarial Regularizer","date":"2018-07-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"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":"73a2b3dfb83b794b","code_sha256_prefix":"73a2b3dfb83b794b","mcp_get_code":{"code_sha256":"73a2b3dfb83b794b"}},{"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":"nashory/pggan-pytorch","path":"utils.py","file_url":"https://github.com/nashory/pggan-pytorch/blob/HEAD/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":"b0f4358dadb23ccd","code_sha256_prefix":"b0f4358dadb23ccd","mcp_get_code":{"code_sha256":"b0f4358dadb23ccd"}},{"arxiv_id":"1511.05644","arxiv_id_is_arxiv":true,"paper":"/paper/adversarial-autoencoders","title":"Adversarial Autoencoders","date":"2015-11-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"baohq1595/aae-experiment","path":"src/model/mnist_aae.py","file_url":"https://github.com/baohq1595/aae-experiment/blob/HEAD/src/model/mnist_aae.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, baohq1595/aae-experiment when it was checked","code_sha256":"73a2b3dfb83b794b","code_sha256_prefix":"73a2b3dfb83b794b","mcp_get_code":{"code_sha256":"73a2b3dfb83b794b"}},{"arxiv_id":"136760331","arxiv_id_is_arxiv":false,"paper":null,"title":"id 136760331 (not an arXiv id)","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"chang9711/BIPS","path":"ECCV2022/utils.py","file_url":"https://github.com/chang9711/BIPS/blob/HEAD/ECCV2022/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":"b0f4358dadb23ccd","code_sha256_prefix":"b0f4358dadb23ccd","mcp_get_code":{"code_sha256":"b0f4358dadb23ccd"}}],"record_sha256":"498604ca33672de6218f89e45be42025505773645db6b1c4add8eb483ce1d4ca","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}