{"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/11","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":11,"pages_in_order":19,"rows_per_page":100,"rows":[1001,1100],"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/10","next":"/task/node-classification/papers/12","papers":[{"url":null,"slug":"graph-positional-autoencoders-as-self","title":"Graph Positional Autoencoders as Self-supervised Learners","date":"2025-05-29","arxiv_id":"2505.23345","repositories_listed":0,"syntology":null},{"url":null,"slug":"directed-homophily-aware-graph-neural-network","title":"Directed Homophily-Aware Graph Neural Network","date":"2025-05-28","arxiv_id":"2505.22362","repositories_listed":0,"syntology":null},{"url":null,"slug":"simple-yet-effective-graph-distillation-via","title":"Simple yet Effective Graph Distillation via Clustering","date":"2025-05-27","arxiv_id":"2505.20807","repositories_listed":0,"syntology":null},{"url":null,"slug":"g1-teaching-llms-to-reason-on-graphs-with","title":"G1: Teaching LLMs to Reason on Graphs with Reinforcement Learning","date":"2025-05-24","arxiv_id":"2505.18499","repositories_listed":0,"syntology":null},{"url":null,"slug":"how-particle-system-theory-enhances","title":"How Particle System Theory Enhances Hypergraph Message Passing","date":"2025-05-24","arxiv_id":"2505.18505","repositories_listed":0,"syntology":null},{"url":null,"slug":"message-passing-state-space-models-improving","title":"Message-Passing State-Space Models: Improving Graph Learning with Modern Sequence Modeling","date":"2025-05-24","arxiv_id":"2505.18728","repositories_listed":0,"syntology":null},{"url":null,"slug":"directed-semi-simplicial-learning-with","title":"Directed Semi-Simplicial Learning with Applications to Brain Activity Decoding","date":"2025-05-23","arxiv_id":"2505.17939","repositories_listed":0,"syntology":null},{"url":null,"slug":"beyond-node-attention-multi-scale-harmonic","title":"Beyond Node Attention: Multi-Scale Harmonic Encoding for Feature-Wise Graph Message Passing","date":"2025-05-21","arxiv_id":"2505.15015","repositories_listed":0,"syntology":null},{"url":null,"slug":"ec-lda-label-distribution-inference-attack","title":"EC-LDA : Label Distribution Inference Attack against Federated Graph Learning with Embedding Compression","date":"2025-05-21","arxiv_id":"2505.15140","repositories_listed":0,"syntology":null},{"url":null,"slug":"unlearning-algorithmic-biases-over-graphs","title":"Unlearning Algorithmic Biases over Graphs","date":"2025-05-20","arxiv_id":"2505.14945","repositories_listed":0,"syntology":null},{"url":null,"slug":"pave-your-own-path-graph-gradual-domain","title":"Pave Your Own Path: Graph Gradual Domain Adaptation on Fused Gromov-Wasserstein Geodesics","date":"2025-05-19","arxiv_id":"2505.12709","repositories_listed":0,"syntology":null},{"url":null,"slug":"instance-prototype-affinity-learning-for-non","title":"Instance-Prototype Affinity Learning for Non-Exemplar Continual Graph Learning","date":"2025-05-15","arxiv_id":"2505.10040","repositories_listed":0,"syntology":null},{"url":null,"slug":"exploiting-text-semantics-for-few-and-zero","title":"Exploiting Text Semantics for Few and Zero Shot Node Classification on Text-attributed Graph","date":"2025-05-13","arxiv_id":"2505.08168","repositories_listed":0,"syntology":null},{"url":null,"slug":"specsphere-dual-pass-spectral-spatial-graph","title":"SpecSphere: Dual-Pass Spectral-Spatial Graph Neural Networks with Certified Robustness","date":"2025-05-13","arxiv_id":"2505.08320","repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-granular-attention-based-heterogeneous","title":"Multi-Granular Attention based Heterogeneous Hypergraph Neural Network","date":"2025-05-07","arxiv_id":"2505.04340","repositories_listed":0,"syntology":null},{"url":null,"slug":"causally-fair-node-classification-on-non-iid","title":"Causally Fair Node Classification on Non-IID Graph Data","date":"2025-05-03","arxiv_id":"2505.01652","repositories_listed":0,"syntology":null},{"url":null,"slug":"scalability-matters-overcoming-challenges-in","title":"Scalability Matters: Overcoming Challenges in InstructGLM with Similarity-Degree-Based Sampling","date":"2025-05-02","arxiv_id":"2505.03799","repositories_listed":0,"syntology":null},{"url":null,"slug":"fedhero-a-federated-learning-approach-for","title":"FedHERO: A Federated Learning Approach for Node Classification Task on Heterophilic Graphs","date":"2025-04-29","arxiv_id":"2504.21206","repositories_listed":0,"syntology":null},{"url":null,"slug":"out-of-distribution-detection-in","title":"Out-of-Distribution Detection in Heterogeneous Graphs via Energy Propagation","date":"2025-04-29","arxiv_id":"2505.03774","repositories_listed":0,"syntology":null},{"url":null,"slug":"efficient-learning-on-large-graphs-using-a","title":"Efficient Learning on Large Graphs using a Densifying Regularity Lemma","date":"2025-04-25","arxiv_id":"2504.18273","repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-unbiased-federated-graph-learning","title":"Towards Unbiased Federated Graph Learning: Label and Topology Perspectives","date":"2025-04-14","arxiv_id":"2504.09963","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-based-uncertainty-aware-self-training","title":"Graph-Based Uncertainty-Aware Self-Training with Stochastic Node Labeling","date":"2025-03-26","arxiv_id":"2503.22745","repositories_listed":0,"syntology":null},{"url":null,"slug":"uncertainty-aware-graph-self-training-with","title":"Uncertainty-Aware Graph Self-Training with Expectation-Maximization Regularization","date":"2025-03-26","arxiv_id":"2503.22744","repositories_listed":0,"syntology":null},{"url":null,"slug":"adapt-agree-aggregate-semi-supervised","title":"Adapt, Agree, Aggregate: Semi-Supervised Ensemble Labeling for Graph Convolutional Networks","date":"2025-03-22","arxiv_id":"2503.17842","repositories_listed":0,"syntology":null},{"url":null,"slug":"fast-online-node-labeling-with-graph","title":"Fast online node labeling with graph subsampling","date":"2025-03-21","arxiv_id":"2503.16755","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-semantic-and-clean-label-backdoor-attack","title":"A Semantic and Clean-label Backdoor Attack against Graph Convolutional Networks","date":"2025-03-19","arxiv_id":"2503.14922","repositories_listed":0,"syntology":null},{"url":null,"slug":"unifying-text-semantics-and-graph-structures","title":"Unifying Text Semantics and Graph Structures for Temporal Text-attributed Graphs with Large Language Models","date":"2025-03-18","arxiv_id":"2503.14411","repositories_listed":0,"syntology":null},{"url":null,"slug":"unifying-structural-proximity-and-equivalence","title":"Unifying Structural Proximity and Equivalence for Enhanced Dynamic Network Embedding","date":"2025-03-14","arxiv_id":"2503.19926","repositories_listed":0,"syntology":null},{"url":null,"slug":"overlap-aware-meta-learning-attention-to","title":"Overlap-aware meta-learning attention to enhance hypergraph neural networks for node classification","date":"2025-03-11","arxiv_id":"2503.07961","repositories_listed":0,"syntology":null},{"url":null,"slug":"tiger-self-supervised-purification-for-time","title":"TiGer: Self-Supervised Purification for Time-evolving Graphs","date":"2025-03-10","arxiv_id":"2503.06990","repositories_listed":0,"syntology":null},{"url":null,"slug":"using-subgraph-gnns-for-node-classification","title":"Using Subgraph GNNs for Node Classification:an Overlooked Potential Approach","date":"2025-03-09","arxiv_id":"2503.06614","repositories_listed":0,"syntology":null},{"url":null,"slug":"nodereg-mitigating-the-imbalance-and","title":"NodeReg: Mitigating the Imbalance and Distribution Shift Effects in Semi-Supervised Node Classification via Norm Consistency","date":"2025-03-05","arxiv_id":"2503.03211","repositories_listed":0,"syntology":null},{"url":null,"slug":"unsupervised-attributed-dynamic-network","title":"Unsupervised Attributed Dynamic Network Embedding with Stability Guarantees","date":"2025-03-04","arxiv_id":"2503.02859","repositories_listed":0,"syntology":null},{"url":null,"slug":"statistical-physics-analysis-of-graph-neural","title":"Statistical physics analysis of graph neural networks: Approaching optimality in the contextual stochastic block model","date":"2025-03-03","arxiv_id":"2503.01361","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-augmentation-for-cross-graph-domain","title":"Graph Augmentation for Cross Graph Domain Generalization","date":"2025-02-25","arxiv_id":"2502.18188","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-masked-language-models","title":"Graph Masked Language Models","date":"2025-02-24","arxiv_id":"2503.05763","repositories_listed":0,"syntology":null},{"url":null,"slug":"vgfl-sa-vertical-graph-federated-learning","title":"VGFL-SA: Vertical Graph Federated Learning Structure Attack Based on Contrastive Learning","date":"2025-02-24","arxiv_id":"2502.16793","repositories_listed":0,"syntology":null},{"url":null,"slug":"fhge-a-fast-heterogeneous-graph-embedding","title":"FHGE: A Fast Heterogeneous Graph Embedding with Ad-hoc Meta-paths","date":"2025-02-22","arxiv_id":"2502.16281","repositories_listed":0,"syntology":null},{"url":null,"slug":"hetfs-a-method-for-fast-similarity-search","title":"HetFS: A Method for Fast Similarity Search with Ad-hoc Meta-paths on Heterogeneous Information Networks","date":"2025-02-22","arxiv_id":"2502.16288","repositories_listed":0,"syntology":null},{"url":null,"slug":"hypergcl-multi-modal-graph-contrastive","title":"HyperGCL: Multi-Modal Graph Contrastive Learning via Learnable Hypergraph Views","date":"2025-02-18","arxiv_id":"2502.13277","repositories_listed":0,"syntology":null},{"url":null,"slug":"graphit-efficient-node-classification-on-text","title":"GraphiT: Efficient Node Classification on Text-Attributed Graphs with Prompt Optimized LLMs","date":"2025-02-14","arxiv_id":"2502.10522","repositories_listed":0,"syntology":null},{"url":null,"slug":"clear-cluster-based-prompt-learning-on","title":"CLEAR: Cluster-based Prompt Learning on Heterogeneous Graphs","date":"2025-02-13","arxiv_id":"2502.08918","repositories_listed":0,"syntology":null},{"url":null,"slug":"mixture-of-decoupled-message-passing-experts","title":"Mixture of Decoupled Message Passing Experts with Entropy Constraint for General Node Classification","date":"2025-02-12","arxiv_id":"2502.08083","repositories_listed":0,"syntology":null},{"url":null,"slug":"rethinking-tokenized-graph-transformers-for","title":"Rethinking Tokenized Graph Transformers for Node Classification","date":"2025-02-12","arxiv_id":"2502.08101","repositories_listed":0,"syntology":null},{"url":null,"slug":"deep-semantic-graph-learning-via-llm-based","title":"Deep Semantic Graph Learning via LLM based Node Enhancement","date":"2025-02-11","arxiv_id":"2502.07982","repositories_listed":0,"syntology":null},{"url":null,"slug":"unified-graph-networks-ugn-a-deep-neural","title":"Unified Graph Networks (UGN): A Deep Neural Framework for Solving Graph Problems","date":"2025-02-11","arxiv_id":"2502.07500","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-neural-networks-at-a-fraction","title":"Graph Neural Networks at a Fraction","date":"2025-02-10","arxiv_id":"2502.06136","repositories_listed":0,"syntology":null},{"url":"/paper/spectro-riemannian-graph-neural-networks","slug":"spectro-riemannian-graph-neural-networks","title":"Spectro-Riemannian Graph Neural Networks","date":"2025-02-01","arxiv_id":"2502.00401","repositories_listed":0,"syntology":{"n":6,"n_ran":3,"n_constructed":2,"n_ran_checked":2,"n_instrument":1,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":6,"phrase":"3 ran (of which 2 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/spectro-riemannian-graph-neural-networks#ran","syntology_url":"https://syntology.ai/paper/2502.00401","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2502.00401"}},"official":null}},{"url":null,"slug":"contrastive-learning-meets-pseudo-label","title":"Contrastive Learning Meets Pseudo-label-assisted Mixup Augmentation: A Comprehensive Graph Representation Framework from Local to Global","date":"2025-01-30","arxiv_id":"2501.18357","repositories_listed":0,"syntology":null},{"url":null,"slug":"node-classification-and-search-on-the-rubik-s","title":"Node Classification and Search on the Rubik's Cube Graph with GNNs","date":"2025-01-30","arxiv_id":"2501.18580","repositories_listed":0,"syntology":null},{"url":"/paper/mamba-based-graph-convolutional-networks","slug":"mamba-based-graph-convolutional-networks","title":"Mamba-Based Graph Convolutional Networks: Tackling Over-smoothing with Selective State Space","date":"2025-01-26","arxiv_id":"2501.15461","repositories_listed":0,"syntology":{"n":3,"n_ran":2,"n_constructed":2,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":3,"phrase":"2 ran (of which 2 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified; every one of the 2 samples that ran constructed an object rather than computing a result","sample_list":"/paper/mamba-based-graph-convolutional-networks#ran","syntology_url":"https://syntology.ai/paper/2501.15461","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2501.15461"}},"official":null}},{"url":null,"slug":"graphbc-improving-llms-for-better-graph-data","title":"GraphSOS: Graph Sampling and Order Selection to Help LLMs Understand Graphs Better","date":"2025-01-24","arxiv_id":"2501.14427","repositories_listed":0,"syntology":null},{"url":null,"slug":"personalized-layer-selection-for-graph-neural","title":"Personalized Layer Selection for Graph Neural Networks","date":"2025-01-24","arxiv_id":"2501.14964","repositories_listed":0,"syntology":null},{"url":null,"slug":"comprehensive-modeling-and-question-answering","title":"Comprehensive Modeling and Question Answering of Cancer Clinical Practice Guidelines using LLMs","date":"2025-01-23","arxiv_id":"2501.13984","repositories_listed":0,"syntology":null},{"url":null,"slug":"hierpromptlm-a-pure-plm-based-framework-for","title":"HierPromptLM: A Pure PLM-based Framework for Representation Learning on Heterogeneous Text-rich Networks","date":"2025-01-22","arxiv_id":"2501.12857","repositories_listed":0,"syntology":null},{"url":null,"slug":"optimizing-blockchain-analysis-tackling","title":"Optimizing Blockchain Analysis: Tackling Temporality and Scalability with an Incremental Approach with Metropolis-Hastings Random Walks","date":"2025-01-21","arxiv_id":"2501.12491","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-defined-language-learning-with-llms","title":"Each Graph is a New Language: Graph Learning with LLMs","date":"2025-01-20","arxiv_id":"2501.11478","repositories_listed":0,"syntology":null},{"url":null,"slug":"predict-confidently-predict-right-abstention","title":"Predict Confidently, Predict Right: Abstention in Dynamic Graph Learning","date":"2025-01-14","arxiv_id":"2501.08397","repositories_listed":0,"syntology":null},{"url":null,"slug":"coupled-hierarchical-structure-learning-using","title":"Coupled Hierarchical Structure Learning using Tree-Wasserstein Distance","date":"2025-01-07","arxiv_id":"2501.03627","repositories_listed":0,"syntology":null},{"url":null,"slug":"overcoming-class-imbalance-unified-gnn","title":"Overcoming Class Imbalance: Unified GNN Learning with Structural and Semantic Connectivity Representations","date":"2024-12-30","arxiv_id":"2412.20656","repositories_listed":0,"syntology":null},{"url":null,"slug":"hypergraph-based-dynamic-graph-node","title":"Hypergraph-Based Dynamic Graph Node Classification","date":"2024-12-29","arxiv_id":"2412.20321","repositories_listed":0,"syntology":null},{"url":null,"slug":"large-language-models-meet-graph-neural","title":"Large Language Models Meet Graph Neural Networks: A Perspective of Graph Mining","date":"2024-12-26","arxiv_id":"2412.19211","repositories_listed":0,"syntology":null},{"url":null,"slug":"graphagent-agentic-graph-language-assistant","title":"GraphAgent: Agentic Graph Language Assistant","date":"2024-12-22","arxiv_id":"2412.17029","repositories_listed":0,"syntology":null},{"url":null,"slug":"fedgat-a-privacy-preserving-federated","title":"FedGAT: A Privacy-Preserving Federated Approximation Algorithm for Graph Attention Networks","date":"2024-12-20","arxiv_id":"2412.16144","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-structure-refinement-with-energy-based","title":"Graph Structure Refinement with Energy-based Contrastive Learning","date":"2024-12-20","arxiv_id":"2412.17856","repositories_listed":0,"syntology":null},{"url":null,"slug":"optimal-exact-recovery-in-semi-supervised","title":"Optimal Exact Recovery in Semi-Supervised Learning: A Study of Spectral Methods and Graph Convolutional Networks","date":"2024-12-18","arxiv_id":"2412.13754","repositories_listed":0,"syntology":null},{"url":null,"slug":"edge-contrastive-learning-an-augmentation","title":"Edge Contrastive Learning: An Augmentation-Free Graph Contrastive Learning Model","date":"2024-12-15","arxiv_id":"2412.11075","repositories_listed":0,"syntology":null},{"url":null,"slug":"gnns-to-mlps-by-teacher-injection-and","title":"TINED: GNNs-to-MLPs by Teacher Injection and Dirichlet Energy Distillation","date":"2024-12-15","arxiv_id":"2412.11180","repositories_listed":0,"syntology":null},{"url":null,"slug":"grimm-a-plug-and-play-perturbation-rectifier","title":"Grimm: A Plug-and-Play Perturbation Rectifier for Graph Neural Networks Defending against Poisoning Attacks","date":"2024-12-11","arxiv_id":"2412.08555","repositories_listed":0,"syntology":null},{"url":null,"slug":"fine-grained-graph-representation-learning","title":"Fine-grained graph representation learning for heterogeneous mobile networks with attentive fusion and contrastive learning","date":"2024-12-10","arxiv_id":"2412.07809","repositories_listed":0,"syntology":null},{"url":null,"slug":"node-classification-with-integrated-reject","title":"Node Classification With Integrated Reject Option","date":"2024-12-04","arxiv_id":"2412.03190","repositories_listed":0,"syntology":null},{"url":null,"slug":"mixture-of-experts-for-node-classification","title":"Mixture of Experts for Node Classification","date":"2024-11-30","arxiv_id":"2412.00418","repositories_listed":0,"syntology":null},{"url":null,"slug":"one-model-for-one-graph-a-new-perspective-for","title":"One Model for One Graph: A New Perspective for Pretraining with Cross-domain Graphs","date":"2024-11-30","arxiv_id":"2412.00315","repositories_listed":0,"syntology":null},{"url":null,"slug":"gradient-inversion-attack-on-graph-neural","title":"Gradient Inversion Attack on Graph Neural Networks","date":"2024-11-29","arxiv_id":"2411.19440","repositories_listed":0,"syntology":null},{"url":null,"slug":"heterogeneous-relationships-of-subjects-and","title":"Heterogeneous Relationships of Subjects and Shapelets for Semi-supervised Multivariate Series Classification","date":"2024-11-27","arxiv_id":"2411.18043","repositories_listed":0,"syntology":null},{"url":null,"slug":"perturbation-ontology-based-graph-attention","title":"Perturbation Ontology based Graph Attention Networks","date":"2024-11-27","arxiv_id":"2411.18520","repositories_listed":0,"syntology":null},{"url":null,"slug":"gnn-multifix-addressing-the-pitfalls-for-gnns","title":"GNN-MultiFix: Addressing the pitfalls for GNNs for multi-label node classification","date":"2024-11-21","arxiv_id":"2411.14094","repositories_listed":0,"syntology":null},{"url":"/paper/heterophilic-graph-neural-networks","slug":"heterophilic-graph-neural-networks","title":"Heterophilic Graph Neural Networks Optimization with Causal Message-passing","date":"2024-11-21","arxiv_id":"2411.13821","repositories_listed":0,"syntology":null},{"url":null,"slug":"scalable-deep-metric-learning-on-attributed","title":"Scalable Deep Metric Learning on Attributed Graphs","date":"2024-11-20","arxiv_id":"2411.13014","repositories_listed":0,"syntology":null},{"url":null,"slug":"higher-order-graph-attention-probabilistic","title":"Higher Order Graph Attention Probabilistic Walk Networks","date":"2024-11-18","arxiv_id":"2411.12052","repositories_listed":0,"syntology":null},{"url":null,"slug":"toward-personalized-federated-node","title":"Towards Federated Graph Learning in One-shot Communication","date":"2024-11-18","arxiv_id":"2411.11304","repositories_listed":0,"syntology":null},{"url":null,"slug":"impact-gnn-imposing-invariance-with-message","title":"IMPaCT GNN: Imposing invariance with Message Passing in Chronological split Temporal Graphs","date":"2024-11-17","arxiv_id":"2411.10957","repositories_listed":0,"syntology":null},{"url":null,"slug":"heterosample-meta-path-guided-sampling-for","title":"HeteroSample: Meta-path Guided Sampling for Heterogeneous Graph Representation Learning","date":"2024-11-11","arxiv_id":"2411.07022","repositories_listed":0,"syntology":null},{"url":null,"slug":"inductive-graph-few-shot-class-incremental","title":"Inductive Graph Few-shot Class Incremental Learning","date":"2024-11-11","arxiv_id":"2411.06634","repositories_listed":0,"syntology":null},{"url":null,"slug":"shedding-light-on-problems-with-hyperbolic","title":"Shedding Light on Problems with Hyperbolic Graph Learning","date":"2024-11-11","arxiv_id":"2411.06688","repositories_listed":0,"syntology":null},{"url":null,"slug":"post-hoc-robustness-enhancement-in-graph","title":"Post-Hoc Robustness Enhancement in Graph Neural Networks with Conditional Random Fields","date":"2024-11-08","arxiv_id":"2411.05399","repositories_listed":0,"syntology":null},{"url":null,"slug":"yoso-you-only-sample-once-via-compressed","title":"YOSO: You-Only-Sample-Once via Compressed Sensing for Graph Neural Network Training","date":"2024-11-08","arxiv_id":"2411.05693","repositories_listed":0,"syntology":null},{"url":null,"slug":"gagsl-global-augmented-graph-structure","title":"GaGSL: Global-augmented Graph Structure Learning via Graph Information Bottleneck","date":"2024-11-07","arxiv_id":"2411.04356","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-neural-networks-with-coarse-and-fine","title":"Graph Neural Networks with Coarse- and Fine-Grained Division for Mitigating Label Sparsity and Noise","date":"2024-11-06","arxiv_id":"2411.03744","repositories_listed":0,"syntology":null},{"url":null,"slug":"g-sparc-spectral-architectures-tackling-the","title":"G-SPARC: SPectral ARchitectures tackling the Cold-start problem in Graph learning","date":"2024-11-03","arxiv_id":"2411.01532","repositories_listed":0,"syntology":null},{"url":null,"slug":"decaf-a-causal-decoupling-framework-for-ood","title":"DeCaf: A Causal Decoupling Framework for OOD Generalization on Node Classification","date":"2024-10-27","arxiv_id":"2410.20295","repositories_listed":0,"syntology":null},{"url":null,"slug":"sparse-decomposition-of-graph-neural-networks","title":"Sparse Decomposition of Graph Neural Networks","date":"2024-10-25","arxiv_id":"2410.19723","repositories_listed":0,"syntology":null},{"url":null,"slug":"bonsai-gradient-free-graph-distillation-for","title":"Bonsai: Gradient-free Graph Condensation for Node Classification","date":"2024-10-23","arxiv_id":"2410.17579","repositories_listed":0,"syntology":null},{"url":null,"slug":"large-language-model-based-augmentation-for","title":"SaVe-TAG: Semantic-aware Vicinal Risk Minimization for Long-Tailed Text-Attributed Graphs","date":"2024-10-22","arxiv_id":"2410.16882","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-to-control-the-smoothness-of-graph","title":"Learning to Control the Smoothness of Graph Convolutional Network Features","date":"2024-10-18","arxiv_id":"2410.14604","repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-frame-detection-via-graph-neural","title":"Multi-frame Detection via Graph Neural Networks: A Link Prediction Approach","date":"2024-10-17","arxiv_id":"2410.13436","repositories_listed":0,"syntology":null},{"url":null,"slug":"rethinking-graph-transformer-architecture","title":"Rethinking Graph Transformer Architecture Design for Node Classification","date":"2024-10-15","arxiv_id":"2410.11189","repositories_listed":0,"syntology":null},{"url":null,"slug":"improving-node-representation-by-boosting","title":"Improving Node Representation by Boosting Target-Aware Contrastive Loss","date":"2024-10-04","arxiv_id":"2410.03901","repositories_listed":0,"syntology":null},{"url":null,"slug":"classcontrast-bridging-the-spatial-and","title":"ClassContrast: Bridging the Spatial and Contextual Gaps for Node Representations","date":"2024-10-03","arxiv_id":"2410.02158","repositories_listed":0,"syntology":null},{"url":null,"slug":"language-models-are-graph-learners","title":"How to Make LLMs Strong Node Classifiers?","date":"2024-10-03","arxiv_id":"2410.02296","repositories_listed":0,"syntology":null}],"record_sha256":"2a3eb23583f11387e7af6918b73b3ee0ac75c9422434b62e342891603f0a3680","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}