{"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/dump-yaml","entry":"dump_yaml","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":8,"n_papers_ran":4,"n_papers_ran_no_instrument_failure":3,"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":3,"n_samples_constructed":0,"n_samples_ran_checked":2,"n_samples_instrument":1,"n_samples_unverified":2,"n_samples_fingerprinted":0,"n_places":8,"n_places_pointer_only":0,"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":2,"unverified":2},"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":"2608.05234","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2608-05234","title":"PPDL: LLM-Based Flows as Probabilistic Programs","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"IBM/prompt-declaration-language","path":"src/pdl/pdl_dumper.py","file_url":"https://github.com/IBM/prompt-declaration-language/blob/HEAD/src/pdl/pdl_dumper.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"1aa1ba74b802c978","code_sha256_prefix":"1aa1ba74b802c978","mcp_get_code":{"code_sha256":"1aa1ba74b802c978"}},{"arxiv_id":"2311.16833","arxiv_id_is_arxiv":true,"paper":"/paper/1-lipschitz-layers-compared-memory-speed-and","title":"1-Lipschitz Layers Compared: Memory, Speed, and Certifiable Robustness","date":"2023-11-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"berndprach/1lipschitzlayerscompared","path":"make_tree.py","file_url":"https://github.com/berndprach/1lipschitzlayerscompared/blob/HEAD/make_tree.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":"70073c38af486064","code_sha256_prefix":"70073c38af486064","mcp_get_code":{"code_sha256":"70073c38af486064"}},{"arxiv_id":"2201.02279","arxiv_id_is_arxiv":true,"paper":"/paper/de-rendering-3d-objects-in-the-wild","title":"De-rendering 3D Objects in the Wild","date":"2022-01-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"brummi/derender3d","path":"derender3d/utils.py","file_url":"https://github.com/brummi/derender3d/blob/HEAD/derender3d/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"fa8f0dbdb9969655","code_sha256_prefix":"fa8f0dbdb9969655","mcp_get_code":{"code_sha256":"fa8f0dbdb9969655"}},{"arxiv_id":"2112.09245","arxiv_id_is_arxiv":true,"paper":"/paper/automated-deep-learning-neural-architecture","title":"Automated Deep Learning: Neural Architecture Search Is Not the End","date":"2021-12-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"D-X-Y/Awesome-AutoDL","path":"awesome_autodl/utils/yaml.py","file_url":"https://github.com/D-X-Y/Awesome-AutoDL/blob/HEAD/awesome_autodl/utils/yaml.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":"03b3d16bf446d0e9","code_sha256_prefix":"03b3d16bf446d0e9","mcp_get_code":{"code_sha256":"03b3d16bf446d0e9"}},{"arxiv_id":"2109.02288","arxiv_id_is_arxiv":true,"paper":"/paper/toward-realistic-single-view-3d-object","title":"Toward Realistic Single-View 3D Object Reconstruction with Unsupervised Learning from Multiple Images","date":"2021-09-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vinairesearch/lemul","path":"utils.py","file_url":"https://github.com/vinairesearch/lemul/blob/HEAD/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"fa8f0dbdb9969655","code_sha256_prefix":"fa8f0dbdb9969655","mcp_get_code":{"code_sha256":"fa8f0dbdb9969655"}},{"arxiv_id":"2104.03954","arxiv_id_is_arxiv":true,"paper":"/paper/de-rendering-the-world-s-revolutionary","title":"De-rendering the World's Revolutionary Artefacts","date":"2021-04-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"elliottwu/sorderender","path":"derender/utils.py","file_url":"https://github.com/elliottwu/sorderender/blob/HEAD/derender/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"8e5f27fa4d58f14b","code_sha256_prefix":"8e5f27fa4d58f14b","mcp_get_code":{"code_sha256":"8e5f27fa4d58f14b"}},{"arxiv_id":"1911.11130","arxiv_id_is_arxiv":true,"paper":"/paper/unsupervised-learning-of-probably-symmetric","title":"Unsupervised Learning of Probably Symmetric Deformable 3D Objects from Images in the Wild","date":"2019-11-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"elliottwu/unsup3d","path":"unsup3d/utils.py","file_url":"https://github.com/elliottwu/unsup3d/blob/HEAD/unsup3d/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"fa8f0dbdb9969655","code_sha256_prefix":"fa8f0dbdb9969655","mcp_get_code":{"code_sha256":"fa8f0dbdb9969655"}},{"arxiv_id":"Prach_1-Lipschitz_Layers_Compared_Memory_Speed_and_Certifiable_Robustness_CVPR_2024_paper","arxiv_id_is_arxiv":false,"paper":null,"title":"CVF open access id Prach_1-Lipschitz_Layers_Compared_Memory_Speed_and_Certifiable_Robustness_CVPR_2024_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"berndprach/1LipschitzLayersCompared","path":"make_tree.py","file_url":"https://github.com/berndprach/1LipschitzLayersCompared/blob/HEAD/make_tree.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":"70073c38af486064","code_sha256_prefix":"70073c38af486064","mcp_get_code":{"code_sha256":"70073c38af486064"}}],"record_sha256":"a6098df08b8438d64c59fa3c9c4db1b1a22a0c70142c3b102906d3227854708a","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}