{"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":"/task/node-classification/papers/8","list_of":"/task/node-classification","task":"Node Classification","archive":{"snapshot":"2025-07-28"},"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"syntology_read_at":"2026-09-28T10:30:06+00:00","order":"archive","order_definition":"repositories listed in the archive (most first), then date (newest first), then slug","page":8,"pages_in_order":19,"rows_per_page":100,"rows":[701,800],"of":1860,"counts":{"archive_papers_tagged":1860,"with_a_code_link":991,"where_syntology_ran_a_sample":305,"not_listed_spam_title":0,"listed":1860,"listed_where_code_ran":305,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":256,"every_run_a_failure_of_syntologys_instrument":49,"listed_with_a_run_with_no_instrument_failure":256,"listed_every_run_a_failure_of_syntologys_instrument":49,"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":"/task/node-classification","prev":"/task/node-classification/papers/7","next":"/task/node-classification/papers/9","papers":[{"url":"/paper/neural-class-expression-synthesis","slug":"neural-class-expression-synthesis","title":"Neural Class Expression Synthesis","date":"2021-11-16","arxiv_id":"2111.08486","repositories_listed":1,"syntology":null},{"url":"/paper/simplifying-approach-to-node-classification","slug":"simplifying-approach-to-node-classification","title":"Simplifying approach to Node Classification in Graph Neural Networks","date":"2021-11-12","arxiv_id":"2111.06748","repositories_listed":1,"syntology":null},{"url":"/paper/topological-relational-learning-on-graphs","slug":"topological-relational-learning-on-graphs","title":"Topological Relational Learning on Graphs","date":"2021-10-29","arxiv_id":"2110.15529","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_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","sample_list":"/paper/topological-relational-learning-on-graphs#ran","syntology_url":"https://syntology.ai/paper/2110.15529","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.15529"}},"official":{"repos":["tri-gnn/tri-gnn"],"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"]}}},{"url":"/paper/vq-gnn-a-universal-framework-to-scale-up","slug":"vq-gnn-a-universal-framework-to-scale-up","title":"VQ-GNN: A Universal Framework to Scale up Graph Neural Networks using Vector Quantization","date":"2021-10-27","arxiv_id":"2110.14363","repositories_listed":1,"syntology":null},{"url":"/paper/tme-bna-temporal-motif-preserving-network","slug":"tme-bna-temporal-motif-preserving-network","title":"TME-BNA: Temporal Motif-Preserving Network Embedding with Bicomponent Neighbor Aggregation","date":"2021-10-26","arxiv_id":"2110.13596","repositories_listed":1,"syntology":null},{"url":"/paper/distance-wise-prototypical-graph-neural","slug":"distance-wise-prototypical-graph-neural","title":"Distance-wise Prototypical Graph Neural Network in Node Imbalance Classification","date":"2021-10-22","arxiv_id":"2110.12035","repositories_listed":1,"syntology":null},{"url":"/paper/fdgatii-fast-dynamic-graph-attention-with","slug":"fdgatii-fast-dynamic-graph-attention-with","title":"FDGATII : Fast Dynamic Graph Attention with Initial Residual and Identity Mapping","date":"2021-10-21","arxiv_id":"2110.11464","repositories_listed":1,"syntology":null},{"url":"/paper/boosting-graph-embedding-on-a-single-gpu","slug":"boosting-graph-embedding-on-a-single-gpu","title":"Boosting Graph Embedding on a Single GPU","date":"2021-10-19","arxiv_id":"2110.10049","repositories_listed":1,"syntology":null},{"url":"/paper/graph-less-neural-networks-teaching-old-mlps-1","slug":"graph-less-neural-networks-teaching-old-mlps-1","title":"Graph-less Neural Networks: Teaching Old MLPs New Tricks via Distillation","date":"2021-10-17","arxiv_id":"2110.08727","repositories_listed":1,"syntology":{"n":8,"n_ran":7,"n_constructed":0,"n_ran_checked":6,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":1,"n_no_contract":5,"n_pointer_only":8,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 1 violated, 5 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/graph-less-neural-networks-teaching-old-mlps-1#ran","syntology_url":"https://syntology.ai/paper/2110.08727","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.08727"}},"official":{"repos":["snap-research/graphless-neural-networks"],"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"]}}},{"url":"/paper/label-wise-message-passing-graph-neural","slug":"label-wise-message-passing-graph-neural","title":"Label-Wise Graph Convolutional Network for Heterophilic Graphs","date":"2021-10-15","arxiv_id":"2110.08128","repositories_listed":1,"syntology":null},{"url":"/paper/relation-aware-heterogeneous-graph-for-user","slug":"relation-aware-heterogeneous-graph-for-user","title":"Relation-aware Heterogeneous Graph for User Profiling","date":"2021-10-14","arxiv_id":"2110.07181","repositories_listed":1,"syntology":null},{"url":"/paper/smgc-a-complex-valued-graph-convolutional","slug":"smgc-a-complex-valued-graph-convolutional","title":"MGC: A Complex-Valued Graph Convolutional Network for Directed Graphs","date":"2021-10-14","arxiv_id":"2110.07570","repositories_listed":1,"syntology":null},{"url":"/paper/sogcn-second-order-graph-convolutional-1","slug":"sogcn-second-order-graph-convolutional-1","title":"SoGCN: Second-Order Graph Convolutional Networks","date":"2021-10-14","arxiv_id":"2110.07141","repositories_listed":1,"syntology":null},{"url":"/paper/topology-imbalance-learning-for-semi","slug":"topology-imbalance-learning-for-semi","title":"Topology-Imbalance Learning for Semi-Supervised Node Classification","date":"2021-10-08","arxiv_id":"2110.04099","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":1,"n_ran_checked":1,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_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) · 0 unverified","sample_list":"/paper/topology-imbalance-learning-for-semi#ran","syntology_url":"https://syntology.ai/paper/2110.04099","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.04099"}},"official":{"repos":["victorchen96/renode"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/a-robust-alternative-for-graph-convolutional","slug":"a-robust-alternative-for-graph-convolutional","title":"A Robust Alternative for Graph Convolutional Neural Networks via Graph Neighborhood Filters","date":"2021-10-02","arxiv_id":"2110.00844","repositories_listed":1,"syntology":null},{"url":"/paper/inductive-representation-learning-in-temporal","slug":"inductive-representation-learning-in-temporal","title":"Inductive Representation Learning in Temporal Networks via Mining Neighborhood and Community Influences","date":"2021-10-01","arxiv_id":"2110.00267","repositories_listed":1,"syntology":null},{"url":"/paper/query-based-adversarial-attacks-on-graph-with","slug":"query-based-adversarial-attacks-on-graph-with","title":"Cluster Attack: Query-based Adversarial Attacks on Graphs with Graph-Dependent Priors","date":"2021-09-27","arxiv_id":"2109.13069","repositories_listed":1,"syntology":null},{"url":"/paper/a-meta-learning-approach-for-training","slug":"a-meta-learning-approach-for-training","title":"A Meta-Learning Approach for Training Explainable Graph Neural Networks","date":"2021-09-20","arxiv_id":"2109.09426","repositories_listed":1,"syntology":null},{"url":"/paper/hemi-multi-view-embedding-in-heterogeneous","slug":"hemi-multi-view-embedding-in-heterogeneous","title":"HeMI: Multi-view Embedding in Heterogeneous Graphs","date":"2021-09-14","arxiv_id":"2109.07008","repositories_listed":1,"syntology":null},{"url":"/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","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_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","sample_list":"/paper/node-feature-kernels-increase-graph#ran","syntology_url":"https://syntology.ai/paper/2109.01785","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2109.01785"}},"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"]}}},{"url":"/paper/towards-self-explainable-graph-neural-network","slug":"towards-self-explainable-graph-neural-network","title":"Towards Self-Explainable Graph Neural Network","date":"2021-08-26","arxiv_id":"2108.12055","repositories_listed":1,"syntology":null},{"url":"/paper/tree-decomposed-graph-neural-network","slug":"tree-decomposed-graph-neural-network","title":"Tree Decomposed Graph Neural Network","date":"2021-08-25","arxiv_id":"2108.11022","repositories_listed":1,"syntology":null},{"url":"/paper/jointly-learnable-data-augmentations-for-self","slug":"jointly-learnable-data-augmentations-for-self","title":"Jointly Learnable Data Augmentations for Self-Supervised GNNs","date":"2021-08-23","arxiv_id":"2108.10420","repositories_listed":1,"syntology":null},{"url":"/paper/temporal-graph-network-embedding-with-causal","slug":"temporal-graph-network-embedding-with-causal","title":"Temporal Graph Network Embedding with Causal Anonymous Walks Representations","date":"2021-08-19","arxiv_id":"2108.08754","repositories_listed":1,"syntology":null},{"url":"/paper/self-supervised-consensus-representation","slug":"self-supervised-consensus-representation","title":"Self-supervised Consensus Representation Learning for Attributed Graph","date":"2021-08-10","arxiv_id":"2108.04822","repositories_listed":1,"syntology":null},{"url":"/paper/evaluating-deep-graph-neural-networks","slug":"evaluating-deep-graph-neural-networks","title":"Evaluating Deep Graph Neural Networks","date":"2021-08-02","arxiv_id":"2108.00955","repositories_listed":1,"syntology":null},{"url":"/paper/rod-reception-aware-online-distillation-for","slug":"rod-reception-aware-online-distillation-for","title":"ROD: Reception-aware Online Distillation for Sparse Graphs","date":"2021-07-25","arxiv_id":"2107.11789","repositories_listed":1,"syntology":null},{"url":"/paper/relational-graph-convolutional-networks-a","slug":"relational-graph-convolutional-networks-a","title":"Relational Graph Convolutional Networks: A Closer Look","date":"2021-07-21","arxiv_id":"2107.10015","repositories_listed":1,"syntology":null},{"url":"/paper/a-survey-on-role-oriented-network-embedding","slug":"a-survey-on-role-oriented-network-embedding","title":"A Survey on Role-Oriented Network Embedding","date":"2021-07-18","arxiv_id":"2107.08379","repositories_listed":1,"syntology":null},{"url":"/paper/dppin-a-biological-dataset-of-dynamic-protein","slug":"dppin-a-biological-dataset-of-dynamic-protein","title":"DPPIN: A Biological Repository of Dynamic Protein-Protein Interaction Network Data","date":"2021-07-05","arxiv_id":"2107.02168","repositories_listed":1,"syntology":null},{"url":"/paper/fea2fea-exploring-structural-feature","slug":"fea2fea-exploring-structural-feature","title":"Fea2Fea: Exploring Structural Feature Correlations via Graph Neural Networks","date":"2021-06-24","arxiv_id":"2106.13061","repositories_listed":1,"syntology":null},{"url":"/paper/you-are-allset-a-multiset-function-framework","slug":"you-are-allset-a-multiset-function-framework","title":"You are AllSet: A Multiset Function Framework for Hypergraph Neural Networks","date":"2021-06-24","arxiv_id":"2106.13264","repositories_listed":1,"syntology":{"n":1,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 1 unverified","sample_list":"/paper/you-are-allset-a-multiset-function-framework#ran","syntology_url":"https://syntology.ai/paper/2106.13264","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.13264"}},"official":{"repos":["jianhao2016/AllSet"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]}}},{"url":"/paper/bernnet-learning-arbitrary-graph-spectral","slug":"bernnet-learning-arbitrary-graph-spectral","title":"BernNet: Learning Arbitrary Graph Spectral Filters via Bernstein Approximation","date":"2021-06-21","arxiv_id":"2106.10994","repositories_listed":1,"syntology":{"n":1,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"0 ran · 1 unverified","sample_list":"/paper/bernnet-learning-arbitrary-graph-spectral#ran","syntology_url":"https://syntology.ai/paper/2106.10994","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.10994"}},"official":{"repos":["ivam-he/BernNet"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]}}},{"url":"/paper/mhnf-multi-hop-heterogeneous-neighborhood","slug":"mhnf-multi-hop-heterogeneous-neighborhood","title":"MHNF: Multi-hop Heterogeneous Neighborhood information Fusion graph representation learning","date":"2021-06-17","arxiv_id":"2106.09289","repositories_listed":1,"syntology":null},{"url":"/paper/an-unifying-point-of-view-on-expressive-power","slug":"an-unifying-point-of-view-on-expressive-power","title":"On the approximation capability of GNNs in node classification/regression tasks","date":"2021-06-16","arxiv_id":"2106.08992","repositories_listed":1,"syntology":null},{"url":"/paper/zero-shot-node-classification-with-decomposed","slug":"zero-shot-node-classification-with-decomposed","title":"Zero-shot Node Classification with Decomposed Graph Prototype Network","date":"2021-06-15","arxiv_id":"2106.08022","repositories_listed":1,"syntology":null},{"url":"/paper/pi-gnn-a-novel-perspective-on-semi-supervised","slug":"pi-gnn-a-novel-perspective-on-semi-supervised","title":"Noise-robust Graph Learning by Estimating and Leveraging Pairwise Interactions","date":"2021-06-14","arxiv_id":"2106.07451","repositories_listed":1,"syntology":null},{"url":"/paper/learnable-hypergraph-laplacian-for-hypergraph-1","slug":"learnable-hypergraph-laplacian-for-hypergraph-1","title":"Learnable Hypergraph Laplacian for Hypergraph Learning","date":"2021-06-12","arxiv_id":"2106.06666","repositories_listed":1,"syntology":null},{"url":"/paper/breaking-the-limit-of-graph-neural-networks","slug":"breaking-the-limit-of-graph-neural-networks","title":"Breaking the Limit of Graph Neural Networks by Improving the Assortativity of Graphs with Local Mixing Patterns","date":"2021-06-11","arxiv_id":"2106.06586","repositories_listed":1,"syntology":{"n":12,"n_ran":6,"n_constructed":0,"n_ran_checked":5,"n_instrument":1,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"6 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; 1 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/breaking-the-limit-of-graph-neural-networks#ran","syntology_url":"https://syntology.ai/paper/2106.06586","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.06586"}},"official":{"repos":["susheels/gnns-and-local-assortativity"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":6,"ran_from_kinds":["official"]}}},{"url":"/paper/graph-transformer-networks-learning-meta-path","slug":"graph-transformer-networks-learning-meta-path","title":"Graph Transformer Networks: Learning Meta-path Graphs to Improve GNNs","date":"2021-06-11","arxiv_id":"2106.06218","repositories_listed":1,"syntology":null},{"url":"/paper/automated-self-supervised-learning-for-graphs","slug":"automated-self-supervised-learning-for-graphs","title":"Automated Self-Supervised Learning for Graphs","date":"2021-06-10","arxiv_id":"2106.05470","repositories_listed":1,"syntology":null},{"url":"/paper/learnable-hypergraph-laplacian-for-hypergraph","slug":"learnable-hypergraph-laplacian-for-hypergraph","title":"Learnable Hypergraph Laplacian for Hypergraph Learning","date":"2021-06-10","arxiv_id":"2106.05701","repositories_listed":1,"syntology":null},{"url":"/paper/learning-based-proximity-matrix-factorization","slug":"learning-based-proximity-matrix-factorization","title":"Learning Based Proximity Matrix Factorization for Node Embedding","date":"2021-06-10","arxiv_id":"2106.05476","repositories_listed":1,"syntology":null},{"url":"/paper/multiple-kernel-representation-learning-on","slug":"multiple-kernel-representation-learning-on","title":"Multiple Kernel Representation Learning on Networks","date":"2021-06-09","arxiv_id":"2106.05057","repositories_listed":1,"syntology":null},{"url":"/paper/xbnet-an-extremely-boosted-neural-network","slug":"xbnet-an-extremely-boosted-neural-network","title":"XBNet : An Extremely Boosted Neural Network","date":"2021-06-09","arxiv_id":"2106.05239","repositories_listed":1,"syntology":null},{"url":"/paper/graph-mlp-node-classification-without-message","slug":"graph-mlp-node-classification-without-message","title":"Graph-MLP: Node Classification without Message Passing in Graph","date":"2021-06-08","arxiv_id":"2106.04051","repositories_listed":1,"syntology":null},{"url":"/paper/nrgnn-learning-a-label-noise-resistant-graph","slug":"nrgnn-learning-a-label-noise-resistant-graph","title":"NRGNN: Learning a Label Noise-Resistant Graph Neural Network on Sparsely and Noisily Labeled Graphs","date":"2021-06-08","arxiv_id":"2106.04714","repositories_listed":1,"syntology":null},{"url":"/paper/adversarially-regularized-graph-attention","slug":"adversarially-regularized-graph-attention","title":"Adversarially Regularized Graph Attention Networks for Inductive Learning on Partially Labeled Graphs","date":"2021-06-07","arxiv_id":"2106.03393","repositories_listed":1,"syntology":null},{"url":"/paper/graph-belief-propagation-networks","slug":"graph-belief-propagation-networks","title":"Graph Belief Propagation Networks","date":"2021-06-06","arxiv_id":"2106.03033","repositories_listed":1,"syntology":null},{"url":"/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","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_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","sample_list":"/paper/semi-riemannian-graph-convolutional-networks#ran","syntology_url":"https://syntology.ai/paper/2106.03134","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.03134"}},"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"]}}},{"url":"/paper/imgagn-imbalanced-network-embedding-via","slug":"imgagn-imbalanced-network-embedding-via","title":"ImGAGN:Imbalanced Network Embedding via Generative Adversarial Graph Networks","date":"2021-06-05","arxiv_id":"2106.02817","repositories_listed":1,"syntology":null},{"url":"/paper/embedding-knowledge-graphs-attentive-to","slug":"embedding-knowledge-graphs-attentive-to","title":"Embedding Knowledge Graphs Attentive to Positional and Centrality Qualities","date":"2021-06-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/mixup-for-node-and-graph-classification","slug":"mixup-for-node-and-graph-classification","title":"Mixup for Node and Graph Classification","date":"2021-06-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/local-global-and-scale-dependent-node-roles","slug":"local-global-and-scale-dependent-node-roles","title":"Local, global and scale-dependent node roles","date":"2021-05-26","arxiv_id":"2105.12598","repositories_listed":1,"syntology":null},{"url":"/paper/self-supervised-graph-representation-learning-2","slug":"self-supervised-graph-representation-learning-2","title":"Self-Supervised Graph Representation Learning via Topology Transformations","date":"2021-05-25","arxiv_id":"2105.11689","repositories_listed":1,"syntology":null},{"url":"/paper/heterogeneous-graph-representation-learning","slug":"heterogeneous-graph-representation-learning","title":"Heterogeneous Graph Representation Learning with Relation Awareness","date":"2021-05-24","arxiv_id":"2105.11122","repositories_listed":1,"syntology":null},{"url":"/paper/position-sensing-graph-neural-networks","slug":"position-sensing-graph-neural-networks","title":"Position-Sensing Graph Neural Networks: Proactively Learning Nodes Relative Positions","date":"2021-05-24","arxiv_id":"2105.11346","repositories_listed":1,"syntology":null},{"url":"/paper/a-robust-and-generalized-framework-for","slug":"a-robust-and-generalized-framework-for","title":"A Robust and Generalized Framework for Adversarial Graph Embedding","date":"2021-05-22","arxiv_id":"2105.10651","repositories_listed":1,"syntology":null},{"url":"/paper/free-energy-node-embedding-via-generalized","slug":"free-energy-node-embedding-via-generalized","title":"Free Energy Node Embedding via Generalized Skip-gram with Negative Sampling","date":"2021-05-19","arxiv_id":"2105.09182","repositories_listed":1,"syntology":null},{"url":"/paper/improving-graph-neural-networks-with-simple","slug":"improving-graph-neural-networks-with-simple","title":"Improving Graph Neural Networks with Simple Architecture Design","date":"2021-05-17","arxiv_id":"2105.07634","repositories_listed":1,"syntology":null},{"url":"/paper/accelerating-large-scale-real-time-gnn","slug":"accelerating-large-scale-real-time-gnn","title":"Accelerating Large Scale Real-Time GNN Inference using Channel Pruning","date":"2021-05-10","arxiv_id":"2105.04528","repositories_listed":1,"syntology":{"n":5,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_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) · 2 unverified","sample_list":"/paper/accelerating-large-scale-real-time-gnn#ran","syntology_url":"https://syntology.ai/paper/2105.04528","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.04528"}},"official":{"repos":["tedzhouhk/GCNP"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/diff-resnets-for-few-shot-learning-an-ode","slug":"diff-resnets-for-few-shot-learning-an-ode","title":"Diffusion Mechanism in Residual Neural Network: Theory and Applications","date":"2021-05-07","arxiv_id":"2105.03155","repositories_listed":1,"syntology":null},{"url":"/paper/crosswalk-fairness-enhanced-node","slug":"crosswalk-fairness-enhanced-node","title":"CrossWalk: Fairness-enhanced Node Representation Learning","date":"2021-05-06","arxiv_id":"2105.02725","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_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","sample_list":"/paper/crosswalk-fairness-enhanced-node#ran","syntology_url":"https://syntology.ai/paper/2105.02725","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.02725"}},"official":{"repos":["ahmadkhajehnejad/CrossWalk"],"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"]}}},{"url":"/paper/lgd-gcn-local-and-global-disentangled-graph","slug":"lgd-gcn-local-and-global-disentangled-graph","title":"LGD-GCN: Local and Global Disentangled Graph Convolutional Networks","date":"2021-04-24","arxiv_id":"2104.11893","repositories_listed":1,"syntology":null},{"url":"/paper/pick-and-choose-a-gnn-based-imbalanced","slug":"pick-and-choose-a-gnn-based-imbalanced","title":"Pick and Choose: A GNN-based Imbalanced Learning Approach for Fraud Detection","date":"2021-04-19","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/higher-order-attribute-enhancing","slug":"higher-order-attribute-enhancing","title":"Higher-Order Attribute-Enhancing Heterogeneous Graph Neural Networks","date":"2021-04-16","arxiv_id":"2104.07892","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_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","sample_list":"/paper/higher-order-attribute-enhancing#ran","syntology_url":"https://syntology.ai/paper/2104.07892","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.07892"}},"official":{"repos":["RingBDStack/HAE"],"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"]}}},{"url":"/paper/reinforced-neighborhood-selection-guided","slug":"reinforced-neighborhood-selection-guided","title":"Reinforced Neighborhood Selection Guided Multi-Relational Graph Neural Networks","date":"2021-04-16","arxiv_id":"2104.07886","repositories_listed":1,"syntology":null},{"url":"/paper/mshine-a-multiple-meta-paths-simultaneous","slug":"mshine-a-multiple-meta-paths-simultaneous","title":"mSHINE: A Multiple-meta-paths Simultaneous Learning Framework for Heterogeneous Information Network Embedding","date":"2021-04-06","arxiv_id":"2104.02433","repositories_listed":1,"syntology":null},{"url":"/paper/new-benchmarks-for-learning-on-non","slug":"new-benchmarks-for-learning-on-non","title":"New Benchmarks for Learning on Non-Homophilous Graphs","date":"2021-04-03","arxiv_id":"2104.01404","repositories_listed":1,"syntology":null},{"url":"/paper/deepened-graph-auto-encoders-help-stabilize","slug":"deepened-graph-auto-encoders-help-stabilize","title":"Deepened Graph Auto-Encoders Help Stabilize and Enhance Link Prediction","date":"2021-03-21","arxiv_id":"2103.11414","repositories_listed":1,"syntology":null},{"url":"/paper/graph-neural-networks-inspired-by-classical","slug":"graph-neural-networks-inspired-by-classical","title":"Graph Neural Networks Inspired by Classical Iterative Algorithms","date":"2021-03-10","arxiv_id":"2103.06064","repositories_listed":1,"syntology":null},{"url":"/paper/lipschitz-normalization-for-self-attention","slug":"lipschitz-normalization-for-self-attention","title":"Lipschitz Normalization for Self-Attention Layers with Application to Graph Neural Networks","date":"2021-03-08","arxiv_id":"2103.04886","repositories_listed":1,"syntology":null},{"url":"/paper/nishimori-meets-bethe-a-spectral-method-for","slug":"nishimori-meets-bethe-a-spectral-method-for","title":"Nishimori meets Bethe: a spectral method for node classification in sparse weighted graphs","date":"2021-03-05","arxiv_id":"2103.03561","repositories_listed":1,"syntology":null},{"url":"/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","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_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","sample_list":"/paper/extract-the-knowledge-of-graph-neural#ran","syntology_url":"https://syntology.ai/paper/2103.02885","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.02885"}},"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"]}}},{"url":"/paper/on-the-importance-of-sampling-in-learning","slug":"on-the-importance-of-sampling-in-learning","title":"On the Importance of Sampling in Training GCNs: Tighter Analysis and Variance Reduction","date":"2021-03-03","arxiv_id":"2103.02696","repositories_listed":1,"syntology":{"n":3,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"0 ran · 3 unverified","sample_list":"/paper/on-the-importance-of-sampling-in-learning#ran","syntology_url":"https://syntology.ai/paper/2103.02696","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.02696"}},"official":{"repos":["CongWeilin/SGCN"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":3,"ran_from_kinds":[]}}},{"url":"/paper/cogdl-an-extensive-toolkit-for-deep-learning","slug":"cogdl-an-extensive-toolkit-for-deep-learning","title":"CogDL: A Comprehensive Library for Graph Deep Learning","date":"2021-03-01","arxiv_id":"2103.00959","repositories_listed":1,"syntology":null},{"url":"/paper/self-supervised-auxiliary-learning-for-graph","slug":"self-supervised-auxiliary-learning-for-graph","title":"Self-supervised Auxiliary Learning for Graph Neural Networks via Meta-Learning","date":"2021-03-01","arxiv_id":"2103.00771","repositories_listed":1,"syntology":null},{"url":"/paper/ra-gcn-graph-convolutional-network-for","slug":"ra-gcn-graph-convolutional-network-for","title":"RA-GCN: Graph Convolutional Network for Disease Prediction Problems with Imbalanced Data","date":"2021-02-27","arxiv_id":"2103.00221","repositories_listed":1,"syntology":null},{"url":"/paper/dynamic-labeling-for-unlabeled-graph-neural","slug":"dynamic-labeling-for-unlabeled-graph-neural","title":"Generalized Equivariance and Preferential Labeling for GNN Node Classification","date":"2021-02-23","arxiv_id":"2102.11485","repositories_listed":1,"syntology":null},{"url":"/paper/magnet-a-magnetic-neural-network-for-directed","slug":"magnet-a-magnetic-neural-network-for-directed","title":"MagNet: A Neural Network for Directed Graphs","date":"2021-02-22","arxiv_id":"2102.11391","repositories_listed":1,"syntology":{"n":1,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 1 unverified","sample_list":"/paper/magnet-a-magnetic-neural-network-for-directed#ran","syntology_url":"https://syntology.ai/paper/2102.11391","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2102.11391"}},"official":{"repos":["matthew-hirn/magnet"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]}}},{"url":"/paper/a-deep-graph-wavelet-convolutional-neural","slug":"a-deep-graph-wavelet-convolutional-neural","title":"A Deep Graph Wavelet Convolutional Neural Network for Semi-supervised Node Classification","date":"2021-02-19","arxiv_id":"2102.09780","repositories_listed":1,"syntology":null},{"url":"/paper/fast-graph-learning-with-unique-optimal","slug":"fast-graph-learning-with-unique-optimal","title":"Fast Graph Learning with Unique Optimal Solutions","date":"2021-02-17","arxiv_id":"2102.08530","repositories_listed":1,"syntology":null},{"url":"/paper/node-select-a-graph-neural-network-based-on-a","slug":"node-select-a-graph-neural-network-based-on-a","title":"NODE-SELECT: A Graph Neural Network Based On A Selective Propagation Technique","date":"2021-02-17","arxiv_id":"2102.08588","repositories_listed":1,"syntology":null},{"url":"/paper/hdmi-high-order-deep-multiplex-infomax","slug":"hdmi-high-order-deep-multiplex-infomax","title":"HDMI: High-order Deep Multiplex Infomax","date":"2021-02-15","arxiv_id":"2102.07810","repositories_listed":1,"syntology":null},{"url":"/paper/topological-graph-neural-networks","slug":"topological-graph-neural-networks","title":"Topological Graph Neural Networks","date":"2021-02-15","arxiv_id":"2102.07835","repositories_listed":1,"syntology":null},{"url":"/paper/adversarial-attack-on-network-embeddings-via","slug":"adversarial-attack-on-network-embeddings-via","title":"Adversarial Attack on Network Embeddings via Supervised Network Poisoning","date":"2021-02-14","arxiv_id":"2102.07164","repositories_listed":1,"syntology":null},{"url":"/paper/multiplex-bipartite-network-embedding-using","slug":"multiplex-bipartite-network-embedding-using","title":"Multiplex Bipartite Network Embedding using Dual Hypergraph Convolutional Networks","date":"2021-02-12","arxiv_id":"2102.06371","repositories_listed":1,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_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","sample_list":"/paper/multiplex-bipartite-network-embedding-using#ran","syntology_url":"https://syntology.ai/paper/2102.06371","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2102.06371"}},"official":null}},{"url":"/paper/two-sides-of-the-same-coin-heterophily-and","slug":"two-sides-of-the-same-coin-heterophily-and","title":"Two Sides of the Same Coin: Heterophily and Oversmoothing in Graph Convolutional Neural Networks","date":"2021-02-12","arxiv_id":"2102.06462","repositories_listed":1,"syntology":null},{"url":"/paper/lime-low-cost-and-incremental-learning-for","slug":"lime-low-cost-and-incremental-learning-for","title":"LIME: Low-Cost and Incremental Learning for Dynamic Heterogeneous Information Networks","date":"2021-02-11","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/efficient-graph-deep-learning-in-tensorflow","slug":"efficient-graph-deep-learning-in-tensorflow","title":"Efficient Graph Deep Learning in TensorFlow with tf_geometric","date":"2021-01-27","arxiv_id":"2101.11552","repositories_listed":1,"syntology":null},{"url":"/paper/improving-graph-representation-learning-by","slug":"improving-graph-representation-learning-by","title":"Calibrating and Improving Graph Contrastive Learning","date":"2021-01-27","arxiv_id":"2101.11525","repositories_listed":1,"syntology":null},{"url":"/paper/graphattacker-a-general-multi-task","slug":"graphattacker-a-general-multi-task","title":"GraphAttacker: A General Multi-Task GraphAttack Framework","date":"2021-01-18","arxiv_id":"2101.06855","repositories_listed":1,"syntology":null},{"url":"/paper/membership-inference-attack-on-graph-neural","slug":"membership-inference-attack-on-graph-neural","title":"Membership Inference Attack on Graph Neural Networks","date":"2021-01-17","arxiv_id":"2101.06570","repositories_listed":1,"syntology":null},{"url":"/paper/variational-embeddings-for-community","slug":"variational-embeddings-for-community","title":"Variational Embeddings for Community Detection and Node Representation","date":"2021-01-11","arxiv_id":"2101.03885","repositories_listed":1,"syntology":null},{"url":"/paper/graphhop-an-enhanced-label-propagation-method","slug":"graphhop-an-enhanced-label-propagation-method","title":"GraphHop: An Enhanced Label Propagation Method for Node Classification","date":"2021-01-07","arxiv_id":"2101.02326","repositories_listed":1,"syntology":null},{"url":"/paper/beyond-low-frequency-information-in-graph","slug":"beyond-low-frequency-information-in-graph","title":"Beyond Low-frequency Information in Graph Convolutional Networks","date":"2021-01-04","arxiv_id":"2101.00797","repositories_listed":1,"syntology":null},{"url":"/paper/hypergraph-neural-networks-for-hypergraph","slug":"hypergraph-neural-networks-for-hypergraph","title":"Hypergraph Neural Networks for Hypergraph Matching","date":"2021-01-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/adaptive-graph-diffusion-networks-with-hop","slug":"adaptive-graph-diffusion-networks-with-hop","title":"Adaptive Graph Diffusion Networks","date":"2020-12-30","arxiv_id":"2012.15024","repositories_listed":1,"syntology":null},{"url":"/paper/a-pipeline-for-fair-comparison-of-graph","slug":"a-pipeline-for-fair-comparison-of-graph","title":"A pipeline for fair comparison of graph neural networks in node classification tasks","date":"2020-12-19","arxiv_id":"2012.10619","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_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","sample_list":"/paper/a-pipeline-for-fair-comparison-of-graph#ran","syntology_url":"https://syntology.ai/paper/2012.10619","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2012.10619"}},"official":{"repos":["karl-zhao/benchmarking-gnns-pyg"],"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"]}}},{"url":"/paper/an-experimental-study-of-the-transferability","slug":"an-experimental-study-of-the-transferability","title":"An Experimental Study of the Transferability of Spectral Graph Networks","date":"2020-12-18","arxiv_id":"2012.10258","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_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) · 1 unverified","sample_list":"/paper/an-experimental-study-of-the-transferability#ran","syntology_url":"https://syntology.ai/paper/2012.10258","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2012.10258"}},"official":{"repos":["Axeln78/Transferability-of-spectral-gnns"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["unlocated"]}}}],"record_sha256":"2bd41e0ec9dd747b132392de6444a31cd14bf579e75c72eea219df79455375ab","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}