{"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/12","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":12,"pages_in_order":19,"rows_per_page":100,"rows":[1101,1200],"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/11","next":"/task/node-classification/papers/13","papers":[{"url":null,"slug":"convolutional-signal-propagation-a-simple","title":"Convolutional Signal Propagation: A Simple Scalable Algorithm for Hypergraphs","date":"2024-09-26","arxiv_id":"2409.17628","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-impact-of-feature-heterophily-on-link","title":"On the Impact of Feature Heterophily on Link Prediction with Graph Neural Networks","date":"2024-09-26","arxiv_id":"2409.17475","repositories_listed":0,"syntology":null},{"url":null,"slug":"graphgi-a-gnn-explanation-method-using-game","title":"GISExplainer: On Explainability of Graph Neural Networks via Game-theoretic Interaction Subgraphs","date":"2024-09-24","arxiv_id":"2409.15698","repositories_listed":0,"syntology":null},{"url":null,"slug":"hyperedge-modeling-in-hypergraph-neural","title":"Hyperedge Modeling in Hypergraph Neural Networks by using Densest Overlapping Subgraphs","date":"2024-09-16","arxiv_id":"2409.10340","repositories_listed":0,"syntology":null},{"url":null,"slug":"leiden-fusion-partitioning-method-for","title":"Leiden-Fusion Partitioning Method for Effective Distributed Training of Graph Embeddings","date":"2024-09-15","arxiv_id":"2409.09887","repositories_listed":0,"syntology":null},{"url":null,"slug":"gre-2-mdcl-graph-representation-embedding","title":"GRE^2-MDCL: Graph Representation Embedding Enhanced via Multidimensional Contrastive Learning","date":"2024-09-12","arxiv_id":"2409.07725","repositories_listed":0,"syntology":null},{"url":null,"slug":"virtual-node-generation-for-node","title":"Virtual Node Generation for Node Classification in Sparsely-Labeled Graphs","date":"2024-09-12","arxiv_id":"2409.07712","repositories_listed":0,"syntology":null},{"url":null,"slug":"graffin-stand-for-tails-in-imbalanced-node","title":"Graffin: Stand for Tails in Imbalanced Node Classification","date":"2024-09-09","arxiv_id":"2409.05339","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-survey-on-signed-graph-embedding-methods","title":"A Survey on Signed Graph Embedding: Methods and Applications","date":"2024-09-05","arxiv_id":"2409.03916","repositories_listed":0,"syntology":null},{"url":null,"slug":"self-directed-learning-of-convex-labelings-on","title":"Self-Directed Learning of Convex Labelings on Graphs","date":"2024-09-02","arxiv_id":"2409.01428","repositories_listed":0,"syntology":null},{"url":null,"slug":"hound-hunting-supervision-signals-for-few-and","title":"Hound: Hunting Supervision Signals for Few and Zero Shot Node Classification on Text-attributed Graph","date":"2024-09-01","arxiv_id":"2409.00727","repositories_listed":0,"syntology":null},{"url":null,"slug":"sfr-gnn-simple-and-fast-robust-gnns-against","title":"SFR-GNN: Simple and Fast Robust GNNs against Structural Attacks","date":"2024-08-29","arxiv_id":"2408.16537","repositories_listed":0,"syntology":null},{"url":null,"slug":"exploring-the-potential-of-large-language-9","title":"Exploring the Potential of Large Language Models for Heterophilic Graphs","date":"2024-08-26","arxiv_id":"2408.14134","repositories_listed":0,"syntology":null},{"url":null,"slug":"rocp-gnn-robust-conformal-prediction-for","title":"RoCP-GNN: Robust Conformal Prediction for Graph Neural Networks in Node-Classification","date":"2024-08-25","arxiv_id":"2408.13825","repositories_listed":0,"syntology":null},{"url":null,"slug":"slicing-input-features-to-accelerate-deep","title":"Slicing Input Features to Accelerate Deep Learning: A Case Study with Graph Neural Networks","date":"2024-08-21","arxiv_id":"2408.11500","repositories_listed":0,"syntology":null},{"url":null,"slug":"leveraging-invariant-principle-for","title":"Leveraging Invariant Principle for Heterophilic Graph Structure Distribution Shifts","date":"2024-08-18","arxiv_id":"2408.09490","repositories_listed":0,"syntology":null},{"url":null,"slug":"sa-gda-spectral-augmentation-for-graph-domain","title":"SA-GDA: Spectral Augmentation for Graph Domain Adaptation","date":"2024-08-17","arxiv_id":"2408.09189","repositories_listed":0,"syntology":null},{"url":"/paper/dyg-mamba-continuous-state-space-modeling-on","slug":"dyg-mamba-continuous-state-space-modeling-on","title":"DyG-Mamba: Continuous State Space Modeling on Dynamic Graphs","date":"2024-08-13","arxiv_id":"2408.06966","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":6,"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/dyg-mamba-continuous-state-space-modeling-on#ran","syntology_url":"https://syntology.ai/paper/2408.06966","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2408.06966"}},"official":null}},{"url":null,"slug":"rw-nsgcn-a-robust-approach-to-structural","title":"RW-NSGCN: A Robust Approach to Structural Attacks via Negative Sampling","date":"2024-08-13","arxiv_id":"2408.06665","repositories_listed":0,"syntology":null},{"url":null,"slug":"path-llm-a-shortest-path-based-llm-learning","title":"Path-LLM: A Shortest-Path-based LLM Learning for Unified Graph Representation","date":"2024-08-10","arxiv_id":"2408.05456","repositories_listed":0,"syntology":null},{"url":null,"slug":"node-level-graph-autoencoder-unified","title":"Node Level Graph Autoencoder: Unified Pretraining for Textual Graph Learning","date":"2024-08-09","arxiv_id":"2408.07091","repositories_listed":0,"syntology":null},{"url":null,"slug":"knowledge-probing-for-graph-representation","title":"Knowledge Probing for Graph Representation Learning","date":"2024-08-07","arxiv_id":"2408.03877","repositories_listed":0,"syntology":null},{"url":null,"slug":"2408-01964","title":"Top K Enhanced Reinforcement Learning Attacks on Heterogeneous Graph Node Classification","date":"2024-08-04","arxiv_id":"2408.01964","repositories_listed":0,"syntology":null},{"url":null,"slug":"contrastive-graph-representation-learning","title":"Contrastive Graph Representation Learning with Adversarial Cross-view Reconstruction and Information Bottleneck","date":"2024-08-01","arxiv_id":"2408.00295","repositories_listed":0,"syntology":null},{"url":null,"slug":"sharp-bounds-for-poly-gnns-and-the-effect-of","title":"Sharp Bounds for Poly-GNNs and the Effect of Graph Noise","date":"2024-07-28","arxiv_id":"2407.19567","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-memory-learning-imitating-lifelong","title":"Graph Memory Learning: Imitating Lifelong Remembering and Forgetting of Brain Networks","date":"2024-07-27","arxiv_id":"2407.19183","repositories_listed":0,"syntology":null},{"url":null,"slug":"pre-training-and-prompting-for-few-shot-node","title":"Pre-Training and Prompting for Few-Shot Node Classification on Text-Attributed Graphs","date":"2024-07-22","arxiv_id":"2407.15431","repositories_listed":0,"syntology":null},{"url":null,"slug":"revisiting-neighborhood-aggregation-in-graph","title":"Revisiting Neighborhood Aggregation in Graph Neural Networks for Node Classification using Statistical Signal Processing","date":"2024-07-21","arxiv_id":"2407.15284","repositories_listed":0,"syntology":null},{"url":null,"slug":"enhancing-data-limited-graph-neural-networks","title":"Enhancing Graph Neural Networks with Limited Labeled Data by Actively Distilling Knowledge from Large Language Models","date":"2024-07-19","arxiv_id":"2407.13989","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-structure-prompt-learning-a-novel","title":"Graph Structure Prompt Learning: A Novel Methodology to Improve Performance of Graph Neural Networks","date":"2024-07-16","arxiv_id":"2407.11361","repositories_listed":0,"syntology":null},{"url":null,"slug":"graphfm-a-scalable-framework-for-multi-graph","title":"GraphFM: A Scalable Framework for Multi-Graph Pretraining","date":"2024-07-16","arxiv_id":"2407.11907","repositories_listed":0,"syntology":null},{"url":"/paper/relaxing-graph-transformers-for-adversarial","slug":"relaxing-graph-transformers-for-adversarial","title":"Relaxing Graph Transformers for Adversarial Attacks","date":"2024-07-16","arxiv_id":"2407.11764","repositories_listed":0,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/relaxing-graph-transformers-for-adversarial#ran","syntology_url":"https://syntology.ai/paper/2407.11764","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.11764"}},"official":null}},{"url":null,"slug":"improving-hyperbolic-representations-via","title":"Improving Hyperbolic Representations via Gromov-Wasserstein Regularization","date":"2024-07-15","arxiv_id":"2407.10495","repositories_listed":0,"syntology":null},{"url":"/paper/conformal-inductive-graph-neural-networks","slug":"conformal-inductive-graph-neural-networks","title":"Conformal Inductive Graph Neural Networks","date":"2024-07-12","arxiv_id":"2407.09173","repositories_listed":0,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/conformal-inductive-graph-neural-networks#ran","syntology_url":"https://syntology.ai/paper/2407.09173","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.09173"}},"official":null}},{"url":null,"slug":"sf-gnn-self-filter-for-message-lossless","title":"SF-GNN: Self Filter for Message Lossless Propagation in Deep Graph Neural Network","date":"2024-07-03","arxiv_id":"2407.02762","repositories_listed":0,"syntology":null},{"url":null,"slug":"structure-aware-consensus-network-on-graphs","title":"Structure-Aware Consensus Network on Graphs with Few Labeled Nodes","date":"2024-07-02","arxiv_id":"2407.02188","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-learned-generalized-geodesic-distance","title":"A Learned Generalized Geodesic Distance Function-Based Approach for Node Feature Augmentation on Graphs","date":"2024-07-01","arxiv_id":"2407.01194","repositories_listed":0,"syntology":null},{"url":null,"slug":"leveraging-contrastive-learning-for-enhanced","title":"Leveraging Contrastive Learning for Enhanced Node Representations in Tokenized Graph Transformers","date":"2024-06-27","arxiv_id":"2406.19258","repositories_listed":0,"syntology":null},{"url":null,"slug":"ntformer-a-composite-node-tokenized-graph","title":"NTFormer: A Composite Node Tokenized Graph Transformer for Node Classification","date":"2024-06-27","arxiv_id":"2406.19249","repositories_listed":0,"syntology":null},{"url":null,"slug":"kolmogorov-arnold-graph-neural-networks","title":"Kolmogorov-Arnold Graph Neural Networks","date":"2024-06-26","arxiv_id":"2406.18354","repositories_listed":0,"syntology":null},{"url":null,"slug":"inference-of-sequential-patterns-for-neural","title":"Inference of Sequential Patterns for Neural Message Passing in Temporal Graphs","date":"2024-06-24","arxiv_id":"2406.16552","repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-lightweight-graph-neural-network","title":"Towards Lightweight Graph Neural Network Search with Curriculum Graph Sparsification","date":"2024-06-24","arxiv_id":"2406.16357","repositories_listed":0,"syntology":null},{"url":null,"slug":"from-overfitting-to-robustness-quantity","title":"From Overfitting to Robustness: Quantity, Quality, and Variety Oriented Negative Sample Selection in Graph Contrastive Learning","date":"2024-06-21","arxiv_id":"2406.15044","repositories_listed":0,"syntology":null},{"url":null,"slug":"sketch-gnn-scalable-graph-neural-networks","title":"Sketch-GNN: Scalable Graph Neural Networks with Sublinear Training Complexity","date":"2024-06-21","arxiv_id":"2406.15575","repositories_listed":0,"syntology":null},{"url":null,"slug":"dr-e-bridges-graphs-with-large-language","title":"Multi-View Empowered Structural Graph Wordification for Language Models","date":"2024-06-19","arxiv_id":"2406.15504","repositories_listed":0,"syntology":null},{"url":null,"slug":"federated-learning-with-limited-node-labels","title":"Federated Learning with Limited Node Labels","date":"2024-06-18","arxiv_id":"2406.12435","repositories_listed":0,"syntology":null},{"url":null,"slug":"global-local-graph-neural-networks-for-node","title":"Global-Local Graph Neural Networks for Node-Classification","date":"2024-06-16","arxiv_id":"2406.10863","repositories_listed":0,"syntology":null},{"url":"/paper/graph-neural-reaction-diffusion-models","slug":"graph-neural-reaction-diffusion-models","title":"Graph Neural Reaction Diffusion Models","date":"2024-06-16","arxiv_id":"2406.10871","repositories_listed":0,"syntology":null},{"url":null,"slug":"disentangled-hyperbolic-representation","title":"Disentangled Hyperbolic Representation Learning for Heterogeneous Graphs","date":"2024-06-14","arxiv_id":"2406.10367","repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-source-unsupervised-domain-adaptation-1","title":"Multi-source Unsupervised Domain Adaptation on Graphs with Transferability Modeling","date":"2024-06-14","arxiv_id":"2406.10425","repositories_listed":0,"syntology":null},{"url":"/paper/robustness-inspired-defense-against-backdoor","slug":"robustness-inspired-defense-against-backdoor","title":"Robustness Inspired Graph Backdoor Defense","date":"2024-06-14","arxiv_id":"2406.09836","repositories_listed":0,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/robustness-inspired-defense-against-backdoor#ran","syntology_url":"https://syntology.ai/paper/2406.09836","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.09836"}},"official":null}},{"url":null,"slug":"hierarchical-compression-of-text-rich-graphs","title":"Hierarchical Compression of Text-Rich Graphs via Large Language Models","date":"2024-06-13","arxiv_id":"2406.11884","repositories_listed":0,"syntology":null},{"url":null,"slug":"graphfm-a-comprehensive-benchmark-for-graph","title":"GraphFM: A Comprehensive Benchmark for Graph Foundation Model","date":"2024-06-12","arxiv_id":"2406.08310","repositories_listed":0,"syntology":null},{"url":null,"slug":"generating-human-understandable-explanations","title":"Generating Human Understandable Explanations for Node Embeddings","date":"2024-06-11","arxiv_id":"2406.07642","repositories_listed":0,"syntology":null},{"url":"/paper/holistic-memory-diversification-for","slug":"holistic-memory-diversification-for","title":"Holistic Memory Diversification for Incremental Learning in Growing Graphs","date":"2024-06-11","arxiv_id":"2406.07413","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":6,"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/holistic-memory-diversification-for#ran","syntology_url":"https://syntology.ai/paper/2406.07413","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.07413"}},"official":null}},{"url":null,"slug":"rethinking-the-impact-of-noisy-labels-in","title":"Rethinking the impact of noisy labels in graph classification: A utility and privacy perspective","date":"2024-06-11","arxiv_id":"2406.07314","repositories_listed":0,"syntology":null},{"url":null,"slug":"genie-watermarking-graph-neural-networks-for","title":"GENIE: Watermarking Graph Neural Networks for Link Prediction","date":"2024-06-07","arxiv_id":"2406.04805","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-mining-under-data-scarcity","title":"Graph Mining under Data scarcity","date":"2024-06-07","arxiv_id":"2406.04825","repositories_listed":0,"syntology":null},{"url":null,"slug":"gnnanatomy-systematic-generation-and","title":"GNNAnatomy: Rethinking Model-Level Explanations for Graph Neural Networks","date":"2024-06-06","arxiv_id":"2406.04548","repositories_listed":0,"syntology":null},{"url":null,"slug":"enhancing-the-resilience-of-graph-neural","title":"Enhancing the Resilience of Graph Neural Networks to Topological Perturbations in Sparse Graphs","date":"2024-06-05","arxiv_id":"2406.03097","repositories_listed":0,"syntology":null},{"url":null,"slug":"node-wise-filtering-in-graph-neural-networks","title":"Node-wise Filtering in Graph Neural Networks: A Mixture of Experts Approach","date":"2024-06-05","arxiv_id":"2406.03464","repositories_listed":0,"syntology":null},{"url":null,"slug":"what-improves-the-generalization-of-graph","title":"What Improves the Generalization of Graph Transformers? A Theoretical Dive into the Self-attention and Positional Encoding","date":"2024-06-04","arxiv_id":"2406.01977","repositories_listed":0,"syntology":null},{"url":null,"slug":"continuous-geometry-aware-graph-diffusion-via","title":"Continuous Geometry-Aware Graph Diffusion via Hyperbolic Neural PDE","date":"2024-06-03","arxiv_id":"2406.01282","repositories_listed":0,"syntology":null},{"url":"/paper/heterophilous-distribution-propagation-for","slug":"heterophilous-distribution-propagation-for","title":"Heterophilous Distribution Propagation for Graph Neural Networks","date":"2024-05-31","arxiv_id":"2405.20640","repositories_listed":0,"syntology":null},{"url":null,"slug":"matrix-manifold-neural-networks","title":"Matrix Manifold Neural Networks++","date":"2024-05-29","arxiv_id":"2405.19206","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-coarsening-with-message-passing","title":"Graph Coarsening with Message-Passing Guarantees","date":"2024-05-28","arxiv_id":"2405.18127","repositories_listed":0,"syntology":null},{"url":null,"slug":"unleashing-the-potential-of-text-attributed","title":"Unleashing the Potential of Text-attributed Graphs: Automatic Relation Decomposition via Large Language Models","date":"2024-05-28","arxiv_id":"2405.18581","repositories_listed":0,"syntology":null},{"url":null,"slug":"spectral-greedy-coresets-for-graph-neural","title":"Spectral Greedy Coresets for Graph Neural Networks","date":"2024-05-27","arxiv_id":"2405.17404","repositories_listed":0,"syntology":null},{"url":null,"slug":"transfer-learning-under-high-dimensional-1","title":"Transfer Learning Under High-Dimensional Graph Convolutional Regression Model for Node Classification","date":"2024-05-26","arxiv_id":"2405.16672","repositories_listed":0,"syntology":null},{"url":null,"slug":"encoder-embedding-for-general-graph-and-node","title":"Encoder Embedding for General Graph and Node Classification","date":"2024-05-24","arxiv_id":"2405.15473","repositories_listed":0,"syntology":null},{"url":null,"slug":"sparse-spectral-training-and-inference-on","title":"Sparse Spectral Training and Inference on Euclidean and Hyperbolic Neural Networks","date":"2024-05-24","arxiv_id":"2405.15481","repositories_listed":0,"syntology":null},{"url":null,"slug":"automated-loss-function-search-for-class","title":"Automated Loss function Search for Class-imbalanced Node Classification","date":"2024-05-23","arxiv_id":"2405.14133","repositories_listed":0,"syntology":null},{"url":null,"slug":"co-representation-neural-hypergraph-diffusion","title":"Co-Representation Neural Hypergraph Diffusion for Edge-Dependent Node Classification","date":"2024-05-23","arxiv_id":"2405.14286","repositories_listed":0,"syntology":null},{"url":null,"slug":"hc-gae-the-hierarchical-cluster-based-graph","title":"HC-GAE: The Hierarchical Cluster-based Graph Auto-Encoder for Graph Representation Learning","date":"2024-05-23","arxiv_id":"2405.14742","repositories_listed":0,"syntology":null},{"url":null,"slug":"analysis-of-corrected-graph-convolutions","title":"Analysis of Corrected Graph Convolutions","date":"2024-05-22","arxiv_id":"2405.13987","repositories_listed":0,"syntology":null},{"url":null,"slug":"dygprompt-learning-feature-and-time-prompts","title":"Node-Time Conditional Prompt Learning In Dynamic Graphs","date":"2024-05-22","arxiv_id":"2405.13937","repositories_listed":0,"syntology":null},{"url":null,"slug":"conditional-shift-robust-conformal-prediction","title":"Conditional Shift-Robust Conformal Prediction for Graph Neural Network","date":"2024-05-20","arxiv_id":"2405.11968","repositories_listed":0,"syntology":null},{"url":null,"slug":"leveraging-discourse-structure-for-the","title":"Leveraging Discourse Structure for Extractive Meeting Summarization","date":"2024-05-17","arxiv_id":"2405.11055","repositories_listed":0,"syntology":null},{"url":null,"slug":"certifying-robustness-of-graph-convolutional","title":"Certifying Robustness of Graph Convolutional Networks for Node Perturbation with Polyhedra Abstract Interpretation","date":"2024-05-14","arxiv_id":"2405.08645","repositories_listed":0,"syntology":null},{"url":null,"slug":"conditional-local-feature-encoding-for-graph","title":"Conditional Local Feature Encoding for Graph Neural Networks","date":"2024-05-08","arxiv_id":"2405.04755","repositories_listed":0,"syntology":null},{"url":null,"slug":"uncertainty-for-active-learning-on-graphs","title":"Uncertainty for Active Learning on Graphs","date":"2024-05-02","arxiv_id":"2405.01462","repositories_listed":0,"syntology":null},{"url":null,"slug":"generating-robust-counterfactual-witnesses","title":"Generating Robust Counterfactual Witnesses for Graph Neural Networks","date":"2024-04-30","arxiv_id":"2404.19519","repositories_listed":0,"syntology":null},{"url":null,"slug":"noisy-node-classification-by-bi-level","title":"Noisy Node Classification by Bi-level Optimization based Multi-teacher Distillation","date":"2024-04-27","arxiv_id":"2404.17875","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-clean-graph-backdoor-attack-against-graph","title":"A Clean-graph Backdoor Attack against Graph Convolutional Networks with Poisoned Label Only","date":"2024-04-19","arxiv_id":"2404.12704","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-learning-dual-graph-convolutional","title":"Graph Convolutional Network For Semi-supervised Node Classification With Subgraph Sketching","date":"2024-04-19","arxiv_id":"2404.12724","repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-view-subgraph-neural-networks-self","title":"Multi-View Subgraph Neural Networks: Self-Supervised Learning with Scarce Labeled Data","date":"2024-04-19","arxiv_id":"2404.12569","repositories_listed":0,"syntology":null},{"url":null,"slug":"you-do-not-have-to-train-graph-neural","title":"You do not have to train Graph Neural Networks at all on text-attributed graphs","date":"2024-04-17","arxiv_id":"2404.11019","repositories_listed":0,"syntology":null},{"url":null,"slug":"aghint-attribute-guided-representation","title":"AGHINT: Attribute-Guided Representation Learning on Heterogeneous Information Networks with Transformer","date":"2024-04-16","arxiv_id":"2404.10443","repositories_listed":0,"syntology":null},{"url":null,"slug":"rethinking-the-graph-polynomial-filter-via","title":"Rethinking the Graph Polynomial Filter via Positive and Negative Coupling Analysis","date":"2024-04-16","arxiv_id":"2404.10353","repositories_listed":0,"syntology":null},{"url":null,"slug":"hyperbolic-heterogeneous-graph-attention","title":"Hyperbolic Heterogeneous Graph Attention Networks","date":"2024-04-15","arxiv_id":"2404.09456","repositories_listed":0,"syntology":null},{"url":null,"slug":"fair-graph-neural-network-with-supervised","title":"Fair Graph Neural Network with Supervised Contrastive Regularization","date":"2024-04-09","arxiv_id":"2404.06090","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-neural-networks-for-binary-programming","title":"Graph Neural Networks for Binary Programming","date":"2024-04-07","arxiv_id":"2404.04874","repositories_listed":0,"syntology":null},{"url":null,"slug":"heteromile-a-multi-level-graph-representation","title":"HeteroMILE: a Multi-Level Graph Representation Learning Framework for Heterogeneous Graphs","date":"2024-03-31","arxiv_id":"2404.00816","repositories_listed":0,"syntology":null},{"url":null,"slug":"beyond-the-known-novel-class-discovery-for","title":"Beyond the Known: Novel Class Discovery for Open-world Graph Learning","date":"2024-03-29","arxiv_id":"2403.19907","repositories_listed":0,"syntology":null},{"url":"/paper/graph-neural-aggregation-diffusion-with","slug":"graph-neural-aggregation-diffusion-with","title":"Graph Neural Aggregation-diffusion with Metastability","date":"2024-03-29","arxiv_id":"2403.20221","repositories_listed":0,"syntology":null},{"url":null,"slug":"variational-graph-auto-encoder-based","title":"Variational Graph Auto-Encoder Based Inductive Learning Method for Semi-Supervised Classification","date":"2024-03-26","arxiv_id":"2403.17500","repositories_listed":0,"syntology":null},{"url":null,"slug":"chebmixer-efficient-graph-representation","title":"ChebMixer: Efficient Graph Representation Learning with MLP Mixer","date":"2024-03-25","arxiv_id":"2403.16358","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-federated-parameter-aggregation-method-for","title":"A Federated Parameter Aggregation Method for Node Classification Tasks with Different Graph Network Structures","date":"2024-03-24","arxiv_id":"2403.16004","repositories_listed":0,"syntology":null},{"url":null,"slug":"node-classification-via-semantic-structural","title":"Node Classification via Semantic-Structural Attention-Enhanced Graph Convolutional Networks","date":"2024-03-24","arxiv_id":"2403.16033","repositories_listed":0,"syntology":null},{"url":null,"slug":"exploring-the-potential-of-large-language-7","title":"Exploring the Potential of Large Language Models in Graph Generation","date":"2024-03-21","arxiv_id":"2403.14358","repositories_listed":0,"syntology":null}],"record_sha256":"53c2feb9b16076d4a609cd0044415f8b6feb676873a0ec3d17500003e4819450","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}