{"about":{"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.","site":"https://codewithpapers.app","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","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/code/index-to-mask","entry":"index_to_mask","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-10-05T00:36:11+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 = n_papers_ran_no_instrument_failure (papers with a run with no instrument failure) + n_papers_ran_instrument_only (papers where every run was a failure of Syntology's instrument); n_samples_ran = n_samples_ran_checked (honoured, violated, no contract) + n_samples_instrument (failures of Syntology's instrument, not of the code).","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; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":25,"n_papers_ran":25,"n_papers_ran_no_instrument_failure":2,"n_papers_ran_instrument_only":23,"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":9,"n_samples_ran":9,"n_samples_constructed":0,"n_samples_ran_checked":2,"n_samples_instrument":7,"n_samples_unverified":0,"n_samples_fingerprinted":0,"n_places":25,"n_places_pointer_only":21,"n_places_pointer_only_link_open":8,"inline_ok_is":"inline_ok is true only when both licence gates allow Syntology to serve this code's text: this paper's link (inline_ok_link, from the licence of this paper's copy) and the stored copy of the same code that Syntology serves, which may have been first harvested from another repository. withheld_clause is Syntology's own wording of which gate keeps the text a pointer and why, and is null when inline_ok is true. This site shows no code text either way; n_places_pointer_only_link_open counts the places where this paper's link allows the text and the stored copy does not","by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":7,"ran_fixture":0,"ran":2,"unverified":0},"key_notes":{"n_samples_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_samples_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"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":"2605.05759","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-05759","title":"Full-Spectrum Graph Neural Networks: Expressive and Scalable","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"xwangxshi/FSpecGNN","path":"Heterophily/large/utils.py","file_url":"https://github.com/xwangxshi/FSpecGNN/blob/HEAD/Heterophily/large/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, xwangxshi/FSpecGNN when it was checked","code_sha256":"015b48620e1b8319","code_sha256_prefix":"015b48620e1b8319","mcp_get_code":{"code_sha256":"015b48620e1b8319"}},{"arxiv_id":"2512.11561","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2512-11561","title":"View Space: Learning Representation across Arbitrary Graphs","date":null,"month_inferred_from_arxiv_id":"2025-12","title_source":"syntology","repo":"jianhao2016/GPRGNN","path":"src/utils.py","file_url":"https://github.com/jianhao2016/GPRGNN/blob/HEAD/src/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, jianhao2016/GPRGNN when it was checked","code_sha256":"da80a2b9fd449bd2","code_sha256_prefix":"da80a2b9fd449bd2","mcp_get_code":{"code_sha256":"da80a2b9fd449bd2"}},{"arxiv_id":"2507.16347","arxiv_id_is_arxiv":true,"paper":null,"title":"arXiv:2507.16347","date":null,"month_inferred_from_arxiv_id":"2025-07","title_source":null,"repo":"streetcorner/HPGNN","path":"utils/dataset_utils.py","file_url":"https://github.com/streetcorner/HPGNN/blob/HEAD/utils/dataset_utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from xwangxshi/FSpecGNN, and GitHub detected no licence in that repository when it was checked","code_sha256":"015b48620e1b8319","code_sha256_prefix":"015b48620e1b8319","mcp_get_code":{"code_sha256":"015b48620e1b8319"}},{"arxiv_id":"2502.01113","arxiv_id_is_arxiv":true,"paper":"/paper/gfm-rag-graph-foundation-model-for-retrieval","title":"GFM-RAG: Graph Foundation Model for Retrieval Augmented Generation","date":"2025-02-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"9664f4b5c60ab1bf","code_sha256_prefix":"9664f4b5c60ab1bf","mcp_get_code":{"code_sha256":"9664f4b5c60ab1bf"}},{"arxiv_id":"2408.00700","arxiv_id_is_arxiv":true,"paper":"/paper/you-can-t-ignore-either-unifying-structure","title":"You Can't Ignore Either: Unifying Structure and Feature Denoising for Robust Graph Learning","date":"2024-08-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"youngtimmy/ugd","path":"generate_noisedata/attack_injection_noise.py","file_url":"https://github.com/youngtimmy/ugd/blob/HEAD/generate_noisedata/attack_injection_noise.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, youngtimmy/ugd when it was checked","code_sha256":"b575184b083dc83b","code_sha256_prefix":"b575184b083dc83b","mcp_get_code":{"code_sha256":"b575184b083dc83b"}},{"arxiv_id":"2407.16863","arxiv_id_is_arxiv":true,"paper":"/paper/balanced-multi-relational-graph-clustering","title":"Balanced Multi-Relational Graph Clustering","date":"2024-07-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zxlearningdeep/bmgc","path":"BMGC/cSBM_dataset.py","file_url":"https://github.com/zxlearningdeep/bmgc/blob/HEAD/BMGC/cSBM_dataset.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, zxlearningdeep/bmgc when it was checked","code_sha256":"da80a2b9fd449bd2","code_sha256_prefix":"da80a2b9fd449bd2","mcp_get_code":{"code_sha256":"da80a2b9fd449bd2"}},{"arxiv_id":"2407.14459","arxiv_id_is_arxiv":true,"paper":"/paper/polyformer-scalable-node-wise-filters-via","title":"PolyFormer: Scalable Node-wise Filters via Polynomial Graph Transformer","date":"2024-07-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"air029/polyformer","path":"node_classification/utils.py","file_url":"https://github.com/air029/polyformer/blob/HEAD/node_classification/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, air029/polyformer when it was checked","code_sha256":"015b48620e1b8319","code_sha256_prefix":"015b48620e1b8319","mcp_get_code":{"code_sha256":"015b48620e1b8319"}},{"arxiv_id":"2407.11624","arxiv_id_is_arxiv":true,"paper":"/paper/rethinking-fair-graph-neural-networks-from-re","title":"Rethinking Fair Graph Neural Networks from Re-balancing","date":"2024-07-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhixunlee/fairgb","path":"data_utils.py","file_url":"https://github.com/zhixunlee/fairgb/blob/HEAD/data_utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"9ed7d6ea040a9619","code_sha256_prefix":"9ed7d6ea040a9619","mcp_get_code":{"code_sha256":"9ed7d6ea040a9619"}},{"arxiv_id":"2402.11837","arxiv_id_is_arxiv":true,"paper":"/paper/self-guided-robust-graph-structure-refinement","title":"Self-Guided Robust Graph Structure Refinement","date":"2024-02-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yeonjun-in/torch-sg-gsr","path":"utils/data.py","file_url":"https://github.com/yeonjun-in/torch-sg-gsr/blob/HEAD/utils/data.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, yeonjun-in/torch-sg-gsr when it was checked","code_sha256":"68823e485d4d106a","code_sha256_prefix":"68823e485d4d106a","mcp_get_code":{"code_sha256":"68823e485d4d106a"}},{"arxiv_id":"2401.06595","arxiv_id_is_arxiv":true,"paper":"/paper/every-node-is-different-dynamically-fusing","title":"Every Node is Different: Dynamically Fusing Self-Supervised Tasks for Attributed Graph Clustering","date":"2024-01-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"q086/DyFSS","path":"DyFSS/utils.py","file_url":"https://github.com/q086/DyFSS/blob/HEAD/DyFSS/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, q086/DyFSS when it was checked","code_sha256":"fbb0568018649a4d","code_sha256_prefix":"fbb0568018649a4d","mcp_get_code":{"code_sha256":"fbb0568018649a4d"}},{"arxiv_id":"2312.14438","arxiv_id_is_arxiv":true,"paper":"/paper/pc-conv-unifying-homophily-and-heterophily","title":"PC-Conv: Unifying Homophily and Heterophily with Two-fold Filtering","date":"2023-12-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"uestclbh/pc-conv","path":"utils.py","file_url":"https://github.com/uestclbh/pc-conv/blob/HEAD/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, uestclbh/pc-conv when it was checked","code_sha256":"015b48620e1b8319","code_sha256_prefix":"015b48620e1b8319","mcp_get_code":{"code_sha256":"015b48620e1b8319"}},{"arxiv_id":"2312.13032","arxiv_id_is_arxiv":true,"paper":"/paper/nodemixup-tackling-under-reaching-for-graph","title":"NodeMixup: Tackling Under-Reaching for Graph Neural Networks","date":"2023-12-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"weiganglu/nodemixup","path":"dataset.py","file_url":"https://github.com/weiganglu/nodemixup/blob/HEAD/dataset.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from divelab/Non-Local-GNN, and GPL-3.0, as GitHub detects it on that repository, is not in the permissive set Syntology serves inline","code_sha256":"da80a2b9fd449bd2","code_sha256_prefix":"da80a2b9fd449bd2","mcp_get_code":{"code_sha256":"da80a2b9fd449bd2"}},{"arxiv_id":"2310.01892","arxiv_id_is_arxiv":true,"paper":"/paper/figure-simple-and-efficient-unsupervised-node-1","title":"FiGURe: Simple and Efficient Unsupervised Node Representations with Filter Augmentations","date":"2023-10-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"microsoft/figure","path":"dataset.py","file_url":"https://github.com/microsoft/figure/blob/HEAD/dataset.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"7a9e612624603b69","code_sha256_prefix":"7a9e612624603b69","mcp_get_code":{"code_sha256":"7a9e612624603b69"}},{"arxiv_id":"2310.00697","arxiv_id_is_arxiv":true,"paper":"/paper/learning-how-to-propagate-messages-in-graph","title":"Learning How to Propagate Messages in Graph Neural Networks","date":"2023-10-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tengxiao1/l2p","path":"full/utils.py","file_url":"https://github.com/tengxiao1/l2p/blob/HEAD/full/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, tengxiao1/l2p when it was checked","code_sha256":"da80a2b9fd449bd2","code_sha256_prefix":"da80a2b9fd449bd2","mcp_get_code":{"code_sha256":"da80a2b9fd449bd2"}},{"arxiv_id":"2307.06422","arxiv_id_is_arxiv":true,"paper":null,"title":"arXiv:2307.06422","date":null,"month_inferred_from_arxiv_id":"2023-07","title_source":null,"repo":"thupchnsky/dp-gnn","path":"core/datasets/cSBM_dataset.py","file_url":"https://github.com/thupchnsky/dp-gnn/blob/HEAD/core/datasets/cSBM_dataset.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from divelab/Non-Local-GNN, and GPL-3.0, as GitHub detects it on that repository, is not in the permissive set Syntology serves inline","code_sha256":"da80a2b9fd449bd2","code_sha256_prefix":"da80a2b9fd449bd2","mcp_get_code":{"code_sha256":"da80a2b9fd449bd2"}},{"arxiv_id":"2305.19337","arxiv_id_is_arxiv":true,"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/graph_helper.py","file_url":"https://github.com/karami-m/higen_main/blob/HEAD/utils/graph_helper.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"9123e2f7b1ebd40b","code_sha256_prefix":"9123e2f7b1ebd40b","mcp_get_code":{"code_sha256":"9123e2f7b1ebd40b"}},{"arxiv_id":"2206.10991","arxiv_id_is_arxiv":true,"paper":"/paper/graph-neural-networks-as-gradient-flows","title":"Understanding convolution on graphs via energies","date":"2022-06-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jrowbottomgit/graff","path":"src/heterophilic.py","file_url":"https://github.com/jrowbottomgit/graff/blob/HEAD/src/heterophilic.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from divelab/Non-Local-GNN, and GPL-3.0, as GitHub detects it on that repository, is not in the permissive set Syntology serves inline","code_sha256":"da80a2b9fd449bd2","code_sha256_prefix":"da80a2b9fd449bd2","mcp_get_code":{"code_sha256":"da80a2b9fd449bd2"}},{"arxiv_id":"2206.09144","arxiv_id_is_arxiv":true,"paper":"/paper/beyond-real-world-benchmark-datasets-an","title":"Beyond Real-world Benchmark Datasets: An Empirical Study of Node Classification with GNNs","date":"2022-06-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"seijimaekawa/empirical-study-of-gnns","path":"models/utils.py","file_url":"https://github.com/seijimaekawa/empirical-study-of-gnns/blob/HEAD/models/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from divelab/Non-Local-GNN, and GPL-3.0, as GitHub detects it on that repository, is not in the permissive set Syntology serves inline","code_sha256":"da80a2b9fd449bd2","code_sha256_prefix":"da80a2b9fd449bd2","mcp_get_code":{"code_sha256":"da80a2b9fd449bd2"}},{"arxiv_id":"2205.14403","arxiv_id_is_arxiv":true,"paper":"/paper/rethinking-the-setting-of-semi-supervised","title":"Rethinking the Setting of Semi-supervised Learning on Graphs","date":"2022-05-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"da80a2b9fd449bd2","code_sha256_prefix":"da80a2b9fd449bd2","mcp_get_code":{"code_sha256":"da80a2b9fd449bd2"}},{"arxiv_id":"2112.11628","arxiv_id_is_arxiv":true,"paper":"/paper/skipnode-on-alleviating-over-smoothing-for","title":"SkipNode: On Alleviating Performance Degradation for Deep Graph Convolutional Networks","date":"2021-12-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"weiganglu/skipnode","path":"utils/dataset.py","file_url":"https://github.com/weiganglu/skipnode/blob/HEAD/utils/dataset.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from divelab/Non-Local-GNN, and GPL-3.0, as GitHub detects it on that repository, is not in the permissive set Syntology serves inline","code_sha256":"da80a2b9fd449bd2","code_sha256_prefix":"da80a2b9fd449bd2","mcp_get_code":{"code_sha256":"da80a2b9fd449bd2"}},{"arxiv_id":"2111.07337","arxiv_id_is_arxiv":true,"paper":"/paper/p-laplacian-based-graph-neural-networks-1","title":"$p$-Laplacian Based Graph Neural Networks","date":"2021-11-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"guoji-fu/pGNNs","path":"cSBM_dataset.py","file_url":"https://github.com/guoji-fu/pGNNs/blob/HEAD/cSBM_dataset.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from divelab/Non-Local-GNN, and GPL-3.0, as GitHub detects it on that repository, is not in the permissive set Syntology serves inline","code_sha256":"da80a2b9fd449bd2","code_sha256_prefix":"da80a2b9fd449bd2","mcp_get_code":{"code_sha256":"da80a2b9fd449bd2"}},{"arxiv_id":"2106.06935","arxiv_id_is_arxiv":true,"paper":"/paper/neural-bellman-ford-networks-a-general-graph","title":"Neural Bellman-Ford Networks: A General Graph Neural Network Framework for Link Prediction","date":"2021-06-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"KiddoZhu/NBFNet-PyG","path":"nbfnet/models.py","file_url":"https://github.com/KiddoZhu/NBFNet-PyG/blob/HEAD/nbfnet/models.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"9664f4b5c60ab1bf","code_sha256_prefix":"9664f4b5c60ab1bf","mcp_get_code":{"code_sha256":"9664f4b5c60ab1bf"}},{"arxiv_id":"2007.09296","arxiv_id_is_arxiv":true,"paper":"/paper/towards-deeper-graph-neural-networks","title":"Towards Deeper Graph Neural Networks","date":"2020-07-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"da80a2b9fd449bd2","code_sha256_prefix":"da80a2b9fd449bd2","mcp_get_code":{"code_sha256":"da80a2b9fd449bd2"}},{"arxiv_id":"2005.14612","arxiv_id_is_arxiv":true,"paper":"/paper/non-local-graph-neural-networks","title":"Non-Local Graph Neural Networks","date":"2020-05-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"divelab/Non-Local-GNN","path":"NLGNN/src/train_eval.py","file_url":"https://github.com/divelab/Non-Local-GNN/blob/HEAD/NLGNN/src/train_eval.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"GPL-3.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GPL-3.0, as GitHub detects it on this paper's repository, divelab/Non-Local-GNN, is not in the permissive set Syntology serves inline","code_sha256":"da80a2b9fd449bd2","code_sha256_prefix":"da80a2b9fd449bd2","mcp_get_code":{"code_sha256":"da80a2b9fd449bd2"}},{"arxiv_id":"aaai_29328","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_29328","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"WeigangLu/NodeMixup","path":"dataset.py","file_url":"https://github.com/WeigangLu/NodeMixup/blob/HEAD/dataset.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from divelab/Non-Local-GNN, and GPL-3.0, as GitHub detects it on that repository, is not in the permissive set Syntology serves inline","code_sha256":"da80a2b9fd449bd2","code_sha256_prefix":"da80a2b9fd449bd2","mcp_get_code":{"code_sha256":"da80a2b9fd449bd2"}}],"record_sha256":"72036b7463407768c2ecbd40caf8217935850c4fa43c96ab98dfb63891d77c48","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}