{"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/gallery","entry":"gallery","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":7,"n_papers_ran":7,"n_papers_ran_no_instrument_failure":4,"n_papers_ran_instrument_only":3,"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":3,"n_samples_instrument":2,"n_samples_unverified":0,"n_samples_fingerprinted":2,"n_places":7,"n_places_pointer_only":2,"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":2,"ran":3,"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":"2305.20086","arxiv_id_is_arxiv":true,"paper":"/paper/understanding-and-mitigating-copying-in-1","title":"Understanding and Mitigating Copying in Diffusion Models","date":"2023-05-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"somepago/dcr","path":"diff_retrieval.py","file_url":"https://github.com/somepago/dcr/blob/HEAD/diff_retrieval.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"23b6b9bbe42a51ff","code_sha256_prefix":"23b6b9bbe42a51ff","mcp_get_code":{"code_sha256":"23b6b9bbe42a51ff"}},{"arxiv_id":"2305.13277","arxiv_id_is_arxiv":true,"paper":"/paper/u-tilise-a-sequence-to-sequence-model-for","title":"U-TILISE: A Sequence-to-sequence Model for Cloud Removal in Optical Satellite Time Series","date":"2023-05-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"prs-eth/u-tilise","path":"lib/visutils.py","file_url":"https://github.com/prs-eth/u-tilise/blob/HEAD/lib/visutils.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":"f186b5255be81e84","code_sha256_prefix":"f186b5255be81e84","mcp_get_code":{"code_sha256":"f186b5255be81e84"}},{"arxiv_id":"1911.12247","arxiv_id_is_arxiv":true,"paper":"/paper/contrastive-learning-of-structured-world-1","title":"Contrastive Learning of Structured World Models","date":"2019-11-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tkipf/c-swm","path":"envs/physics_sim.py","file_url":"https://github.com/tkipf/c-swm/blob/HEAD/envs/physics_sim.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":"13bd75adaddef15f","code_sha256_prefix":"13bd75adaddef15f","mcp_get_code":{"code_sha256":"13bd75adaddef15f"}},{"arxiv_id":"1909.07425","arxiv_id_is_arxiv":true,"paper":"/paper/a-characteristic-function-approach-to-deep","title":"A Characteristic Function Approach to Deep Implicit Generative Modeling","date":"2019-09-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"crslab/OCFGAN","path":"src/util.py","file_url":"https://github.com/crslab/OCFGAN/blob/HEAD/src/util.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":"5bd7bf186d32335f","code_sha256_prefix":"5bd7bf186d32335f","mcp_get_code":{"code_sha256":"5bd7bf186d32335f"}},{"arxiv_id":"1905.11169","arxiv_id_is_arxiv":true,"paper":"/paper/physics-as-inverse-graphics-joint","title":"Physics-as-Inverse-Graphics: Unsupervised Physical Parameter Estimation from Video","date":"2019-05-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"seuqaj114/paig","path":"nn/utils/viz.py","file_url":"https://github.com/seuqaj114/paig/blob/HEAD/nn/utils/viz.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":"13bd75adaddef15f","code_sha256_prefix":"13bd75adaddef15f","mcp_get_code":{"code_sha256":"13bd75adaddef15f"}},{"arxiv_id":"1701.07875","arxiv_id_is_arxiv":true,"paper":"/paper/wasserstein-gan","title":"Wasserstein GAN","date":"2017-01-26","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":"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":"278a4cc6c445af9d","code_sha256_prefix":"278a4cc6c445af9d","mcp_get_code":{"code_sha256":"278a4cc6c445af9d"}},{"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":"korra141/Generative-Adversarial-Networks","path":"VanillaGAN_MNIST.py","file_url":"https://github.com/korra141/Generative-Adversarial-Networks/blob/HEAD/VanillaGAN_MNIST.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, korra141/Generative-Adversarial-Networks when it was checked","code_sha256":"278a4cc6c445af9d","code_sha256_prefix":"278a4cc6c445af9d","mcp_get_code":{"code_sha256":"278a4cc6c445af9d"}}],"record_sha256":"28746e5ef81bd3ddcb2eb5ea661aeaf36e56cf67b9f8e8008b25d1f8a071aadc","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}