{"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/gcn","entry":"GCN","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":41,"n_papers_ran":35,"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":52,"n_samples_ran":40,"n_samples_fingerprinted":0,"n_places":52,"n_places_pointer_only":28,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":40,"unverified":12},"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":"2606.12494","paper":"/paper/arxiv-2606-12494","title":"Net-Ev <sup>2</sup> : A Generative Simulator for Network Event Evolution","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"Guangyu4/Net-Ev-2","path":"model/denoiser/graphunet.py","file_url":"https://github.com/Guangyu4/Net-Ev-2/blob/HEAD/model/denoiser/graphunet.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"62946b23619fce10","mcp_get_code":{"code_sha256":"62946b23619fce10"}},{"arxiv_id":"2603.08032","paper":"/paper/arxiv-2603-08032","title":"GCGNet: Graph-Consistent Generative Network for Time Series Forecasting with Exogenous Variables","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"decisionintelligence/GCGNet","path":"ts_benchmark/baselines/GCGNet/models/gcgnet_model.py","file_url":"https://github.com/decisionintelligence/GCGNet/blob/HEAD/ts_benchmark/baselines/GCGNet/models/gcgnet_model.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"39a5436e3ee292c2","mcp_get_code":{"code_sha256":"39a5436e3ee292c2"}},{"arxiv_id":"2602.19113","paper":"/paper/arxiv-2602-19113","title":"Learning from Complexity: Exploring Dynamic Sample Pruning of Spatio-Temporal Training","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"HKUDS/OpenCity","path":"model/OpenCity/OpenCity.py","file_url":"https://github.com/HKUDS/OpenCity/blob/HEAD/model/OpenCity/OpenCity.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"e7c52aa258e7a375","mcp_get_code":{"code_sha256":"e7c52aa258e7a375"}},{"arxiv_id":"2601.23114","paper":"/paper/arxiv-2601-23114","title":"To See Far, Look Close: Evolutionary Forecasting for Long-term Time Series","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"thuml/Time-Series-Library","path":"layers/TimeFilter_layers.py","file_url":"https://github.com/thuml/Time-Series-Library/blob/HEAD/layers/TimeFilter_layers.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"34b6b2e28760f4dd","mcp_get_code":{"code_sha256":"34b6b2e28760f4dd"}},{"arxiv_id":"2601.17469","paper":"/paper/arxiv-2601-17469","title":"Identifying and Correcting Label Noise for Robust GNNs via Influence Contradiction","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"wayc04/ICGNN","path":"models/ICGNN.py","file_url":"https://github.com/wayc04/ICGNN/blob/HEAD/models/ICGNN.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"f2d0c1a5222074f3","mcp_get_code":{"code_sha256":"f2d0c1a5222074f3"}},{"arxiv_id":"2601.05137","paper":"/paper/arxiv-2601-05137","title":"Neural Algorithmic Reasoning for Approximate k-Coloring with Recursive Warm Starts","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"Weber-GeoML/ColoringGNNs","path":"full_gcn.py","file_url":"https://github.com/Weber-GeoML/ColoringGNNs/blob/HEAD/full_gcn.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"d09c53ccad3af850","mcp_get_code":{"code_sha256":"d09c53ccad3af850"}},{"arxiv_id":"2507.04428","paper":null,"title":"arXiv:2507.04428","date":null,"month_inferred_from_arxiv_id":"2025-07","title_source":null,"repo":"seucoin/armr2","path":"code/net_mynet.py","file_url":"https://github.com/seucoin/armr2/blob/HEAD/code/net_mynet.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"26ddda9bcd436585","mcp_get_code":{"code_sha256":"26ddda9bcd436585"}},{"arxiv_id":"2503.17908","paper":"/paper/does-gcl-need-a-large-number-of-negative","title":"Does GCL Need a Large Number of Negative Samples? Enhancing Graph Contrastive Learning with Effective and Efficient Negative Sampling","date":"2025-03-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hedongxiao-tju/E2Neg","path":"networks.py","file_url":"https://github.com/hedongxiao-tju/E2Neg/blob/HEAD/networks.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"9d155ed296a822ef","mcp_get_code":{"code_sha256":"9d155ed296a822ef"}},{"arxiv_id":"2501.09214","paper":"/paper/boosting-short-text-classification-with-multi","title":"Boosting Short Text Classification with Multi-Source Information Exploration and Dual-Level Contrastive Learning","date":"2025-01-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"KEAML-JLU/MI-DELIGHT","path":"model.py","file_url":"https://github.com/KEAML-JLU/MI-DELIGHT/blob/HEAD/model.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"07c6e57b53549592","mcp_get_code":{"code_sha256":"07c6e57b53549592"}},{"arxiv_id":"2411.12164","paper":"/paper/urbandit-a-foundation-model-for-open-world","title":"UrbanDiT: A Foundation Model for Open-World Urban Spatio-Temporal Learning","date":"2024-11-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"YuanYuan98/UrbanDiT","path":"src/Embed.py","file_url":"https://github.com/YuanYuan98/UrbanDiT/blob/HEAD/src/Embed.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"85748648fb97ed30","mcp_get_code":{"code_sha256":"85748648fb97ed30"}},{"arxiv_id":"2410.13761","paper":"/paper/gder-safeguarding-efficiency-balancing-and","title":"GDeR: Safeguarding Efficiency, Balancing, and Robustness via Prototypical Graph Pruning","date":"2024-10-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ins1stenc3/gder","path":"models/GNN_Prot.py","file_url":"https://github.com/ins1stenc3/gder/blob/HEAD/models/GNN_Prot.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"a5dc35fe4c7efb79","mcp_get_code":{"code_sha256":"a5dc35fe4c7efb79"}},{"arxiv_id":"2410.03396","paper":"/paper/graphcroc-cross-correlation-autoencoder-for","title":"GraphCroc: Cross-Correlation Autoencoder for Graph Structural Reconstruction","date":"2024-10-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sjduan/graphcroc","path":"GraphCroc/UNET.py","file_url":"https://github.com/sjduan/graphcroc/blob/HEAD/GraphCroc/UNET.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"9740f77d46c19ea2","mcp_get_code":{"code_sha256":"9740f77d46c19ea2"}},{"arxiv_id":"2407.16168","paper":"/paper/progressively-modality-freezing-for-multi","title":"Progressively Modality Freezing for Multi-Modal Entity Alignment","date":"2024-07-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ninibymilk/PMF-MMEA","path":"model/PMF.py","file_url":"https://github.com/ninibymilk/PMF-MMEA/blob/HEAD/model/PMF.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"55399663a530eb02","mcp_get_code":{"code_sha256":"55399663a530eb02"}},{"arxiv_id":"2405.03342","paper":"/paper/doubly-robust-causal-effect-estimation-under","title":"Doubly Robust Causal Effect Estimation under Networked Interference via Targeted Learning","date":"2024-05-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"WeilinChen507/targeted_interference","path":"src/targetedModel_DoubleBSpline.py","file_url":"https://github.com/WeilinChen507/targeted_interference/blob/HEAD/src/targetedModel_DoubleBSpline.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"fcebe99277bfcf79","mcp_get_code":{"code_sha256":"fcebe99277bfcf79"}},{"arxiv_id":"2402.19302","paper":"/paper/diffassemble-a-unified-graph-diffusion-model","title":"DiffAssemble: A Unified Graph-Diffusion Model for 2D and 3D Reassembly","date":"2024-02-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"iit-pavis/diffassemble","path":"puzzle_diff/model/spatial_diffusion.py","file_url":"https://github.com/iit-pavis/diffassemble/blob/HEAD/puzzle_diff/model/spatial_diffusion.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"853fb3e8375b1a22","mcp_get_code":{"code_sha256":"853fb3e8375b1a22"}},{"arxiv_id":"2402.11887","paper":"/paper/generative-semi-supervised-graph-anomaly","title":"Generative Semi-supervised Graph Anomaly Detection","date":"2024-02-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mala-lab/ggad","path":"model.py","file_url":"https://github.com/mala-lab/ggad/blob/HEAD/model.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"02c6a5361e2291b2","mcp_get_code":{"code_sha256":"02c6a5361e2291b2"}},{"arxiv_id":"2402.05660","paper":"/paper/rethinking-propagation-for-unsupervised-graph","title":"Rethinking Propagation for Unsupervised Graph Domain Adaptation","date":"2024-02-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yuntaodu/ASN","path":"GCN_model.py","file_url":"https://github.com/yuntaodu/ASN/blob/HEAD/GCN_model.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"45631a7bbd6520e3","mcp_get_code":{"code_sha256":"45631a7bbd6520e3"}},{"arxiv_id":"2401.17838","paper":"/paper/a-cross-view-hierarchical-graph-learning","title":"A Cross-View Hierarchical Graph Learning Hypernetwork for Skill Demand-Supply Joint Prediction","date":"2024-01-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vincent40416/Skill-Demand-Supply-Joint-Prediction","path":"model/model.py","file_url":"https://github.com/vincent40416/Skill-Demand-Supply-Joint-Prediction/blob/HEAD/model/model.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"dc88208677870e3b","mcp_get_code":{"code_sha256":"dc88208677870e3b"}},{"arxiv_id":"2401.01232","paper":"/paper/motif-aware-riemannian-graph-neural-network","title":"Motif-aware Riemannian Graph Neural Network with Generative-Contrastive Learning","date":"2024-01-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"riemanngraph/motifrgc","path":"models.py","file_url":"https://github.com/riemanngraph/motifrgc/blob/HEAD/models.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"edd81c40e27d23fc","mcp_get_code":{"code_sha256":"edd81c40e27d23fc"}},{"arxiv_id":"2301.08834","paper":"/paper/manydg-many-domain-generalization-for","title":"ManyDG: Many-domain Generalization for Healthcare Applications","date":"2023-01-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ycq091044/manydg","path":"model.py","file_url":"https://github.com/ycq091044/manydg/blob/HEAD/model.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"c7c1528707c4390d","mcp_get_code":{"code_sha256":"c7c1528707c4390d"}},{"arxiv_id":"2208.00368","paper":"/paper/skeleton-parted-graph-scattering-networks-for","title":"Skeleton-Parted Graph Scattering Networks for 3D Human Motion Prediction","date":"2022-07-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mediabrain-sjtu/spgsn","path":"utils/model.py","file_url":"https://github.com/mediabrain-sjtu/spgsn/blob/HEAD/utils/model.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"3a3dcd4a64e7301e","mcp_get_code":{"code_sha256":"3a3dcd4a64e7301e"}},{"arxiv_id":"2204.13846","paper":"/paper/rosa-a-robust-self-aligned-framework-for-node","title":"RoSA: A Robust Self-Aligned Framework for Node-Node Graph Contrastive Learning","date":"2022-04-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ZhuYun97/RoSA","path":"model.py","file_url":"https://github.com/ZhuYun97/RoSA/blob/HEAD/model.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"3f0d2666f360c676","mcp_get_code":{"code_sha256":"3f0d2666f360c676"}},{"arxiv_id":"2202.03857","paper":"/paper/learning-optical-flow-with-adaptive-graph","title":"Learning Optical Flow with Adaptive Graph Reasoning","date":"2022-02-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"la30/agflow","path":"core/raft_agflow.py","file_url":"https://github.com/la30/agflow/blob/HEAD/core/raft_agflow.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"3579f23825ccf5e7","mcp_get_code":{"code_sha256":"3579f23825ccf5e7"}},{"arxiv_id":"2112.04159","paper":"/paper/garment4d-garment-reconstruction-from-point-1","title":"Garment4D: Garment Reconstruction from Point Cloud Sequences","date":"2021-12-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hongfz16/garment4d","path":"modules/pygcn/models.py","file_url":"https://github.com/hongfz16/garment4d/blob/HEAD/modules/pygcn/models.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"894337f9c48ffee7","mcp_get_code":{"code_sha256":"894337f9c48ffee7"}},{"arxiv_id":"2109.05213","paper":"/paper/uncovering-main-causalities-for-long-tailed","title":"Uncovering Main Causalities for Long-tailed Information Extraction","date":"2021-09-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"HeyyyyyyG/CFIE","path":"model/gcn.py","file_url":"https://github.com/HeyyyyyyG/CFIE/blob/HEAD/model/gcn.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"GPL-3.0","inline_ok":false,"code_sha256_prefix":"cea456feff8df57e","mcp_get_code":{"code_sha256":"cea456feff8df57e"}},{"arxiv_id":"2106.10446","paper":"/paper/attend-what-you-need-motion-appearance","title":"Attend What You Need: Motion-Appearance Synergistic Networks for Video Question Answering","date":"2021-06-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ahjeongseo/MASN-pytorch","path":"model/masn.py","file_url":"https://github.com/ahjeongseo/MASN-pytorch/blob/HEAD/model/masn.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"b86d984ed27f78a4","mcp_get_code":{"code_sha256":"b86d984ed27f78a4"}},{"arxiv_id":"2106.08630","paper":"/paper/help-hardware-adaptive-efficient-latency","title":"HELP: Hardware-Adaptive Efficient Latency Prediction for NAS via Meta-Learning","date":"2021-06-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hayeonlee/help","path":"help.py","file_url":"https://github.com/hayeonlee/help/blob/HEAD/help.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"71fc6adbc8a9e344","mcp_get_code":{"code_sha256":"71fc6adbc8a9e344"}},{"arxiv_id":"2105.11776","paper":"/paper/dynamic-semantic-graph-construction-and","title":"Dynamic Semantic Graph Construction and Reasoning for Explainable Multi-hop Science Question Answering","date":"2021-05-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wwxu21/AMR-SG","path":"RoBERTa_finetune/transformers_amr/modeling_bert.py","file_url":"https://github.com/wwxu21/AMR-SG/blob/HEAD/RoBERTa_finetune/transformers_amr/modeling_bert.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"fc31b6dfd485b025","mcp_get_code":{"code_sha256":"fc31b6dfd485b025"}},{"arxiv_id":"2103.15734","paper":"/paper/enhanced-boundary-learning-for-glass-like","title":"Enhanced Boundary Learning for Glass-like Object Segmentation","date":"2021-03-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hehao13/EBLNet","path":"network/nn/contour_point_gcn.py","file_url":"https://github.com/hehao13/EBLNet/blob/HEAD/network/nn/contour_point_gcn.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"b934d7ff5b5f6a1b","mcp_get_code":{"code_sha256":"b934d7ff5b5f6a1b"}},{"arxiv_id":"2103.14581","paper":"/paper/non-salient-region-object-mining-for-weakly","title":"Non-Salient Region Object Mining for Weakly Supervised Semantic Segmentation","date":"2021-03-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"NUST-Machine-Intelligence-Laboratory/nsrom","path":"classification/models/global_reasoning_unit.py","file_url":"https://github.com/NUST-Machine-Intelligence-Laboratory/nsrom/blob/HEAD/classification/models/global_reasoning_unit.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"13a9404d25c1e993","mcp_get_code":{"code_sha256":"13a9404d25c1e993"}},{"arxiv_id":"2103.13225","paper":"/paper/structure-aware-face-clustering-on-a-large","title":"Structure-Aware Face Clustering on a Large-Scale Graph with $\\bf{10^{7}}$ Nodes","date":"2021-03-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sstzal/STAR-FC","path":"src/models/gcn.py","file_url":"https://github.com/sstzal/STAR-FC/blob/HEAD/src/models/gcn.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"6ced2555b3d088d4","mcp_get_code":{"code_sha256":"6ced2555b3d088d4"}},{"arxiv_id":"2103.07889","paper":"/paper/learning-a-proposal-classifier-for-multiple","title":"Learning a Proposal Classifier for Multiple Object Tracking","date":"2021-03-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"daip13/LPC_MOT","path":"learnable_proposal_classifier/gcn_based_purity_network/dsgcn/models/dsgcn.py","file_url":"https://github.com/daip13/LPC_MOT/blob/HEAD/learnable_proposal_classifier/gcn_based_purity_network/dsgcn/models/dsgcn.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"748441f5b0d1ba43","mcp_get_code":{"code_sha256":"748441f5b0d1ba43"}},{"arxiv_id":"2103.05471","paper":"/paper/contrastive-neural-architecture-search-with","title":"Contrastive Neural Architecture Search with Neural Architecture Comparators","date":"2021-03-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"chenyaofo/CTNAS","path":"ctnas/core/model/nac.py","file_url":"https://github.com/chenyaofo/CTNAS/blob/HEAD/ctnas/core/model/nac.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"code_sha256_prefix":"0174c3008a632396","mcp_get_code":{"code_sha256":"0174c3008a632396"}},{"arxiv_id":"2102.01987","paper":"/paper/learning-graph-embeddings-for-compositional","title":"Learning Graph Embeddings for Compositional Zero-shot Learning","date":"2021-02-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ExplainableML/czsl","path":"models/graph_method.py","file_url":"https://github.com/ExplainableML/czsl/blob/HEAD/models/graph_method.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"GPL-3.0","inline_ok":false,"code_sha256_prefix":"a4c3261e9df16697","mcp_get_code":{"code_sha256":"a4c3261e9df16697"}},{"arxiv_id":"2101.12555","paper":"/paper/out-of-town-recommendation-with-travel","title":"Out-of-Town Recommendation with Travel Intention Modeling","date":"2021-01-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xhran2010/TrainOR_AAAI21","path":"Pytorch/model.py","file_url":"https://github.com/xhran2010/TrainOR_AAAI21/blob/HEAD/Pytorch/model.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"06566e2ba6b870c8","mcp_get_code":{"code_sha256":"06566e2ba6b870c8"}},{"arxiv_id":"2007.03778","paper":"/paper/3d-shape-reconstruction-from-vision-and-touch","title":"3D Shape Reconstruction from Vision and Touch","date":"2020-07-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"facebookresearch/3D-Vision-and-Touch","path":"vision_charts/models.py","file_url":"https://github.com/facebookresearch/3D-Vision-and-Touch/blob/HEAD/vision_charts/models.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"code_sha256_prefix":"dadbe75f331a2b52","mcp_get_code":{"code_sha256":"dadbe75f331a2b52"}},{"arxiv_id":"2006.05582","paper":"/paper/contrastive-multi-view-representation","title":"Contrastive Multi-View Representation Learning on Graphs","date":"2020-06-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"timothewt/AdvancedGraphClustering","path":"src/algorithms/deep/MVGRL.py","file_url":"https://github.com/timothewt/AdvancedGraphClustering/blob/HEAD/src/algorithms/deep/MVGRL.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"8dc21381dd6d399e","mcp_get_code":{"code_sha256":"8dc21381dd6d399e"}},{"arxiv_id":"2002.09405","paper":"/paper/learning-to-simulate-complex-physics-with","title":"Learning to Simulate Complex Physics with Graph Networks","date":"2020-02-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"m-ulmestrand/gcn-collisions","path":"physics_gnn.py","file_url":"https://github.com/m-ulmestrand/gcn-collisions/blob/HEAD/physics_gnn.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"6ddd7d872c5465bd","mcp_get_code":{"code_sha256":"6ddd7d872c5465bd"}},{"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":"wwwyyun/HDGI","path":"models/dgi.py","file_url":"https://github.com/wwwyyun/HDGI/blob/HEAD/models/dgi.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"5fd25f0307b96798","mcp_get_code":{"code_sha256":"5fd25f0307b96798"}},{"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":"zpeng27/GMI","path":"models/gmi.py","file_url":"https://github.com/zpeng27/GMI/blob/HEAD/models/gmi.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"1efc738df1839678","mcp_get_code":{"code_sha256":"1efc738df1839678"}},{"arxiv_id":"1609.02907","paper":"/paper/semi-supervised-classification-with-graph","title":"Semi-Supervised Classification with Graph Convolutional Networks","date":"2016-09-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"LouisDumont/GCN---re-implementation","path":"gcn.py","file_url":"https://github.com/LouisDumont/GCN---re-implementation/blob/HEAD/gcn.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"c58cace7f8be77e2","mcp_get_code":{"code_sha256":"c58cace7f8be77e2"}},{"arxiv_id":"1609.02907","paper":"/paper/semi-supervised-classification-with-graph","title":"Semi-Supervised Classification with Graph Convolutional Networks","date":"2016-09-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mahendrathapa/graph-convolution-network","path":"src/model/gcn.py","file_url":"https://github.com/mahendrathapa/graph-convolution-network/blob/HEAD/src/model/gcn.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"7ad60a09b8387891","mcp_get_code":{"code_sha256":"7ad60a09b8387891"}},{"arxiv_id":"1609.02907","paper":"/paper/semi-supervised-classification-with-graph","title":"Semi-Supervised Classification with Graph Convolutional Networks","date":"2016-09-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"HoganZhang/pygcn_python3","path":"pygcn/models.py","file_url":"https://github.com/HoganZhang/pygcn_python3/blob/HEAD/pygcn/models.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"c6a324398743dc52","mcp_get_code":{"code_sha256":"c6a324398743dc52"}},{"arxiv_id":"1609.02907","paper":"/paper/semi-supervised-classification-with-graph","title":"Semi-Supervised Classification with Graph Convolutional Networks","date":"2016-09-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"toinesayan/node-classification-and-label-dependencies","path":"models/gcn.py","file_url":"https://github.com/toinesayan/node-classification-and-label-dependencies/blob/HEAD/models/gcn.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"68f1d06e5c89108e","mcp_get_code":{"code_sha256":"68f1d06e5c89108e"}},{"arxiv_id":"1609.02907","paper":"/paper/semi-supervised-classification-with-graph","title":"Semi-Supervised Classification with Graph Convolutional Networks","date":"2016-09-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yCobanoglu/infinite-width-gnns","path":"gnn/models/node_classification/gcn.py","file_url":"https://github.com/yCobanoglu/infinite-width-gnns/blob/HEAD/gnn/models/node_classification/gcn.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"b28cd994482b4d0a","mcp_get_code":{"code_sha256":"b28cd994482b4d0a"}},{"arxiv_id":"1609.02907","paper":"/paper/semi-supervised-classification-with-graph","title":"Semi-Supervised Classification with Graph Convolutional Networks","date":"2016-09-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"1075225782/GCN","path":"GCN/gcnpy/models.py","file_url":"https://github.com/1075225782/GCN/blob/HEAD/GCN/gcnpy/models.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"9ae4971fbc72a790","mcp_get_code":{"code_sha256":"9ae4971fbc72a790"}},{"arxiv_id":"1609.02907","paper":"/paper/semi-supervised-classification-with-graph","title":"Semi-Supervised Classification with Graph Convolutional Networks","date":"2016-09-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bepping/non-oversmoothing-gcns","path":"src/GCN_methods/models.py","file_url":"https://github.com/bepping/non-oversmoothing-gcns/blob/HEAD/src/GCN_methods/models.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"33c9884171e760fd","mcp_get_code":{"code_sha256":"33c9884171e760fd"}},{"arxiv_id":"1609.02907","paper":"/paper/semi-supervised-classification-with-graph","title":"Semi-Supervised Classification with Graph Convolutional Networks","date":"2016-09-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hazdzz/GCN","path":"model/models.py","file_url":"https://github.com/hazdzz/GCN/blob/HEAD/model/models.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"LGPL-2.1","inline_ok":false,"code_sha256_prefix":"c8a2116bdd54211d","mcp_get_code":{"code_sha256":"c8a2116bdd54211d"}},{"arxiv_id":"1609.02907","paper":"/paper/semi-supervised-classification-with-graph","title":"Semi-Supervised Classification with Graph Convolutional Networks","date":"2016-09-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"HamzaGbada/GCN-Numpy","path":"core/GCN_scratch/model.py","file_url":"https://github.com/HamzaGbada/GCN-Numpy/blob/HEAD/core/GCN_scratch/model.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"720119c339f1a7f9","mcp_get_code":{"code_sha256":"720119c339f1a7f9"}},{"arxiv_id":"1609.02907","paper":"/paper/semi-supervised-classification-with-graph","title":"Semi-Supervised Classification with Graph Convolutional Networks","date":"2016-09-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"basiralab/RG-Select","path":"models_gcn.py","file_url":"https://github.com/basiralab/RG-Select/blob/HEAD/models_gcn.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"0a27b9c97ef96c4c","mcp_get_code":{"code_sha256":"0a27b9c97ef96c4c"}},{"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":"meliketoy/graph-cnn.pytorch","path":"models.py","file_url":"https://github.com/meliketoy/graph-cnn.pytorch/blob/HEAD/models.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"f224b63a7a7463d9","mcp_get_code":{"code_sha256":"f224b63a7a7463d9"}},{"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/nfc-gcn","path":"models.py","file_url":"https://github.com/asarigun/nfc-gcn/blob/HEAD/models.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"0da98822521f5a66","mcp_get_code":{"code_sha256":"0da98822521f5a66"}}]}