{"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":"/method/gcn/papers/ran/1","list_of":"/method/gcn","method":"GCN","archive":{"snapshot":"2025-07-28"},"syntology_read_at":"2026-09-28T10:30:06+00:00","order":"ran","order_definition":"only papers where Syntology ran at least one harvested sample; date (newest first), ties by arXiv id","caption":"We ran code from the paper's repository; we did not isolate this method inside it.","absence":"A paper missing from this list is not a recorded non-run: it may have no arXiv id, no harvested code, or only samples that have not run yet.","page":1,"pages_in_order":1,"rows_per_page":100,"rows":[1,94],"of":94,"counts":{"archive_papers_tagged":968,"with_a_code_link":443,"where_syntology_ran_a_sample":94,"not_listed_spam_title":0,"listed":968,"listed_where_code_ran":94,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":79,"every_run_a_failure_of_syntologys_instrument":15,"listed_with_a_run_with_no_instrument_failure":79,"listed_every_run_a_failure_of_syntologys_instrument":15,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"first_page":"/method/gcn/papers/ran/1","prev":null,"next":null,"papers":[{"paper":"/paper/unlocking-the-potential-of-classic-gnns-for","slug":"unlocking-the-potential-of-classic-gnns-for","title":"Unlocking the Potential of Classic GNNs for Graph-level Tasks: Simple Architectures Meet Excellence","date":"2025-02-13","arxiv_id":"2502.09263","n_code_links":1,"syntology":{"ran":7,"of":12,"n_ran_checked":7,"n_instrument":0,"unverified":5,"pointer_only":3,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 5 unverified","official":{"repos":["LUOyk1999/GNNPlus"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":5,"ran_from_kinds":["official"]}}},{"paper":"/paper/emt-a-novel-transformer-for-generalized-cross","slug":"emt-a-novel-transformer-for-generalized-cross","title":"EmT: A Novel Transformer for Generalized Cross-subject EEG Emotion Recognition","date":"2024-06-26","arxiv_id":"2406.18345","n_code_links":1,"syntology":{"ran":1,"of":1,"n_ran_checked":1,"n_instrument":0,"unverified":0,"pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","official":{"repos":["yi-ding-cs/emt"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/learning-divergence-fields-for-shift-robust","slug":"learning-divergence-fields-for-shift-robust","title":"Learning Divergence Fields for Shift-Robust Graph Representations","date":"2024-06-07","arxiv_id":"2406.04963","n_code_links":1,"syntology":{"ran":5,"of":8,"n_ran_checked":5,"n_instrument":0,"unverified":3,"pointer_only":8,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","official":{"repos":["fannie1208/glind"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":3,"ran_from_kinds":["official"]}}},{"paper":"/paper/fourierkan-gcf-fourier-kolmogorov-arnold","slug":"fourierkan-gcf-fourier-kolmogorov-arnold","title":"FourierKAN-GCF: Fourier Kolmogorov-Arnold Network -- An Effective and Efficient Feature Transformation for Graph Collaborative Filtering","date":"2024-06-03","arxiv_id":"2406.01034","n_code_links":1,"syntology":{"ran":1,"of":1,"n_ran_checked":1,"n_instrument":0,"unverified":0,"pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","official":{"repos":["jinfeng-xu/fkan-gcf"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/graphany-a-foundation-model-for-node","slug":"graphany-a-foundation-model-for-node","title":"Fully-inductive Node Classification on Arbitrary Graphs","date":"2024-05-30","arxiv_id":"2405.20445","n_code_links":1,"syntology":{"ran":5,"of":8,"n_ran_checked":5,"n_instrument":0,"unverified":3,"pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","official":{"repos":["deepgraphlearning/graphany"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":3,"ran_from_kinds":["official"]}}},{"paper":"/paper/bounding-the-expected-robustness-of-graph","slug":"bounding-the-expected-robustness-of-graph","title":"Bounding the Expected Robustness of Graph Neural Networks Subject to Node Feature Attacks","date":"2024-04-27","arxiv_id":"2404.17947","n_code_links":1,"syntology":{"ran":1,"of":3,"n_ran_checked":1,"n_instrument":0,"unverified":2,"pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","official":{"repos":["sennadir/gcorn"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"paper":"/paper/a-simple-and-yet-fairly-effective-defense-for","slug":"a-simple-and-yet-fairly-effective-defense-for","title":"A Simple and Yet Fairly Effective Defense for Graph Neural Networks","date":"2024-02-21","arxiv_id":"2402.13987","n_code_links":1,"syntology":{"ran":1,"of":3,"n_ran_checked":1,"n_instrument":0,"unverified":2,"pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","official":{"repos":["sennadir/noisygnn"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"paper":"/paper/it-s-never-too-late-fusing-acoustic","slug":"it-s-never-too-late-fusing-acoustic","title":"It's Never Too Late: Fusing Acoustic Information into Large Language Models for Automatic Speech Recognition","date":"2024-02-08","arxiv_id":"2402.05457","n_code_links":1,"syntology":{"ran":3,"of":6,"n_ran_checked":2,"n_instrument":1,"unverified":3,"pointer_only":1,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 0 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 3 unverified","official":null}},{"paper":"/paper/descriptive-kernel-convolution-network-with","slug":"descriptive-kernel-convolution-network-with","title":"Descriptive Kernel Convolution Network with Improved Random Walk Kernel","date":"2024-02-08","arxiv_id":"2402.06087","n_code_links":1,"syntology":{"ran":5,"of":8,"n_ran_checked":5,"n_instrument":0,"unverified":3,"pointer_only":8,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 1 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","official":{"repos":["mengchillee/rwk_plus"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":3,"ran_from_kinds":["official"]}}},{"paper":"/paper/product-manifold-representations-for-learning","slug":"product-manifold-representations-for-learning","title":"Product Manifold Representations for Learning on Biological Pathways","date":"2024-01-27","arxiv_id":"2401.15478","n_code_links":2,"syntology":{"ran":6,"of":6,"n_ran_checked":2,"n_instrument":4,"unverified":0,"pointer_only":6,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 1 violated, 1 with no contract checked; 4 where Syntology's instrument failed) · 0 unverified","official":{"repos":["mcneela/mixed-curvature-gcn","mcneela/mixed-curvature-pathways"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/cross-space-adaptive-filter-integrating-graph","slug":"cross-space-adaptive-filter-integrating-graph","title":"Cross-Space Adaptive Filter: Integrating Graph Topology and Node Attributes for Alleviating the Over-smoothing Problem","date":"2024-01-26","arxiv_id":"2401.14876","n_code_links":1,"syntology":{"ran":3,"of":3,"n_ran_checked":2,"n_instrument":1,"unverified":0,"pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","official":{"repos":["huangzichun/cross-space-adaptive-filter"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/large-language-models-are-efficient-learners","slug":"large-language-models-are-efficient-learners","title":"Large Language Models are Efficient Learners of Noise-Robust Speech Recognition","date":"2024-01-19","arxiv_id":"2401.10446","n_code_links":1,"syntology":{"ran":1,"of":1,"n_ran_checked":1,"n_instrument":0,"unverified":0,"pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","official":{"repos":["yuchen005/robustger"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/motif-aware-riemannian-graph-neural-network","slug":"motif-aware-riemannian-graph-neural-network","title":"Motif-aware Riemannian Graph Neural Network with Generative-Contrastive Learning","date":"2024-01-02","arxiv_id":"2401.01232","n_code_links":1,"syntology":{"ran":4,"of":6,"n_ran_checked":4,"n_instrument":0,"unverified":2,"pointer_only":0,"phrase":"4 ran (of which 4 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified; every one of the 4 samples that ran constructed an object rather than computing a result","official":{"repos":["riemanngraph/motifrgc"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":4,"n_ran_no_instrument_failure":4,"n_unverified":2,"ran_from_kinds":["official"]}}},{"paper":"/paper/gpt-4v-with-emotion-a-zero-shot-benchmark-for","slug":"gpt-4v-with-emotion-a-zero-shot-benchmark-for","title":"GPT-4V with Emotion: A Zero-shot Benchmark for Generalized Emotion Recognition","date":"2023-12-07","arxiv_id":"2312.04293","n_code_links":1,"syntology":{"ran":1,"of":1,"n_ran_checked":1,"n_instrument":0,"unverified":0,"pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","official":{"repos":["zeroqiaoba/gpt4v-emotion"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/deep-semi-supervised-anomaly-detection-with","slug":"deep-semi-supervised-anomaly-detection-with","title":"Label-based Graph Augmentation with Metapath for Graph Anomaly Detection","date":"2023-08-21","arxiv_id":"2308.10918","n_code_links":2,"syntology":{"ran":3,"of":4,"n_ran_checked":3,"n_instrument":0,"unverified":1,"pointer_only":4,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","official":{"repos":["missinghwan/mgad","missinghwan/MSAD"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":"/paper/gc-flow-a-graph-based-flow-network-for","slug":"gc-flow-a-graph-based-flow-network-for","title":"GC-Flow: A Graph-Based Flow Network for Effective Clustering","date":"2023-05-26","arxiv_id":"2305.17284","n_code_links":1,"syntology":{"ran":1,"of":1,"n_ran_checked":1,"n_instrument":0,"unverified":0,"pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","official":{"repos":["xztcwang/gcflow"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/commonscenes-generating-commonsense-3d-indoor","slug":"commonscenes-generating-commonsense-3d-indoor","title":"CommonScenes: Generating Commonsense 3D Indoor Scenes with Scene Graph Diffusion","date":"2023-05-25","arxiv_id":"2305.16283","n_code_links":1,"syntology":{"ran":11,"of":25,"n_ran_checked":9,"n_instrument":2,"unverified":14,"pointer_only":25,"phrase":"11 ran (of which 6 constructed an object rather than computing a result; 9 with no instrument failure: 1 honoured, 0 violated, 8 with no contract checked; 2 where Syntology's instrument failed) · 14 unverified","official":{"repos":["ymxlzgy/commonscenes"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":6,"n_ran_no_instrument_failure":9,"n_unverified":14,"ran_from_kinds":["official"]}}},{"paper":"/paper/edge-directionality-improves-learning-on","slug":"edge-directionality-improves-learning-on","title":"Edge Directionality Improves Learning on Heterophilic Graphs","date":"2023-05-17","arxiv_id":"2305.10498","n_code_links":1,"syntology":{"ran":4,"of":5,"n_ran_checked":4,"n_instrument":0,"unverified":1,"pointer_only":4,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","official":{"repos":["emalgorithm/directed-graph-neural-network"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":"/paper/best-practices-for-2-body-pose-forecasting","slug":"best-practices-for-2-body-pose-forecasting","title":"Best Practices for 2-Body Pose Forecasting","date":"2023-04-12","arxiv_id":"2304.05758","n_code_links":1,"syntology":{"ran":16,"of":17,"n_ran_checked":16,"n_instrument":0,"unverified":1,"pointer_only":3,"phrase":"16 ran (of which 0 constructed an object rather than computing a result; 16 with no instrument failure: 0 honoured, 0 violated, 16 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","official":{"repos":["edodema/BestPractices2Body"],"state":"official (archive's flag): 16 ran","n_ran":16,"n_constructed":0,"n_ran_no_instrument_failure":16,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":"/paper/meaformer-multi-modal-entity-alignment","slug":"meaformer-multi-modal-entity-alignment","title":"MEAformer: Multi-modal Entity Alignment Transformer for Meta Modality Hybrid","date":"2022-12-29","arxiv_id":"2212.14454","n_code_links":1,"syntology":{"ran":11,"of":13,"n_ran_checked":7,"n_instrument":4,"unverified":2,"pointer_only":3,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 4 where Syntology's instrument failed) · 2 unverified","official":{"repos":["zjukg/MEAformer"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":2,"ran_from_kinds":["official"]}}},{"paper":"/paper/gread-graph-neural-reaction-diffusion","slug":"gread-graph-neural-reaction-diffusion","title":"GREAD: Graph Neural Reaction-Diffusion Networks","date":"2022-11-25","arxiv_id":"2211.14208","n_code_links":1,"syntology":{"ran":9,"of":10,"n_ran_checked":6,"n_instrument":3,"unverified":1,"pointer_only":4,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 3 where Syntology's instrument failed) · 1 unverified","official":{"repos":["jeongwhanchoi/gread"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":1,"ran_from_kinds":["official","unlocated"]}}},{"paper":"/paper/uncovering-the-structural-fairness-in-graph","slug":"uncovering-the-structural-fairness-in-graph","title":"Uncovering the Structural Fairness in Graph Contrastive Learning","date":"2022-10-06","arxiv_id":"2210.03011","n_code_links":1,"syntology":{"ran":1,"of":1,"n_ran_checked":1,"n_instrument":0,"unverified":0,"pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","official":null}},{"paper":"/paper/cryptogcn-fast-and-scalable-homomorphically","slug":"cryptogcn-fast-and-scalable-homomorphically","title":"CryptoGCN: Fast and Scalable Homomorphically Encrypted Graph Convolutional Network Inference","date":"2022-09-24","arxiv_id":"2209.11904","n_code_links":2,"syntology":{"ran":5,"of":7,"n_ran_checked":4,"n_instrument":1,"unverified":2,"pointer_only":7,"phrase":"5 ran (of which 3 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","official":{"repos":["ranran0523/cryptogcn"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"paper":"/paper/reliable-representations-make-a-stronger","slug":"reliable-representations-make-a-stronger","title":"Reliable Representations Make A Stronger Defender: Unsupervised Structure Refinement for Robust GNN","date":"2022-06-30","arxiv_id":"2207.00012","n_code_links":1,"syntology":{"ran":5,"of":5,"n_ran_checked":3,"n_instrument":2,"unverified":0,"pointer_only":2,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","official":{"repos":["likuanppd/stable"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/graph-neural-networks-as-gradient-flows","slug":"graph-neural-networks-as-gradient-flows","title":"Understanding convolution on graphs via energies","date":"2022-06-22","arxiv_id":"2206.10991","n_code_links":2,"syntology":{"ran":6,"of":9,"n_ran_checked":4,"n_instrument":2,"unverified":3,"pointer_only":3,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 2 where Syntology's instrument failed) · 3 unverified","official":{"repos":["jrowbottomgit/graff"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":3,"ran_from_kinds":["official"]}}},{"paper":"/paper/rethinking-the-setting-of-semi-supervised","slug":"rethinking-the-setting-of-semi-supervised","title":"Rethinking the Setting of Semi-supervised Learning on Graphs","date":"2022-05-28","arxiv_id":"2205.14403","n_code_links":1,"syntology":{"ran":2,"of":2,"n_ran_checked":0,"n_instrument":2,"unverified":0,"pointer_only":1,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","official":{"repos":["thudm/igb"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official","unlocated"]}}},{"paper":"/paper/a-simple-yet-effective-svd-gcn-for-directed","slug":"a-simple-yet-effective-svd-gcn-for-directed","title":"A Simple Yet Effective SVD-GCN for Directed Graphs","date":"2022-05-19","arxiv_id":"2205.09335","n_code_links":1,"syntology":{"ran":5,"of":6,"n_ran_checked":0,"n_instrument":5,"unverified":1,"pointer_only":6,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 5 where Syntology's instrument failed) · 1 unverified","official":{"repos":["thisisforreview/svd-gcn"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":"/paper/remote-sensing-cross-modal-text-image","slug":"remote-sensing-cross-modal-text-image","title":"Remote Sensing Cross-Modal Text-Image Retrieval Based on Global and Local Information","date":"2022-04-21","arxiv_id":"2204.09860","n_code_links":1,"syntology":{"ran":1,"of":2,"n_ran_checked":0,"n_instrument":1,"unverified":1,"pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","official":{"repos":["xiaoyuan1996/galr"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":"/paper/pipegcn-efficient-full-graph-training-of-1","slug":"pipegcn-efficient-full-graph-training-of-1","title":"PipeGCN: Efficient Full-Graph Training of Graph Convolutional Networks with Pipelined Feature Communication","date":"2022-03-20","arxiv_id":"2203.10428","n_code_links":1,"syntology":{"ran":1,"of":4,"n_ran_checked":1,"n_instrument":0,"unverified":3,"pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","official":{"repos":["RICE-EIC/PipeGCN"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":3,"ran_from_kinds":["official"]}}},{"paper":"/paper/interacting-attention-graph-for-single-image","slug":"interacting-attention-graph-for-single-image","title":"Interacting Attention Graph for Single Image Two-Hand Reconstruction","date":"2022-03-17","arxiv_id":"2203.09364","n_code_links":1,"syntology":{"ran":2,"of":4,"n_ran_checked":2,"n_instrument":0,"unverified":2,"pointer_only":4,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","official":{"repos":["dw1010/intaghand"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["official"]}}},{"paper":"/paper/learning-to-solve-routing-problems-via","slug":"learning-to-solve-routing-problems-via","title":"Learning to Solve Routing Problems via Distributionally Robust Optimization","date":"2022-02-15","arxiv_id":"2202.07241","n_code_links":1,"syntology":{"ran":2,"of":3,"n_ran_checked":0,"n_instrument":2,"unverified":1,"pointer_only":3,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","official":{"repos":["jiang-yuan/Learning-routing-DRO"],"state":"official: no sample here; runs from other or unrecorded repositories","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["found_in_text"]}}},{"paper":"/paper/hyla-hyperbolic-laplacian-features-for-graph","slug":"hyla-hyperbolic-laplacian-features-for-graph","title":"Random Laplacian Features for Learning with Hyperbolic Space","date":"2022-02-14","arxiv_id":"2202.06854","n_code_links":1,"syntology":{"ran":3,"of":3,"n_ran_checked":3,"n_instrument":0,"unverified":0,"pointer_only":3,"phrase":"3 ran (of which 1 constructed an object rather than computing a result; 3 with no instrument failure: 2 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","official":{"repos":["ydtydr/hyla"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":1,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/convolutional-neural-networks-on-graphs-with-1","slug":"convolutional-neural-networks-on-graphs-with-1","title":"Convolutional Neural Networks on Graphs with Chebyshev Approximation, Revisited","date":"2022-02-04","arxiv_id":"2202.03580","n_code_links":1,"syntology":{"ran":1,"of":3,"n_ran_checked":0,"n_instrument":1,"unverified":2,"pointer_only":3,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","official":{"repos":["ivam-he/chebnetii"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["official"]}}},{"paper":"/paper/fedgcn-convergence-and-communication","slug":"fedgcn-convergence-and-communication","title":"FedGCN: Convergence-Communication Tradeoffs in Federated Training of Graph Convolutional Networks","date":"2022-01-28","arxiv_id":"2201.12433","n_code_links":2,"syntology":{"ran":13,"of":19,"n_ran_checked":13,"n_instrument":0,"unverified":6,"pointer_only":0,"phrase":"13 ran (of which 0 constructed an object rather than computing a result; 13 with no instrument failure: 0 honoured, 0 violated, 13 with no contract checked; 0 where Syntology's instrument failed) · 6 unverified","official":{"repos":["yh-yao/FedGCN"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":1,"ran_from_kinds":["listed","official"]}}},{"paper":"/paper/decoupling-the-depth-and-scope-of-graph-1","slug":"decoupling-the-depth-and-scope-of-graph-1","title":"Decoupling the Depth and Scope of Graph Neural Networks","date":"2022-01-19","arxiv_id":"2201.07858","n_code_links":1,"syntology":{"ran":1,"of":2,"n_ran_checked":1,"n_instrument":0,"unverified":1,"pointer_only":2,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","official":{"repos":["facebookresearch/shaDow_GNN"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":"/paper/contrastive-laplacian-eigenmaps-1","slug":"contrastive-laplacian-eigenmaps-1","title":"Contrastive Laplacian Eigenmaps","date":"2022-01-14","arxiv_id":"2201.05493","n_code_links":1,"syntology":{"ran":2,"of":2,"n_ran_checked":2,"n_instrument":0,"unverified":0,"pointer_only":2,"phrase":"2 ran (of which 2 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; every one of the 2 samples that ran constructed an object rather than computing a result","official":{"repos":["allenhaozhu/coles"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":2,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/gcod-graph-convolutional-network-acceleration","slug":"gcod-graph-convolutional-network-acceleration","title":"GCoD: Graph Convolutional Network Acceleration via Dedicated Algorithm and Accelerator Co-Design","date":"2021-12-22","arxiv_id":"2112.11594","n_code_links":1,"syntology":{"ran":3,"of":8,"n_ran_checked":2,"n_instrument":1,"unverified":5,"pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 5 unverified","official":{"repos":["rice-eic/gcod"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":5,"ran_from_kinds":["official"]}}},{"paper":"/paper/skipnode-on-alleviating-over-smoothing-for","slug":"skipnode-on-alleviating-over-smoothing-for","title":"SkipNode: On Alleviating Performance Degradation for Deep Graph Convolutional Networks","date":"2021-12-22","arxiv_id":"2112.11628","n_code_links":1,"syntology":{"ran":7,"of":7,"n_ran_checked":6,"n_instrument":1,"unverified":0,"pointer_only":1,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","official":{"repos":["weiganglu/skipnode"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/coarse-to-fine-animal-pose-and-shape","slug":"coarse-to-fine-animal-pose-and-shape","title":"Coarse-to-fine Animal Pose and Shape Estimation","date":"2021-11-16","arxiv_id":"2111.08176","n_code_links":1,"syntology":{"ran":13,"of":14,"n_ran_checked":13,"n_instrument":0,"unverified":1,"pointer_only":1,"phrase":"13 ran (of which 0 constructed an object rather than computing a result; 13 with no instrument failure: 0 honoured, 0 violated, 13 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","official":{"repos":["chaneyddtt/coarse-to-fine-3d-animal"],"state":"official (archive's flag): 13 ran","n_ran":13,"n_constructed":0,"n_ran_no_instrument_failure":13,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":"/paper/linear-or-non-linear-that-is-the-question","slug":"linear-or-non-linear-that-is-the-question","title":"Linear, or Non-Linear, That is the Question!","date":"2021-11-14","arxiv_id":"2111.07265","n_code_links":2,"syntology":{"ran":1,"of":1,"n_ran_checked":1,"n_instrument":0,"unverified":0,"pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","official":{"repos":["jeongwhanchoi/HMLET"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/rim-reliable-influence-based-active-learning","slug":"rim-reliable-influence-based-active-learning","title":"RIM: Reliable Influence-based Active Learning on Graphs","date":"2021-10-28","arxiv_id":"2110.14854","n_code_links":1,"syntology":{"ran":1,"of":1,"n_ran_checked":1,"n_instrument":0,"unverified":0,"pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","official":{"repos":["zwt233/rim"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/space-time-separable-graph-convolutional-1","slug":"space-time-separable-graph-convolutional-1","title":"Space-Time-Separable Graph Convolutional Network for Pose Forecasting","date":"2021-10-09","arxiv_id":"2110.04573","n_code_links":1,"syntology":{"ran":2,"of":3,"n_ran_checked":2,"n_instrument":0,"unverified":1,"pointer_only":0,"phrase":"2 ran (of which 2 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified; every one of the 2 samples that ran constructed an object rather than computing a result","official":{"repos":["fraluca/stsgcn"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":2,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":"/paper/iglu-efficient-gcn-training-via-lazy-updates","slug":"iglu-efficient-gcn-training-via-lazy-updates","title":"IGLU: Efficient GCN Training via Lazy Updates","date":"2021-09-28","arxiv_id":"2109.13995","n_code_links":1,"syntology":{"ran":3,"of":4,"n_ran_checked":0,"n_instrument":3,"unverified":1,"pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 1 unverified","official":{"repos":["sdeepaknarayanan/iglu"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":"/paper/node-feature-kernels-increase-graph","slug":"node-feature-kernels-increase-graph","title":"Node Feature Kernels Increase Graph Convolutional Network Robustness","date":"2021-09-04","arxiv_id":"2109.01785","n_code_links":1,"syntology":{"ran":2,"of":3,"n_ran_checked":2,"n_instrument":0,"unverified":1,"pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","official":{"repos":["changminwu/robustgcn"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":"/paper/lt-ocf-learnable-time-ode-based-collaborative","slug":"lt-ocf-learnable-time-ode-based-collaborative","title":"LT-OCF: Learnable-Time ODE-based Collaborative Filtering","date":"2021-08-08","arxiv_id":"2108.06208","n_code_links":2,"syntology":{"ran":3,"of":3,"n_ran_checked":3,"n_instrument":0,"unverified":0,"pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","official":{"repos":["jeongwhanchoi/lt-ocf"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/active-3d-shape-reconstruction-from-vision","slug":"active-3d-shape-reconstruction-from-vision","title":"Active 3D Shape Reconstruction from Vision and Touch","date":"2021-07-20","arxiv_id":"2107.09584","n_code_links":2,"syntology":{"ran":5,"of":7,"n_ran_checked":5,"n_instrument":0,"unverified":2,"pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","official":{"repos":["facebookresearch/Active-3D-Vision-and-Touch"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"paper":"/paper/hierarchical-graph-neural-nets-can-capture","slug":"hierarchical-graph-neural-nets-can-capture","title":"Hierarchical graph neural nets can capture long-range interactions","date":"2021-07-15","arxiv_id":"2107.07432","n_code_links":1,"syntology":{"ran":5,"of":8,"n_ran_checked":5,"n_instrument":0,"unverified":3,"pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","official":{"repos":["rampasek/HGNet"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":3,"ran_from_kinds":["official"]}}},{"paper":"/paper/semi-riemannian-graph-convolutional-networks","slug":"semi-riemannian-graph-convolutional-networks","title":"Pseudo-Riemannian Graph Convolutional Networks","date":"2021-06-06","arxiv_id":"2106.03134","n_code_links":1,"syntology":{"ran":4,"of":4,"n_ran_checked":4,"n_instrument":0,"unverified":0,"pointer_only":1,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","official":{"repos":["xiongbo010/qgcn"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/user-preference-aware-fake-news-detection","slug":"user-preference-aware-fake-news-detection","title":"User Preference-aware Fake News Detection","date":"2021-04-25","arxiv_id":"2104.12259","n_code_links":2,"syntology":{"ran":1,"of":1,"n_ran_checked":0,"n_instrument":1,"unverified":0,"pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","official":{"repos":["safe-graph/GNN-FakeNews"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/deep-occlusion-aware-instance-segmentation","slug":"deep-occlusion-aware-instance-segmentation","title":"Deep Occlusion-Aware Instance Segmentation with Overlapping BiLayers","date":"2021-03-23","arxiv_id":"2103.12340","n_code_links":1,"syntology":{"ran":9,"of":12,"n_ran_checked":9,"n_instrument":0,"unverified":3,"pointer_only":5,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","official":{"repos":["lkeab/BCNet"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":3,"ran_from_kinds":["official"]}}},{"paper":"/paper/extract-the-knowledge-of-graph-neural","slug":"extract-the-knowledge-of-graph-neural","title":"Extract the Knowledge of Graph Neural Networks and Go Beyond it: An Effective Knowledge Distillation Framework","date":"2021-03-04","arxiv_id":"2103.02885","n_code_links":1,"syntology":{"ran":2,"of":3,"n_ran_checked":0,"n_instrument":2,"unverified":1,"pointer_only":3,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","official":{"repos":["BUPT-GAMMA/CPF"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":"/paper/dissecting-the-diffusion-process-in-linear","slug":"dissecting-the-diffusion-process-in-linear","title":"Dissecting the Diffusion Process in Linear Graph Convolutional Networks","date":"2021-02-22","arxiv_id":"2102.10739","n_code_links":1,"syntology":{"ran":1,"of":1,"n_ran_checked":1,"n_instrument":0,"unverified":0,"pointer_only":0,"phrase":"1 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; the one sample that ran constructed an object rather than computing a result","official":{"repos":["yifeiwang77/dgc"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/gist-distributed-training-for-large-scale","slug":"gist-distributed-training-for-large-scale","title":"GIST: Distributed Training for Large-Scale Graph Convolutional Networks","date":"2021-02-20","arxiv_id":"2102.10424","n_code_links":1,"syntology":{"ran":2,"of":2,"n_ran_checked":0,"n_instrument":2,"unverified":0,"pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","official":null}},{"paper":"/paper/on-the-equivalence-of-decoupled-graph","slug":"on-the-equivalence-of-decoupled-graph","title":"On the Equivalence of Decoupled Graph Convolution Network and Label Propagation","date":"2020-10-23","arxiv_id":"2010.12408","n_code_links":1,"syntology":{"ran":3,"of":4,"n_ran_checked":3,"n_instrument":0,"unverified":1,"pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","official":{"repos":["DongHande/PT_propagation_then_training"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":"/paper/data-driven-learning-of-geometric-scattering-1","slug":"data-driven-learning-of-geometric-scattering-1","title":"Data-Driven Learning of Geometric Scattering Networks","date":"2020-10-06","arxiv_id":"2010.02415","n_code_links":1,"syntology":{"ran":1,"of":1,"n_ran_checked":0,"n_instrument":1,"unverified":0,"pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","official":null}},{"paper":"/paper/a-unified-view-on-graph-neural-networks-as-1","slug":"a-unified-view-on-graph-neural-networks-as-1","title":"A Unified View on Graph Neural Networks as Graph Signal Denoising","date":"2020-10-05","arxiv_id":"2010.01777","n_code_links":1,"syntology":{"ran":1,"of":1,"n_ran_checked":0,"n_instrument":1,"unverified":0,"pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","official":{"repos":["alge24/ADA-UGNN"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/masked-label-prediction-unified-massage","slug":"masked-label-prediction-unified-massage","title":"Masked Label Prediction: Unified Message Passing Model for Semi-Supervised Classification","date":"2020-09-08","arxiv_id":"2009.03509","n_code_links":3,"syntology":{"ran":7,"of":7,"n_ran_checked":6,"n_instrument":1,"unverified":0,"pointer_only":2,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 2 violated, 4 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","official":{"repos":["PaddlePaddle/PGL"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"paper":"/paper/graph-convolutional-networks-for-1","slug":"graph-convolutional-networks-for-1","title":"Graph Convolutional Networks for Hyperspectral Image Classification","date":"2020-08-06","arxiv_id":"2008.02457","n_code_links":1,"syntology":{"ran":2,"of":2,"n_ran_checked":1,"n_instrument":1,"unverified":0,"pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","official":{"repos":["danfenghong/IEEE_TGRS_GCN"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official","unlocated"]}}},{"paper":"/paper/graph-convolutional-networks-for-graphs","slug":"graph-convolutional-networks-for-graphs","title":"Graph Convolutional Networks for Graphs Containing Missing Features","date":"2020-07-09","arxiv_id":"2007.04583","n_code_links":2,"syntology":{"ran":6,"of":9,"n_ran_checked":6,"n_instrument":0,"unverified":3,"pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","official":{"repos":["marblet/GCNmf"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":3,"ran_from_kinds":["official"]}}},{"paper":"/paper/simple-and-deep-graph-convolutional-networks-1","slug":"simple-and-deep-graph-convolutional-networks-1","title":"Simple and Deep Graph Convolutional Networks","date":"2020-07-04","arxiv_id":"2007.02133","n_code_links":4,"syntology":{"ran":5,"of":7,"n_ran_checked":5,"n_instrument":0,"unverified":2,"pointer_only":4,"phrase":"5 ran (of which 5 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified; every one of the 5 samples that ran constructed an object rather than computing a result","official":{"repos":["chennnM/GCNII"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":2,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["found_in_text","listed","official"]}}},{"paper":"/paper/generalized-multi-relational-graph","slug":"generalized-multi-relational-graph","title":"Knowledge Embedding Based Graph Convolutional Network","date":"2020-06-12","arxiv_id":"2006.07331","n_code_links":1,"syntology":{"ran":5,"of":12,"n_ran_checked":3,"n_instrument":2,"unverified":7,"pointer_only":4,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 1 honoured, 0 violated, 2 with no contract checked; 2 where Syntology's instrument failed) · 7 unverified","official":{"repos":["Maysir/GEM-GCN"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":7,"ran_from_kinds":["official"]}}},{"paper":"/paper/on-the-bottleneck-of-graph-neural-networks","slug":"on-the-bottleneck-of-graph-neural-networks","title":"On the Bottleneck of Graph Neural Networks and its Practical Implications","date":"2020-06-09","arxiv_id":"2006.05205","n_code_links":3,"syntology":{"ran":1,"of":1,"n_ran_checked":1,"n_instrument":0,"unverified":0,"pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","official":{"repos":["tech-srl/bottleneck"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/when-differential-privacy-meets-graph-neural","slug":"when-differential-privacy-meets-graph-neural","title":"Locally Private Graph Neural Networks","date":"2020-06-09","arxiv_id":"2006.05535","n_code_links":1,"syntology":{"ran":1,"of":3,"n_ran_checked":0,"n_instrument":1,"unverified":2,"pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","official":{"repos":["sisaman/lpgnn"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["official"]}}},{"paper":"/paper/motion-guided-3d-pose-estimation-from-videos","slug":"motion-guided-3d-pose-estimation-from-videos","title":"Motion Guided 3D Pose Estimation from Videos","date":"2020-04-29","arxiv_id":"2004.13985","n_code_links":1,"syntology":{"ran":5,"of":9,"n_ran_checked":4,"n_instrument":1,"unverified":4,"pointer_only":1,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 1 honoured, 0 violated, 3 with no contract checked; 1 where Syntology's instrument failed) · 4 unverified","official":null}},{"paper":"/paper/vgcn-bert-augmenting-bert-with-graph","slug":"vgcn-bert-augmenting-bert-with-graph","title":"VGCN-BERT: Augmenting BERT with Graph Embedding for Text Classification","date":"2020-04-12","arxiv_id":"2004.05707","n_code_links":1,"syntology":{"ran":7,"of":9,"n_ran_checked":5,"n_instrument":2,"unverified":2,"pointer_only":2,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 1 honoured, 0 violated, 4 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified","official":{"repos":["Louis-udm/VGCN-BERT"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":2,"ran_from_kinds":["official"]}}},{"paper":"/paper/distillating-knowledge-from-graph","slug":"distillating-knowledge-from-graph","title":"Distilling Knowledge from Graph Convolutional Networks","date":"2020-03-23","arxiv_id":"2003.10477","n_code_links":1,"syntology":{"ran":7,"of":7,"n_ran_checked":7,"n_instrument":0,"unverified":0,"pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","official":{"repos":["ihollywhy/DistillGCN.PyTorch"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/adaptive-propagation-graph-convolutional","slug":"adaptive-propagation-graph-convolutional","title":"Adaptive Propagation Graph Convolutional Network","date":"2020-02-24","arxiv_id":"2002.10306","n_code_links":1,"syntology":{"ran":2,"of":5,"n_ran_checked":2,"n_instrument":0,"unverified":3,"pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","official":{"repos":["spindro/AP-GCN"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":3,"ran_from_kinds":["official"]}}},{"paper":"/paper/unifying-graph-convolutional-neural-networks-1","slug":"unifying-graph-convolutional-neural-networks-1","title":"Unifying Graph Convolutional Neural Networks and Label Propagation","date":"2020-02-17","arxiv_id":"2002.06755","n_code_links":2,"syntology":{"ran":9,"of":14,"n_ran_checked":9,"n_instrument":0,"unverified":5,"pointer_only":0,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 1 honoured, 1 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 5 unverified","official":null}},{"paper":"/paper/graph-universal-adversarial-attacks-a-few-bad","slug":"graph-universal-adversarial-attacks-a-few-bad","title":"Graph Universal Adversarial Attacks: A Few Bad Actors Ruin Graph Learning Models","date":"2020-02-12","arxiv_id":"2002.04784","n_code_links":1,"syntology":{"ran":7,"of":8,"n_ran_checked":6,"n_instrument":1,"unverified":1,"pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","official":{"repos":["chisam0217/Graph-Universal-Attack"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":"/paper/lightgcn-simplifying-and-powering-graph","slug":"lightgcn-simplifying-and-powering-graph","title":"LightGCN: Simplifying and Powering Graph Convolution Network for Recommendation","date":"2020-02-06","arxiv_id":"2002.02126","n_code_links":18,"syntology":{"ran":6,"of":7,"n_ran_checked":4,"n_instrument":2,"unverified":1,"pointer_only":2,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","official":{"repos":["gusye1234/pytorch-light-gcn","kuandeng/LightGCN"],"state":"official: no sample here; runs from other or unrecorded repositories","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed","unlocated"]}}},{"paper":"/paper/structural-deep-clustering-network","slug":"structural-deep-clustering-network","title":"Structural Deep Clustering Network","date":"2020-02-05","arxiv_id":"2002.01633","n_code_links":2,"syntology":{"ran":4,"of":4,"n_ran_checked":3,"n_instrument":1,"unverified":0,"pointer_only":1,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 1 honoured, 1 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","official":{"repos":["bdy9527/SDCN"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"paper":"/paper/g-tad-sub-graph-localization-for-temporal","slug":"g-tad-sub-graph-localization-for-temporal","title":"G-TAD: Sub-Graph Localization for Temporal Action Detection","date":"2019-11-26","arxiv_id":"1911.11462","n_code_links":7,"syntology":{"ran":15,"of":18,"n_ran_checked":13,"n_instrument":2,"unverified":3,"pointer_only":2,"phrase":"15 ran (of which 0 constructed an object rather than computing a result; 13 with no instrument failure: 1 honoured, 0 violated, 12 with no contract checked; 2 where Syntology's instrument failed) · 3 unverified","official":{"repos":["Frostinassiky/gtad"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":3,"ran_from_kinds":["listed","official"]}}},{"paper":"/paper/multi-label-classification-with-label-graph","slug":"multi-label-classification-with-label-graph","title":"Multi-Label Classification with Label Graph Superimposing","date":"2019-11-21","arxiv_id":"1911.09243","n_code_links":3,"syntology":{"ran":2,"of":2,"n_ran_checked":0,"n_instrument":2,"unverified":0,"pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","official":null}},{"paper":"/paper/layer-dependent-importance-sampling-for-1","slug":"layer-dependent-importance-sampling-for-1","title":"Layer-Dependent Importance Sampling for Training Deep and Large Graph Convolutional Networks","date":"2019-11-17","arxiv_id":"1911.07323","n_code_links":1,"syntology":{"ran":3,"of":3,"n_ran_checked":1,"n_instrument":2,"unverified":0,"pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","official":{"repos":["acbull/LADIES"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official","unlocated"]}}},{"paper":"/paper/learning-graph-convolutional-network-for","slug":"learning-graph-convolutional-network-for","title":"Learning Graph Convolutional Network for Skeleton-based Human Action Recognition by Neural Searching","date":"2019-11-11","arxiv_id":"1911.04131","n_code_links":1,"syntology":{"ran":2,"of":2,"n_ran_checked":1,"n_instrument":1,"unverified":0,"pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","official":null}},{"paper":"/paper/composition-based-multi-relational-graph","slug":"composition-based-multi-relational-graph","title":"Composition-based Multi-Relational Graph Convolutional Networks","date":"2019-11-08","arxiv_id":"1911.03082","n_code_links":4,"syntology":{"ran":5,"of":6,"n_ran_checked":3,"n_instrument":2,"unverified":1,"pointer_only":3,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","official":{"repos":["malllabiisc/CompGCN"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"paper":"/paper/hyperbolic-graph-convolutional-neural","slug":"hyperbolic-graph-convolutional-neural","title":"Hyperbolic Graph Convolutional Neural Networks","date":"2019-10-28","arxiv_id":"1910.12933","n_code_links":3,"syntology":{"ran":2,"of":3,"n_ran_checked":1,"n_instrument":1,"unverified":1,"pointer_only":3,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","official":null}},{"paper":"/paper/graph-convolutional-networks-for-learning","slug":"graph-convolutional-networks-for-learning","title":"Graph convolutional networks for learning with few clean and many noisy labels","date":"2019-10-01","arxiv_id":"1910.00324","n_code_links":1,"syntology":{"ran":4,"of":4,"n_ran_checked":4,"n_instrument":0,"unverified":0,"pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","official":{"repos":["google-research/noisy-fewshot-learning"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/layerwise-relevance-visualization-in","slug":"layerwise-relevance-visualization-in","title":"Layerwise Relevance Visualization in Convolutional Text Graph Classifiers","date":"2019-09-24","arxiv_id":"1909.10911","n_code_links":1,"syntology":{"ran":2,"of":2,"n_ran_checked":0,"n_instrument":2,"unverified":0,"pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","official":{"repos":["DFKI-NLP/lrv"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/anti-money-laundering-in-bitcoin","slug":"anti-money-laundering-in-bitcoin","title":"Anti-Money Laundering in Bitcoin: Experimenting with Graph Convolutional Networks for Financial Forensics","date":"2019-07-31","arxiv_id":"1908.02591","n_code_links":1,"syntology":{"ran":2,"of":2,"n_ran_checked":2,"n_instrument":0,"unverified":0,"pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","official":null}},{"paper":"/paper/the-truly-deep-graph-convolutional-networks","slug":"the-truly-deep-graph-convolutional-networks","title":"DropEdge: Towards Deep Graph Convolutional Networks on Node Classification","date":"2019-07-25","arxiv_id":"1907.10903","n_code_links":7,"syntology":{"ran":4,"of":5,"n_ran_checked":4,"n_instrument":0,"unverified":1,"pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","official":{"repos":["DropEdge/DropEdge"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"paper":"/paper/break-the-ceiling-stronger-multi-scale-deep","slug":"break-the-ceiling-stronger-multi-scale-deep","title":"Break the Ceiling: Stronger Multi-scale Deep Graph Convolutional Networks","date":"2019-06-05","arxiv_id":"1906.02174","n_code_links":1,"syntology":{"ran":5,"of":9,"n_ran_checked":5,"n_instrument":0,"unverified":4,"pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 1 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","official":{"repos":["PwnerHarry/Stronger_GCN"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":4,"ran_from_kinds":["official"]}}},{"paper":"/paper/path-augmented-graph-transformer-network","slug":"path-augmented-graph-transformer-network","title":"Path-Augmented Graph Transformer Network","date":"2019-05-29","arxiv_id":"1905.12712","n_code_links":2,"syntology":{"ran":8,"of":8,"n_ran_checked":8,"n_instrument":0,"unverified":0,"pointer_only":0,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","official":{"repos":["benatorc/PA-Graph-Transformer"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"paper":"/paper/on-asymptotic-behaviors-of-graph-cnns-from","slug":"on-asymptotic-behaviors-of-graph-cnns-from","title":"Graph Neural Networks Exponentially Lose Expressive Power for Node Classification","date":"2019-05-27","arxiv_id":"1905.10947","n_code_links":1,"syntology":{"ran":1,"of":1,"n_ran_checked":0,"n_instrument":1,"unverified":0,"pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","official":{"repos":["delta2323/gnn-asymptotics"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/predicting-path-failure-in-time-evolving","slug":"predicting-path-failure-in-time-evolving","title":"Predicting Path Failure In Time-Evolving Graphs","date":"2019-05-10","arxiv_id":"1905.03994","n_code_links":2,"syntology":{"ran":3,"of":4,"n_ran_checked":1,"n_instrument":2,"unverified":1,"pointer_only":0,"phrase":"3 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","official":null}},{"paper":"/paper/evolvegcn-evolving-graph-convolutional","slug":"evolvegcn-evolving-graph-convolutional","title":"EvolveGCN: Evolving Graph Convolutional Networks for Dynamic Graphs","date":"2019-02-26","arxiv_id":"1902.10191","n_code_links":10,"syntology":{"ran":9,"of":11,"n_ran_checked":7,"n_instrument":2,"unverified":2,"pointer_only":1,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 1 violated, 6 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified","official":{"repos":["IBM/AMLSim","IBM/EvolveGCN"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["listed","official"]}}},{"paper":"/paper/gcn-gan-a-non-linear-temporal-link-prediction","slug":"gcn-gan-a-non-linear-temporal-link-prediction","title":"GCN-GAN: A Non-linear Temporal Link Prediction Model for Weighted Dynamic Networks","date":"2019-01-26","arxiv_id":"1901.09165","n_code_links":1,"syntology":{"ran":1,"of":1,"n_ran_checked":1,"n_instrument":0,"unverified":0,"pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","official":null}},{"paper":"/paper/t-gcn-a-temporal-graph-convolutionalnetwork","slug":"t-gcn-a-temporal-graph-convolutionalnetwork","title":"T-GCN: A Temporal Graph ConvolutionalNetwork for Traffic Prediction","date":"2018-11-12","arxiv_id":"1811.05320","n_code_links":10,"syntology":{"ran":5,"of":5,"n_ran_checked":5,"n_instrument":0,"unverified":0,"pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","official":{"repos":["lehaifeng/T-GCN"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"paper":"/paper/jointly-multiple-events-extraction-via","slug":"jointly-multiple-events-extraction-via","title":"Jointly Multiple Events Extraction via Attention-based Graph Information Aggregation","date":"2018-09-24","arxiv_id":"1809.09078","n_code_links":3,"syntology":{"ran":2,"of":2,"n_ran_checked":2,"n_instrument":0,"unverified":0,"pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","official":{"repos":["lx865712528/JMEE"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"paper":"/paper/graph-convolutional-networks-for-text","slug":"graph-convolutional-networks-for-text","title":"Graph Convolutional Networks for Text Classification","date":"2018-09-15","arxiv_id":"1809.05679","n_code_links":9,"syntology":{"ran":14,"of":16,"n_ran_checked":10,"n_instrument":4,"unverified":2,"pointer_only":6,"phrase":"14 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 2 honoured, 0 violated, 8 with no contract checked; 4 where Syntology's instrument failed) · 2 unverified","official":{"repos":["yao8839836/text_gcn"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"paper":"/paper/semi-supervised-user-geolocation-via-graph","slug":"semi-supervised-user-geolocation-via-graph","title":"Semi-supervised User Geolocation via Graph Convolutional Networks","date":"2018-04-22","arxiv_id":"1804.08049","n_code_links":1,"syntology":{"ran":1,"of":1,"n_ran_checked":1,"n_instrument":0,"unverified":0,"pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","official":null}},{"paper":"/paper/stochastic-training-of-graph-convolutional","slug":"stochastic-training-of-graph-convolutional","title":"Stochastic Training of Graph Convolutional Networks with Variance Reduction","date":"2017-10-29","arxiv_id":"1710.10568","n_code_links":2,"syntology":{"ran":7,"of":11,"n_ran_checked":6,"n_instrument":1,"unverified":4,"pointer_only":3,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 3 honoured, 2 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 4 unverified","official":null}},{"paper":"/paper/encoding-sentences-with-graph-convolutional","slug":"encoding-sentences-with-graph-convolutional","title":"Encoding Sentences with Graph Convolutional Networks for Semantic Role Labeling","date":"2017-03-14","arxiv_id":"1703.04826","n_code_links":2,"syntology":{"ran":4,"of":7,"n_ran_checked":4,"n_instrument":0,"unverified":3,"pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","official":{"repos":["diegma/neural-dep-srl"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":3,"ran_from_kinds":["official"]}}},{"paper":"/paper/semi-supervised-classification-with-graph","slug":"semi-supervised-classification-with-graph","title":"Semi-Supervised Classification with Graph Convolutional Networks","date":"2016-09-09","arxiv_id":"1609.02907","n_code_links":55,"syntology":{"ran":39,"of":58,"n_ran_checked":34,"n_instrument":5,"unverified":19,"pointer_only":23,"phrase":"39 ran (of which 13 constructed an object rather than computing a result; 34 with no instrument failure: 0 honoured, 1 violated, 33 with no contract checked; 5 where Syntology's instrument failed) · 19 unverified","official":{"repos":["tkipf/pygcn"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}}],"record_sha256":"481939bcca7a66e740d2c155112472361d4aa91c03a6f08652a71a4604fb70db","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}