{"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/n-community","entry":"n_community","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":6,"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":6,"n_places_pointer_only":1,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":1,"ran":1,"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":"2405.03188","paper":"/paper/hyperbolic-geometric-latent-diffusion-model","title":"Hyperbolic Geometric Latent Diffusion Model for Graph Generation","date":"2024-05-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ringbdstack/hypdiff","path":"Synthatic_graph_generator.py","file_url":"https://github.com/ringbdstack/hypdiff/blob/HEAD/Synthatic_graph_generator.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"5b1b2b64adcd58fa","mcp_get_code":{"code_sha256":"5b1b2b64adcd58fa"}},{"arxiv_id":"2403.16883","paper":"/paper/discrete-latent-graph-generative-modeling","title":"GLAD: Improving Latent Graph Generative Modeling with Simple Quantization","date":"2024-03-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"v18nguye/glad","path":"data/data_generators.py","file_url":"https://github.com/v18nguye/glad/blob/HEAD/data/data_generators.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"code_sha256_prefix":"05cc7a74eb054f12","mcp_get_code":{"code_sha256":"05cc7a74eb054f12"}},{"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":"dsl-lab/swingnn","path":"setup/gen_graph_data.py","file_url":"https://github.com/dsl-lab/swingnn/blob/HEAD/setup/gen_graph_data.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"d520133b61f52af3","mcp_get_code":{"code_sha256":"d520133b61f52af3"}},{"arxiv_id":"2211.03329","paper":"/paper/implicit-graphon-neural-representation","title":"Implicit Graphon Neural Representation","date":"2022-11-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mishne-lab/ignr","path":"c-IGNR/data.py","file_url":"https://github.com/mishne-lab/ignr/blob/HEAD/c-IGNR/data.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"30116c4bfed7a89a","mcp_get_code":{"code_sha256":"30116c4bfed7a89a"}},{"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":"data.py","file_url":"https://github.com/KarolisMart/SPECTRE/blob/HEAD/data.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"74ede2585b6c1835","mcp_get_code":{"code_sha256":"74ede2585b6c1835"}},{"arxiv_id":"1802.08773","paper":"/paper/graphrnn-generating-realistic-graphs-with","title":"GraphRNN: Generating Realistic Graphs with Deep Auto-regressive Models","date":"2018-02-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"snap-stanford/GraphRNN","path":"utils.py","file_url":"https://github.com/snap-stanford/GraphRNN/blob/HEAD/utils.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"19bff1c9b578d1ae","mcp_get_code":{"code_sha256":"19bff1c9b578d1ae"}}]}