{"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":"/method/graph-neural-network/papers/10","list_of":"/method/graph-neural-network","method":"Graph Neural Network","archive":{"snapshot":"2025-07-28"},"syntology_read_at":"2026-09-28T10:30:06+00:00","order":"archive","order_definition":"date (newest first), then slug","page":10,"pages_in_order":27,"rows_per_page":100,"rows":[901,1000],"of":2694,"counts":{"archive_papers_tagged":2694,"with_a_code_link":1137,"where_syntology_ran_a_sample":271,"not_listed_spam_title":0,"listed":2694,"listed_where_code_ran":271,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":235,"every_run_a_failure_of_syntologys_instrument":36,"listed_with_a_run_with_no_instrument_failure":235,"listed_every_run_a_failure_of_syntologys_instrument":36,"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":"/method/graph-neural-network","prev":"/method/graph-neural-network/papers/9","next":"/method/graph-neural-network/papers/11","papers":[{"paper":null,"slug":"from-coupled-oscillators-to-graph-neural","title":"From Coupled Oscillators to Graph Neural Networks: Reducing Over-smoothing via a Kuramoto Model-based Approach","date":"2023-11-06","arxiv_id":"2311.03260","n_code_links":0,"syntology":null},{"paper":null,"slug":"a-systematic-review-of-deep-graph-neural","title":"A Systematic Review of Deep Graph Neural Networks: Challenges, Classification, Architectures, Applications & Potential Utility in Bioinformatics","date":"2023-11-03","arxiv_id":"2311.02127","n_code_links":0,"syntology":null},{"paper":null,"slug":"pairing-based-graph-neural-network-for","title":"Pairing-based graph neural network for simulating quantum materials","date":"2023-11-03","arxiv_id":"2311.02143","n_code_links":0,"syntology":null},{"paper":null,"slug":"attacking-graph-neural-networks-with-bit","title":"Attacking Graph Neural Networks with Bit Flips: Weisfeiler and Lehman Go Indifferent","date":"2023-11-02","arxiv_id":"2311.01205","n_code_links":0,"syntology":null},{"paper":null,"slug":"graph-neural-networks-for-topological-feature","title":"Graph Neural Networks for Topological Feature Extraction in ECG Classification","date":"2023-11-02","arxiv_id":"2311.04228","n_code_links":0,"syntology":null},{"paper":null,"slug":"entity-alignment-method-of-science-and","title":"Entity Alignment Method of Science and Technology Patent based on Graph Convolution Network and Information Fusion","date":"2023-11-01","arxiv_id":"2311.00300","n_code_links":0,"syntology":null},{"paper":null,"slug":"kronecker-factored-approximate-curvature-for","title":"Kronecker-Factored Approximate Curvature for Modern Neural Network Architectures","date":"2023-11-01","arxiv_id":"2311.00636","n_code_links":0,"syntology":null},{"paper":"/paper/robust-graph-clustering-via-meta-weighting","slug":"robust-graph-clustering-via-meta-weighting","title":"Robust Graph Clustering via Meta Weighting for Noisy Graphs","date":"2023-11-01","arxiv_id":"2311.00322","n_code_links":1,"syntology":{"ran":9,"of":10,"n_ran_checked":9,"n_instrument":0,"unverified":1,"pointer_only":1,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 1 honoured, 0 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","official":{"repos":["hyeonsoojo/metagc"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"semantic-representation-learning-of","title":"Semantic Representation Learning of Scientific Literature based on Adaptive Feature and Graph Neural Network","date":"2023-11-01","arxiv_id":"2311.00296","n_code_links":0,"syntology":null},{"paper":null,"slug":"autoregressive-renaissance-in-neural-pde","title":"Autoregressive Renaissance in Neural PDE Solvers","date":"2023-10-30","arxiv_id":"2310.19763","n_code_links":0,"syntology":null},{"paper":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","n_code_links":0,"syntology":null},{"paper":null,"slug":"topological-or-non-topological-a-deep","title":"Topological, or Non-topological? A Deep Learning Based Prediction","date":"2023-10-29","arxiv_id":"2310.18907","n_code_links":0,"syntology":null},{"paper":"/paper/maximum-independent-set-self-training-through","slug":"maximum-independent-set-self-training-through","title":"Maximum Independent Set: Self-Training through Dynamic Programming","date":"2023-10-28","arxiv_id":"2310.18672","n_code_links":1,"syntology":{"ran":2,"of":2,"n_ran_checked":0,"n_instrument":2,"unverified":0,"pointer_only":0,"phrase":"2 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; 2 where Syntology's instrument failed) · 0 unverified","official":{"repos":["LIONS-EPFL/dynamic-MIS"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"disentangled-representation-learning-with-3","title":"Disentangled Representation Learning with Large Language Models for Text-Attributed Graphs","date":"2023-10-27","arxiv_id":"2310.18152","n_code_links":0,"syntology":null},{"paper":null,"slug":"one-model-fits-all-cross-region-taxi-demand","title":"One Model Fits All: Cross-Region Taxi-Demand Forecasting","date":"2023-10-27","arxiv_id":"2310.18215","n_code_links":0,"syntology":null},{"paper":null,"slug":"a-hybrid-graph-network-for-complex-activity","title":"A Hybrid Graph Network for Complex Activity Detection in Video","date":"2023-10-26","arxiv_id":"2310.17493","n_code_links":0,"syntology":null},{"paper":"/paper/using-causality-aware-graph-neural-networks","slug":"using-causality-aware-graph-neural-networks","title":"Using Time-Aware Graph Neural Networks to Predict Temporal Centralities in Dynamic Graphs","date":"2023-10-24","arxiv_id":"2310.15865","n_code_links":1,"syntology":{"ran":4,"of":4,"n_ran_checked":4,"n_instrument":0,"unverified":0,"pointer_only":4,"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) · 0 unverified","official":{"repos":["pathpy/pathpyg"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"a-hybrid-gnn-approach-for-predicting-node","title":"A Hybrid GNN approach for predicting node data for 3D meshes","date":"2023-10-23","arxiv_id":"2310.14707","n_code_links":0,"syntology":null},{"paper":"/paper/efficient-heterogeneous-graph-learning-via","slug":"efficient-heterogeneous-graph-learning-via","title":"Efficient Heterogeneous Graph Learning via Random Projection","date":"2023-10-23","arxiv_id":"2310.14481","n_code_links":1,"syntology":{"ran":5,"of":8,"n_ran_checked":5,"n_instrument":0,"unverified":3,"pointer_only":8,"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) · 3 unverified","official":{"repos":["CrawlScript/RpHGNN"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":3,"ran_from_kinds":["official"]}}},{"paper":"/paper/grenade-graph-centric-language-model-for-self","slug":"grenade-graph-centric-language-model-for-self","title":"GRENADE: Graph-Centric Language Model for Self-Supervised Representation Learning on Text-Attributed Graphs","date":"2023-10-23","arxiv_id":"2310.15109","n_code_links":1,"syntology":null},{"paper":null,"slug":"neural-snowflakes-universal-latent-graph","title":"Neural Snowflakes: Universal Latent Graph Inference via Trainable Latent Geometries","date":"2023-10-23","arxiv_id":"2310.15003","n_code_links":0,"syntology":null},{"paper":"/paper/ensemble-learning-for-graph-neural-networks","slug":"ensemble-learning-for-graph-neural-networks","title":"Ensemble Learning for Graph Neural Networks","date":"2023-10-22","arxiv_id":"2310.14166","n_code_links":2,"syntology":null},{"paper":"/paper/genetic-algorithms-with-neural-cost-predictor","slug":"genetic-algorithms-with-neural-cost-predictor","title":"Genetic Algorithms with Neural Cost Predictor for Solving Hierarchical Vehicle Routing Problems","date":"2023-10-22","arxiv_id":"2310.14157","n_code_links":1,"syntology":null},{"paper":"/paper/flee-gnn-a-federated-learning-system-for-edge","slug":"flee-gnn-a-federated-learning-system-for-edge","title":"FLEE-GNN: A Federated Learning System for Edge-Enhanced Graph Neural Network in Analyzing Geospatial Resilience of Multicommodity Food Flows","date":"2023-10-20","arxiv_id":"2310.13248","n_code_links":1,"syntology":null},{"paper":"/paper/towards-enhancing-relational-rules-for","slug":"towards-enhancing-relational-rules-for","title":"Towards Enhancing Relational Rules for Knowledge Graph Link Prediction","date":"2023-10-20","arxiv_id":"2310.13411","n_code_links":1,"syntology":null},{"paper":null,"slug":"agri-gnn-a-novel-genotypic-topological-graph","title":"Agri-GNN: A Novel Genotypic-Topological Graph Neural Network Framework Built on GraphSAGE for Optimized Yield Prediction","date":"2023-10-19","arxiv_id":"2310.13037","n_code_links":0,"syntology":null},{"paper":"/paper/depwignn-a-depth-wise-graph-neural-network","slug":"depwignn-a-depth-wise-graph-neural-network","title":"DepWiGNN: A Depth-wise Graph Neural Network for Multi-hop Spatial Reasoning in Text","date":"2023-10-19","arxiv_id":"2310.12557","n_code_links":1,"syntology":null},{"paper":null,"slug":"heterogeneous-graph-neural-networks-for-data","title":"End-to-End Heterogeneous Graph Neural Networks for Traffic Assignment","date":"2023-10-19","arxiv_id":"2310.13193","n_code_links":0,"syntology":null},{"paper":"/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","n_code_links":0,"syntology":{"ran":5,"of":6,"n_ran_checked":5,"n_instrument":0,"unverified":1,"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","official":null}},{"paper":"/paper/weavenet-for-approximating-two-sided-matching","slug":"weavenet-for-approximating-two-sided-matching","title":"WeaveNet for Approximating Two-sided Matching Problems","date":"2023-10-19","arxiv_id":"2310.12515","n_code_links":1,"syntology":null},{"paper":null,"slug":"building-a-graph-based-deep-learning-network","title":"Building a Graph-based Deep Learning network model from captured traffic traces","date":"2023-10-18","arxiv_id":"2310.11889","n_code_links":0,"syntology":null},{"paper":"/paper/equipping-federated-graph-neural-networks","slug":"equipping-federated-graph-neural-networks","title":"Equipping Federated Graph Neural Networks with Structure-aware Group Fairness","date":"2023-10-18","arxiv_id":"2310.12350","n_code_links":1,"syntology":null},{"paper":null,"slug":"federated-heterogeneous-graph-neural-network","title":"Federated Heterogeneous Graph Neural Network for Privacy-preserving Recommendation","date":"2023-10-18","arxiv_id":"2310.11730","n_code_links":0,"syntology":null},{"paper":"/paper/learning-co-speech-gesture-for-multimodal","slug":"learning-co-speech-gesture-for-multimodal","title":"Learning Co-Speech Gesture for Multimodal Aphasia Type Detection","date":"2023-10-18","arxiv_id":"2310.11710","n_code_links":1,"syntology":null},{"paper":"/paper/neurocut-a-neural-approach-for-robust-graph","slug":"neurocut-a-neural-approach-for-robust-graph","title":"NeuroCUT: A Neural Approach for Robust Graph Partitioning","date":"2023-10-18","arxiv_id":"2310.11787","n_code_links":1,"syntology":null},{"paper":null,"slug":"analyzing-modularity-maximization-in","title":"Analyzing Modularity Maximization in Approximation, Heuristic, and Graph Neural Network Algorithms for Community Detection","date":"2023-10-17","arxiv_id":"2310.10898","n_code_links":0,"syntology":null},{"paper":"/paper/vct-visual-change-transformer-for-remote","slug":"vct-visual-change-transformer-for-remote","title":"VcT: Visual change Transformer for Remote Sensing Image Change Detection","date":"2023-10-17","arxiv_id":"2310.11417","n_code_links":1,"syntology":null},{"paper":"/paper/graph-scp-accelerating-set-cover-problems","slug":"graph-scp-accelerating-set-cover-problems","title":"Graph-SCP: Accelerating Set Cover Problems with Graph Neural Networks","date":"2023-10-12","arxiv_id":"2310.07979","n_code_links":1,"syntology":null},{"paper":"/paper/infinite-width-graph-neural-networks-for-node","slug":"infinite-width-graph-neural-networks-for-node","title":"Infinite Width Graph Neural Networks for Node Regression/ Classification","date":"2023-10-12","arxiv_id":"2310.08176","n_code_links":1,"syntology":null},{"paper":null,"slug":"global-minima-recoverability-thresholds-and","title":"Global Minima, Recoverability Thresholds, and Higher-Order Structure in GNNS","date":"2023-10-11","arxiv_id":"2310.07667","n_code_links":0,"syntology":null},{"paper":"/paper/gmocat-a-graph-enhanced-multi-objective","slug":"gmocat-a-graph-enhanced-multi-objective","title":"GMOCAT: A Graph-Enhanced Multi-Objective Method for Computerized Adaptive Testing","date":"2023-10-11","arxiv_id":"2310.07477","n_code_links":1,"syntology":{"ran":4,"of":4,"n_ran_checked":1,"n_instrument":3,"unverified":0,"pointer_only":4,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","official":{"repos":["justarter/gmocat"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official","unlocated"]}}},{"paper":"/paper/non-backtracking-graph-neural-networks","slug":"non-backtracking-graph-neural-networks","title":"Non-backtracking Graph Neural Networks","date":"2023-10-11","arxiv_id":"2310.07430","n_code_links":1,"syntology":{"ran":3,"of":5,"n_ran_checked":3,"n_instrument":0,"unverified":2,"pointer_only":5,"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) · 2 unverified","official":{"repos":["seonghyun26/nba-gnn"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":2,"ran_from_kinds":["official"]}}},{"paper":"/paper/neural-relational-inference-with-fast-modular-1","slug":"neural-relational-inference-with-fast-modular-1","title":"Neural Relational Inference with Fast Modular Meta-learning","date":"2023-10-10","arxiv_id":"2310.07015","n_code_links":1,"syntology":{"ran":3,"of":5,"n_ran_checked":3,"n_instrument":0,"unverified":2,"pointer_only":0,"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) · 2 unverified","official":{"repos":["FerranAlet/modular-metalearning"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":2,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"hybrid-recommendation-system-using-graph","title":"Hybrid Recommendation System using Graph Neural Network and BERT Embeddings","date":"2023-10-07","arxiv_id":"2310.04878","n_code_links":0,"syntology":null},{"paper":null,"slug":"autoparllm-gnn-guided-automatic-code","title":"AUTOPARLLM: GNN-Guided Automatic Code Parallelization using Large Language Models","date":"2023-10-06","arxiv_id":"2310.04047","n_code_links":0,"syntology":null},{"paper":null,"slug":"learning-adjacency-matrix-for-dynamic-graph","title":"Mending of Spatio-Temporal Dependencies in Block Adjacency Matrix","date":"2023-10-04","arxiv_id":"2310.02606","n_code_links":0,"syntology":null},{"paper":"/paper/rayleigh-quotient-graph-neural-networks-for","slug":"rayleigh-quotient-graph-neural-networks-for","title":"Rayleigh Quotient Graph Neural Networks for Graph-level Anomaly Detection","date":"2023-10-04","arxiv_id":"2310.02861","n_code_links":1,"syntology":{"ran":1,"of":6,"n_ran_checked":1,"n_instrument":0,"unverified":5,"pointer_only":6,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 5 unverified","official":{"repos":["xydong127/rqgnn"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":5,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"stand-for-something-or-fall-for-everything","title":"Stand for Something or Fall for Everything: Predict Misinformation Spread with Stance-Aware Graph Neural Networks","date":"2023-10-04","arxiv_id":"2310.02568","n_code_links":0,"syntology":null},{"paper":"/paper/score-dynamics-scaling-molecular-dynamics","slug":"score-dynamics-scaling-molecular-dynamics","title":"Score dynamics: scaling molecular dynamics with picoseconds timestep via conditional diffusion model","date":"2023-10-02","arxiv_id":"2310.01678","n_code_links":1,"syntology":{"ran":8,"of":15,"n_ran_checked":8,"n_instrument":0,"unverified":7,"pointer_only":15,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 7 unverified","official":{"repos":["llnl/graphite"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":7,"ran_from_kinds":["official"]}}},{"paper":"/paper/the-map-equation-goes-neural","slug":"the-map-equation-goes-neural","title":"The Map Equation Goes Neural: Mapping Network Flows with Graph Neural Networks","date":"2023-10-02","arxiv_id":"2310.01144","n_code_links":1,"syntology":null},{"paper":"/paper/are-graph-neural-networks-optimal","slug":"are-graph-neural-networks-optimal","title":"Are Graph Neural Networks Optimal Approximation Algorithms?","date":"2023-10-01","arxiv_id":"2310.00526","n_code_links":1,"syntology":{"ran":6,"of":13,"n_ran_checked":6,"n_instrument":0,"unverified":7,"pointer_only":13,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 7 unverified","official":{"repos":["penlu/bespoke-gnn4do"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":7,"ran_from_kinds":["official"]}}},{"paper":"/paper/gnrk-graph-neural-runge-kutta-method-for","slug":"gnrk-graph-neural-runge-kutta-method-for","title":"GNRK: Graph Neural Runge-Kutta method for solving partial differential equations","date":"2023-10-01","arxiv_id":"2310.00618","n_code_links":1,"syntology":null},{"paper":"/paper/hierarchical-adaptation-with-hypernetworks","slug":"hierarchical-adaptation-with-hypernetworks","title":"PACIA: Parameter-Efficient Adapter for Few-Shot Molecular Property Prediction","date":"2023-10-01","arxiv_id":"2310.00614","n_code_links":1,"syntology":null},{"paper":null,"slug":"physics-informed-graph-neural-network-for-1","title":"Physics-Informed Graph Neural Network for Dynamic Reconfiguration of Power Systems","date":"2023-10-01","arxiv_id":"2310.00728","n_code_links":0,"syntology":null},{"paper":null,"slug":"sequential-monte-carlo-graph-convolutional","title":"Sequential Monte Carlo Graph Convolutional Network for Dynamic Brain Connectivity","date":"2023-10-01","arxiv_id":"2310.00630","n_code_links":0,"syntology":null},{"paper":null,"slug":"better-situational-graphs-by-inferring-high","title":"Learning High-level Semantic-Relational Concepts for SLAM","date":"2023-09-30","arxiv_id":"2310.00401","n_code_links":0,"syntology":null},{"paper":"/paper/learning-state-augmented-policies-for","slug":"learning-state-augmented-policies-for","title":"Learning State-Augmented Policies for Information Routing in Communication Networks","date":"2023-09-30","arxiv_id":"2310.00248","n_code_links":1,"syntology":null},{"paper":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","n_code_links":0,"syntology":null},{"paper":"/paper/admet-property-prediction-through","slug":"admet-property-prediction-through","title":"ADMET property prediction through combinations of molecular fingerprints","date":"2023-09-29","arxiv_id":"2310.00174","n_code_links":1,"syntology":null},{"paper":"/paper/asynchronous-graph-generators","slug":"asynchronous-graph-generators","title":"Asynchronous Graph Generator","date":"2023-09-29","arxiv_id":"2309.17335","n_code_links":1,"syntology":null},{"paper":null,"slug":"dream-decentralized-reinforcement-learning","title":"DREAM: Decentralized Reinforcement Learning for Exploration and Efficient Energy Management in Multi-Robot Systems","date":"2023-09-29","arxiv_id":"2309.17433","n_code_links":0,"syntology":null},{"paper":"/paper/muse-gnn-learning-unified-gene-representation","slug":"muse-gnn-learning-unified-gene-representation","title":"MuSe-GNN: Learning Unified Gene Representation From Multimodal Biological Graph Data","date":"2023-09-29","arxiv_id":"2310.02275","n_code_links":1,"syntology":{"ran":1,"of":2,"n_ran_checked":1,"n_instrument":0,"unverified":1,"pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","official":{"repos":["helloworldlty/muse-gnn"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":"/paper/on-the-equivalence-of-graph-convolution-and","slug":"on-the-equivalence-of-graph-convolution-and","title":"On the Equivalence of Graph Convolution and Mixup","date":"2023-09-29","arxiv_id":"2310.00183","n_code_links":1,"syntology":null},{"paper":null,"slug":"reinforcement-learning-for-node-selection-in","title":"Reinforcement Learning for Node Selection in Branch-and-Bound","date":"2023-09-29","arxiv_id":"2310.00112","n_code_links":0,"syntology":null},{"paper":null,"slug":"distill-to-delete-unlearning-in-graph","title":"Distill to Delete: Unlearning in Graph Networks with Knowledge Distillation","date":"2023-09-28","arxiv_id":"2309.16173","n_code_links":0,"syntology":null},{"paper":"/paper/mhg-gnn-combination-of-molecular-hypergraph","slug":"mhg-gnn-combination-of-molecular-hypergraph","title":"MHG-GNN: Combination of Molecular Hypergraph Grammar with Graph Neural Network","date":"2023-09-28","arxiv_id":"2309.16374","n_code_links":1,"syntology":null},{"paper":"/paper/graph-neural-prompting-with-large-language","slug":"graph-neural-prompting-with-large-language","title":"Graph Neural Prompting with Large Language Models","date":"2023-09-27","arxiv_id":"2309.15427","n_code_links":1,"syntology":null},{"paper":null,"slug":"xgv-bert-leveraging-contextualized-language","title":"XGV-BERT: Leveraging Contextualized Language Model and Graph Neural Network for Efficient Software Vulnerability Detection","date":"2023-09-26","arxiv_id":"2309.14677","n_code_links":0,"syntology":null},{"paper":null,"slug":"a-model-agnostic-graph-neural-network-for","title":"A Model-Agnostic Graph Neural Network for Integrating Local and Global Information","date":"2023-09-23","arxiv_id":"2309.13459","n_code_links":0,"syntology":null},{"paper":null,"slug":"graph-neural-network-for-stress-predictions","title":"Graph Neural Network for Stress Predictions in Stiffened Panels Under Uniform Loading","date":"2023-09-22","arxiv_id":"2309.13022","n_code_links":0,"syntology":null},{"paper":null,"slug":"protoem-a-prototype-enhanced-matching","title":"ProtoEM: A Prototype-Enhanced Matching Framework for Event Relation Extraction","date":"2023-09-22","arxiv_id":"2309.12892","n_code_links":0,"syntology":null},{"paper":"/paper/amag-additive-multiplicative-and-adaptive","slug":"amag-additive-multiplicative-and-adaptive","title":"AMAG: Additive, Multiplicative and Adaptive Graph Neural Network For Forecasting Neuron Activity","date":"2023-09-21","arxiv_id":null,"n_code_links":1,"syntology":null},{"paper":"/paper/efficiently-incorporating-quintuple","slug":"efficiently-incorporating-quintuple","title":"Efficiently incorporating quintuple interactions into geometric deep learning force fields","date":"2023-09-21","arxiv_id":null,"n_code_links":1,"syntology":null},{"paper":"/paper/ld2-scalable-heterophilous-graph-neural","slug":"ld2-scalable-heterophilous-graph-neural","title":"LD2: Scalable Heterophilous Graph Neural Network with Decoupled Embeddings","date":"2023-09-21","arxiv_id":null,"n_code_links":1,"syntology":null},{"paper":null,"slug":"predicting-global-label-relationship-matrix","title":"Predicting Global Label Relationship Matrix for Graph Neural Networks under Heterophily","date":"2023-09-21","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"three-iterations-of-d-1-wl-test-distinguish","title":"Three Iterations of (d − 1)-WL Test Distinguish Non Isometric Clouds of d-dimensional Points","date":"2023-09-21","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"train-once-and-explain-everywhere-pre","title":"Train Once and Explain Everywhere: Pre-training Interpretable Graph Neural Networks","date":"2023-09-21","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":"/paper/improving-article-classification-with-edge","slug":"improving-article-classification-with-edge","title":"Article Classification with Graph Neural Networks and Multigraphs","date":"2023-09-20","arxiv_id":"2309.11341","n_code_links":1,"syntology":null},{"paper":"/paper/inkstream-real-time-gnn-inference-on","slug":"inkstream-real-time-gnn-inference-on","title":"InkStream: Real-time GNN Inference on Streaming Graphs via Incremental Update","date":"2023-09-20","arxiv_id":"2309.11071","n_code_links":1,"syntology":null},{"paper":null,"slug":"large-scale-pretraining-improves-sample","title":"Large-scale Pretraining Improves Sample Efficiency of Active Learning based Molecule Virtual Screening","date":"2023-09-20","arxiv_id":"2309.11687","n_code_links":0,"syntology":null},{"paper":null,"slug":"localize-retrieve-and-fuse-a-generalized","title":"Localize, Retrieve and Fuse: A Generalized Framework for Free-Form Question Answering over Tables","date":"2023-09-20","arxiv_id":"2309.11049","n_code_links":0,"syntology":null},{"paper":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","n_code_links":0,"syntology":null},{"paper":"/paper/multi-stain-self-attention-graph-multiple","slug":"multi-stain-self-attention-graph-multiple","title":"MUSTANG: Multi-Stain Self-Attention Graph Multiple Instance Learning Pipeline for Histopathology Whole Slide Images","date":"2023-09-19","arxiv_id":"2309.10650","n_code_links":1,"syntology":null},{"paper":null,"slug":"a-heterogeneous-graph-based-multi-task","title":"A Heterogeneous Graph-Based Multi-Task Learning for Fault Event Diagnosis in Smart Grid","date":"2023-09-18","arxiv_id":"2309.09921","n_code_links":0,"syntology":null},{"paper":null,"slug":"efficient-low-rank-gnn-defense-against","title":"Efficient Low-Rank GNN Defense Against Structural Attacks","date":"2023-09-18","arxiv_id":"2309.10136","n_code_links":0,"syntology":null},{"paper":null,"slug":"towards-differential-privacy-in-sequential","title":"Towards Differential Privacy in Sequential Recommendation: A Noisy Graph Neural Network Approach","date":"2023-09-17","arxiv_id":"2309.11515","n_code_links":0,"syntology":null},{"paper":null,"slug":"vulnsense-efficient-vulnerability-detection","title":"VulnSense: Efficient Vulnerability Detection in Ethereum Smart Contracts by Multimodal Learning with Graph Neural Network and Language Model","date":"2023-09-15","arxiv_id":"2309.08474","n_code_links":0,"syntology":null},{"paper":null,"slug":"xfedhunter-an-explainable-federated-learning","title":"XFedHunter: An Explainable Federated Learning Framework for Advanced Persistent Threat Detection in SDN","date":"2023-09-15","arxiv_id":"2309.08485","n_code_links":0,"syntology":null},{"paper":"/paper/higt-hierarchical-interaction-graph","slug":"higt-hierarchical-interaction-graph","title":"HIGT: Hierarchical Interaction Graph-Transformer for Whole Slide Image Analysis","date":"2023-09-14","arxiv_id":"2309.07400","n_code_links":1,"syntology":{"ran":4,"of":6,"n_ran_checked":4,"n_instrument":0,"unverified":2,"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","official":{"repos":["hku-medai/higt"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":2,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"naturalistic-robot-arm-trajectory-generation","title":"Naturalistic Robot Arm Trajectory Generation via Representation Learning","date":"2023-09-14","arxiv_id":"2309.07550","n_code_links":0,"syntology":null},{"paper":null,"slug":"scalable-neural-network-models-and-terascale","title":"Improved particle-flow event reconstruction with scalable neural networks for current and future particle detectors","date":"2023-09-13","arxiv_id":"2309.06782","n_code_links":0,"syntology":null},{"paper":"/paper/2309-05953","slug":"2309-05953","title":"GLAD: Content-aware Dynamic Graphs For Log Anomaly Detection","date":"2023-09-12","arxiv_id":"2309.05953","n_code_links":1,"syntology":null},{"paper":null,"slug":"explainable-graph-neural-network-for","title":"Self-explainable Graph Neural Network for Alzheimer's Disease And Related Dementias Risk Prediction","date":"2023-09-12","arxiv_id":"2309.06584","n_code_links":0,"syntology":null},{"paper":"/paper/pcn-a-deep-learning-approach-to-jet-tagging","slug":"pcn-a-deep-learning-approach-to-jet-tagging","title":"PCN: A Deep Learning Approach to Jet Tagging Utilizing Novel Graph Construction Methods and Chebyshev Graph Convolutions","date":"2023-09-12","arxiv_id":"2309.08630","n_code_links":1,"syntology":null},{"paper":null,"slug":"saf-smart-aggregation-framework-for-revealing","title":"SAF: Smart Aggregation Framework for Revealing Atoms Importance Rank and Improving Prediction Rates in Drug Discovery","date":"2023-09-12","arxiv_id":"2310.03028","n_code_links":0,"syntology":null},{"paper":null,"slug":"a-parameterised-model-for-link-prediction","title":"A parameterised model for link prediction using node centrality and similarity measure based on graph embedding","date":"2023-09-11","arxiv_id":"2309.05434","n_code_links":0,"syntology":null},{"paper":null,"slug":"advancing-federated-learning-in-6g-a-trusted","title":"Advancing Federated Learning in 6G: A Trusted Architecture with Graph-based Analysis","date":"2023-09-11","arxiv_id":"2309.05525","n_code_links":0,"syntology":null},{"paper":null,"slug":"efficient-network-representation-for-gnn","title":"Efficient Network Representation for GNN-based Intrusion Detection","date":"2023-09-11","arxiv_id":"2310.05956","n_code_links":0,"syntology":null},{"paper":"/paper/fully-connected-spatial-temporal-graph-for","slug":"fully-connected-spatial-temporal-graph-for","title":"Fully-Connected Spatial-Temporal Graph for Multivariate Time-Series Data","date":"2023-09-11","arxiv_id":"2309.05305","n_code_links":1,"syntology":null},{"paper":"/paper/learning-the-geodesic-embedding-with-graph","slug":"learning-the-geodesic-embedding-with-graph","title":"Learning the Geodesic Embedding with Graph Neural Networks","date":"2023-09-11","arxiv_id":"2309.05613","n_code_links":1,"syntology":{"ran":1,"of":1,"n_ran_checked":0,"n_instrument":1,"unverified":0,"pointer_only":1,"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","official":{"repos":["intelligentgeometry/gegnn"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}}],"record_sha256":"f695f12bd8e6462d87d1ebf64e7f3fc987dd616ee561e24aa10e994697058be4","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}