{"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/jsonable","entry":"jsonable","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":10,"n_papers_ran":10,"n_papers_ran_no_instrument_failure":6,"n_papers_ran_instrument_only":4,"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":1,"n_samples_instrument":4,"n_samples_unverified":0,"n_samples_fingerprinted":0,"n_places":10,"n_places_pointer_only":3,"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":1,"ran_draft_wrong":4,"ran_fixture":0,"ran":0,"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":"2609.12639","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2609-12639","title":"EXPLAINING TIME SERIES FORECASTING WITH HORIZON-RESOLVED ATTRIBUTION","date":null,"month_inferred_from_arxiv_id":"2026-09","title_source":"syntology","repo":"seunghan96/HRX","path":"experiments/run_exp.py","file_url":"https://github.com/seunghan96/HRX/blob/HEAD/experiments/run_exp.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"fe9de43cafa96a17","code_sha256_prefix":"fe9de43cafa96a17","mcp_get_code":{"code_sha256":"fe9de43cafa96a17"}},{"arxiv_id":"2608.21252","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2608-21252","title":"EnSI-RAG: Entity-Structure-Indexed Retrieval-Augmented Generation for Long-Document Question Answering","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"RamonMeng/EnSI-RAG","path":"ensi-rag-financebench-eval/ensi_financebench/document_preparation.py","file_url":"https://github.com/RamonMeng/EnSI-RAG/blob/HEAD/ensi-rag-financebench-eval/ensi_financebench/document_preparation.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, RamonMeng/EnSI-RAG when it was checked","code_sha256":"aa5b8ced6b97c1ab","code_sha256_prefix":"aa5b8ced6b97c1ab","mcp_get_code":{"code_sha256":"aa5b8ced6b97c1ab"}},{"arxiv_id":"2608.01678","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2608-01678","title":"Progressive Agent Skill Generation via Reinforcement Learning","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"ejhshen/skill-alpha","path":"src/skill_alpha_rl/reward_compare.py","file_url":"https://github.com/ejhshen/skill-alpha/blob/HEAD/src/skill_alpha_rl/reward_compare.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"01c0839e76ce5a48","code_sha256_prefix":"01c0839e76ce5a48","mcp_get_code":{"code_sha256":"01c0839e76ce5a48"}},{"arxiv_id":"2606.01736","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-01736","title":"Argument Collapse: LLMs Flatten Long-Form Public Debate","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"mungg/argument_collapse","path":"src/argument_collapse/inference/types.py","file_url":"https://github.com/mungg/argument_collapse/blob/HEAD/src/argument_collapse/inference/types.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"cba80378bea200a8","code_sha256_prefix":"cba80378bea200a8","mcp_get_code":{"code_sha256":"cba80378bea200a8"}},{"arxiv_id":"2410.23091","arxiv_id_is_arxiv":true,"paper":"/paper/causaldiff-causality-inspired-disentanglement","title":"CausalDiff: Causality-Inspired Disentanglement via Diffusion Model for Adversarial Defense","date":"2024-10-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"TMLResearchGroup-CAS/CausalDiff","path":"config_base.py","file_url":"https://github.com/TMLResearchGroup-CAS/CausalDiff/blob/HEAD/config_base.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"3436fefeb3a4b49a","code_sha256_prefix":"3436fefeb3a4b49a","mcp_get_code":{"code_sha256":"3436fefeb3a4b49a"}},{"arxiv_id":"2402.19009","arxiv_id_is_arxiv":true,"paper":"/paper/generating-reconstructing-and-representing","title":"Unified Generation, Reconstruction, and Representation: Generalized Diffusion with Adaptive Latent Encoding-Decoding","date":"2024-02-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"guangyliu/EDDPM","path":"Image/config_base.py","file_url":"https://github.com/guangyliu/EDDPM/blob/HEAD/Image/config_base.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","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, guangyliu/EDDPM when it was checked","code_sha256":"3436fefeb3a4b49a","code_sha256_prefix":"3436fefeb3a4b49a","mcp_get_code":{"code_sha256":"3436fefeb3a4b49a"}},{"arxiv_id":"2308.09223","arxiv_id_is_arxiv":true,"paper":"/paper/dmcvr-morphology-guided-diffusion-model-for","title":"DMCVR: Morphology-Guided Diffusion Model for 3D Cardiac Volume Reconstruction","date":"2023-08-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hexiaoxiao-cs/dmcvr","path":"generation/diffae/config_base.py","file_url":"https://github.com/hexiaoxiao-cs/dmcvr/blob/HEAD/generation/diffae/config_base.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"3436fefeb3a4b49a","code_sha256_prefix":"3436fefeb3a4b49a","mcp_get_code":{"code_sha256":"3436fefeb3a4b49a"}},{"arxiv_id":"2308.01316","arxiv_id_is_arxiv":true,"paper":"/paper/patched-denoising-diffusion-models-for-high","title":"Patched Denoising Diffusion Models For High-Resolution Image Synthesis","date":"2023-08-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mlpc-ucsd/patch-dm","path":"config_base.py","file_url":"https://github.com/mlpc-ucsd/patch-dm/blob/HEAD/config_base.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","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, mlpc-ucsd/patch-dm when it was checked","code_sha256":"3436fefeb3a4b49a","code_sha256_prefix":"3436fefeb3a4b49a","mcp_get_code":{"code_sha256":"3436fefeb3a4b49a"}},{"arxiv_id":"2211.12500","arxiv_id_is_arxiv":true,"paper":"/paper/person-image-synthesis-via-denoising","title":"Person Image Synthesis via Denoising Diffusion Model","date":"2022-11-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ankanbhunia/PIDM","path":"models/config_base.py","file_url":"https://github.com/ankanbhunia/PIDM/blob/HEAD/models/config_base.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"3436fefeb3a4b49a","code_sha256_prefix":"3436fefeb3a4b49a","mcp_get_code":{"code_sha256":"3436fefeb3a4b49a"}},{"arxiv_id":"2111.15640","arxiv_id_is_arxiv":true,"paper":"/paper/diffusion-autoencoders-toward-a-meaningful","title":"Diffusion Autoencoders: Toward a Meaningful and Decodable Representation","date":"2021-11-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"phizaz/diffae","path":"config_base.py","file_url":"https://github.com/phizaz/diffae/blob/HEAD/config_base.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"3436fefeb3a4b49a","code_sha256_prefix":"3436fefeb3a4b49a","mcp_get_code":{"code_sha256":"3436fefeb3a4b49a"}}],"record_sha256":"89798842d13aec7b5774b88b8c32613aff84576f3fdfb4249ea47f60c707a223","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}