{"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/diffusion-2","entry":"diffusion","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":6,"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":5,"n_samples_ran":5,"n_samples_constructed":0,"n_samples_ran_checked":4,"n_samples_instrument":1,"n_samples_unverified":0,"n_samples_fingerprinted":0,"n_places":6,"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":1,"ran_fixture":0,"ran":4,"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":"2510.10020","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2510-10020","title":"Calibrating Generative Models to Distributional Constraints","date":null,"month_inferred_from_arxiv_id":"2025-10","title_source":"syntology","repo":"smithhenryd/cgm","path":"genie2/genie_score_network.py","file_url":"https://github.com/smithhenryd/cgm/blob/HEAD/genie2/genie_score_network.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":"9e8aacf09f0436f0","code_sha256_prefix":"9e8aacf09f0436f0","mcp_get_code":{"code_sha256":"9e8aacf09f0436f0"}},{"arxiv_id":"2412.06143","arxiv_id_is_arxiv":true,"paper":"/paper/precise-fast-and-low-cost-concept-erasure-in","title":"Precise, Fast, and Low-cost Concept Erasure in Value Space: Orthogonal Complement Matters","date":"2024-12-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wyuan1001/adavd","path":"src/main_multi.py","file_url":"https://github.com/wyuan1001/adavd/blob/HEAD/src/main_multi.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":"82511a695667195b","code_sha256_prefix":"82511a695667195b","mcp_get_code":{"code_sha256":"82511a695667195b"}},{"arxiv_id":"2308.04073","arxiv_id_is_arxiv":true,"paper":"/paper/learning-specialized-activation-functions-for","title":"Learning Specialized Activation Functions for Physics-informed Neural Networks","date":"2023-08-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"leaplabthu/adaafforpinns","path":"source/systems_pbc.py","file_url":"https://github.com/leaplabthu/adaafforpinns/blob/HEAD/source/systems_pbc.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, leaplabthu/adaafforpinns when it was checked","code_sha256":"0af9ef32a8bd2b8c","code_sha256_prefix":"0af9ef32a8bd2b8c","mcp_get_code":{"code_sha256":"0af9ef32a8bd2b8c"}},{"arxiv_id":"2111.04840","arxiv_id_is_arxiv":true,"paper":"/paper/cold-brew-distilling-graph-node-1","title":"Cold Brew: Distilling Graph Node Representations with Incomplete or Missing Neighborhoods","date":"2021-11-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"amazon-research/gnn-tail-generalization","path":"Label_propagation_model/diffusion_feature.py","file_url":"https://github.com/amazon-research/gnn-tail-generalization/blob/HEAD/Label_propagation_model/diffusion_feature.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":"afbdc85089318f81","code_sha256_prefix":"afbdc85089318f81","mcp_get_code":{"code_sha256":"afbdc85089318f81"}},{"arxiv_id":"2006.05582","arxiv_id_is_arxiv":true,"paper":"/paper/contrastive-multi-view-representation","title":"Contrastive Multi-View Representation Learning on Graphs","date":"2020-06-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ycremar/DIG-SSL","path":"sslgraph/contrastive/model/mvgrl.py","file_url":"https://github.com/ycremar/DIG-SSL/blob/HEAD/sslgraph/contrastive/model/mvgrl.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, ycremar/DIG-SSL when it was checked","code_sha256":"95811669b9827928","code_sha256_prefix":"95811669b9827928","mcp_get_code":{"code_sha256":"95811669b9827928"}},{"arxiv_id":"Wang_Precise_Fast_and_Low-cost_Concept_Erasure_in_Value_Space__CVPR_2025_paper","arxiv_id_is_arxiv":false,"paper":null,"title":"CVF open access id Wang_Precise_Fast_and_Low-cost_Concept_Erasure_in_Value_Space__CVPR_2025_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"WYuan1001/AdaVD","path":"src/main_multi.py","file_url":"https://github.com/WYuan1001/AdaVD/blob/HEAD/src/main_multi.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":"82511a695667195b","code_sha256_prefix":"82511a695667195b","mcp_get_code":{"code_sha256":"82511a695667195b"}}],"record_sha256":"a3c3ac6690c9ea3569531c080a2daba753d6df561d9f6426bcd7db13dffbe0f4","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}