{"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/graph-learning/papers/11","list_of":"/task/graph-learning","task":"Graph Learning","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":16,"rows_per_page":100,"rows":[1001,1100],"of":1570,"counts":{"archive_papers_tagged":1570,"with_a_code_link":686,"where_syntology_ran_a_sample":193,"not_listed_spam_title":0,"listed":1570,"listed_where_code_ran":193,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":162,"every_run_a_failure_of_syntologys_instrument":31,"listed_with_a_run_with_no_instrument_failure":162,"listed_every_run_a_failure_of_syntologys_instrument":31,"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/graph-learning","prev":"/task/graph-learning/papers/10","next":"/task/graph-learning/papers/12","papers":[{"url":null,"slug":"hdreason-algorithm-hardware-codesign-for","title":"HDReason: Algorithm-Hardware Codesign for Hyperdimensional Knowledge Graph Reasoning","date":"2024-03-09","arxiv_id":"2403.05763","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-learning-for-parameter-prediction-of","title":"Graph Learning for Parameter Prediction of Quantum Approximate Optimization Algorithm","date":"2024-03-05","arxiv_id":"2403.03310","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":null,"slug":"graph-learning-under-distribution-shifts-a","title":"Graph Learning under Distribution Shifts: A Comprehensive Survey on Domain Adaptation, Out-of-distribution, and Continual Learning","date":"2024-02-26","arxiv_id":"2402.16374","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-learning-with-distributional-edge","title":"Graph Learning with Distributional Edge Layouts","date":"2024-02-26","arxiv_id":"2402.16402","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-generalization-capability-of-temporal","title":"On the Generalization Capability of Temporal Graph Learning Algorithms: Theoretical Insights and a Simpler Method","date":"2024-02-26","arxiv_id":"2402.16387","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":"deep-contrastive-graph-learning-with","title":"Deep Contrastive Graph Learning with Clustering-Oriented Guidance","date":"2024-02-25","arxiv_id":"2402.16012","repositories_listed":0,"syntology":null},{"url":null,"slug":"overcoming-pitfalls-in-graph-contrastive","title":"Overcoming Pitfalls in Graph Contrastive Learning Evaluation: Toward Comprehensive Benchmarks","date":"2024-02-24","arxiv_id":"2402.15680","repositories_listed":0,"syntology":null},{"url":null,"slug":"linksage-optimizing-job-matching-using-graph","title":"LinkSAGE: Optimizing Job Matching Using Graph Neural Networks","date":"2024-02-20","arxiv_id":"2402.13430","repositories_listed":0,"syntology":null},{"url":null,"slug":"distilling-large-language-models-for-text","title":"Distilling Large Language Models for Text-Attributed Graph Learning","date":"2024-02-19","arxiv_id":"2402.12022","repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-versatile-graph-learning-approach","title":"Towards Versatile Graph Learning Approach: from the Perspective of Large Language Models","date":"2024-02-18","arxiv_id":"2402.11641","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":"unifying-invariance-and-spuriousity-for-graph","title":"Unifying Invariance and Spuriousity for Graph Out-of-Distribution via Probability of Necessity and Sufficiency","date":"2024-02-14","arxiv_id":"2402.09165","repositories_listed":0,"syntology":null},{"url":null,"slug":"revealing-decurve-flows-for-generalized-graph","title":"Revealing Decurve Flows for Generalized Graph Propagation","date":"2024-02-13","arxiv_id":"2402.08480","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-cartesian-product-graphs-with","title":"Learning Cartesian Product Graphs with Laplacian Constraints","date":"2024-02-12","arxiv_id":"2402.08105","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":"continual-learning-on-graphs-a-survey","title":"Continual Learning on Graphs: A Survey","date":"2024-02-09","arxiv_id":"2402.06330","repositories_listed":0,"syntology":null},{"url":null,"slug":"geneft-understanding-statics-and-dynamics-of","title":"GenEFT: Understanding Statics and Dynamics of Model Generalization via Effective Theory","date":"2024-02-08","arxiv_id":"2402.05916","repositories_listed":0,"syntology":null},{"url":null,"slug":"veni-vidi-vici-solving-the-myriad-of","title":"Veni, Vidi, Vici: Solving the Myriad of Challenges before Knowledge Graph Learning","date":"2024-02-08","arxiv_id":"2402.06098","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-on-multimodal-graphs-a-survey","title":"Learning on Multimodal Graphs: A Survey","date":"2024-02-07","arxiv_id":"2402.05322","repositories_listed":0,"syntology":null},{"url":null,"slug":"patsteg-modeling-formation-dynamics-of-patent","title":"PatSTEG: Modeling Formation Dynamics of Patent Citation Networks via The Semantic-Topological Evolutionary Graph","date":"2024-02-03","arxiv_id":"2402.02158","repositories_listed":0,"syntology":null},{"url":null,"slug":"two-heads-are-better-than-one-boosting-graph","title":"Two Heads Are Better Than One: Boosting Graph Sparse Training via Semantic and Topological Awareness","date":"2024-02-02","arxiv_id":"2402.01242","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-survey-of-data-efficient-graph-learning","title":"A Survey of Data-Efficient Graph Learning","date":"2024-02-01","arxiv_id":"2402.00447","repositories_listed":0,"syntology":null},{"url":null,"slug":"benchmarking-sensitivity-of-continual-graph","title":"Benchmarking Sensitivity of Continual Graph Learning for Skeleton-Based Action Recognition","date":"2024-01-31","arxiv_id":"2401.18054","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-survey-on-structure-preserving-graph","title":"A Survey on Structure-Preserving Graph Transformers","date":"2024-01-29","arxiv_id":"2401.16176","repositories_listed":0,"syntology":null},{"url":null,"slug":"mtrgl-effective-temporal-correlation","title":"MTRGL:Effective Temporal Correlation Discerning through Multi-modal Temporal Relational Graph Learning","date":"2024-01-25","arxiv_id":"2401.14199","repositories_listed":0,"syntology":null},{"url":null,"slug":"multiview-graph-learning-with-consensus-graph","title":"Multiview Graph Learning with Consensus Graph","date":"2024-01-24","arxiv_id":"2401.13769","repositories_listed":0,"syntology":null},{"url":null,"slug":"scalable-link-prediction-on-large-scale","title":"LPNL: Scalable Link Prediction with Large Language Models","date":"2024-01-24","arxiv_id":"2401.13227","repositories_listed":0,"syntology":null},{"url":null,"slug":"ada-gnn-atom-distance-angle-graph-neural","title":"ADA-GNN: Atom-Distance-Angle Graph Neural Network for Crystal Material Property Prediction","date":"2024-01-22","arxiv_id":"2401.11768","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":"boolgebra-attributed-graph-learning-for","title":"BoolGebra: Attributed Graph-learning for Boolean Algebraic Manipulation","date":"2024-01-19","arxiv_id":"2401.10753","repositories_listed":0,"syntology":null},{"url":null,"slug":"false-discovery-rate-control-for-gaussian","title":"False Discovery Rate Control for Gaussian Graphical Models via Neighborhood Screening","date":"2024-01-18","arxiv_id":"2401.09979","repositories_listed":0,"syntology":null},{"url":"/paper/a-novel-hybrid-time-varying-graph-neural","slug":"a-novel-hybrid-time-varying-graph-neural","title":"A novel hybrid time-varying graph neural network for traffic flow forecasting","date":"2024-01-17","arxiv_id":"2401.10155","repositories_listed":0,"syntology":null},{"url":null,"slug":"machine-learning-on-dynamic-graphs-a-survey","title":"Machine Learning on Dynamic Graphs: A Survey on Applications","date":"2024-01-16","arxiv_id":"2401.08147","repositories_listed":0,"syntology":null},{"url":null,"slug":"optimizing-k-in-k-nn-graphs-with-graph","title":"Optimizing $k$ in $k$NN Graphs with Graph Learning Perspective","date":"2024-01-16","arxiv_id":"2401.08245","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-general-benchmark-framework-is-dynamic","title":"A General Benchmark Framework is Dynamic Graph Neural Network Need","date":"2024-01-12","arxiv_id":"2401.06559","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-learning-based-fleet-scheduling-for","title":"Graph Learning-based Fleet Scheduling for Urban Air Mobility under Operational Constraints, Varying Demand & Uncertainties","date":"2024-01-09","arxiv_id":"2401.04851","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-primer-on-temporal-graph-learning","title":"A Primer on Temporal Graph Learning","date":"2024-01-08","arxiv_id":"2401.03988","repositories_listed":0,"syntology":null},{"url":null,"slug":"unifying-graph-contrastive-learning-via-graph","title":"Unifying Graph Contrastive Learning via Graph Message Augmentation","date":"2024-01-08","arxiv_id":"2401.03638","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":"glisp-a-scalable-gnn-learning-system-by","title":"GLISP: A Scalable GNN Learning System by Exploiting Inherent Structural Properties of Graphs","date":"2024-01-06","arxiv_id":"2401.03114","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-topology-aware-graph-coarsening-framework","title":"A Topology-aware Graph Coarsening Framework for Continual Graph Learning","date":"2024-01-05","arxiv_id":"2401.03077","repositories_listed":0,"syntology":null},{"url":null,"slug":"adaptive-hyper-graph-aggregation-for-modality","title":"Adaptive Hyper-graph Aggregation for Modality-Agnostic Federated Learning","date":"2024-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"joint-signal-recovery-and-graph-learning-from","title":"Joint Signal Recovery and Graph Learning from Incomplete Time-Series","date":"2023-12-28","arxiv_id":"2312.16940","repositories_listed":0,"syntology":null},{"url":null,"slug":"diffusion-maps-for-signal-filtering-in-graph","title":"Diffusion Maps for Signal Filtering in Graph Learning","date":"2023-12-22","arxiv_id":"2312.14758","repositories_listed":0,"syntology":null},{"url":null,"slug":"transglow-attention-augmented-transduction","title":"TransGlow: Attention-augmented Transduction model based on Graph Neural Networks for Water Flow Forecasting","date":"2023-12-10","arxiv_id":"2312.05961","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":"the-graph-lottery-ticket-hypothesis-finding","title":"The Graph Lottery Ticket Hypothesis: Finding Sparse, Informative Graph Structure","date":"2023-12-08","arxiv_id":"2312.04762","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":"efficient-large-language-models-fine-tuning","title":"Efficient End-to-end Language Model Fine-tuning on Graphs","date":"2023-12-07","arxiv_id":"2312.04737","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":null,"slug":"learning-high-dimensional-differential-graphs","title":"Learning High-Dimensional Differential Graphs From Multi-Attribute Data","date":"2023-12-05","arxiv_id":"2312.03761","repositories_listed":0,"syntology":null},{"url":null,"slug":"samsgl-series-aligned-multi-scale-graph","title":"SAMSGL: Series-Aligned Multi-Scale Graph Learning for Spatio-Temporal Forecasting","date":"2023-12-05","arxiv_id":"2312.02646","repositories_listed":0,"syntology":null},{"url":null,"slug":"percnet-periodic-complete-representation-for","title":"PerCNet: Periodic Complete Representation for Crystal Graphs","date":"2023-12-03","arxiv_id":"2312.14936","repositories_listed":0,"syntology":null},{"url":null,"slug":"lastgl-an-industrial-framework-for-large","title":"LasTGL: An Industrial Framework for Large-Scale Temporal Graph Learning","date":"2023-11-28","arxiv_id":"2311.16605","repositories_listed":0,"syntology":null},{"url":null,"slug":"solve-large-scale-unit-commitment-problems-by","title":"Solve Large-scale Unit Commitment Problems by Physics-informed Graph Learning","date":"2023-11-26","arxiv_id":"2311.15216","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":"a-unified-framework-for-fair-spectral","title":"A Unified Framework for Fair Spectral Clustering With Effective Graph Learning","date":"2023-11-23","arxiv_id":"2311.13766","repositories_listed":0,"syntology":null},{"url":null,"slug":"hierarchical-joint-graph-learning-and","title":"Hierarchical Joint Graph Learning and Multivariate Time Series Forecasting","date":"2023-11-21","arxiv_id":"2311.12630","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":"spatio-temporal-graph-neural-point-process","title":"Spatio-Temporal Graph Neural Point Process for Traffic Congestion Event Prediction","date":"2023-11-15","arxiv_id":"2311.08635","repositories_listed":0,"syntology":null},{"url":null,"slug":"mobility-induced-graph-learning-for-wifi","title":"Mobility-Induced Graph Learning for WiFi Positioning","date":"2023-11-14","arxiv_id":"2311.08271","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-consistent-diffusion-based-algorithm-for-1","title":"A Consistent Diffusion-Based Algorithm for Semi-Supervised Graph Learning","date":"2023-11-13","arxiv_id":"2311.07627","repositories_listed":0,"syntology":null},{"url":null,"slug":"dirichlet-active-learning","title":"Dirichlet Active Learning","date":"2023-11-09","arxiv_id":"2311.05501","repositories_listed":0,"syntology":null},{"url":null,"slug":"information-theoretic-generalization-bounds-6","title":"Information-Theoretic Generalization Bounds for Transductive Learning and its Applications","date":"2023-11-08","arxiv_id":"2311.04561","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-decentralized-traffic-signal","title":"Learning Decentralized Traffic Signal Controllers with Multi-Agent Graph Reinforcement Learning","date":"2023-11-07","arxiv_id":"2311.03756","repositories_listed":0,"syntology":null},{"url":null,"slug":"improving-collaborative-filtering","title":"Improving Collaborative Filtering Recommendation via Graph Learning","date":"2023-11-06","arxiv_id":"2311.03316","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-metadata-driven-approach-to-understand","title":"A Metadata-Driven Approach to Understand Graph Neural Networks","date":"2023-10-30","arxiv_id":"2310.19263","repositories_listed":0,"syntology":null},{"url":null,"slug":"kernel-based-joint-multiple-graph-learning","title":"Kernel-based Joint Multiple Graph Learning and Clustering of Graph Signals","date":"2023-10-29","arxiv_id":"2310.19005","repositories_listed":0,"syntology":null},{"url":null,"slug":"mag-gnn-reinforcement-learning-boosted-graph","title":"MAG-GNN: Reinforcement Learning Boosted Graph Neural Network","date":"2023-10-29","arxiv_id":"2310.19142","repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-unifying-diffusion-models-for","title":"Towards Unifying Diffusion Models for Probabilistic Spatio-Temporal Graph Learning","date":"2023-10-26","arxiv_id":"2310.17360","repositories_listed":0,"syntology":null},{"url":null,"slug":"do-we-really-need-contrastive-learning-for","title":"Graph Ranking Contrastive Learning: A Extremely Simple yet Efficient Method","date":"2023-10-23","arxiv_id":"2310.14525","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":"towards-graph-foundation-models-a-survey-and","title":"Towards Graph Foundation Models: A Survey and Beyond","date":"2023-10-18","arxiv_id":"2310.11829","repositories_listed":0,"syntology":null},{"url":null,"slug":"hgcvae-integrating-generative-and-contrastive","title":"Refining Latent Representations: A Generative SSL Approach for Heterogeneous Graph Learning","date":"2023-10-17","arxiv_id":"2310.11102","repositories_listed":0,"syntology":null},{"url":null,"slug":"mekb-rec-personal-knowledge-graph-learning","title":"MeKB-Rec: Personal Knowledge Graph Learning for Cross-Domain Recommendation","date":"2023-10-17","arxiv_id":"2310.11088","repositories_listed":0,"syntology":null},{"url":null,"slug":"exploring-sparse-spatial-relation-in-graph","title":"Exploring Sparse Spatial Relation in Graph Inference for Text-Based VQA","date":"2023-10-13","arxiv_id":"2310.09147","repositories_listed":0,"syntology":null},{"url":null,"slug":"2sfgl-a-simple-and-robust-protocol-for-graph","title":"2SFGL: A Simple And Robust Protocol For Graph-Based Fraud Detection","date":"2023-10-12","arxiv_id":"2310.08335","repositories_listed":0,"syntology":null},{"url":null,"slug":"advective-diffusion-transformers-for","title":"Supercharging Graph Transformers with Advective Diffusion","date":"2023-10-10","arxiv_id":"2310.06417","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-edge-aware-graph-autoencoder-trained-on","title":"An Edge-Aware Graph Autoencoder Trained on Scale-Imbalanced Data for Traveling Salesman Problems","date":"2023-10-10","arxiv_id":"2310.06543","repositories_listed":0,"syntology":null},{"url":null,"slug":"integrating-graphs-with-large-language-models","title":"Integrating Graphs with Large Language Models: Methods and Prospects","date":"2023-10-09","arxiv_id":"2310.05499","repositories_listed":0,"syntology":null},{"url":null,"slug":"data-centric-graph-learning-a-survey","title":"Data-centric Graph Learning: A Survey","date":"2023-10-08","arxiv_id":"2310.04987","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-learning-in-robotics-a-survey","title":"Graph learning in robotics: a survey","date":"2023-10-06","arxiv_id":"2310.04294","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":"tdcgl-two-level-debiased-contrastive-graph","title":"TDCGL: Two-Level Debiased Contrastive Graph Learning for Recommendation","date":"2023-10-01","arxiv_id":"2310.00569","repositories_listed":0,"syntology":null},{"url":null,"slug":"durendal-graph-deep-learning-framework-for","title":"DURENDAL: Graph deep learning framework for temporal heterogeneous networks","date":"2023-09-30","arxiv_id":"2310.00336","repositories_listed":0,"syntology":null},{"url":null,"slug":"resolvnet-a-graph-convolutional-network-with","title":"ResolvNet: A Graph Convolutional Network with multi-scale Consistency","date":"2023-09-30","arxiv_id":"2310.00431","repositories_listed":0,"syntology":null},{"url":null,"slug":"neuromorphic-imaging-and-classification-with","title":"Neuromorphic Imaging and Classification with Graph Learning","date":"2023-09-27","arxiv_id":"2309.15627","repositories_listed":0,"syntology":null},{"url":null,"slug":"sgrec3d-self-supervised-3d-scene-graph","title":"SGRec3D: Self-Supervised 3D Scene Graph Learning via Object-Level Scene Reconstruction","date":"2023-09-27","arxiv_id":"2309.15702","repositories_listed":0,"syntology":null},{"url":null,"slug":"alex-towards-effective-graph-transfer","title":"ALEX: Towards Effective Graph Transfer Learning with Noisy Labels","date":"2023-09-26","arxiv_id":"2309.14673","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":"is-solving-graph-neural-tangent-kernel","title":"Is Solving Graph Neural Tangent Kernel Equivalent to Training Graph Neural Network?","date":"2023-09-14","arxiv_id":"2309.07452","repositories_listed":0,"syntology":null},{"url":null,"slug":"tibgl-template-induced-brain-graph-learning","title":"TiBGL: Template-induced Brain Graph Learning for Functional Neuroimaging Analysis","date":"2023-09-14","arxiv_id":"2309.07947","repositories_listed":0,"syntology":null},{"url":null,"slug":"unleashing-the-power-of-graph-learning","title":"A Versatile Graph Learning Approach through LLM-based Agent","date":"2023-09-08","arxiv_id":"2309.04565","repositories_listed":0,"syntology":null},{"url":null,"slug":"expert-uncertainty-and-severity-aware-chest-x","title":"Expert Uncertainty and Severity Aware Chest X-Ray Classification by Multi-Relationship Graph Learning","date":"2023-09-06","arxiv_id":"2309.03331","repositories_listed":0,"syntology":null},{"url":null,"slug":"human-learning-of-hierarchical-graphs","title":"Human Learning of Hierarchical Graphs","date":"2023-09-06","arxiv_id":"2309.02665","repositories_listed":0,"syntology":null},{"url":null,"slug":"leveraging-semi-supervised-graph-learning-for","title":"Leveraging Semi-Supervised Graph Learning for Enhanced Diabetic Retinopathy Detection","date":"2023-09-02","arxiv_id":"2309.00824","repositories_listed":0,"syntology":null},{"url":null,"slug":"visual-kinematics-graph-learning-for","title":"Visual-Kinematics Graph Learning for Procedure-agnostic Instrument Tip Segmentation in Robotic Surgeries","date":"2023-09-02","arxiv_id":"2309.00957","repositories_listed":0,"syntology":null},{"url":null,"slug":"msgnn-multi-scale-spatio-temporal-graph","title":"MSGNN: Multi-scale Spatio-temporal Graph Neural Network for Epidemic Forecasting","date":"2023-08-30","arxiv_id":"2308.15840","repositories_listed":0,"syntology":null}],"record_sha256":"9c79b56bb1d842e5e85f7b81dd6782c2d1a134b37fd551b8102e3393c18d5a8e","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}