{"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/17","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":17,"pages_in_order":19,"rows_per_page":100,"rows":[1601,1700],"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/16","next":"/task/node-classification/papers/18","papers":[{"url":null,"slug":"ultrahyperbolic-neural-networks-1","title":"Ultrahyperbolic Neural Networks","date":"2021-05-21","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-sanitation-with-application-to-node","title":"Graph Sanitation with Application to Node Classification","date":"2021-05-19","arxiv_id":"2105.09384","repositories_listed":0,"syntology":null},{"url":null,"slug":"understanding-and-improvement-of-adversarial","title":"Understanding and Improvement of Adversarial Training for Network Embedding from an Optimization Perspective","date":"2021-05-17","arxiv_id":"2105.08007","repositories_listed":0,"syntology":null},{"url":null,"slug":"neural-trees-for-learning-on-graphs","title":"Neural Trees for Learning on Graphs","date":"2021-05-15","arxiv_id":"2105.07264","repositories_listed":0,"syntology":null},{"url":null,"slug":"meta-inductive-node-classification-across","title":"Meta-Inductive Node Classification across Graphs","date":"2021-05-14","arxiv_id":"2105.06725","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-power-of-the-weisfeiler-leman-algorithm-1","title":"The Power of the Weisfeiler-Leman Algorithm for Machine Learning with Graphs","date":"2021-05-12","arxiv_id":"2105.05911","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-attention-networks-with-positional","title":"Graph Attention Networks with Positional Embeddings","date":"2021-05-09","arxiv_id":"2105.04037","repositories_listed":0,"syntology":null},{"url":null,"slug":"non-recursive-graph-convolutional-networks","title":"Non-Recursive Graph Convolutional Networks","date":"2021-05-09","arxiv_id":"2105.03868","repositories_listed":0,"syntology":null},{"url":null,"slug":"versagnn-a-versatile-accelerator-for-graph","title":"VersaGNN: a Versatile accelerator for Graph neural networks","date":"2021-05-04","arxiv_id":"2105.01280","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-decoupling-attention-markov-networks","title":"Graph Decoupling Attention Markov Networks for Semi-supervised Graph Node Classification","date":"2021-04-28","arxiv_id":"2104.13718","repositories_listed":0,"syntology":null},{"url":null,"slug":"seastar-vertex-centric-programming-for-graph","title":"Seastar: vertex-centric programming for graph neural networks","date":"2021-04-21","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"sas-a-simple-accurate-and-scalable-node","title":"SAS: A Simple, Accurate and Scalable Node Classification Algorithm","date":"2021-04-19","arxiv_id":"2104.09120","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-hyperbolic-to-hyperbolic-graph","title":"A Hyperbolic-to-Hyperbolic Graph Convolutional Network","date":"2021-04-14","arxiv_id":"2104.06942","repositories_listed":0,"syntology":null},{"url":null,"slug":"deep-attributed-network-representation","title":"Deep Attributed Network Representation Learning via Attribute Enhanced Neighborhood","date":"2021-04-12","arxiv_id":"2104.05234","repositories_listed":0,"syntology":null},{"url":null,"slug":"edge-enriching-knowledge-graph-embeddings","title":"Edge: Enriching Knowledge Graph Embeddings with External Text","date":"2021-04-11","arxiv_id":"2104.04909","repositories_listed":0,"syntology":null},{"url":null,"slug":"explainability-based-backdoor-attacks-against","title":"Explainability-based Backdoor Attacks Against Graph Neural Networks","date":"2021-04-08","arxiv_id":"2104.03674","repositories_listed":0,"syntology":null},{"url":null,"slug":"modeling-graph-node-correlations-with","title":"Modeling Graph Node Correlations with Neighbor Mixture Models","date":"2021-03-29","arxiv_id":"2103.15966","repositories_listed":0,"syntology":null},{"url":null,"slug":"beyond-low-pass-filters-adaptive-feature","title":"Beyond Low-Pass Filters: Adaptive Feature Propagation on Graphs","date":"2021-03-26","arxiv_id":"2103.14187","repositories_listed":0,"syntology":null},{"url":null,"slug":"dynacpd-embedding-algorithm-for-prediction","title":"DynACPD Embedding Algorithm for Prediction Tasks in Dynamic Networks","date":"2021-03-12","arxiv_id":"2103.07080","repositories_listed":0,"syntology":null},{"url":null,"slug":"metapaths-guided-neighbors-aggregated-network","title":"Metapaths guided Neighbors aggregated Network for?Heterogeneous Graph Reasoning","date":"2021-03-11","arxiv_id":"2103.06474","repositories_listed":0,"syntology":null},{"url":null,"slug":"2d-histology-meets-3d-topology","title":"2D histology meets 3D topology: Cytoarchitectonic brain mapping with Graph Neural Networks","date":"2021-03-09","arxiv_id":"2103.05259","repositories_listed":0,"syntology":null},{"url":null,"slug":"netvec-a-scalable-hypergraph-embedding-system","title":"Scalable Hypergraph Embedding System","date":"2021-03-09","arxiv_id":"2103.09660","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-graph-neural-networks-with-positive","title":"Learning Graph Neural Networks with Positive and Unlabeled Nodes","date":"2021-03-08","arxiv_id":"2103.04683","repositories_listed":0,"syntology":null},{"url":null,"slug":"unified-robust-training-for-graph","title":"Unified Robust Training for Graph NeuralNetworks against Label Noise","date":"2021-03-05","arxiv_id":"2103.03414","repositories_listed":0,"syntology":null},{"url":null,"slug":"graphfool-targeted-label-adversarial-attack","title":"Graphfool: Targeted Label Adversarial Attack on Graph Embedding","date":"2021-02-24","arxiv_id":"2102.12284","repositories_listed":0,"syntology":null},{"url":null,"slug":"bridging-graph-neural-networks-and","title":"A Statistical Relational Approach to Learning Distance-based GCNs","date":"2021-02-13","arxiv_id":"2102.07007","repositories_listed":0,"syntology":null},{"url":null,"slug":"wasserstein-diffusion-on-graphs-with-missing-1","title":"Wasserstein Graph Neural Networks for Graphs with Missing Attributes","date":"2021-02-06","arxiv_id":"2102.03450","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-graph-representations","title":"Learning Graph Representations","date":"2021-02-03","arxiv_id":"2102.02026","repositories_listed":0,"syntology":null},{"url":null,"slug":"infant-cry-classification-with-graph","title":"Infant Cry Classification with Graph Convolutional Networks","date":"2021-01-31","arxiv_id":"2102.02909","repositories_listed":0,"syntology":null},{"url":null,"slug":"adversarial-active-learning-based","title":"Adversarial Active Learning based Heterogeneous Graph Neural Network for Fake News Detection","date":"2021-01-27","arxiv_id":"2101.11206","repositories_listed":0,"syntology":null},{"url":null,"slug":"nemr-network-embedding-on-metric-of-relation","title":"NEMR: Network Embedding on Metric of Relation","date":"2021-01-20","arxiv_id":"2101.08020","repositories_listed":0,"syntology":null},{"url":null,"slug":"communication-efficient-sampling-for-1","title":"Communication-Efficient Sampling for Distributed Training of Graph Convolutional Networks","date":"2021-01-19","arxiv_id":"2101.07706","repositories_listed":0,"syntology":null},{"url":null,"slug":"edge-featured-graph-attention-network","title":"Edge-Featured Graph Attention Network","date":"2021-01-19","arxiv_id":"2101.07671","repositories_listed":0,"syntology":null},{"url":null,"slug":"jitune-just-in-time-hyperparameter-tuning-for","title":"JITuNE: Just-In-Time Hyperparameter Tuning for Network Embedding Algorithms","date":"2021-01-16","arxiv_id":"2101.06427","repositories_listed":0,"syntology":null},{"url":null,"slug":"bigcn-a-bi-directional-low-pass-filtering-1","title":"BiGCN: A Bi-directional Low-Pass Filtering Graph Neural Network","date":"2021-01-14","arxiv_id":"2101.05519","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-survey-on-embedding-dynamic-graphs","title":"A Survey on Embedding Dynamic Graphs","date":"2021-01-04","arxiv_id":"2101.01229","repositories_listed":0,"syntology":null},{"url":null,"slug":"tensorizing-subgraph-search-in-the-supernet","title":"Topology-aware Tensor Decomposition for Meta-graph Learning","date":"2021-01-04","arxiv_id":"2101.01078","repositories_listed":0,"syntology":null},{"url":null,"slug":"representation-learning-of-reconstructed","title":"Representation Learning of Reconstructed Graphs Using Random Walk Graph Convolutional Network","date":"2021-01-02","arxiv_id":"2101.00417","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-deep-graph-neural-networks-architecture","title":"A Deep Graph Neural Networks Architecture Design: From Global Pyramid-like Shrinkage Skeleton to Local Link Rewiring","date":"2021-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"bridging-graph-network-to-lifelong-learning","title":"Bridging Graph Network to Lifelong Learning with Feature Interaction","date":"2021-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"coldexpand-semi-supervised-graph-learning-in","title":"ColdExpand: Semi-Supervised Graph Learning in Cold Start","date":"2021-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"collective-robustness-certificates","title":"Collective Robustness Certificates","date":"2021-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"fasg-feature-aggregation-self-training-gcn","title":"FASG: Feature Aggregation Self-training GCN for Semi-supervised Node Classification","date":"2021-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"global-node-attentions-via-adaptive-spectral","title":"Global Node Attentions via Adaptive Spectral Filters","date":"2021-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-graph-similarity-network","title":"Graph-Graph Similarity Network","date":"2021-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-pooling-by-edge-cut","title":"Graph Pooling by Edge Cut","date":"2021-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-structural-aggregation-for-explainable","title":"Graph Structural Aggregation for Explainable Learning","date":"2021-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-view-consistent-learning-network","title":"Graph View-Consistent Learning Network","date":"2021-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"hard-masking-for-explaining-graph-neural","title":"Hard Masking for Explaining Graph Neural Networks","date":"2021-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"incremental-learning-on-growing-graphs","title":"Incremental Learning on Growing Graphs","date":"2021-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"iterated-graph-neural-network-system","title":"Iterated graph neural network system","date":"2021-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"memory-augmented-design-of-graph-neural","title":"Memory Augmented Design of Graph Neural Networks","date":"2021-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"node-select-a-flexible-graph-neural-network","title":"NODE-SELECT: A FLEXIBLE GRAPH NEURAL NETWORK BASED ON REALISTIC PROPAGATION SCHEME","date":"2021-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"teleport-graph-convolutional-networks","title":"Teleport Graph Convolutional Networks","date":"2021-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-powerful-graph-neural-networks","title":"Towards Powerful Graph Neural Networks: Diversity Matters","date":"2021-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-robust-graph-neural-networks-against","title":"Towards Robust Graph Neural Networks against Label Noise","date":"2021-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"vecoder-variational-embeddings-for-community","title":"VECoDeR - Variational Embeddings for Community Detection and Node Representation","date":"2021-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"vem-gcn-topology-optimization-with","title":"VEM-GCN: Topology Optimization with Variational EM for Graph Convolutional Networks","date":"2021-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"bayesian-inductive-learner-for-graph","title":"Bayesian Graph Neural Network for Fast identification of critical nodes in Uncertain Complex Networks","date":"2020-12-26","arxiv_id":"2012.15733","repositories_listed":0,"syntology":null},{"url":null,"slug":"semi-supervised-node-classification-on-graphs","title":"Semi-Supervised Node Classification on Graphs: Markov Random Fields vs. Graph Neural Networks","date":"2020-12-24","arxiv_id":"2012.13085","repositories_listed":0,"syntology":null},{"url":null,"slug":"unifying-homophily-and-heterophily-network","title":"Unifying Homophily and Heterophily Network Transformation via Motifs","date":"2020-12-21","arxiv_id":"2012.11400","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-deep-graph-neural-networks-architecture-1","title":"A Deep Graph Neural Networks Architecture Design: From Global Pyramid-like Shrinkage Skeleton to Local Topology Link Rewiring","date":"2020-12-16","arxiv_id":"2012.08717","repositories_listed":0,"syntology":null},{"url":null,"slug":"edge-entropy-as-an-indicator-of-the","title":"Edge Entropy as an Indicator of the Effectiveness of GNNs over CNNs for Node Classification","date":"2020-12-16","arxiv_id":"2012.08698","repositories_listed":0,"syntology":null},{"url":null,"slug":"understanding-graph-embedding-methods-and","title":"Understanding graph embedding methods and their applications","date":"2020-12-15","arxiv_id":"2012.08019","repositories_listed":0,"syntology":null},{"url":null,"slug":"distance-wise-graph-contrastive-learning","title":"Rethinking the Promotion Brought by Contrastive Learning to Semi-Supervised Node Classification","date":"2020-12-14","arxiv_id":"2012.07437","repositories_listed":0,"syntology":null},{"url":null,"slug":"query-free-black-box-adversarial-attacks-on","title":"Blindfolded Attackers Still Threatening: Strict Black-Box Adversarial Attacks on Graphs","date":"2020-12-12","arxiv_id":"2012.06757","repositories_listed":0,"syntology":null},{"url":null,"slug":"i-gcn-robust-graph-convolutional-network-via","title":"I-GCN: Robust Graph Convolutional Network via Influence Mechanism","date":"2020-12-11","arxiv_id":"2012.06110","repositories_listed":0,"syntology":null},{"url":null,"slug":"pair-view-unsupervised-graph-representation","title":"Pair-view Unsupervised Graph Representation Learning","date":"2020-12-11","arxiv_id":"2012.06113","repositories_listed":0,"syntology":null},{"url":null,"slug":"graphfl-a-federated-learning-framework-for","title":"GraphFL: A Federated Learning Framework for Semi-Supervised Node Classification on Graphs","date":"2020-12-08","arxiv_id":"2012.04187","repositories_listed":0,"syntology":null},{"url":null,"slug":"ncgnn-node-level-capsule-graph-neural-network","title":"NCGNN: Node-Level Capsule Graph Neural Network for Semisupervised Classification","date":"2020-12-07","arxiv_id":"2012.03476","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-node-representations-from-noisy","title":"Learning Node Representations from Noisy Graph Structures","date":"2020-12-04","arxiv_id":"2012.02434","repositories_listed":0,"syntology":null},{"url":null,"slug":"unsupervised-adversarially-robust","title":"Unsupervised Adversarially-Robust Representation Learning on Graphs","date":"2020-12-04","arxiv_id":"2012.02486","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-graph-similarity-for-deep-learning","title":"A graph similarity for deep learning","date":"2020-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"adversarial-attacks-on-deep-graph-matching","title":"Adversarial Attacks on Deep Graph Matching","date":"2020-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"unsupervised-joint-k-node-graph-1","title":"Unsupervised Joint k-node Graph Representations with Compositional Energy-Based Models","date":"2020-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"cyclic-label-propagation-for-graph-semi","title":"Cyclic Label Propagation for Graph Semi-supervised Learning","date":"2020-11-24","arxiv_id":"2011.11860","repositories_listed":0,"syntology":null},{"url":null,"slug":"autograph-automated-graph-neural-network","title":"AutoGraph: Automated Graph Neural Network","date":"2020-11-23","arxiv_id":"2011.11288","repositories_listed":0,"syntology":null},{"url":null,"slug":"gnnvis-a-visual-analytics-approach-for","title":"GNNLens: A Visual Analytics Approach for Prediction Error Diagnosis of Graph Neural Networks","date":"2020-11-22","arxiv_id":"2011.11048","repositories_listed":0,"syntology":null},{"url":null,"slug":"adversarial-context-aware-network-embeddings","title":"Adversarial Context Aware Network Embeddings for Textual Networks","date":"2020-11-05","arxiv_id":"2011.02665","repositories_listed":0,"syntology":null},{"url":null,"slug":"gage-geometry-preserving-attributed-graph","title":"GAGE: Geometry Preserving Attributed Graph Embeddings","date":"2020-11-03","arxiv_id":"2011.01422","repositories_listed":0,"syntology":null},{"url":null,"slug":"gain-graph-attention-interaction-network-for","title":"GAIN: Graph Attention & Interaction Network for Inductive Semi-Supervised Learning over Large-scale Graphs","date":"2020-11-03","arxiv_id":"2011.01393","repositories_listed":0,"syntology":null},{"url":"/paper/neural-extractive-summarization-with","slug":"neural-extractive-summarization-with","title":"Neural Extractive Summarization with Hierarchical Attentive Heterogeneous Graph Network","date":"2020-11-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"deep-kernel-supervised-hashing-for-node","title":"Deep Kernel Supervised Hashing for Node Classification in Structural Networks","date":"2020-10-26","arxiv_id":"2010.13582","repositories_listed":0,"syntology":null},{"url":null,"slug":"co-embedding-of-nodes-and-edges-with-graph","title":"Co-embedding of Nodes and Edges with Graph Neural Networks","date":"2020-10-25","arxiv_id":"2010.13242","repositories_listed":0,"syntology":null},{"url":null,"slug":"joint-use-of-node-attributes-and-proximity","title":"Joint Use of Node Attributes and Proximity for Semi-Supervised Classification on Graphs","date":"2020-10-22","arxiv_id":"2010.11536","repositories_listed":0,"syntology":null},{"url":null,"slug":"anisotropic-graph-convolutional-network-for","title":"Anisotropic Graph Convolutional Network for Semi-supervised Learning","date":"2020-10-20","arxiv_id":"2010.10284","repositories_listed":0,"syntology":null},{"url":null,"slug":"meta-path-free-semi-supervised-learning-for","title":"Meta-path Free Semi-supervised Learning for Heterogeneous Networks","date":"2020-10-18","arxiv_id":"2010.08924","repositories_listed":0,"syntology":null},{"url":null,"slug":"instantembedding-efficient-local-node-1","title":"InstantEmbedding: Efficient Local Node Representations","date":"2020-10-14","arxiv_id":"2010.06992","repositories_listed":0,"syntology":null},{"url":null,"slug":"unsupervised-joint-k-node-graph","title":"Unsupervised Joint $k$-node Graph Representations with Compositional Energy-Based Models","date":"2020-10-08","arxiv_id":"2010.04259","repositories_listed":0,"syntology":null},{"url":null,"slug":"rm-n-small-ode-s-small-ig-random-walk","title":"NodeSig: Binary Node Embeddings via Random Walk Diffusion","date":"2020-10-01","arxiv_id":"2010.00261","repositories_listed":0,"syntology":null},{"url":null,"slug":"spectral-embedding-of-graph-networks","title":"Spectral Embedding of Graph Networks","date":"2020-09-30","arxiv_id":"2009.14441","repositories_listed":0,"syntology":null},{"url":null,"slug":"uncertainty-matching-graph-neural-networks-to","title":"Uncertainty-Matching Graph Neural Networks to Defend Against Poisoning Attacks","date":"2020-09-30","arxiv_id":"2009.14455","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-joint-attention-networks","title":"Graph Joint Attention Networks","date":"2020-09-28","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"panrep-universal-node-embeddings-for-1","title":"PanRep: Universal node embeddings for heterogeneous graphs","date":"2020-09-28","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"revisiting-graph-neural-networks-for-link","title":"Revisiting Graph Neural Networks for Link Prediction","date":"2020-09-28","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"inductive-graph-embeddings-through-locality","title":"Inductive Graph Embeddings through Locality Encodings","date":"2020-09-26","arxiv_id":"2009.12585","repositories_listed":0,"syntology":null},{"url":null,"slug":"revisiting-graph-convolutional-network-on","title":"Revisiting Graph Convolutional Network on Semi-Supervised Node Classification from an Optimization Perspective","date":"2020-09-24","arxiv_id":"2009.11469","repositories_listed":0,"syntology":null},{"url":null,"slug":"streaming-graph-neural-networks-via-continual","title":"Streaming Graph Neural Networks via Continual Learning","date":"2020-09-23","arxiv_id":"2009.10951","repositories_listed":0,"syntology":null},{"url":null,"slug":"layer-stacked-attention-for-heterogeneous","title":"Layer-stacked Attention for Heterogeneous Network Embedding","date":"2020-09-17","arxiv_id":"2009.08072","repositories_listed":0,"syntology":null},{"url":null,"slug":"community-detection-in-networks-using-graph-1","title":"Community detection in networks using graph embeddings","date":"2020-09-11","arxiv_id":"2009.05265","repositories_listed":0,"syntology":null}],"record_sha256":"5ba1057ac565350925ee472af0a71fa823a7c4f39c0692df0d103a66ac7f8104","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}