{"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/parse-index-file","entry":"parse_index_file","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":54,"n_papers_ran":54,"n_papers_ran_no_instrument_failure":54,"n_papers_ran_instrument_only":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":4,"n_samples_ran":4,"n_samples_constructed":0,"n_samples_ran_checked":4,"n_samples_instrument":0,"n_samples_unverified":0,"n_samples_fingerprinted":0,"n_places":55,"n_places_pointer_only":38,"n_places_pointer_only_link_open":19,"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":3,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":1,"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":"2502.19670","arxiv_id_is_arxiv":true,"paper":"/paper/training-robust-graph-neural-networks-by","title":"Training Robust Graph Neural Networks by Modeling Noise Dependencies","date":"2025-02-27","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,"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":"c1d6392f89c5e495","code_sha256_prefix":"c1d6392f89c5e495","mcp_get_code":{"code_sha256":"c1d6392f89c5e495"}},{"arxiv_id":"2408.12594","arxiv_id_is_arxiv":true,"paper":"/paper/non-homophilic-graph-pre-training-and-prompt","title":"Non-Homophilic Graph Pre-Training and Prompt Learning","date":"2024-08-22","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,"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":"c1d6392f89c5e495","code_sha256_prefix":"c1d6392f89c5e495","mcp_get_code":{"code_sha256":"c1d6392f89c5e495"}},{"arxiv_id":"2406.17281","arxiv_id_is_arxiv":true,"paper":"/paper/distance-recomputator-and-topology","title":"Distance Recomputator and Topology Reconstructor for Graph Neural Networks","date":"2024-06-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"NoakLiu/Distance-Recomputator-and-Topology-Reconstructor","path":"APPNP_GDRA/data_preprocesing.py","file_url":"https://github.com/NoakLiu/Distance-Recomputator-and-Topology-Reconstructor/blob/HEAD/APPNP_GDRA/data_preprocesing.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, NoakLiu/Distance-Recomputator-and-Topology-Reconstructor when it was checked","code_sha256":"5c3fa9402a9405bc","code_sha256_prefix":"5c3fa9402a9405bc","mcp_get_code":{"code_sha256":"5c3fa9402a9405bc"}},{"arxiv_id":"2406.02059","arxiv_id_is_arxiv":true,"paper":"/paper/graph-adversarial-diffusion-convolution","title":"Graph Adversarial Diffusion Convolution","date":"2024-06-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"songtaoliu0823/gadc","path":"Adaptive_Adversarial_Attack/utils.py","file_url":"https://github.com/songtaoliu0823/gadc/blob/HEAD/Adaptive_Adversarial_Attack/utils.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, songtaoliu0823/gadc when it was checked","code_sha256":"c1d6392f89c5e495","code_sha256_prefix":"c1d6392f89c5e495","mcp_get_code":{"code_sha256":"c1d6392f89c5e495"}},{"arxiv_id":"2405.03188","arxiv_id_is_arxiv":true,"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":"data.py","file_url":"https://github.com/ringbdstack/hypdiff/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,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, ringbdstack/hypdiff when it was checked","code_sha256":"5c3fa9402a9405bc","code_sha256_prefix":"5c3fa9402a9405bc","mcp_get_code":{"code_sha256":"5c3fa9402a9405bc"}},{"arxiv_id":"2311.01196","arxiv_id_is_arxiv":true,"paper":"/paper/combating-bilateral-edge-noise-for-robust-1","title":"Combating Bilateral Edge Noise for Robust Link Prediction","date":"2023-11-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"flyingdoog/PTDNet","path":"utils.py","file_url":"https://github.com/flyingdoog/PTDNet/blob/HEAD/utils.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, flyingdoog/PTDNet when it was checked","code_sha256":"c1d6392f89c5e495","code_sha256_prefix":"c1d6392f89c5e495","mcp_get_code":{"code_sha256":"c1d6392f89c5e495"}},{"arxiv_id":"2311.00322","arxiv_id_is_arxiv":true,"paper":"/paper/robust-graph-clustering-via-meta-weighting","title":"Robust Graph Clustering via Meta Weighting for Noisy Graphs","date":"2023-11-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hyeonsoojo/metagc","path":"utils/load_utils.py","file_url":"https://github.com/hyeonsoojo/metagc/blob/HEAD/utils/load_utils.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"5c3fa9402a9405bc","code_sha256_prefix":"5c3fa9402a9405bc","mcp_get_code":{"code_sha256":"5c3fa9402a9405bc"}},{"arxiv_id":"2310.18884","arxiv_id_is_arxiv":true,"paper":"/paper/simple-and-asymmetric-graph-contrastive-1","title":"Simple and Asymmetric Graph Contrastive Learning without Augmentations","date":"2023-10-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"graphdml-uiuc-jlu/geom-gcn","path":"utils.py","file_url":"https://github.com/graphdml-uiuc-jlu/geom-gcn/blob/HEAD/utils.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, graphdml-uiuc-jlu/geom-gcn when it was checked","code_sha256":"c1d6392f89c5e495","code_sha256_prefix":"c1d6392f89c5e495","mcp_get_code":{"code_sha256":"c1d6392f89c5e495"}},{"arxiv_id":"2310.17394","arxiv_id_is_arxiv":true,"paper":"/paper/enhancing-graph-neural-networks-with","title":"PSP: Pre-Training and Structure Prompt Tuning for Graph Neural Networks","date":"2023-10-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gqq1210/psp","path":"PSP_graph/utils.py","file_url":"https://github.com/gqq1210/psp/blob/HEAD/PSP_graph/utils.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, gqq1210/psp when it was checked","code_sha256":"c1d6392f89c5e495","code_sha256_prefix":"c1d6392f89c5e495","mcp_get_code":{"code_sha256":"c1d6392f89c5e495"}},{"arxiv_id":"2308.08963","arxiv_id_is_arxiv":true,"paper":"/paper/convert-contrastive-graph-clustering-with","title":"CONVERT:Contrastive Graph Clustering with Reliable Augmentation","date":"2023-08-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xihongyang1999/convert","path":"utils.py","file_url":"https://github.com/xihongyang1999/convert/blob/HEAD/utils.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, xihongyang1999/convert when it was checked","code_sha256":"5c3fa9402a9405bc","code_sha256_prefix":"5c3fa9402a9405bc","mcp_get_code":{"code_sha256":"5c3fa9402a9405bc"}},{"arxiv_id":"2308.03306","arxiv_id_is_arxiv":true,"paper":"/paper/implicit-graph-neural-diffusion-based-on","title":"Implicit Graph Neural Diffusion Networks: Convergence, Generalization, and Over-Smoothing","date":"2023-08-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"guoji-fu/dignn","path":"nodeclassification/data.py","file_url":"https://github.com/guoji-fu/dignn/blob/HEAD/nodeclassification/data.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","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 DSL-Lab/Specformer, and GPL-3.0, as GitHub detects it on that repository, is not in the permissive set Syntology serves inline","code_sha256":"c1d6392f89c5e495","code_sha256_prefix":"c1d6392f89c5e495","mcp_get_code":{"code_sha256":"c1d6392f89c5e495"}},{"arxiv_id":"2306.09104","arxiv_id_is_arxiv":true,"paper":"/paper/on-strengthening-and-defending-graph","title":"On Strengthening and Defending Graph Reconstruction Attack with Markov Chain Approximation","date":"2023-06-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tmlr-group/MC-GRA","path":"MC-GRA/dataset.py","file_url":"https://github.com/tmlr-group/MC-GRA/blob/HEAD/MC-GRA/dataset.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"5c3fa9402a9405bc","code_sha256_prefix":"5c3fa9402a9405bc","mcp_get_code":{"code_sha256":"5c3fa9402a9405bc"}},{"arxiv_id":"2303.01028","arxiv_id_is_arxiv":true,"paper":"/paper/specformer-spectral-graph-neural-networks","title":"Specformer: Spectral Graph Neural Networks Meet Transformers","date":"2023-03-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"DSL-Lab/Specformer","path":"Node/preprocess_node_data.py","file_url":"https://github.com/DSL-Lab/Specformer/blob/HEAD/Node/preprocess_node_data.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","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, DSL-Lab/Specformer, is not in the permissive set Syntology serves inline","code_sha256":"c1d6392f89c5e495","code_sha256_prefix":"c1d6392f89c5e495","mcp_get_code":{"code_sha256":"c1d6392f89c5e495"}},{"arxiv_id":"2210.12941","arxiv_id_is_arxiv":true,"paper":"/paper/are-we-really-making-much-progress-in","title":"Unsupervised Graph Outlier Detection: Problem Revisit, New Insight, and Superior Method","date":"2022-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,"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":"c1d6392f89c5e495","code_sha256_prefix":"c1d6392f89c5e495","mcp_get_code":{"code_sha256":"c1d6392f89c5e495"}},{"arxiv_id":"2208.07012","arxiv_id_is_arxiv":true,"paper":"/paper/mm-gnn-mix-moment-graph-neural-network","title":"MM-GNN: Mix-Moment Graph Neural Network towards Modeling Neighborhood Feature Distribution","date":"2022-08-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wendongbi/MMGNN","path":"main/process.py","file_url":"https://github.com/wendongbi/MMGNN/blob/HEAD/main/process.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":false,"withheld_clause":"MIT, as GitHub detects it on this paper's repository, wendongbi/MMGNN, is in the permissive set, but a licence decision keeps the body a pointer: the reason for that decision is not recorded with it","code_sha256":"c1d6392f89c5e495","code_sha256_prefix":"c1d6392f89c5e495","mcp_get_code":{"code_sha256":"c1d6392f89c5e495"}},{"arxiv_id":"2206.04285","arxiv_id_is_arxiv":true,"paper":"/paper/pseudo-poincare-a-unification-framework-for","title":"A Unification Framework for Euclidean and Hyperbolic Graph Neural Networks","date":"2022-06-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"oom-debugger/ijcai23","path":"GCNII-master/process.py","file_url":"https://github.com/oom-debugger/ijcai23/blob/HEAD/GCNII-master/process.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","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 DSL-Lab/Specformer, and GPL-3.0, as GitHub detects it on that repository, is not in the permissive set Syntology serves inline","code_sha256":"c1d6392f89c5e495","code_sha256_prefix":"c1d6392f89c5e495","mcp_get_code":{"code_sha256":"c1d6392f89c5e495"}},{"arxiv_id":"2206.00583","arxiv_id_is_arxiv":true,"paper":"/paper/calibrate-and-debias-layer-wise-sampling-for","title":"Calibrate and Debias Layer-wise Sampling for Graph Convolutional Networks","date":"2022-06-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,"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":"c1d6392f89c5e495","code_sha256_prefix":"c1d6392f89c5e495","mcp_get_code":{"code_sha256":"c1d6392f89c5e495"}},{"arxiv_id":"2204.05351","arxiv_id_is_arxiv":true,"paper":"/paper/graph-ordering-attention-networks","title":"Graph Ordering Attention Networks","date":"2022-04-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"michailchatzianastasis/goat","path":"utils2.py","file_url":"https://github.com/michailchatzianastasis/goat/blob/HEAD/utils2.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","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 DSL-Lab/Specformer, and GPL-3.0, as GitHub detects it on that repository, is not in the permissive set Syntology serves inline","code_sha256":"c1d6392f89c5e495","code_sha256_prefix":"c1d6392f89c5e495","mcp_get_code":{"code_sha256":"c1d6392f89c5e495"}},{"arxiv_id":"2203.00199","arxiv_id_is_arxiv":true,"paper":"/paper/equivariant-and-stable-positional-encoding-1","title":"Equivariant and Stable Positional Encoding for More Powerful Graph Neural Networks","date":"2022-03-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"graph-com/peg","path":"utils.py","file_url":"https://github.com/graph-com/peg/blob/HEAD/utils.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","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 DSL-Lab/Specformer, and GPL-3.0, as GitHub detects it on that repository, is not in the permissive set Syntology serves inline","code_sha256":"c1d6392f89c5e495","code_sha256_prefix":"c1d6392f89c5e495","mcp_get_code":{"code_sha256":"c1d6392f89c5e495"}},{"arxiv_id":"2201.12433","arxiv_id_is_arxiv":true,"paper":"/paper/fedgcn-convergence-and-communication","title":"FedGCN: Convergence-Communication Tradeoffs in Federated Training of Graph Convolutional Networks","date":"2022-01-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yh-yao/FedGCN","path":"src/data_process.py","file_url":"https://github.com/yh-yao/FedGCN/blob/HEAD/src/data_process.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":"d2d6d7748327bbb9","code_sha256_prefix":"d2d6d7748327bbb9","mcp_get_code":{"code_sha256":"d2d6d7748327bbb9"}},{"arxiv_id":"2201.06367","arxiv_id_is_arxiv":true,"paper":"/paper/towards-unsupervised-deep-graph-structure","title":"Towards Unsupervised Deep Graph Structure Learning","date":"2022-01-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"grand-lab/sublime","path":"data_loader.py","file_url":"https://github.com/grand-lab/sublime/blob/HEAD/data_loader.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","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 DSL-Lab/Specformer, and GPL-3.0, as GitHub detects it on that repository, is not in the permissive set Syntology serves inline","code_sha256":"c1d6392f89c5e495","code_sha256_prefix":"c1d6392f89c5e495","mcp_get_code":{"code_sha256":"c1d6392f89c5e495"}},{"arxiv_id":"2112.04575","arxiv_id_is_arxiv":true,"paper":"/paper/adaptive-kernel-graph-neural-network","title":"Adaptive Kernel Graph Neural Network","date":"2021-12-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jumxglhf/akgnn","path":"utils.py","file_url":"https://github.com/jumxglhf/akgnn/blob/HEAD/utils.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"5c3fa9402a9405bc","code_sha256_prefix":"5c3fa9402a9405bc","mcp_get_code":{"code_sha256":"5c3fa9402a9405bc"}},{"arxiv_id":"2110.14038","arxiv_id_is_arxiv":true,"paper":"/paper/robustness-of-graph-neural-networks-at-scale","title":"Robustness of Graph Neural Networks at Scale","date":"2021-10-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ventr1c/res-gcl","path":"dataset.py","file_url":"https://github.com/ventr1c/res-gcl/blob/HEAD/dataset.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"5c3fa9402a9405bc","code_sha256_prefix":"5c3fa9402a9405bc","mcp_get_code":{"code_sha256":"5c3fa9402a9405bc"}},{"arxiv_id":"2006.16499","arxiv_id_is_arxiv":true,"paper":"/paper/sce-scalable-network-embedding-from-sparsest","title":"SCE: Scalable Network Embedding from Sparsest Cut","date":"2020-06-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"szzhang17/Sparsest-Cut-Network-Embedding","path":"utils.py","file_url":"https://github.com/szzhang17/Sparsest-Cut-Network-Embedding/blob/HEAD/utils.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"5c3fa9402a9405bc","code_sha256_prefix":"5c3fa9402a9405bc","mcp_get_code":{"code_sha256":"5c3fa9402a9405bc"}},{"arxiv_id":"2006.11468","arxiv_id_is_arxiv":true,"paper":"/paper/generalizing-graph-neural-networks-beyond","title":"Beyond Homophily in Graph Neural Networks: Current Limitations and Effective Designs","date":"2020-06-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"PetarV-/GAT","path":"utils/process.py","file_url":"https://github.com/PetarV-/GAT/blob/HEAD/utils/process.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","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 DSL-Lab/Specformer, and GPL-3.0, as GitHub detects it on that repository, is not in the permissive set Syntology serves inline","code_sha256":"c1d6392f89c5e495","code_sha256_prefix":"c1d6392f89c5e495","mcp_get_code":{"code_sha256":"c1d6392f89c5e495"}},{"arxiv_id":"2006.05806","arxiv_id_is_arxiv":true,"paper":"/paper/bandit-samplers-for-training-graph-neural","title":"Bandit Samplers for Training Graph Neural Networks","date":"2020-06-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xavierzw/ogb-geniepath-bs","path":"utils.py","file_url":"https://github.com/xavierzw/ogb-geniepath-bs/blob/HEAD/utils.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","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 DSL-Lab/Specformer, and GPL-3.0, as GitHub detects it on that repository, is not in the permissive set Syntology serves inline","code_sha256":"c1d6392f89c5e495","code_sha256_prefix":"c1d6392f89c5e495","mcp_get_code":{"code_sha256":"c1d6392f89c5e495"}},{"arxiv_id":"2005.11079","arxiv_id_is_arxiv":true,"paper":"/paper/graph-random-neural-network","title":"Graph Random Neural Network for Semi-Supervised Learning on Graphs","date":"2020-05-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Grand20/grand","path":"pygcn/utils.py","file_url":"https://github.com/Grand20/grand/blob/HEAD/pygcn/utils.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"5c3fa9402a9405bc","code_sha256_prefix":"5c3fa9402a9405bc","mcp_get_code":{"code_sha256":"5c3fa9402a9405bc"}},{"arxiv_id":"2002.06755","arxiv_id_is_arxiv":true,"paper":"/paper/unifying-graph-convolutional-neural-networks-1","title":"Unifying Graph Convolutional Neural Networks and Label Propagation","date":"2020-02-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"achalagarwal/gcn-lpa","path":"src/data_loader.py","file_url":"https://github.com/achalagarwal/gcn-lpa/blob/HEAD/src/data_loader.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"5c3fa9402a9405bc","code_sha256_prefix":"5c3fa9402a9405bc","mcp_get_code":{"code_sha256":"5c3fa9402a9405bc"}},{"arxiv_id":"2002.05287","arxiv_id_is_arxiv":true,"paper":"/paper/geom-gcn-geometric-graph-convolutional-1","title":"Geom-GCN: Geometric Graph Convolutional Networks","date":"2020-02-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bingzhewei/geom-gcn","path":"utils.py","file_url":"https://github.com/bingzhewei/geom-gcn/blob/HEAD/utils.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, bingzhewei/geom-gcn when it was checked","code_sha256":"dfd091f34611a47a","code_sha256_prefix":"dfd091f34611a47a","mcp_get_code":{"code_sha256":"dfd091f34611a47a"}},{"arxiv_id":"2002.03665","arxiv_id_is_arxiv":true,"paper":"/paper/anomalydae-dual-autoencoder-for-anomaly","title":"AnomalyDAE: Dual autoencoder for anomaly detection on attributed networks","date":"2020-02-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"haoyfan/AnomalyDAE","path":"src/input_data.py","file_url":"https://github.com/haoyfan/AnomalyDAE/blob/HEAD/src/input_data.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"5c3fa9402a9405bc","code_sha256_prefix":"5c3fa9402a9405bc","mcp_get_code":{"code_sha256":"5c3fa9402a9405bc"}},{"arxiv_id":"1911.07323","arxiv_id_is_arxiv":true,"paper":"/paper/layer-dependent-importance-sampling-for-1","title":"Layer-Dependent Importance Sampling for Training Deep and Large Graph Convolutional Networks","date":"2019-11-17","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,"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":"c1d6392f89c5e495","code_sha256_prefix":"c1d6392f89c5e495","mcp_get_code":{"code_sha256":"c1d6392f89c5e495"}},{"arxiv_id":"1911.01731","arxiv_id_is_arxiv":true,"paper":"/paper/graphair-graph-representation-learning-with","title":"GraphAIR: Graph Representation Learning with Neighborhood Aggregation and Interaction","date":"2019-11-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"CRIPAC-DIG/GraphAIR","path":"tensorflow_code/utils.py","file_url":"https://github.com/CRIPAC-DIG/GraphAIR/blob/HEAD/tensorflow_code/utils.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","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 DSL-Lab/Specformer, and GPL-3.0, as GitHub detects it on that repository, is not in the permissive set Syntology serves inline","code_sha256":"c1d6392f89c5e495","code_sha256_prefix":"c1d6392f89c5e495","mcp_get_code":{"code_sha256":"c1d6392f89c5e495"}},{"arxiv_id":"1908.07078","arxiv_id_is_arxiv":true,"paper":"/paper/semi-implicit-graph-variational-auto-encoders","title":"Semi-Implicit Graph Variational Auto-Encoders","date":"2019-08-19","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,"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":"5c3fa9402a9405bc","code_sha256_prefix":"5c3fa9402a9405bc","mcp_get_code":{"code_sha256":"5c3fa9402a9405bc"}},{"arxiv_id":"1908.04003","arxiv_id_is_arxiv":true,"paper":"/paper/rwr-gae-random-walk-regularization-for-graph","title":"RWR-GAE: Random Walk Regularization for Graph Auto Encoders","date":"2019-08-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"MysteryVaibhav/DW-GAE","path":"gae/utils.py","file_url":"https://github.com/MysteryVaibhav/DW-GAE/blob/HEAD/gae/utils.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"5c3fa9402a9405bc","code_sha256_prefix":"5c3fa9402a9405bc","mcp_get_code":{"code_sha256":"5c3fa9402a9405bc"}},{"arxiv_id":"1906.04817","arxiv_id_is_arxiv":true,"paper":"/paper/position-aware-graph-neural-networks","title":"Position-aware Graph Neural Networks","date":"2019-06-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"JiaxuanYou/P-GNN","path":"dataset.py","file_url":"https://github.com/JiaxuanYou/P-GNN/blob/HEAD/dataset.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"5c3fa9402a9405bc","code_sha256_prefix":"5c3fa9402a9405bc","mcp_get_code":{"code_sha256":"5c3fa9402a9405bc"}},{"arxiv_id":"1906.02174","arxiv_id_is_arxiv":true,"paper":"/paper/break-the-ceiling-stronger-multi-scale-deep","title":"Break the Ceiling: Stronger Multi-scale Deep Graph Convolutional Networks","date":"2019-06-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"PwnerHarry/Stronger_GCN","path":"TF2/initialize_dataset.py","file_url":"https://github.com/PwnerHarry/Stronger_GCN/blob/HEAD/TF2/initialize_dataset.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"5c3fa9402a9405bc","code_sha256_prefix":"5c3fa9402a9405bc","mcp_get_code":{"code_sha256":"5c3fa9402a9405bc"}},{"arxiv_id":"1905.13403","arxiv_id_is_arxiv":true,"paper":"/paper/deep-bayesian-optimization-on-attributed","title":"Deep Bayesian Optimization on Attributed Graphs","date":"2019-05-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"csjtx1021/DGBO","path":"gcn/utils.py","file_url":"https://github.com/csjtx1021/DGBO/blob/HEAD/gcn/utils.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","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 DSL-Lab/Specformer, and GPL-3.0, as GitHub detects it on that repository, is not in the permissive set Syntology serves inline","code_sha256":"c1d6392f89c5e495","code_sha256_prefix":"c1d6392f89c5e495","mcp_get_code":{"code_sha256":"c1d6392f89c5e495"}},{"arxiv_id":"1902.07153","arxiv_id_is_arxiv":true,"paper":"/paper/simplifying-graph-convolutional-networks","title":"Simplifying Graph Convolutional Networks","date":"2019-02-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Tiiiger/SGC","path":"utils.py","file_url":"https://github.com/Tiiiger/SGC/blob/HEAD/utils.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","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 DSL-Lab/Specformer, and GPL-3.0, as GitHub detects it on that repository, is not in the permissive set Syntology serves inline","code_sha256":"c1d6392f89c5e495","code_sha256_prefix":"c1d6392f89c5e495","mcp_get_code":{"code_sha256":"c1d6392f89c5e495"}},{"arxiv_id":"1902.06667","arxiv_id_is_arxiv":true,"paper":"/paper/semi-supervised-node-classification-via","title":"Hierarchical Graph Convolutional Networks for Semi-supervised Node Classification","date":"2019-02-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"CRIPAC-DIG/H-GCN","path":"tensorflow_code/utils.py","file_url":"https://github.com/CRIPAC-DIG/H-GCN/blob/HEAD/tensorflow_code/utils.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","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 DSL-Lab/Specformer, and GPL-3.0, as GitHub detects it on that repository, is not in the permissive set Syntology serves inline","code_sha256":"c1d6392f89c5e495","code_sha256_prefix":"c1d6392f89c5e495","mcp_get_code":{"code_sha256":"c1d6392f89c5e495"}},{"arxiv_id":"1901.09993","arxiv_id_is_arxiv":true,"paper":"/paper/generalized-label-propagation-methods-for","title":"Label Efficient Semi-Supervised Learning via Graph Filtering","date":"2019-01-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"liqimai/Efficient-SSL","path":"gcn/utils.py","file_url":"https://github.com/liqimai/Efficient-SSL/blob/HEAD/gcn/utils.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","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 DSL-Lab/Specformer, and GPL-3.0, as GitHub detects it on that repository, is not in the permissive set Syntology serves inline","code_sha256":"c1d6392f89c5e495","code_sha256_prefix":"c1d6392f89c5e495","mcp_get_code":{"code_sha256":"c1d6392f89c5e495"}},{"arxiv_id":"1901.08255","arxiv_id_is_arxiv":true,"paper":"/paper/confidence-based-graph-convolutional-networks","title":"Confidence-based Graph Convolutional Networks for Semi-Supervised Learning","date":"2019-01-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"malllabiisc/ConfGCN","path":"helper.py","file_url":"https://github.com/malllabiisc/ConfGCN/blob/HEAD/helper.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","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 DSL-Lab/Specformer, and GPL-3.0, as GitHub detects it on that repository, is not in the permissive set Syntology serves inline","code_sha256":"c1d6392f89c5e495","code_sha256_prefix":"c1d6392f89c5e495","mcp_get_code":{"code_sha256":"c1d6392f89c5e495"}},{"arxiv_id":"1811.11103","arxiv_id_is_arxiv":true,"paper":"/paper/bayesian-graph-convolutional-neural-networks","title":"Bayesian graph convolutional neural networks for semi-supervised classification","date":"2018-11-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"huawei-noah/BGCN","path":"src/utils_gcn.py","file_url":"https://github.com/huawei-noah/BGCN/blob/HEAD/src/utils_gcn.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":false,"withheld_clause":"MIT, as GitHub detects it on this paper's repository, huawei-noah/BGCN, is in the permissive set, but a licence decision keeps the body a pointer: the reason for that decision is not recorded with it","code_sha256":"c1d6392f89c5e495","code_sha256_prefix":"c1d6392f89c5e495","mcp_get_code":{"code_sha256":"c1d6392f89c5e495"}},{"arxiv_id":"1811.02798","arxiv_id_is_arxiv":true,"paper":"/paper/multi-task-graph-autoencoders","title":"Multi-Task Graph Autoencoders","date":"2018-11-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vuptran/graph-representation-learning","path":"longae/utils_gcn.py","file_url":"https://github.com/vuptran/graph-representation-learning/blob/HEAD/longae/utils_gcn.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","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 DSL-Lab/Specformer, and GPL-3.0, as GitHub detects it on that repository, is not in the permissive set Syntology serves inline","code_sha256":"c1d6392f89c5e495","code_sha256_prefix":"c1d6392f89c5e495","mcp_get_code":{"code_sha256":"c1d6392f89c5e495"}},{"arxiv_id":"1811.02061","arxiv_id_is_arxiv":true,"paper":"/paper/a-recurrent-graph-neural-network-for-multi","title":"A Recurrent Graph Neural Network for Multi-Relational Data","date":"2018-11-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bioannidis/adaptive_recurrent_graph_neural_network","path":"utils.py","file_url":"https://github.com/bioannidis/adaptive_recurrent_graph_neural_network/blob/HEAD/utils.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","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 DSL-Lab/Specformer, and GPL-3.0, as GitHub detects it on that repository, is not in the permissive set Syntology serves inline","code_sha256":"c1d6392f89c5e495","code_sha256_prefix":"c1d6392f89c5e495","mcp_get_code":{"code_sha256":"c1d6392f89c5e495"}},{"arxiv_id":"1809.10341","arxiv_id_is_arxiv":true,"paper":"/paper/deep-graph-infomax","title":"Deep Graph Infomax","date":"2018-09-27","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,"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":"c1d6392f89c5e495","code_sha256_prefix":"c1d6392f89c5e495","mcp_get_code":{"code_sha256":"c1d6392f89c5e495"}},{"arxiv_id":"1804.00099","arxiv_id_is_arxiv":true,"paper":"/paper/graph-convolutional-neural-networks-via-1","title":"Graph Convolutional Neural Networks via Scattering","date":"2018-03-31","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,"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":"c1d6392f89c5e495","code_sha256_prefix":"c1d6392f89c5e495","mcp_get_code":{"code_sha256":"c1d6392f89c5e495"}},{"arxiv_id":"1804.00099","arxiv_id_is_arxiv":true,"paper":"/paper/graph-convolutional-neural-networks-via-1","title":"Graph Convolutional Neural Networks via Scattering","date":"2018-03-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dmzou/SCAT","path":"trainCora.py","file_url":"https://github.com/dmzou/SCAT/blob/HEAD/trainCora.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"5c3fa9402a9405bc","code_sha256_prefix":"5c3fa9402a9405bc","mcp_get_code":{"code_sha256":"5c3fa9402a9405bc"}},{"arxiv_id":"1802.08773","arxiv_id_is_arxiv":true,"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":"data.py","file_url":"https://github.com/snap-stanford/GraphRNN/blob/HEAD/data.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"5c3fa9402a9405bc","code_sha256_prefix":"5c3fa9402a9405bc","mcp_get_code":{"code_sha256":"5c3fa9402a9405bc"}},{"arxiv_id":"1710.10903","arxiv_id_is_arxiv":true,"paper":"/paper/graph-attention-networks","title":"Graph Attention Networks","date":"2017-10-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"404nofound/gat","path":"utils/process.py","file_url":"https://github.com/404nofound/gat/blob/HEAD/utils/process.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","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 DSL-Lab/Specformer, and GPL-3.0, as GitHub detects it on that repository, is not in the permissive set Syntology serves inline","code_sha256":"c1d6392f89c5e495","code_sha256_prefix":"c1d6392f89c5e495","mcp_get_code":{"code_sha256":"c1d6392f89c5e495"}},{"arxiv_id":"1710.10568","arxiv_id_is_arxiv":true,"paper":"/paper/stochastic-training-of-graph-convolutional","title":"Stochastic Training of Graph Convolutional Networks with Variance Reduction","date":"2017-10-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"thu-ml/stochastic_gcn","path":"gcn/utils.py","file_url":"https://github.com/thu-ml/stochastic_gcn/blob/HEAD/gcn/utils.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","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 DSL-Lab/Specformer, and GPL-3.0, as GitHub detects it on that repository, is not in the permissive set Syntology serves inline","code_sha256":"c1d6392f89c5e495","code_sha256_prefix":"c1d6392f89c5e495","mcp_get_code":{"code_sha256":"c1d6392f89c5e495"}},{"arxiv_id":"1611.07308","arxiv_id_is_arxiv":true,"paper":"/paper/variational-graph-auto-encoders","title":"Variational Graph Auto-Encoders","date":"2016-11-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Omairss/RepresentationLearning","path":"src/input_data.py","file_url":"https://github.com/Omairss/RepresentationLearning/blob/HEAD/src/input_data.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"5c3fa9402a9405bc","code_sha256_prefix":"5c3fa9402a9405bc","mcp_get_code":{"code_sha256":"5c3fa9402a9405bc"}},{"arxiv_id":"1603.08861","arxiv_id_is_arxiv":true,"paper":"/paper/revisiting-semi-supervised-learning-with","title":"Revisiting Semi-Supervised Learning with Graph Embeddings","date":"2016-03-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"asarigun/la-gcn-tensorflow","path":"utils.py","file_url":"https://github.com/asarigun/la-gcn-tensorflow/blob/HEAD/utils.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","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 DSL-Lab/Specformer, and GPL-3.0, as GitHub detects it on that repository, is not in the permissive set Syntology serves inline","code_sha256":"c1d6392f89c5e495","code_sha256_prefix":"c1d6392f89c5e495","mcp_get_code":{"code_sha256":"c1d6392f89c5e495"}},{"arxiv_id":"ijcai2022_0498","arxiv_id_is_arxiv":false,"paper":null,"title":"IJCAI id ijcai2022_0498","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"xinxingwu-uk/DGAE","path":"Python/Models/dgae_alpha/input_data.py","file_url":"https://github.com/xinxingwu-uk/DGAE/blob/HEAD/Python/Models/dgae_alpha/input_data.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"5c3fa9402a9405bc","code_sha256_prefix":"5c3fa9402a9405bc","mcp_get_code":{"code_sha256":"5c3fa9402a9405bc"}},{"arxiv_id":"aaai_20873","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_20873","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"RICE-EIC/Early-Bird-GCN","path":"gcn/utils.py","file_url":"https://github.com/RICE-EIC/Early-Bird-GCN/blob/HEAD/gcn/utils.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","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 DSL-Lab/Specformer, and GPL-3.0, as GitHub detects it on that repository, is not in the permissive set Syntology serves inline","code_sha256":"c1d6392f89c5e495","code_sha256_prefix":"c1d6392f89c5e495","mcp_get_code":{"code_sha256":"c1d6392f89c5e495"}},{"arxiv_id":"aaai_20664","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_20664","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"jumxglhf/AKGNN","path":"utils.py","file_url":"https://github.com/jumxglhf/AKGNN/blob/HEAD/utils.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"5c3fa9402a9405bc","code_sha256_prefix":"5c3fa9402a9405bc","mcp_get_code":{"code_sha256":"5c3fa9402a9405bc"}}],"record_sha256":"3705b822fccc28db6744e5ea4aea2b0a0aba6cfd13eaa88be2e3fb35e14a9bdc","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}