{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/code/files-exist","entry":"files_exist","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-09-24T18:15:14+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.","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; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":8,"n_papers_ran":2,"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":2,"n_samples_fingerprinted":0,"n_places":8,"n_places_pointer_only":2,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":2,"unverified":4},"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","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":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"934e88324646e2d7","mcp_get_code":{"code_sha256":"934e88324646e2d7"}},{"arxiv_id":"2410.04263","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":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"934e88324646e2d7","mcp_get_code":{"code_sha256":"934e88324646e2d7"}},{"arxiv_id":"2403.06026","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","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"a2bed3dc1c938772","mcp_get_code":{"code_sha256":"a2bed3dc1c938772"}},{"arxiv_id":"2403.06020","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,"code_sha256_prefix":"ba546bbe7d90467a","mcp_get_code":{"code_sha256":"ba546bbe7d90467a"}},{"arxiv_id":"2312.17397","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":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"934e88324646e2d7","mcp_get_code":{"code_sha256":"934e88324646e2d7"}},{"arxiv_id":"2308.11937","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,"code_sha256_prefix":"134bbc852e3845bb","mcp_get_code":{"code_sha256":"134bbc852e3845bb"}},{"arxiv_id":"2303.08137","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":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"1f09210911a76554","mcp_get_code":{"code_sha256":"1f09210911a76554"}},{"arxiv_id":"2206.06602","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":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"54056f7e25fb5e82","mcp_get_code":{"code_sha256":"54056f7e25fb5e82"}}]}