{"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/degree-worker","entry":"degree_worker","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":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":2,"n_samples_ran":0,"n_samples_fingerprinted":0,"n_places":8,"n_places_pointer_only":1,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":0,"unverified":2},"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/analysis/spectre_utils.py","file_url":"https://github.com/cvignac/DiGress/blob/HEAD/src/analysis/spectre_utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"2830d89cd6960c9d","mcp_get_code":{"code_sha256":"2830d89cd6960c9d"}},{"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/analysis/spectre_utils.py","file_url":"https://github.com/manuelmlmadeira/DeFoG/blob/HEAD/src/analysis/spectre_utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"2830d89cd6960c9d","mcp_get_code":{"code_sha256":"2830d89cd6960c9d"}},{"arxiv_id":"2405.11416","paper":"/paper/discrete-state-continuous-time-diffusion-for","title":"Discrete-state Continuous-time Diffusion for Graph Generation","date":"2024-05-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pricexu/disco","path":"eval_spectre.py","file_url":"https://github.com/pricexu/disco/blob/HEAD/eval_spectre.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"2830d89cd6960c9d","mcp_get_code":{"code_sha256":"2830d89cd6960c9d"}},{"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/analysis/spectre_utils.py","file_url":"https://github.com/asduffo/freegress/blob/HEAD/src/analysis/spectre_utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"2830d89cd6960c9d","mcp_get_code":{"code_sha256":"2830d89cd6960c9d"}},{"arxiv_id":"2307.01646","paper":"/paper/swingnn-rethinking-permutation-invariance-in","title":"SwinGNN: Rethinking Permutation Invariance in Diffusion Models for Graph Generation","date":"2023-07-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"qiyan98/swingnn","path":"evaluation/stats.py","file_url":"https://github.com/qiyan98/swingnn/blob/HEAD/evaluation/stats.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"36afd1c572ae4673","mcp_get_code":{"code_sha256":"36afd1c572ae4673"}},{"arxiv_id":"2305.19337","paper":"/paper/higen-hierarchical-graph-generative-networks","title":"HiGen: Hierarchical Graph Generative Networks","date":"2023-05-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"karami-m/higen_main","path":"utils/eval_helper.py","file_url":"https://github.com/karami-m/higen_main/blob/HEAD/utils/eval_helper.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"2830d89cd6960c9d","mcp_get_code":{"code_sha256":"2830d89cd6960c9d"}},{"arxiv_id":"2204.01613","paper":"/paper/spectre-spectral-conditioning-helps-to","title":"SPECTRE: Spectral Conditioning Helps to Overcome the Expressivity Limits of One-shot Graph Generators","date":"2022-04-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"KarolisMart/SPECTRE","path":"util/eval_helper.py","file_url":"https://github.com/KarolisMart/SPECTRE/blob/HEAD/util/eval_helper.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"2830d89cd6960c9d","mcp_get_code":{"code_sha256":"2830d89cd6960c9d"}},{"arxiv_id":"1910.00760","paper":"/paper/efficient-graph-generation-with-graph","title":"Efficient Graph Generation with Graph Recurrent Attention Networks","date":"2019-10-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lrjconan/GRAN","path":"utils/eval_helper.py","file_url":"https://github.com/lrjconan/GRAN/blob/HEAD/utils/eval_helper.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"2830d89cd6960c9d","mcp_get_code":{"code_sha256":"2830d89cd6960c9d"}}]}