{"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/erdos-renyi","entry":"erdos_renyi","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":5,"n_papers_ran":4,"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":3,"n_samples_ran":2,"n_samples_fingerprinted":0,"n_places":5,"n_places_pointer_only":2,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":2,"unverified":1},"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":"2607.09893","paper":"/paper/arxiv-2607-09893","title":"An End-to-End Hybrid Quantum-Classical Sampling Workflow for Discrete Markov Random Fields: A Reproducible Case Study","date":null,"month_inferred_from_arxiv_id":"2026-07","title_source":"syntology","repo":"arulrhikm/QuantumDGM","path":"experiments/graph_families.py","file_url":"https://github.com/arulrhikm/QuantumDGM/blob/HEAD/experiments/graph_families.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"e0626d736e62fb29","mcp_get_code":{"code_sha256":"e0626d736e62fb29"}},{"arxiv_id":"2605.20257","paper":"/paper/arxiv-2605-20257","title":"Instance Discrimination for Link Prediction","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"valentincuzin/GCL-Link-Prediction","path":"other_methods/MPLP-main/graph_generation.py","file_url":"https://github.com/valentincuzin/GCL-Link-Prediction/blob/HEAD/other_methods/MPLP-main/graph_generation.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"5ab4deddff163d3b","mcp_get_code":{"code_sha256":"5ab4deddff163d3b"}},{"arxiv_id":"2309.00976","paper":"/paper/pure-message-passing-can-estimate-common","title":"Pure Message Passing Can Estimate Common Neighbor for Link Prediction","date":"2023-09-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Barcavin/efficient-node-labelling","path":"graph_generation.py","file_url":"https://github.com/Barcavin/efficient-node-labelling/blob/HEAD/graph_generation.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"5ab4deddff163d3b","mcp_get_code":{"code_sha256":"5ab4deddff163d3b"}},{"arxiv_id":"2208.05553","paper":"/paper/exploiting-neighborhood-interference-with-low","title":"Exploiting Neighborhood Interference with Low Order Interactions under Unit Randomized Design","date":null,"month_inferred_from_arxiv_id":"2022-08","title_source":"archive","repo":"mayscortez/low-order-unitrd","path":"Code-for-Experiments/nci_linear_setup.py","file_url":"https://github.com/mayscortez/low-order-unitrd/blob/HEAD/Code-for-Experiments/nci_linear_setup.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"280d45bf6addf1d3","mcp_get_code":{"code_sha256":"280d45bf6addf1d3"}},{"arxiv_id":"2110.03753","paper":"/paper/from-stars-to-subgraphs-uplifting-any-gnn","title":"From Stars to Subgraphs: Uplifting Any GNN with Local Structure Awareness","date":"2021-10-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"GNNAsKernel/GNNAsKernel","path":"core/data_utils/graph_generation.py","file_url":"https://github.com/GNNAsKernel/GNNAsKernel/blob/HEAD/core/data_utils/graph_generation.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"5ab4deddff163d3b","mcp_get_code":{"code_sha256":"5ab4deddff163d3b"}}]}