{"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/sample-mask","entry":"sample_mask","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":39,"n_papers_ran":32,"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":13,"n_samples_ran":6,"n_samples_fingerprinted":1,"n_places":39,"n_places_pointer_only":13,"by_status":{"ran_honours":0,"ran_violates":1,"ran_draft_wrong":4,"ran_fixture":0,"ran":1,"unverified":7},"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":"2412.09902","paper":"/paper/one-node-one-model-featuring-the-missing-half","title":"One Node One Model: Featuring the Missing-Half for Graph Clustering","date":"2024-12-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xiexuanting/fpgc","path":"FPGC-main/utils.py","file_url":"https://github.com/xiexuanting/fpgc/blob/HEAD/FPGC-main/utils.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"b32fd748b4bbe3bf","mcp_get_code":{"code_sha256":"b32fd748b4bbe3bf"}},{"arxiv_id":"2406.09870","paper":"/paper/igl-bench-establishing-the-comprehensive","title":"IGL-Bench: Establishing the Comprehensive Benchmark for Imbalanced Graph Learning","date":"2024-06-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"RingBDStack/IGL-Bench","path":"IGL_Bench/algorithm/DEMONet/util.py","file_url":"https://github.com/RingBDStack/IGL-Bench/blob/HEAD/IGL_Bench/algorithm/DEMONet/util.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"03c26d27b6d12de7","mcp_get_code":{"code_sha256":"03c26d27b6d12de7"}},{"arxiv_id":"2311.01196","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_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"b32fd748b4bbe3bf","mcp_get_code":{"code_sha256":"b32fd748b4bbe3bf"}},{"arxiv_id":"2310.18884","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_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"b32fd748b4bbe3bf","mcp_get_code":{"code_sha256":"b32fd748b4bbe3bf"}},{"arxiv_id":"2308.08963","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_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"b32fd748b4bbe3bf","mcp_get_code":{"code_sha256":"b32fd748b4bbe3bf"}},{"arxiv_id":"2302.01757","paper":"/paper/rs-del-edit-distance-robustness-certificates-1","title":"RS-Del: Edit Distance Robustness Certificates for Sequence Classifiers via Randomized Deletion","date":"2023-01-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dovermore/randomized-deletion","path":"src/torchmalware/certification/masking_mech.py","file_url":"https://github.com/dovermore/randomized-deletion/blob/HEAD/src/torchmalware/certification/masking_mech.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"fc750dd2d5bc8304","mcp_get_code":{"code_sha256":"fc750dd2d5bc8304"}},{"arxiv_id":"2210.12765","paper":"/paper/multi-objective-gflownets","title":"Multi-Objective GFlowNets","date":"2022-10-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"samuelstanton/lambo","path":"lambo/models/mlm.py","file_url":"https://github.com/samuelstanton/lambo/blob/HEAD/lambo/models/mlm.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"30a113efdcdd9ae4","mcp_get_code":{"code_sha256":"30a113efdcdd9ae4"}},{"arxiv_id":"2208.07012","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_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"MIT","inline_ok":false,"code_sha256_prefix":"b32fd748b4bbe3bf","mcp_get_code":{"code_sha256":"b32fd748b4bbe3bf"}},{"arxiv_id":"2206.04285","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_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"b32fd748b4bbe3bf","mcp_get_code":{"code_sha256":"b32fd748b4bbe3bf"}},{"arxiv_id":"2204.05351","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_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"b32fd748b4bbe3bf","mcp_get_code":{"code_sha256":"b32fd748b4bbe3bf"}},{"arxiv_id":"2203.00199","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_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"b32fd748b4bbe3bf","mcp_get_code":{"code_sha256":"b32fd748b4bbe3bf"}},{"arxiv_id":"2202.08516","paper":"/paper/saits-self-attention-based-imputation-for","title":"SAITS: Self-Attention-based Imputation for Time Series","date":"2022-02-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gorgen2020/LSSDM_imputation","path":"dataset_pemsbay.py","file_url":"https://github.com/gorgen2020/LSSDM_imputation/blob/HEAD/dataset_pemsbay.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"353b5cb711bb921e","mcp_get_code":{"code_sha256":"353b5cb711bb921e"}},{"arxiv_id":"2201.06367","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_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"b32fd748b4bbe3bf","mcp_get_code":{"code_sha256":"b32fd748b4bbe3bf"}},{"arxiv_id":"2106.08171","paper":"/paper/evaluating-modules-in-graph-contrastive","title":"Evaluating Modules in Graph Contrastive Learning","date":"2021-06-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"thunlp/opengcl","path":"src/opengcl/datasets/planetoid_dataset.py","file_url":"https://github.com/thunlp/opengcl/blob/HEAD/src/opengcl/datasets/planetoid_dataset.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"8168a1e07d2c4a1f","mcp_get_code":{"code_sha256":"8168a1e07d2c4a1f"}},{"arxiv_id":"2104.07892","paper":"/paper/higher-order-attribute-enhancing","title":"Higher-Order Attribute-Enhancing Heterogeneous Graph Neural Networks","date":"2021-04-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"RingBDStack/HAE","path":"HAE_GATGAT/execute_cora.py","file_url":"https://github.com/RingBDStack/HAE/blob/HEAD/HAE_GATGAT/execute_cora.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"72ba653e4f5592f9","mcp_get_code":{"code_sha256":"72ba653e4f5592f9"}},{"arxiv_id":"2103.15619","paper":"/paper/setvae-learning-hierarchical-composition-for","title":"SetVAE: Learning Hierarchical Composition for Generative Modeling of Set-Structured Data","date":"2021-03-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jw9730/setvae","path":"models/networks.py","file_url":"https://github.com/jw9730/setvae/blob/HEAD/models/networks.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"f3ac4b1a18df2e8f","mcp_get_code":{"code_sha256":"f3ac4b1a18df2e8f"}},{"arxiv_id":"2010.12783","paper":"/paper/uncertainty-aware-semi-supervised-learning-on","title":"Uncertainty Aware Semi-Supervised Learning on Graph Data","date":"2020-10-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":null,"inline_ok":false,"code_sha256_prefix":"b32fd748b4bbe3bf","mcp_get_code":{"code_sha256":"b32fd748b4bbe3bf"}},{"arxiv_id":"2008.02457","paper":"/paper/graph-convolutional-networks-for-1","title":"Graph Convolutional Networks for Hyperspectral Image Classification","date":"2020-08-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":null,"inline_ok":false,"code_sha256_prefix":"b32fd748b4bbe3bf","mcp_get_code":{"code_sha256":"b32fd748b4bbe3bf"}},{"arxiv_id":"2006.11468","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_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"b32fd748b4bbe3bf","mcp_get_code":{"code_sha256":"b32fd748b4bbe3bf"}},{"arxiv_id":"2006.05806","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_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"b32fd748b4bbe3bf","mcp_get_code":{"code_sha256":"b32fd748b4bbe3bf"}},{"arxiv_id":"2002.05287","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_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"61cb7d8c95b55c0c","mcp_get_code":{"code_sha256":"61cb7d8c95b55c0c"}},{"arxiv_id":"2002.02798","paper":"/paper/how-to-train-your-neural-ode","title":"How to train your neural ODE: the world of Jacobian and kinetic regularization","date":"2020-02-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"D-hash-code/ffjord-rnode-finalweek-mnist","path":"lib/layers/coupling.py","file_url":"https://github.com/D-hash-code/ffjord-rnode-finalweek-mnist/blob/HEAD/lib/layers/coupling.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"3a7bef4c55086f50","mcp_get_code":{"code_sha256":"3a7bef4c55086f50"}},{"arxiv_id":"1911.01731","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_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"b32fd748b4bbe3bf","mcp_get_code":{"code_sha256":"b32fd748b4bbe3bf"}},{"arxiv_id":"1908.04003","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_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"b32fd748b4bbe3bf","mcp_get_code":{"code_sha256":"b32fd748b4bbe3bf"}},{"arxiv_id":"1906.02611","paper":"/paper/improving-robustness-without-sacrificing","title":"Improving Robustness Without Sacrificing Accuracy with Patch Gaussian Augmentation","date":"2019-06-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gatheluck/PatchGaussian","path":"libs/mask.py","file_url":"https://github.com/gatheluck/PatchGaussian/blob/HEAD/libs/mask.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"0af957208b1acfa3","mcp_get_code":{"code_sha256":"0af957208b1acfa3"}},{"arxiv_id":"1905.13403","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_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"b32fd748b4bbe3bf","mcp_get_code":{"code_sha256":"b32fd748b4bbe3bf"}},{"arxiv_id":"1905.03994","paper":"/paper/predicting-path-failure-in-time-evolving","title":"Predicting Path Failure In Time-Evolving Graphs","date":"2019-05-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"chocolates/predicting-path-failure-in-time-evolving-graphs","path":"load_data.py","file_url":"https://github.com/chocolates/predicting-path-failure-in-time-evolving-graphs/blob/HEAD/load_data.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"72ba653e4f5592f9","mcp_get_code":{"code_sha256":"72ba653e4f5592f9"}},{"arxiv_id":"1903.07293","paper":"/paper/heterogeneous-graph-attention-network","title":"Heterogeneous Graph Attention Network","date":null,"month_inferred_from_arxiv_id":"2019-03","title_source":"archive","repo":"Jhy1993/HAN","path":"ex_acm3025.py","file_url":"https://github.com/Jhy1993/HAN/blob/HEAD/ex_acm3025.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"b32fd748b4bbe3bf","mcp_get_code":{"code_sha256":"b32fd748b4bbe3bf"}},{"arxiv_id":"1902.11038","paper":"/paper/multi-stage-self-supervised-learning-for","title":"Multi-Stage Self-Supervised Learning for Graph Convolutional Networks on Graphs with Few Labels","date":"2019-02-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Junseok0207/M3S_Pytorch","path":"models/M3S.py","file_url":"https://github.com/Junseok0207/M3S_Pytorch/blob/HEAD/models/M3S.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"780134f804064be1","mcp_get_code":{"code_sha256":"780134f804064be1"}},{"arxiv_id":"1902.06667","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_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"b32fd748b4bbe3bf","mcp_get_code":{"code_sha256":"b32fd748b4bbe3bf"}},{"arxiv_id":"1811.11103","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_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"MIT","inline_ok":false,"code_sha256_prefix":"b32fd748b4bbe3bf","mcp_get_code":{"code_sha256":"b32fd748b4bbe3bf"}},{"arxiv_id":"1811.02798","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_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"b32fd748b4bbe3bf","mcp_get_code":{"code_sha256":"b32fd748b4bbe3bf"}},{"arxiv_id":"1810.08437","paper":"/paper/learning-with-privileged-information-via","title":"Learning with privileged information via adversarial discriminative modality distillation","date":"2018-10-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pmorerio/admd","path":"ActionRecogDatasets/codebase/parsers.py","file_url":"https://github.com/pmorerio/admd/blob/HEAD/ActionRecogDatasets/codebase/parsers.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"b5290762a80247bb","mcp_get_code":{"code_sha256":"b5290762a80247bb"}},{"arxiv_id":"1809.10341","paper":"/paper/deep-graph-infomax","title":"Deep Graph Infomax","date":"2018-09-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dfdazac/dgi","path":"gcn/utils.py","file_url":"https://github.com/dfdazac/dgi/blob/HEAD/gcn/utils.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"b32fd748b4bbe3bf","mcp_get_code":{"code_sha256":"b32fd748b4bbe3bf"}},{"arxiv_id":"1804.00099","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_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":null,"inline_ok":false,"code_sha256_prefix":"b32fd748b4bbe3bf","mcp_get_code":{"code_sha256":"b32fd748b4bbe3bf"}},{"arxiv_id":"1710.10903","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_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"b32fd748b4bbe3bf","mcp_get_code":{"code_sha256":"b32fd748b4bbe3bf"}},{"arxiv_id":"1710.10568","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_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"b32fd748b4bbe3bf","mcp_get_code":{"code_sha256":"b32fd748b4bbe3bf"}},{"arxiv_id":"1603.08861","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_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"b32fd748b4bbe3bf","mcp_get_code":{"code_sha256":"b32fd748b4bbe3bf"}},{"arxiv_id":"aaai_20873","paper":null,"title":"arXiv: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_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"b32fd748b4bbe3bf","mcp_get_code":{"code_sha256":"b32fd748b4bbe3bf"}}]}