{"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/16","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":16,"pages_in_order":19,"rows_per_page":100,"rows":[1501,1600],"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/15","next":"/task/node-classification/papers/17","papers":[{"url":null,"slug":"neighborhood-random-walk-graph-sampling-for","title":"Neighborhood Random Walk Graph Sampling for Regularized Bayesian Graph Convolutional Neural Networks","date":"2021-12-14","arxiv_id":"2112.07743","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-use-of-unrealistic-predictions-in","title":"On the Use of Unrealistic Predictions in Hundreds of Papers Evaluating Graph Representations","date":"2021-12-08","arxiv_id":"2112.04274","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-theory-can-sometimes-explain-1","title":"Learning Theory Can (Sometimes) Explain Generalisation in Graph Neural Networks","date":"2021-12-07","arxiv_id":"2112.03968","repositories_listed":0,"syntology":null},{"url":null,"slug":"trivial-bundle-embeddings-for-learning-graph","title":"Trivial bundle embeddings for learning graph representations","date":"2021-12-05","arxiv_id":"2112.02531","repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-scale-graph-convolutional-networks-with","title":"Multi-scale Graph Convolutional Networks with Self-Attention","date":"2021-12-04","arxiv_id":"2112.03262","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-spatial-temporal-graphs-for-active","title":"Learning Spatial-Temporal Graphs for Active Speaker Detection","date":"2021-12-02","arxiv_id":"2112.01479","repositories_listed":0,"syntology":null},{"url":"/paper/multi-task-self-distillation-for-graph-based","slug":"multi-task-self-distillation-for-graph-based","title":"Multi-task Self-distillation for Graph-based Semi-Supervised Learning","date":"2021-12-02","arxiv_id":"2112.01174","repositories_listed":0,"syntology":null},{"url":null,"slug":"adaptive-data-augmentation-on-temporal-graphs","title":"Adaptive Data Augmentation on Temporal Graphs","date":"2021-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"contrastive-graph-poisson-networks-semi","title":"Contrastive Graph Poisson Networks: Semi-Supervised Learning with Extremely Limited Labels","date":"2021-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"structure-aware-label-smoothing-for-graph","title":"Structure-Aware Label Smoothing for Graph Neural Networks","date":"2021-12-01","arxiv_id":"2112.00499","repositories_listed":0,"syntology":null},{"url":null,"slug":"ultrahyperbolic-neural-networks","title":"Ultrahyperbolic Neural Networks","date":"2021-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"geometric-multimodal-deep-learning-with-multi","title":"Geometric Multimodal Deep Learning with Multi-Scaled Graph Wavelet Convolutional Network","date":"2021-11-26","arxiv_id":"2111.13361","repositories_listed":0,"syntology":null},{"url":"/paper/network-in-graph-neural-network","slug":"network-in-graph-neural-network","title":"Network In Graph Neural Network","date":"2021-11-23","arxiv_id":"2111.11638","repositories_listed":0,"syntology":null},{"url":null,"slug":"strokenet-stroke-assisted-and-hierarchical","title":"StrokeNet: Stroke Assisted and Hierarchical Graph Reasoning Networks","date":"2021-11-23","arxiv_id":"2111.11718","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-neural-networks-with-feature-and","title":"Graph Neural Networks with Feature and Structure Aware Random Walk","date":"2021-11-19","arxiv_id":"2111.10102","repositories_listed":0,"syntology":null},{"url":null,"slug":"structure-and-features-fusion-with-evidential","title":"Structure and Features Fusion with Evidential Graph Convolutional Neural Network for Node Classification","date":"2021-11-16","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":"/paper/cn-motifs-perceptive-graph-neural-networks","slug":"cn-motifs-perceptive-graph-neural-networks","title":"CN-Motifs Perceptive Graph Neural Networks","date":"2021-11-15","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"implicit-vs-unfolded-graph-neural-networks-1","title":"Implicit vs Unfolded Graph Neural Networks","date":"2021-11-12","arxiv_id":"2111.06592","repositories_listed":0,"syntology":null},{"url":null,"slug":"topic-aware-latent-models-for-representation","title":"Topic-aware latent models for representation learning on networks","date":"2021-11-10","arxiv_id":"2111.05576","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-embedding-with-hierarchical-attentive","title":"Graph Embedding with Hierarchical Attentive Membership","date":"2021-10-31","arxiv_id":"2111.00604","repositories_listed":0,"syntology":null},{"url":null,"slug":"barlow-graph-auto-encoder-for-unsupervised","title":"Barlow Graph Auto-Encoder for Unsupervised Network Embedding","date":"2021-10-29","arxiv_id":"2110.15742","repositories_listed":0,"syntology":null},{"url":"/paper/tackling-oversmoothing-of-gnns-with-1","slug":"tackling-oversmoothing-of-gnns-with-1","title":"Deeper-GXX: Deepening Arbitrary GNNs","date":"2021-10-26","arxiv_id":"2110.13798","repositories_listed":0,"syntology":null},{"url":null,"slug":"gophormer-ego-graph-transformer-for-node","title":"Gophormer: Ego-Graph Transformer for Node Classification","date":"2021-10-25","arxiv_id":"2110.13094","repositories_listed":0,"syntology":null},{"url":null,"slug":"degree-based-random-walk-approach-for-graph","title":"Degree-Based Random Walk Approach for Graph Embedding","date":"2021-10-21","arxiv_id":"2110.13627","repositories_listed":0,"syntology":null},{"url":null,"slug":"watermarking-graph-neural-networks-based-on","title":"Watermarking Graph Neural Networks based on Backdoor Attacks","date":"2021-10-21","arxiv_id":"2110.11024","repositories_listed":0,"syntology":null},{"url":null,"slug":"surrogate-representation-learning-with","title":"Surrogate Representation Learning with Isometric Mapping for Gray-box Graph Adversarial Attacks","date":"2021-10-20","arxiv_id":"2110.10482","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-partner-neural-networks-for-semi","title":"Graph Partner Neural Networks for Semi-Supervised Learning on Graphs","date":"2021-10-18","arxiv_id":"2110.09182","repositories_listed":0,"syntology":null},{"url":null,"slug":"gcn-se-attention-as-explainability-for-node","title":"GCN-SE: Attention as Explainability for Node Classification in Dynamic Graphs","date":"2021-10-11","arxiv_id":"2110.05598","repositories_listed":0,"syntology":null},{"url":null,"slug":"haar-wavelet-feature-compression-for","title":"Haar Wavelet Feature Compression for Quantized Graph Convolutional Networks","date":"2021-10-10","arxiv_id":"2110.04824","repositories_listed":0,"syntology":null},{"url":null,"slug":"label-propagation-across-graphs-node","title":"Label Propagation across Graphs: Node Classification using Graph Neural Tangent Kernels","date":"2021-10-07","arxiv_id":"2110.03763","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-pointer-neural-networks","title":"Graph Pointer Neural Networks","date":"2021-10-03","arxiv_id":"2110.00973","repositories_listed":0,"syntology":null},{"url":null,"slug":"latent-network-embedding-via-adversarial-auto","title":"Latent Network Embedding via Adversarial Auto-encoders","date":"2021-09-30","arxiv_id":"2109.15257","repositories_listed":0,"syntology":null},{"url":null,"slug":"bandits-for-black-box-attacks-to-graph-neural","title":"Bandits for Black-box Attacks to Graph Neural Networks with Structure Perturbation","date":"2021-09-29","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"connecting-graph-convolution-and-graph-pca","title":"Connecting Graph Convolution and Graph PCA","date":"2021-09-29","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"convolutional-networks-on-enhanced-message","title":"Convolutional Networks on Enhanced Message-Passing Graph Improve Semi-Supervised Classification with Few Labels","date":"2021-09-29","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"crossformer-transformer-with-alternated-cross","title":"Crossformer: Transformer with Alternated Cross-Layer Guidance","date":"2021-09-29","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"effective-polynomial-filter-adaptation-for","title":"Effective Polynomial Filter Adaptation for Graph Neural Networks","date":"2021-09-29","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"efficient-ensembles-of-graph-neural-networks","title":"Efficient Ensembles of Graph Neural Networks","date":"2021-09-29","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"equivariant-heterogeneous-graph-networks","title":"Equivariant Heterogeneous Graph Networks","date":"2021-09-29","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"feature-augmented-hypergraph-neural-networks","title":"FEATURE-AUGMENTED HYPERGRAPH NEURAL NETWORKS","date":"2021-09-29","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"gcn-sl-graph-convolutional-network-with","title":"GCN-SL: Graph Convolutional Network with Structure Learning for Disassortative Graphs","date":"2021-09-29","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-information-matters-understanding-graph","title":"Graph Information Matters: Understanding Graph Filters from Interaction Probability","date":"2021-09-29","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"graphens-neighbor-aware-ego-network-synthesis","title":"GraphENS: Neighbor-Aware Ego Network Synthesis for Class-Imbalanced Node Classification","date":"2021-09-29","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"how-frequency-effect-graph-neural-networks","title":"How Frequency Effect Graph Neural Networks","date":"2021-09-29","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"inductive-lottery-ticket-learning-for-graph","title":"Inductive Lottery Ticket Learning for Graph Neural Networks","date":"2021-09-29","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"is-heterophily-a-real-nightmare-for-graph-1","title":"Is Heterophily A Real Nightmare For Graph Neural Networks on Performing Node Classification?","date":"2021-09-29","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"m-mix-generating-hard-negatives-via-multiple","title":"$m$-mix: Generating hard negatives via multiple samples mixing for contrastive learning","date":"2021-09-29","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-level-approach-to-accurate-and-scalable","title":"MULTI-LEVEL APPROACH TO ACCURATE AND SCALABLE HYPERGRAPH EMBEDDING","date":"2021-09-29","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"neurally-boosted-supervised-spectral","title":"Neurally boosted supervised spectral clustering","date":"2021-09-29","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"pi-gnn-towards-robust-semi-supervised-node","title":"PI-GNN: Towards Robust Semi-Supervised Node Classification against Noisy Labels","date":"2021-09-29","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"stabilized-self-training-with-negative","title":"Stabilized Self-training with Negative Sampling on Few-labeled Graph Data","date":"2021-09-29","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"contig-continuous-representation-learning-on","title":"ConTIG: Continuous Representation Learning on Temporal Interaction Graphs","date":"2021-09-27","arxiv_id":"2110.06088","repositories_listed":0,"syntology":null},{"url":null,"slug":"embedding-node-structural-role-identity-using","title":"Embedding Node Structural Role Identity Using Stress Majorization","date":"2021-09-14","arxiv_id":"2109.07023","repositories_listed":0,"syntology":null},{"url":"/paper/is-heterophily-a-real-nightmare-for-graph","slug":"is-heterophily-a-real-nightmare-for-graph","title":"Is Heterophily A Real Nightmare For Graph Neural Networks To Do Node Classification?","date":"2021-09-12","arxiv_id":"2109.05641","repositories_listed":0,"syntology":null},{"url":null,"slug":"ergodic-limits-relaxations-and-geometric","title":"Ergodic Limits, Relaxations, and Geometric Properties of Random Walk Node Embeddings","date":"2021-09-09","arxiv_id":"2109.04526","repositories_listed":0,"syntology":null},{"url":null,"slug":"quint-node-embedding-using-network-hashing","title":"QUINT: Node embedding using network hashing","date":"2021-09-09","arxiv_id":"2109.04206","repositories_listed":0,"syntology":null},{"url":null,"slug":"hmsg-heterogeneous-graph-neural-network-based","title":"HMSG: Heterogeneous Graph Neural Network based on Metapath Subgraph Learning","date":"2021-09-07","arxiv_id":"2109.02868","repositories_listed":0,"syntology":null},{"url":null,"slug":"heterogeneous-graph-neural-network-with-multi","title":"Heterogeneous Graph Neural Network with Multi-view Representation Learning","date":"2021-08-31","arxiv_id":"2108.13650","repositories_listed":0,"syntology":null},{"url":null,"slug":"quantized-convolutional-neural-networks","title":"Quantized Convolutional Neural Networks Through the Lens of Partial Differential Equations","date":"2021-08-31","arxiv_id":"2109.00095","repositories_listed":0,"syntology":null},{"url":"/paper/adaptive-and-interpretable-graph-convolution","slug":"adaptive-and-interpretable-graph-convolution","title":"Layer-wise Adaptive Graph Convolution Networks Using Generalized Pagerank","date":"2021-08-24","arxiv_id":"2108.10636","repositories_listed":0,"syntology":null},{"url":null,"slug":"refine-random-range-finder-for-network","title":"REFINE: Random RangE FInder for Network Embedding","date":"2021-08-24","arxiv_id":"2108.10703","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-hard-label-black-box-adversarial-attack","title":"A Hard Label Black-box Adversarial Attack Against Graph Neural Networks","date":"2021-08-21","arxiv_id":"2108.09513","repositories_listed":0,"syntology":null},{"url":null,"slug":"semi-supervised-network-embedding-with","title":"Semi-supervised Network Embedding with Differentiable Deep Quantisation","date":"2021-08-20","arxiv_id":"2108.09128","repositories_listed":0,"syntology":null},{"url":null,"slug":"unsupervised-domain-adaptive-hash-for","title":"Unsupervised Domain-adaptive Hash for Networks","date":"2021-08-20","arxiv_id":"2108.09136","repositories_listed":0,"syntology":null},{"url":null,"slug":"blockchain-phishing-scam-detection-via-multi","title":"Blockchain Phishing Scam Detection via Multi-channel Graph Classification","date":"2021-08-19","arxiv_id":"2108.08456","repositories_listed":0,"syntology":null},{"url":null,"slug":"label-informed-graph-structure-learning-for","title":"Label-informed Graph Structure Learning for Node Classification","date":"2021-08-10","arxiv_id":"2108.04595","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-framework-for-joint-unsupervised-learning","title":"A Framework for Joint Unsupervised Learning of Cluster-Aware Embedding for Heterogeneous Networks","date":"2021-08-09","arxiv_id":"2108.03953","repositories_listed":0,"syntology":null},{"url":null,"slug":"missing-data-estimation-in-temporal","title":"Missing Data Estimation in Temporal Multilayer Position-aware Graph Neural Network (TMP-GNN)","date":"2021-08-07","arxiv_id":"2108.03400","repositories_listed":0,"syntology":null},{"url":null,"slug":"explicit-pairwise-factorized-graph-neural","title":"Explicit Pairwise Factorized Graph Neural Network for Semi-Supervised Node Classification","date":"2021-07-27","arxiv_id":"2107.13059","repositories_listed":0,"syntology":null},{"url":null,"slug":"gcexplainer-human-in-the-loop-concept-based","title":"GCExplainer: Human-in-the-Loop Concept-based Explanations for Graph Neural Networks","date":"2021-07-25","arxiv_id":"2107.11889","repositories_listed":0,"syntology":null},{"url":null,"slug":"ego-gnns-exploiting-ego-structures-in-graph","title":"Ego-GNNs: Exploiting Ego Structures in Graph Neural Networks","date":"2021-07-22","arxiv_id":"2107.10957","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-graph-data-augmentation-strategy-with","title":"A Graph Data Augmentation Strategy with Entropy Preservation","date":"2021-07-13","arxiv_id":"2107.06048","repositories_listed":0,"syntology":null},{"url":null,"slug":"automated-graph-learning-via-population-based","title":"Automated Graph Learning via Population Based Self-Tuning GCN","date":"2021-07-09","arxiv_id":"2107.04713","repositories_listed":0,"syntology":null},{"url":null,"slug":"privacy-preserving-representation-learning-on","title":"Privacy-Preserving Representation Learning on Graphs: A Mutual Information Perspective","date":"2021-07-03","arxiv_id":"2107.01475","repositories_listed":0,"syntology":null},{"url":null,"slug":"searchgcn-powering-embedding-retrieval-by","title":"SearchGCN: Powering Embedding Retrieval by Graph Convolution Networks for E-Commerce Search","date":"2021-07-01","arxiv_id":"2107.00525","repositories_listed":0,"syntology":null},{"url":null,"slug":"curvature-graph-neural-network","title":"Curvature Graph Neural Network","date":"2021-06-30","arxiv_id":"2106.15762","repositories_listed":0,"syntology":null},{"url":null,"slug":"exploiting-spiking-dynamics-with-spatial","title":"Exploiting Spiking Dynamics with Spatial-temporal Feature Normalization in Graph Learning","date":"2021-06-30","arxiv_id":"2107.06865","repositories_listed":0,"syntology":null},{"url":null,"slug":"dual-gnns-graph-neural-network-learning-with","title":"Dual GNNs: Graph Neural Network Learning with Limited Supervision","date":"2021-06-29","arxiv_id":"2106.15755","repositories_listed":0,"syntology":null},{"url":"/paper/simple-truncated-svd-based-model-for-node","slug":"simple-truncated-svd-based-model-for-node","title":"Simple Truncated SVD based Model for Node Classification on Heterophilic Graphs","date":"2021-06-24","arxiv_id":"2106.12807","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-vertical-federated-learning-framework-for-1","title":"A Vertical Federated Learning Framework for Graph Convolutional Network","date":"2021-06-22","arxiv_id":"2106.11593","repositories_listed":0,"syntology":null},{"url":null,"slug":"graphmixup-improving-class-imbalanced-node","title":"GraphMixup: Improving Class-Imbalanced Node Classification on Graphs by Self-supervised Context Prediction","date":"2021-06-21","arxiv_id":"2106.11133","repositories_listed":0,"syntology":null},{"url":null,"slug":"large-scale-network-embedding-in-apache-spark","title":"Large-Scale Network Embedding in Apache Spark","date":"2021-06-20","arxiv_id":"2106.10620","repositories_listed":0,"syntology":null},{"url":"/paper/rlc-gnn-an-improved-deep-architecture-for","slug":"rlc-gnn-an-improved-deep-architecture-for","title":"RLC-GNN: An Improved Deep Architecture for Spatial-Based Graph Neural Network with Application to Fraud Detection","date":"2021-06-18","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"self-supervised-incremental-deep-graph","title":"Self-supervised Incremental Deep Graph Learning for Ethereum Phishing Scam Detection","date":"2021-06-18","arxiv_id":"2106.10176","repositories_listed":0,"syntology":null},{"url":null,"slug":"data-augmentation-for-graph-convolutional","title":"Data Augmentation for Graph Convolutional Network on Semi-Supervised Classification","date":"2021-06-16","arxiv_id":"2106.08848","repositories_listed":0,"syntology":null},{"url":null,"slug":"seen-sharpening-explanations-for-graph-neural","title":"SEEN: Sharpening Explanations for Graph Neural Networks using Explanations from Neighborhoods","date":"2021-06-16","arxiv_id":"2106.08532","repositories_listed":0,"syntology":null},{"url":null,"slug":"node-classification-meets-link-prediction-on","title":"Node Classification Meets Link Prediction on Knowledge Graphs","date":"2021-06-14","arxiv_id":"2106.07297","repositories_listed":0,"syntology":null},{"url":null,"slug":"weakly-supervised-graph-meta-learning-for-few","title":"Robust Graph Meta-learning for Weakly-supervised Few-shot Node Classification","date":"2021-06-12","arxiv_id":"2106.06873","repositories_listed":0,"syntology":null},{"url":null,"slug":"is-homophily-a-necessity-for-graph-neural","title":"Is Homophily a Necessity for Graph Neural Networks?","date":"2021-06-11","arxiv_id":"2106.06134","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-symbiosis-learning","title":"AKE-GNN: Effective Graph Learning with Adaptive Knowledge Exchange","date":"2021-06-10","arxiv_id":"2106.05455","repositories_listed":0,"syntology":null},{"url":null,"slug":"fairness-aware-node-representation-learning","title":"Fairness-Aware Node Representation Learning","date":"2021-06-09","arxiv_id":"2106.05391","repositories_listed":0,"syntology":null},{"url":null,"slug":"vertex-centric-visual-programming-for-graph","title":"Vertex-Centric Visual Programming for Graph Neural Networks","date":"2021-06-09","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"on-local-aggregation-in-heterophilic-graphs","title":"On Local Aggregation in Heterophilic Graphs","date":"2021-06-06","arxiv_id":"2106.03213","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-infomax-adversarial-learning-for","title":"Graph Infomax Adversarial Learning for Treatment Effect Estimation with Networked Observational Data","date":"2021-06-05","arxiv_id":"2106.02881","repositories_listed":0,"syntology":null},{"url":null,"slug":"ell-2-norm-flow-diffusion-in-near-linear-time","title":"$\\ell_2$-norm Flow Diffusion in Near-Linear Time","date":"2021-05-30","arxiv_id":"2105.14629","repositories_listed":0,"syntology":null},{"url":null,"slug":"hop-aware-dimension-optimization-for-graph","title":"Relational Graph Neural Network Design via Progressive Neural Architecture Search","date":"2021-05-30","arxiv_id":"2105.14490","repositories_listed":0,"syntology":null},{"url":null,"slug":"slgcn-structure-learning-graph-convolutional","title":"GCN-SL: Graph Convolutional Networks with Structure Learning for Graphs under Heterophily","date":"2021-05-28","arxiv_id":"2105.13795","repositories_listed":0,"syntology":null},{"url":null,"slug":"adagcn-adaptive-boosting-algorithm-for-graph","title":"Boosting-GNN: Boosting Algorithm for Graph Networks on Imbalanced Node Classification","date":"2021-05-25","arxiv_id":"2105.11625","repositories_listed":0,"syntology":null},{"url":null,"slug":"auxiliary-learning-induced-graph","title":"Auxiliary learning induced graph convolutional networks","date":"2021-05-21","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"is-heterophily-a-real-nightmare-for-graph-2","title":"Is Heterophily A Real Nightmare For Graph Neural Networks Performing Node Classification?","date":"2021-05-21","arxiv_id":null,"repositories_listed":0,"syntology":null}],"record_sha256":"5208637be260dee57d17482818195257aef20e77de3d38f61cd3bbde5e35286f","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}