{"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/num-graphs","entry":"num_graphs","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":10,"n_papers_ran":10,"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":1,"n_samples_ran":1,"n_samples_fingerprinted":0,"n_places":10,"n_places_pointer_only":7,"by_status":{"ran_honours":1,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":0,"unverified":0},"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":"2507.00440","paper":null,"title":"arXiv:2507.00440","date":null,"month_inferred_from_arxiv_id":"2025-07","title_source":null,"repo":"causal-graph/CGR","path":"train_cal.py","file_url":"https://github.com/causal-graph/CGR/blob/HEAD/train_cal.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"9da87b0b1605a660","mcp_get_code":{"code_sha256":"9da87b0b1605a660"}},{"arxiv_id":"2410.06746","paper":"/paper/cluster-wise-graph-transformer-with-dual","title":"Cluster-wise Graph Transformer with Dual-granularity Kernelized Attention","date":"2024-10-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"LUMIA-Group/Cluster-wise-Graph-Transformer","path":"data.py","file_url":"https://github.com/LUMIA-Group/Cluster-wise-Graph-Transformer/blob/HEAD/data.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"9da87b0b1605a660","mcp_get_code":{"code_sha256":"9da87b0b1605a660"}},{"arxiv_id":"2310.19906","paper":"/paper/interpretable-prototype-based-graph-1","title":"Interpretable Prototype-based Graph Information Bottleneck","date":"2023-10-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":null,"inline_ok":false,"code_sha256_prefix":"9da87b0b1605a660","mcp_get_code":{"code_sha256":"9da87b0b1605a660"}},{"arxiv_id":"2110.00684","paper":"/paper/learning-compact-representations-of-neural","title":"Learning Compact Representations of Neural Networks using DiscriminAtive Masking (DAM)","date":"2021-10-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":null,"inline_ok":false,"code_sha256_prefix":"9da87b0b1605a660","mcp_get_code":{"code_sha256":"9da87b0b1605a660"}},{"arxiv_id":"2106.05469","paper":"/paper/variational-information-bottleneck-for-2","title":"Variational Information Bottleneck for Effective Low-Resource Fine-Tuning","date":"2021-06-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"RingBDStack/VIB-GSL","path":"train_eval.py","file_url":"https://github.com/RingBDStack/VIB-GSL/blob/HEAD/train_eval.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"9da87b0b1605a660","mcp_get_code":{"code_sha256":"9da87b0b1605a660"}},{"arxiv_id":"2010.12811","paper":"/paper/graph-information-bottleneck","title":"Graph Information Bottleneck","date":"2020-10-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":null,"inline_ok":false,"code_sha256_prefix":"9da87b0b1605a660","mcp_get_code":{"code_sha256":"9da87b0b1605a660"}},{"arxiv_id":"2010.05563","paper":"/paper/graph-information-bottleneck-for-subgraph-1","title":"Graph Information Bottleneck for Subgraph Recognition","date":"2020-10-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Samyu0304/graph-information-bottleneck-for-Subgraph-Recognition","path":"graph-classfication/ours_train_eval.py","file_url":"https://github.com/Samyu0304/graph-information-bottleneck-for-Subgraph-Recognition/blob/HEAD/graph-classfication/ours_train_eval.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"9da87b0b1605a660","mcp_get_code":{"code_sha256":"9da87b0b1605a660"}},{"arxiv_id":"2002.06757","paper":"/paper/entity-context-and-relational-paths-for","title":"Relational Message Passing for Knowledge Graph Completion","date":"2020-02-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"muhanzhang/IGMC","path":"train_eval.py","file_url":"https://github.com/muhanzhang/IGMC/blob/HEAD/train_eval.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"9da87b0b1605a660","mcp_get_code":{"code_sha256":"9da87b0b1605a660"}},{"arxiv_id":"1904.12058","paper":"/paper/inductive-graph-pattern-learning-for","title":"Inductive Matrix Completion Based on Graph Neural Networks","date":"2019-04-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":null,"inline_ok":false,"code_sha256_prefix":"9da87b0b1605a660","mcp_get_code":{"code_sha256":"9da87b0b1605a660"}},{"arxiv_id":"aaai_17268","paper":null,"title":"arXiv:aaai_17268","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"uta-smile/HGCN","path":"train_eval.py","file_url":"https://github.com/uta-smile/HGCN/blob/HEAD/train_eval.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"9da87b0b1605a660","mcp_get_code":{"code_sha256":"9da87b0b1605a660"}}]}