{"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/13","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":13,"pages_in_order":19,"rows_per_page":100,"rows":[1201,1300],"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/12","next":"/task/node-classification/papers/14","papers":[{"url":null,"slug":"generation-is-better-than-modification","title":"Generation is better than Modification: Combating High Class Homophily Variance in Graph Anomaly Detection","date":"2024-03-15","arxiv_id":"2403.10339","repositories_listed":0,"syntology":null},{"url":null,"slug":"robust-subgraph-learning-by-monitoring-early","title":"Robust Subgraph Learning by Monitoring Early Training Representations","date":"2024-03-14","arxiv_id":"2403.09901","repositories_listed":0,"syntology":null},{"url":null,"slug":"reduced-jeffries-matusita-distance-a-novel","title":"Reduced Jeffries-Matusita distance: A Novel Loss Function to Improve Generalization Performance of Deep Classification Models","date":"2024-03-13","arxiv_id":"2403.08408","repositories_listed":0,"syntology":null},{"url":null,"slug":"iterative-graph-neural-network-enhancement","title":"Iterative Graph Neural Network Enhancement via Frequent Subgraph Mining of Explanations","date":"2024-03-12","arxiv_id":"2403.07849","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-differential-geometric-view-and","title":"A Differential Geometric View and Explainability of GNN on Evolving Graphs","date":"2024-03-11","arxiv_id":"2403.06425","repositories_listed":0,"syntology":null},{"url":null,"slug":"signn-a-spike-induced-graph-neural-network","title":"SiGNN: A Spike-induced Graph Neural Network for Dynamic Graph Representation Learning","date":"2024-03-11","arxiv_id":"2404.07941","repositories_listed":0,"syntology":null},{"url":null,"slug":"better-schedules-for-low-precision-training","title":"Better Schedules for Low Precision Training of Deep Neural Networks","date":"2024-03-04","arxiv_id":"2403.02243","repositories_listed":0,"syntology":null},{"url":null,"slug":"rog-pl-robust-open-set-graph-learning-via","title":"ROG$_{PL}$: Robust Open-Set Graph Learning via Region-Based Prototype Learning","date":"2024-02-28","arxiv_id":"2402.18495","repositories_listed":0,"syntology":null},{"url":"/paper/gnndld-graph-neural-network-with-directional","slug":"gnndld-graph-neural-network-with-directional","title":"GNNDLD: Graph Neural Network with Directional Label Distribution","date":"2024-02-26","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"one-shot-graph-representation-learning-using","title":"Hyperdimensional Representation Learning for Node Classification and Link Prediction","date":"2024-02-26","arxiv_id":"2402.17073","repositories_listed":0,"syntology":null},{"url":null,"slug":"understanding-oversmoothing-in-diffusion","title":"Understanding Oversmoothing in Diffusion-Based GNNs From the Perspective of Operator Semigroup Theory","date":"2024-02-23","arxiv_id":"2402.15326","repositories_listed":0,"syntology":null},{"url":null,"slug":"link-prediction-under-heterophily-a-physics","title":"Link Prediction with Physics-Inspired Graph Neural Networks","date":"2024-02-22","arxiv_id":"2402.14802","repositories_listed":0,"syntology":null},{"url":null,"slug":"buffgraph-enhancing-class-imbalanced-node","title":"BuffGraph: Enhancing Class-Imbalanced Node Classification via Buffer Nodes","date":"2024-02-20","arxiv_id":"2402.13114","repositories_listed":0,"syntology":null},{"url":null,"slug":"can-we-soft-prompt-llms-for-graph-learning","title":"Can we Soft Prompt LLMs for Graph Learning Tasks?","date":"2024-02-15","arxiv_id":"2402.10359","repositories_listed":0,"syntology":null},{"url":null,"slug":"graphcbal-class-balanced-active-learning-for","title":"Class-Balanced and Reinforced Active Learning on Graphs","date":"2024-02-15","arxiv_id":"2402.10074","repositories_listed":0,"syntology":null},{"url":null,"slug":"hypermagnet-a-magnetic-laplacian-based","title":"HyperMagNet: A Magnetic Laplacian based Hypergraph Neural Network","date":"2024-02-15","arxiv_id":"2402.09676","repositories_listed":0,"syntology":null},{"url":null,"slug":"low-rank-graph-contrastive-learning-for-node","title":"Low-Rank Graph Contrastive Learning for Node Classification","date":"2024-02-14","arxiv_id":"2402.09600","repositories_listed":0,"syntology":null},{"url":null,"slug":"message-detouring-a-simple-yet-effective","title":"Message Detouring: A Simple Yet Effective Cycle Representation for Expressive Graph Learning","date":"2024-02-12","arxiv_id":"2402.08085","repositories_listed":0,"syntology":null},{"url":null,"slug":"exgrg-explicitly-generated-relation-graph-for","title":"ExGRG: Explicitly-Generated Relation Graph for Self-Supervised Representation Learning","date":"2024-02-09","arxiv_id":"2402.06737","repositories_listed":0,"syntology":null},{"url":null,"slug":"flexible-infinite-width-graph-convolutional","title":"Flexible infinite-width graph convolutional networks and the importance of representation learning","date":"2024-02-09","arxiv_id":"2402.06525","repositories_listed":0,"syntology":null},{"url":null,"slug":"game-theoretic-counterfactual-explanation-for","title":"Game-theoretic Counterfactual Explanation for Graph Neural Networks","date":"2024-02-08","arxiv_id":"2402.06030","repositories_listed":0,"syntology":null},{"url":null,"slug":"hypergraph-node-classification-with-graph","title":"Training-Free Message Passing for Learning on Hypergraphs","date":"2024-02-08","arxiv_id":"2402.05569","repositories_listed":0,"syntology":null},{"url":null,"slug":"large-language-model-meets-graph-neural","title":"Large Language Model Meets Graph Neural Network in Knowledge Distillation","date":"2024-02-08","arxiv_id":"2402.05894","repositories_listed":0,"syntology":null},{"url":null,"slug":"feature-distribution-on-graph-topology","title":"Feature Distribution on Graph Topology Mediates the Effect of Graph Convolution: Homophily Perspective","date":"2024-02-07","arxiv_id":"2402.04621","repositories_listed":0,"syntology":null},{"url":null,"slug":"active-learning-for-graphs-with-noisy","title":"Active Learning for Graphs with Noisy Structures","date":"2024-02-04","arxiv_id":"2402.02321","repositories_listed":0,"syntology":null},{"url":null,"slug":"cpt-competence-progressive-training-strategy","title":"CPT: Competence-progressive Training Strategy for Few-shot Node Classification","date":"2024-02-01","arxiv_id":"2402.00450","repositories_listed":0,"syntology":null},{"url":"/paper/graph-transformers-without-positional","slug":"graph-transformers-without-positional","title":"Graph Transformers without Positional Encodings","date":"2024-01-31","arxiv_id":"2401.17791","repositories_listed":0,"syntology":null},{"url":null,"slug":"graphviz2vec-a-structure-aware-feature","title":"GraphViz2Vec: A Structure-aware Feature Generation Model to Improve Classification in GNNs","date":"2024-01-30","arxiv_id":"2401.17178","repositories_listed":0,"syntology":null},{"url":null,"slug":"fedgt-federated-node-classification-with","title":"FedGT: Federated Node Classification with Scalable Graph Transformer","date":"2024-01-26","arxiv_id":"2401.15203","repositories_listed":0,"syntology":null},{"url":null,"slug":"deepricci-self-supervised-graph-structure","title":"DeepRicci: Self-supervised Graph Structure-Feature Co-Refinement for Alleviating Over-squashing","date":"2024-01-23","arxiv_id":"2401.12780","repositories_listed":0,"syntology":null},{"url":null,"slug":"adafgl-a-new-paradigm-for-federated-node","title":"AdaFGL: A New Paradigm for Federated Node Classification with Topology Heterogeneity","date":"2024-01-22","arxiv_id":"2401.11750","repositories_listed":0,"syntology":null},{"url":null,"slug":"distribution-consistency-based-self-training","title":"Distribution Consistency based Self-Training for Graph Neural Networks with Sparse Labels","date":"2024-01-18","arxiv_id":"2401.10394","repositories_listed":0,"syntology":null},{"url":null,"slug":"rethinking-spectral-graph-neural-networks","title":"Rethinking Spectral Graph Neural Networks with Spatially Adaptive Filtering","date":"2024-01-17","arxiv_id":"2401.09071","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-transformer-gans-with-graph-masked","title":"Graph Transformer GANs with Graph Masked Modeling for Architectural Layout Generation","date":"2024-01-15","arxiv_id":"2401.07721","repositories_listed":0,"syntology":null},{"url":null,"slug":"predicting-the-structure-of-dynamic-graphs","title":"Predicting the structure of dynamic graphs","date":"2024-01-08","arxiv_id":"2401.04280","repositories_listed":0,"syntology":null},{"url":null,"slug":"synhin-generating-synthetic-heterogeneous","title":"SynHING: Synthetic Heterogeneous Information Network Generation for Graph Learning and Explanation","date":"2024-01-07","arxiv_id":"2401.04133","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-backdoor-attack-against-link-prediction","title":"Effective backdoor attack on graph neural networks in link prediction tasks","date":"2024-01-05","arxiv_id":"2401.02663","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-clean-label-graph-backdoor-attack-method-in","title":"A clean-label graph backdoor attack method in node classification task","date":"2023-12-30","arxiv_id":"2401.00163","repositories_listed":0,"syntology":null},{"url":null,"slug":"explainability-based-adversarial-attack-on","title":"Explainability-Based Adversarial Attack on Graphs Through Edge Perturbation","date":"2023-12-28","arxiv_id":"2312.17301","repositories_listed":0,"syntology":null},{"url":"/paper/refining-latent-homophilic-structures-over","slug":"refining-latent-homophilic-structures-over","title":"Refining Latent Homophilic Structures over Heterophilic Graphs for Robust Graph Convolution Networks","date":"2023-12-27","arxiv_id":"2312.16418","repositories_listed":0,"syntology":null},{"url":null,"slug":"poincare-differential-privacy-for-hierarchy","title":"Poincaré Differential Privacy for Hierarchy-Aware Graph Embedding","date":"2023-12-19","arxiv_id":"2312.12183","repositories_listed":0,"syntology":null},{"url":null,"slug":"model-stealing-attack-against-graph","title":"Model Stealing Attack against Graph Classification with Authenticity, Uncertainty and Diversity","date":"2023-12-18","arxiv_id":"2312.10943","repositories_listed":0,"syntology":null},{"url":null,"slug":"dynamic-spiking-graph-neural-networks","title":"Dynamic Spiking Framework for Graph Neural Networks","date":"2023-12-15","arxiv_id":"2401.05373","repositories_listed":0,"syntology":null},{"url":"/paper/graphrare-reinforcement-learning-enhanced","slug":"graphrare-reinforcement-learning-enhanced","title":"GraphRARE: Reinforcement Learning Enhanced Graph Neural Network with Relative Entropy","date":"2023-12-15","arxiv_id":"2312.09708","repositories_listed":0,"syntology":null},{"url":null,"slug":"edgepruner-poisoned-edge-pruning-in-graph","title":"EdgePruner: Poisoned Edge Pruning in Graph Contrastive Learning","date":"2023-12-12","arxiv_id":"2312.07022","repositories_listed":0,"syntology":null},{"url":null,"slug":"aswt-sgnn-adaptive-spectral-wavelet-transform","title":"ASWT-SGNN: Adaptive Spectral Wavelet Transform-based Self-Supervised Graph Neural Network","date":"2023-12-10","arxiv_id":"2312.05736","repositories_listed":0,"syntology":null},{"url":null,"slug":"isomorphic-consistent-variational-graph-auto","title":"Isomorphic-Consistent Variational Graph Auto-Encoders for Multi-Level Graph Representation Learning","date":"2023-12-09","arxiv_id":"2312.05519","repositories_listed":0,"syntology":null},{"url":null,"slug":"hc-ref-hierarchical-constrained-refinement","title":"HC-Ref: Hierarchical Constrained Refinement for Robust Adversarial Training of GNNs","date":"2023-12-08","arxiv_id":"2312.04879","repositories_listed":0,"syntology":null},{"url":"/paper/breaking-the-entanglement-of-homophily-and","slug":"breaking-the-entanglement-of-homophily-and","title":"Breaking the Entanglement of Homophily and Heterophily in Semi-supervised Node Classification","date":"2023-12-07","arxiv_id":"2312.04111","repositories_listed":0,"syntology":null},{"url":null,"slug":"node-aware-bi-smoothing-certified-robustness","title":"Node-aware Bi-smoothing: Certified Robustness against Graph Injection Attacks","date":"2023-12-07","arxiv_id":"2312.03979","repositories_listed":0,"syntology":null},{"url":"/paper/provable-adversarial-robustness-for-group-1","slug":"provable-adversarial-robustness-for-group-1","title":"Provable Adversarial Robustness for Group Equivariant Tasks: Graphs, Point Clouds, Molecules, and More","date":"2023-12-05","arxiv_id":"2312.02708","repositories_listed":0,"syntology":{"n":31,"n_ran":22,"n_constructed":1,"n_ran_checked":19,"n_instrument":3,"n_unverified":9,"n_honours":0,"n_violates":0,"n_no_contract":19,"n_pointer_only":4,"phrase":"22 ran (of which 1 constructed an object rather than computing a result; 19 with no instrument failure: 0 honoured, 0 violated, 19 with no contract checked; 3 where Syntology's instrument failed) · 9 unverified","sample_list":"/paper/provable-adversarial-robustness-for-group-1#ran","syntology_url":"https://syntology.ai/paper/2312.02708","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2312.02708"}},"official":null}},{"url":null,"slug":"uncertainty-in-graph-contrastive-learning","title":"Uncertainty in Graph Contrastive Learning with Bayesian Neural Networks","date":"2023-11-30","arxiv_id":"2312.00232","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-adversarial-robustness-of-graph","title":"On the Adversarial Robustness of Graph Contrastive Learning Methods","date":"2023-11-29","arxiv_id":"2311.17853","repositories_listed":0,"syntology":null},{"url":null,"slug":"propagate-distill-towards-effective-graph","title":"Propagate & Distill: Towards Effective Graph Learners Using Propagation-Embracing MLPs","date":"2023-11-29","arxiv_id":"2311.17781","repositories_listed":0,"syntology":null},{"url":null,"slug":"attend-who-is-weak-enhancing-graph","title":"Attend Who is Weak: Enhancing Graph Condensation via Cross-Free Adversarial Training","date":"2023-11-27","arxiv_id":"2311.15772","repositories_listed":0,"syntology":null},{"url":null,"slug":"large-language-models-as-topological","title":"Large Language Models as Topological Structure Enhancers for Text-Attributed Graphs","date":"2023-11-24","arxiv_id":"2311.14324","repositories_listed":0,"syntology":null},{"url":null,"slug":"unveiling-the-unseen-potential-of-graph","title":"Unveiling the Unseen Potential of Graph Learning through MLPs: Effective Graph Learners Using Propagation-Embracing MLPs","date":"2023-11-20","arxiv_id":"2311.11759","repositories_listed":0,"syntology":null},{"url":null,"slug":"self-supervised-pretraining-for-heterogeneous","title":"Self-Supervised Pretraining for Heterogeneous Hypergraph Neural Networks","date":"2023-11-19","arxiv_id":"2311.11368","repositories_listed":0,"syntology":null},{"url":null,"slug":"dirichlet-energy-enhancement-of-graph-neural","title":"Dirichlet Energy Enhancement of Graph Neural Networks by Framelet Augmentation","date":"2023-11-09","arxiv_id":"2311.05767","repositories_listed":0,"syntology":null},{"url":"/paper/edge2node-reducing-edge-prediction-to-node","slug":"edge2node-reducing-edge-prediction-to-node","title":"Edge2Node: Reducing Edge Prediction to Node Classification","date":"2023-11-06","arxiv_id":"2311.02921","repositories_listed":0,"syntology":null},{"url":null,"slug":"vigraph-self-supervised-learning-for-class","title":"VIGraph: Generative Self-supervised Learning for Class-Imbalanced Node Classification","date":"2023-11-02","arxiv_id":"2311.01191","repositories_listed":0,"syntology":null},{"url":"/paper/hyperbolic-graph-neural-networks-at-scale-a","slug":"hyperbolic-graph-neural-networks-at-scale-a","title":"Hyperbolic Graph Neural Networks at Scale: A Meta Learning Approach","date":"2023-10-29","arxiv_id":"2310.18918","repositories_listed":0,"syntology":{"n":6,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":6,"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) · 2 unverified","sample_list":"/paper/hyperbolic-graph-neural-networks-at-scale-a#ran","syntology_url":"https://syntology.ai/paper/2310.18918","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.18918"}},"official":null}},{"url":null,"slug":"blis-net-classifying-and-analyzing-signals-on","title":"BLIS-Net: Classifying and Analyzing Signals on Graphs","date":"2023-10-26","arxiv_id":"2310.17579","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-agent-explicit-reasoning-agent-for","title":"Graph Agent: Explicit Reasoning Agent for Graphs","date":"2023-10-25","arxiv_id":"2310.16421","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-neural-networks-with-a-distribution-of","title":"Graph Neural Networks with a Distribution of Parametrized Graphs","date":"2023-10-25","arxiv_id":"2310.16401","repositories_listed":0,"syntology":null},{"url":null,"slug":"generative-and-contrastive-paradigms-are","title":"Generative and Contrastive Paradigms Are Complementary for Graph Self-Supervised Learning","date":"2023-10-24","arxiv_id":"2310.15523","repositories_listed":0,"syntology":null},{"url":null,"slug":"hierarchical-randomized-smoothing","title":"Hierarchical Randomized Smoothing","date":"2023-10-24","arxiv_id":"2310.16221","repositories_listed":0,"syntology":null},{"url":null,"slug":"gnnevaluator-evaluating-gnn-performance-on","title":"GNNEvaluator: Evaluating GNN Performance On Unseen Graphs Without Labels","date":"2023-10-23","arxiv_id":"2310.14586","repositories_listed":0,"syntology":null},{"url":null,"slug":"hetgpt-harnessing-the-power-of-prompt-tuning","title":"HetGPT: Harnessing the Power of Prompt Tuning in Pre-Trained Heterogeneous Graph Neural Networks","date":"2023-10-23","arxiv_id":"2310.15318","repositories_listed":0,"syntology":null},{"url":null,"slug":"fairness-aware-optimal-graph-filter-design","title":"Fairness-aware Optimal Graph Filter Design","date":"2023-10-22","arxiv_id":"2310.14432","repositories_listed":0,"syntology":null},{"url":null,"slug":"positive-unlabeled-node-classification-with","title":"Positive-Unlabeled Node Classification with Structure-aware Graph Learning","date":"2023-10-20","arxiv_id":"2310.13538","repositories_listed":0,"syntology":null},{"url":null,"slug":"exploring-graph-neural-networks-for-indian","title":"Exploring Graph Neural Networks for Indian Legal Judgment Prediction","date":"2023-10-19","arxiv_id":"2310.12800","repositories_listed":0,"syntology":null},{"url":"/paper/musegnn-interpretable-and-convergent-graph","slug":"musegnn-interpretable-and-convergent-graph","title":"MuseGNN: Interpretable and Convergent Graph Neural Network Layers at Scale","date":"2023-10-19","arxiv_id":"2310.12457","repositories_listed":0,"syntology":{"n":6,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/musegnn-interpretable-and-convergent-graph#ran","syntology_url":"https://syntology.ai/paper/2310.12457","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.12457"}},"official":null}},{"url":null,"slug":"hetero-2-net-heterophily-aware-representation","title":"Hetero$^2$Net: Heterophily-aware Representation Learning on Heterogenerous Graphs","date":"2023-10-18","arxiv_id":"2310.11664","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-local-graph-limits-perspective-on-sampling","title":"A Local Graph Limits Perspective on Sampling-Based GNNs","date":"2023-10-17","arxiv_id":"2310.10953","repositories_listed":0,"syntology":null},{"url":"/paper/signgt-signed-attention-based-graph","slug":"signgt-signed-attention-based-graph","title":"SignGT: Signed Attention-based Graph Transformer for Graph Representation Learning","date":"2023-10-17","arxiv_id":"2310.11025","repositories_listed":0,"syntology":null},{"url":null,"slug":"topology-guided-hypergraph-transformer","title":"Topology-guided Hypergraph Transformer Network: Unveiling Structural Insights for Improved Representation","date":"2023-10-14","arxiv_id":"2310.09657","repositories_listed":0,"syntology":null},{"url":null,"slug":"heterophily-based-graph-neural-network-for","title":"Heterophily-Based Graph Neural Network for Imbalanced Classification","date":"2023-10-12","arxiv_id":"2310.08725","repositories_listed":0,"syntology":null},{"url":null,"slug":"np-2-l-negative-pseudo-partial-labels","title":"NP$^2$L: Negative Pseudo Partial Labels Extraction for Graph Neural Networks","date":"2023-10-02","arxiv_id":"2310.01098","repositories_listed":0,"syntology":null},{"url":null,"slug":"sheaf-hypergraph-networks","title":"Sheaf Hypergraph Networks","date":"2023-09-29","arxiv_id":"2309.17116","repositories_listed":0,"syntology":null},{"url":null,"slug":"prototype-enhanced-hypergraph-learning-for","title":"Prototype-Enhanced Hypergraph Learning for Heterogeneous Information Networks","date":"2023-09-22","arxiv_id":"2309.13092","repositories_listed":0,"syntology":null},{"url":null,"slug":"crypto-graph-leveraging-privacy-preserving","title":"Crypto'Graph: Leveraging Privacy-Preserving Distributed Link Prediction for Robust Graph Learning","date":"2023-09-19","arxiv_id":"2309.10890","repositories_listed":0,"syntology":null},{"url":null,"slug":"symplectic-structure-aware-hamiltonian-graph","title":"Symplectic Structure-Aware Hamiltonian (Graph) Embeddings","date":"2023-09-09","arxiv_id":"2309.04885","repositories_listed":0,"syntology":null},{"url":null,"slug":"curve-your-attention-mixed-curvature","title":"Curve Your Attention: Mixed-Curvature Transformers for Graph Representation Learning","date":"2023-09-08","arxiv_id":"2309.04082","repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-unsupervised-graph-completion","title":"Towards Unsupervised Graph Completion Learning on Graphs with Features and Structure Missing","date":"2023-09-06","arxiv_id":"2309.02762","repositories_listed":0,"syntology":null},{"url":null,"slug":"over-squashing-in-graph-neural-networks-a","title":"Over-Squashing in Graph Neural Networks: A Comprehensive survey","date":"2023-08-29","arxiv_id":"2308.15568","repositories_listed":0,"syntology":null},{"url":null,"slug":"universal-graph-continual-learning","title":"Universal Graph Continual Learning","date":"2023-08-27","arxiv_id":"2308.13982","repositories_listed":0,"syntology":null},{"url":null,"slug":"unveiling-the-role-of-message-passing-in-dual","title":"Unveiling the Role of Message Passing in Dual-Privacy Preservation on GNNs","date":"2023-08-25","arxiv_id":"2308.13513","repositories_listed":0,"syntology":null},{"url":null,"slug":"cached-operator-reordering-a-unified-view-for","title":"Cached Operator Reordering: A Unified View for Fast GNN Training","date":"2023-08-23","arxiv_id":"2308.12093","repositories_listed":0,"syntology":null},{"url":null,"slug":"kmf-knowledge-aware-multi-faceted","title":"KMF: Knowledge-Aware Multi-Faceted Representation Learning for Zero-Shot Node Classification","date":"2023-08-15","arxiv_id":"2308.08563","repositories_listed":0,"syntology":null},{"url":null,"slug":"node-embedding-for-homophilous-graphs-with","title":"Node Embedding for Homophilous Graphs with ARGEW: Augmentation of Random walks by Graph Edge Weights","date":"2023-08-11","arxiv_id":"2308.05957","repositories_listed":0,"syntology":null},{"url":null,"slug":"mathcal-g-2pxy-generative-open-set-node","title":"$\\mathcal{G}^2Pxy$: Generative Open-Set Node Classification on Graphs with Proxy Unknowns","date":"2023-08-10","arxiv_id":"2308.05463","repositories_listed":0,"syntology":null},{"url":null,"slug":"local-structure-aware-graph-contrastive","title":"Local Structure-aware Graph Contrastive Representation Learning","date":"2023-08-07","arxiv_id":"2308.03271","repositories_listed":0,"syntology":null},{"url":"/paper/communication-free-distributed-gnn-training","slug":"communication-free-distributed-gnn-training","title":"Communication-Free Distributed GNN Training with Vertex Cut","date":"2023-08-06","arxiv_id":"2308.03209","repositories_listed":0,"syntology":null},{"url":null,"slug":"blindsage-label-inference-attacks-against","title":"Label Inference Attacks against Node-level Vertical Federated GNNs","date":"2023-08-04","arxiv_id":"2308.02465","repositories_listed":0,"syntology":null},{"url":null,"slug":"adr-gnn-advection-diffusion-reaction-graph","title":"Feature Transportation Improves Graph Neural Networks","date":"2023-07-29","arxiv_id":"2307.16092","repositories_listed":0,"syntology":null},{"url":null,"slug":"muse-multi-view-contrastive-learning-for","title":"MUSE: Multi-View Contrastive Learning for Heterophilic Graphs","date":"2023-07-29","arxiv_id":"2307.16026","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-adaptive-neighborhoods-for-graph","title":"Learning Adaptive Neighborhoods for Graph Neural Networks","date":"2023-07-18","arxiv_id":"2307.09065","repositories_listed":0,"syntology":null},{"url":null,"slug":"curriculum-learning-for-graph-neural-networks","title":"Curriculum Learning for Graph Neural Networks: A Multiview Competence-based Approach","date":"2023-07-17","arxiv_id":"2307.08859","repositories_listed":0,"syntology":null},{"url":null,"slug":"from-random-walks-to-graph-sprints-a-low","title":"From random-walks to graph-sprints: a low-latency node embedding framework on continuous-time dynamic graphs","date":"2023-07-17","arxiv_id":"2307.08433","repositories_listed":0,"syntology":null}],"record_sha256":"33200c227a52b7f45cd7e2b895c9a57f30374bd45cd73306ffaf27ed216bc07a","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}