{"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/files-exist","entry":"files_exist","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":7,"n_papers_ran_no_instrument_failure":7,"n_papers_ran_instrument_only":0,"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":6,"n_samples_ran":5,"n_samples_constructed":0,"n_samples_ran_checked":5,"n_samples_instrument":0,"n_samples_unverified":1,"n_samples_fingerprinted":0,"n_places":8,"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":2,"ran_draft_wrong":0,"ran_fixture":0,"ran":3,"unverified":1},"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":"2603.28572","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2603-28572","title":"Unrestrained Simplex Denoising for Discrete Data A Non-Markovian Approach Applied to Graph Generation","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"cvignac/DiGress","path":"src/datasets/guacamol_dataset.py","file_url":"https://github.com/cvignac/DiGress/blob/HEAD/src/datasets/guacamol_dataset.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":"934e88324646e2d7","code_sha256_prefix":"934e88324646e2d7","mcp_get_code":{"code_sha256":"934e88324646e2d7"}},{"arxiv_id":"2410.04263","arxiv_id_is_arxiv":true,"paper":"/paper/defog-discrete-flow-matching-for-graph","title":"DeFoG: Discrete Flow Matching for Graph Generation","date":"2024-10-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"manuelmlmadeira/DeFoG","path":"src/datasets/guacamol_dataset.py","file_url":"https://github.com/manuelmlmadeira/DeFoG/blob/HEAD/src/datasets/guacamol_dataset.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":"934e88324646e2d7","code_sha256_prefix":"934e88324646e2d7","mcp_get_code":{"code_sha256":"934e88324646e2d7"}},{"arxiv_id":"2403.06026","arxiv_id_is_arxiv":true,"paper":"/paper/towards-a-generic-representation-of","title":"Towards a Generic Representation of Combinatorial Problems for Learning-Based Approaches","date":"2024-03-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"corail-research/learning-generic-csp","path":"src/generic_xcsp/dataset.py","file_url":"https://github.com/corail-research/learning-generic-csp/blob/HEAD/src/generic_xcsp/dataset.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, corail-research/learning-generic-csp when it was checked","code_sha256":"a2bed3dc1c938772","code_sha256_prefix":"a2bed3dc1c938772","mcp_get_code":{"code_sha256":"a2bed3dc1c938772"}},{"arxiv_id":"2403.06020","arxiv_id_is_arxiv":true,"paper":"/paper/multi-conditioned-graph-diffusion-for-neural","title":"Multi-conditioned Graph Diffusion for Neural Architecture Search","date":"2024-03-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rohanasthana/dinas","path":"src/generate_samples.py","file_url":"https://github.com/rohanasthana/dinas/blob/HEAD/src/generate_samples.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":"ba546bbe7d90467a","code_sha256_prefix":"ba546bbe7d90467a","mcp_get_code":{"code_sha256":"ba546bbe7d90467a"}},{"arxiv_id":"2312.17397","arxiv_id_is_arxiv":true,"paper":"/paper/classifier-free-graph-diffusion-for-molecular","title":"Classifier-free graph diffusion for molecular property targeting","date":"2023-12-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"asduffo/freegress","path":"src/datasets/guacamol_dataset.py","file_url":"https://github.com/asduffo/freegress/blob/HEAD/src/datasets/guacamol_dataset.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":"934e88324646e2d7","code_sha256_prefix":"934e88324646e2d7","mcp_get_code":{"code_sha256":"934e88324646e2d7"}},{"arxiv_id":"2308.11937","arxiv_id_is_arxiv":true,"paper":"/paper/learning-bottleneck-transformer-for-event","title":"Learning Bottleneck Transformer for Event Image-Voxel Feature Fusion based Classification","date":"2023-08-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"event-ahu/efv_event_classification","path":"datasets/img_voxel_dataset.py","file_url":"https://github.com/event-ahu/efv_event_classification/blob/HEAD/datasets/img_voxel_dataset.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, event-ahu/efv_event_classification when it was checked","code_sha256":"134bbc852e3845bb","code_sha256_prefix":"134bbc852e3845bb","mcp_get_code":{"code_sha256":"134bbc852e3845bb"}},{"arxiv_id":"2303.08137","arxiv_id_is_arxiv":true,"paper":"/paper/layoutdm-discrete-diffusion-model-for","title":"LayoutDM: Discrete Diffusion Model for Controllable Layout Generation","date":"2023-03-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"CyberAgentAILab/layout-dm","path":"src/trainer/trainer/datasets/dataset.py","file_url":"https://github.com/CyberAgentAILab/layout-dm/blob/HEAD/src/trainer/trainer/datasets/dataset.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":"1f09210911a76554","code_sha256_prefix":"1f09210911a76554","mcp_get_code":{"code_sha256":"1f09210911a76554"}},{"arxiv_id":"2206.06602","arxiv_id_is_arxiv":true,"paper":"/paper/deep-isolation-forest-for-anomaly-detection","title":"Deep Isolation Forest for Anomaly Detection","date":"2022-06-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xuhongzuo/deep-iforest","path":"pyg_old/pyg_old_dataset.py","file_url":"https://github.com/xuhongzuo/deep-iforest/blob/HEAD/pyg_old/pyg_old_dataset.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":"54056f7e25fb5e82","code_sha256_prefix":"54056f7e25fb5e82","mcp_get_code":{"code_sha256":"54056f7e25fb5e82"}}],"record_sha256":"3cecc765b2add8e9d5dd36a5cae131dd1f10b367d9ef6d7478e89f4fd9b91b32","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}