{"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-neural-network/papers/6","list_of":"/task/graph-neural-network","task":"Graph Neural Network","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":6,"pages_in_order":36,"rows_per_page":100,"rows":[501,600],"of":3598,"counts":{"archive_papers_tagged":3598,"with_a_code_link":1516,"where_syntology_ran_a_sample":350,"not_listed_spam_title":0,"listed":3598,"listed_where_code_ran":350,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":302,"every_run_a_failure_of_syntologys_instrument":48,"listed_with_a_run_with_no_instrument_failure":302,"listed_every_run_a_failure_of_syntologys_instrument":48,"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-neural-network","prev":"/task/graph-neural-network/papers/5","next":"/task/graph-neural-network/papers/7","papers":[{"url":"/paper/heterogeneous-graph-reasoning-for-fact","slug":"heterogeneous-graph-reasoning-for-fact","title":"Heterogeneous Graph Reasoning for Fact Checking over Texts and Tables","date":"2024-02-20","arxiv_id":"2402.13028","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"1 ran (of which 1 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) · 0 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/heterogeneous-graph-reasoning-for-fact#ran","syntology_url":"https://syntology.ai/paper/2402.13028","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.13028"}},"official":{"repos":["deno-v/heterfc"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/gnnavi-navigating-the-information-flow-in","slug":"gnnavi-navigating-the-information-flow-in","title":"GNNavi: Navigating the Information Flow in Large Language Models by Graph Neural Network","date":"2024-02-18","arxiv_id":"2402.11709","repositories_listed":1,"syntology":null},{"url":"/paper/chemreasoner-heuristic-search-over-a-large","slug":"chemreasoner-heuristic-search-over-a-large","title":"ChemReasoner: Heuristic Search over a Large Language Model's Knowledge Space using Quantum-Chemical Feedback","date":"2024-02-15","arxiv_id":"2402.10980","repositories_listed":1,"syntology":{"n":7,"n_ran":5,"n_constructed":0,"n_ran_checked":0,"n_instrument":5,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":7,"phrase":"5 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; 5 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/chemreasoner-heuristic-search-over-a-large#ran","syntology_url":"https://syntology.ai/paper/2402.10980","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.10980"}},"official":{"repos":["pnnl/chemreasoner"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/improving-cognitive-diagnosis-models-with","slug":"improving-cognitive-diagnosis-models-with","title":"Exploring Heterogeneity and Uncertainty for Graph-based Cognitive Diagnosis Models in Intelligent Education","date":"2024-02-15","arxiv_id":"2403.05559","repositories_listed":1,"syntology":null},{"url":"/paper/disgnet-a-distance-graph-neural-network-for","slug":"disgnet-a-distance-graph-neural-network-for","title":"DisGNet: A Distance Graph Neural Network for Forward Kinematics Learning of Gough-Stewart Platform","date":"2024-02-14","arxiv_id":"2402.09077","repositories_listed":1,"syntology":null},{"url":"/paper/parallel-friendly-spatio-temporal-graph","slug":"parallel-friendly-spatio-temporal-graph","title":"Parallel-friendly Spatio-Temporal Graph Learning for Photovoltaic Degradation Analysis at Scale","date":"2024-02-13","arxiv_id":"2402.08470","repositories_listed":1,"syntology":null},{"url":"/paper/netinfof-framework-measuring-and-exploiting","slug":"netinfof-framework-measuring-and-exploiting","title":"NetInfoF Framework: Measuring and Exploiting Network Usable Information","date":"2024-02-12","arxiv_id":"2402.07999","repositories_listed":1,"syntology":{"n":8,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"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) · 2 unverified","sample_list":"/paper/netinfof-framework-measuring-and-exploiting#ran","syntology_url":"https://syntology.ai/paper/2402.07999","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.07999"}},"official":{"repos":["amazon-science/network-usable-info-framework"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/explainable-global-wildfire-prediction-models","slug":"explainable-global-wildfire-prediction-models","title":"Explainable Global Wildfire Prediction Models using Graph Neural Networks","date":"2024-02-11","arxiv_id":"2402.07152","repositories_listed":1,"syntology":null},{"url":"/paper/core-gd-a-hierarchical-framework-for-scalable","slug":"core-gd-a-hierarchical-framework-for-scalable","title":"CoRe-GD: A Hierarchical Framework for Scalable Graph Visualization with GNNs","date":"2024-02-09","arxiv_id":"2402.06706","repositories_listed":1,"syntology":{"n":10,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/core-gd-a-hierarchical-framework-for-scalable#ran","syntology_url":"https://syntology.ai/paper/2402.06706","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.06706"}},"official":{"repos":["floriangroetschla/core-gd"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/deceptive-path-planning-via-reinforcement","slug":"deceptive-path-planning-via-reinforcement","title":"Deceptive Path Planning via Reinforcement Learning with Graph Neural Networks","date":"2024-02-09","arxiv_id":"2402.06552","repositories_listed":1,"syntology":null},{"url":"/paper/moco-a-learnable-meta-optimizer-for","slug":"moco-a-learnable-meta-optimizer-for","title":"Moco: A Learnable Meta Optimizer for Combinatorial Optimization","date":"2024-02-07","arxiv_id":"2402.04915","repositories_listed":1,"syntology":{"n":10,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":0,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/moco-a-learnable-meta-optimizer-for#ran","syntology_url":"https://syntology.ai/paper/2402.04915","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.04915"}},"official":{"repos":["timd3/moco"],"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"]}}},{"url":"/paper/pac-bayesian-adversarially-robust","slug":"pac-bayesian-adversarially-robust","title":"PAC-Bayesian Adversarially Robust Generalization Bounds for Graph Neural Network","date":"2024-02-06","arxiv_id":"2402.04038","repositories_listed":1,"syntology":null},{"url":"/paper/a-comparative-analysis-of-gene-expression","slug":"a-comparative-analysis-of-gene-expression","title":"A Comparative Analysis of Gene Expression Profiling by Statistical and Machine Learning Approaches","date":"2024-02-01","arxiv_id":"2402.00926","repositories_listed":1,"syntology":null},{"url":"/paper/efficient-tuning-and-inference-for-large","slug":"efficient-tuning-and-inference-for-large","title":"Efficient Tuning and Inference for Large Language Models on Textual Graphs","date":"2024-01-28","arxiv_id":"2401.15569","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":4,"phrase":"3 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; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/efficient-tuning-and-inference-for-large#ran","syntology_url":"https://syntology.ai/paper/2401.15569","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2401.15569"}},"official":{"repos":["ZhuYun97/ENGINE"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/truck-parking-usage-prediction-with","slug":"truck-parking-usage-prediction-with","title":"Truck Parking Usage Prediction with Decomposed Graph Neural Networks","date":"2024-01-23","arxiv_id":"2401.12920","repositories_listed":1,"syntology":null},{"url":"/paper/full-body-motion-reconstruction-with-sparse","slug":"full-body-motion-reconstruction-with-sparse","title":"Full-Body Motion Reconstruction with Sparse Sensing from Graph Perspective","date":"2024-01-22","arxiv_id":"2401.11783","repositories_listed":1,"syntology":null},{"url":"/paper/learning-dynamics-from-multicellular-graphs","slug":"learning-dynamics-from-multicellular-graphs","title":"Learning Dynamics from Multicellular Graphs with Deep Neural Networks","date":"2024-01-22","arxiv_id":"2401.12196","repositories_listed":1,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"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) · 1 unverified","sample_list":"/paper/learning-dynamics-from-multicellular-graphs#ran","syntology_url":"https://syntology.ai/paper/2401.12196","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2401.12196"}},"official":{"repos":["guolab-cellmechanics/gnn-collective-cell-dynamics"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/tensor-view-topological-graph-neural-network","slug":"tensor-view-topological-graph-neural-network","title":"Tensor-view Topological Graph Neural Network","date":"2024-01-22","arxiv_id":"2401.12007","repositories_listed":1,"syntology":null},{"url":"/paper/a-novel-deep-learning-approach-featuring","slug":"a-novel-deep-learning-approach-featuring","title":"A Novel Deep Learning Approach Featuring Graph-Based Algorithm for Cell Segmentation and Tracking","date":"2024-01-18","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/predicting-viral-rumors-and-vulnerable-users","slug":"predicting-viral-rumors-and-vulnerable-users","title":"Predicting Viral Rumors and Vulnerable Users for Infodemic Surveillance","date":"2024-01-18","arxiv_id":"2401.09724","repositories_listed":1,"syntology":null},{"url":"/paper/gnn-lofi-a-novel-graph-neural-network-through","slug":"gnn-lofi-a-novel-graph-neural-network-through","title":"GNN-LoFI: a Novel Graph Neural Network through Localized Feature-based Histogram Intersection","date":"2024-01-17","arxiv_id":"2401.09193","repositories_listed":1,"syntology":null},{"url":"/paper/on-the-power-of-graph-neural-networks-and","slug":"on-the-power-of-graph-neural-networks-and","title":"On the Power of Graph Neural Networks and Feature Augmentation Strategies to Classify Social Networks","date":"2024-01-11","arxiv_id":"2401.06048","repositories_listed":1,"syntology":null},{"url":"/paper/lpac-learnable-perception-action","slug":"lpac-learnable-perception-action","title":"LPAC: Learnable Perception-Action-Communication Loops with Applications to Coverage Control","date":"2024-01-10","arxiv_id":"2401.04855","repositories_listed":1,"syntology":null},{"url":"/paper/global-prediction-of-covid-19-variant","slug":"global-prediction-of-covid-19-variant","title":"Global Prediction of COVID-19 Variant Emergence Using Dynamics-Informed Graph Neural Networks","date":"2024-01-07","arxiv_id":"2401.03390","repositories_listed":1,"syntology":null},{"url":"/paper/multimodal-weighted-graph-representation-for","slug":"multimodal-weighted-graph-representation-for","title":"Multimodal weighted graph representation for information extraction from visually rich documents.","date":"2024-01-05","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/powerformer-a-section-adaptive-transformer","slug":"powerformer-a-section-adaptive-transformer","title":"Powerformer: A Section-adaptive Transformer for Power Flow Adjustment","date":"2024-01-05","arxiv_id":"2401.02771","repositories_listed":1,"syntology":null},{"url":"/paper/motif-aware-riemannian-graph-neural-network","slug":"motif-aware-riemannian-graph-neural-network","title":"Motif-aware Riemannian Graph Neural Network with Generative-Contrastive Learning","date":"2024-01-02","arxiv_id":"2401.01232","repositories_listed":1,"syntology":{"n":6,"n_ran":4,"n_constructed":4,"n_ran_checked":4,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 4 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; every one of the 4 samples that ran constructed an object rather than computing a result","sample_list":"/paper/motif-aware-riemannian-graph-neural-network#ran","syntology_url":"https://syntology.ai/paper/2401.01232","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2401.01232"}},"official":{"repos":["riemanngraph/motifrgc"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":4,"n_ran_no_instrument_failure":4,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/domain-separation-graph-neural-networks-for","slug":"domain-separation-graph-neural-networks-for","title":"Domain Separation Graph Neural Networks for Saliency Object Ranking","date":"2024-01-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/fc-gnn-recovering-reliable-and-accurate","slug":"fc-gnn-recovering-reliable-and-accurate","title":"FC-GNN: Recovering Reliable and Accurate Correspondences from Interferences","date":"2024-01-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/on-discprecncies-between-perturbation","slug":"on-discprecncies-between-perturbation","title":"On Discprecncies between Perturbation Evaluations of Graph Neural Network Attributions","date":"2024-01-01","arxiv_id":"2401.00633","repositories_listed":1,"syntology":null},{"url":"/paper/strong-transitivity-relations-and-graph","slug":"strong-transitivity-relations-and-graph","title":"Strong Transitivity Relations and Graph Neural Networks","date":"2024-01-01","arxiv_id":"2401.01384","repositories_listed":1,"syntology":null},{"url":"/paper/a-graph-neural-network-based-model-with-out","slug":"a-graph-neural-network-based-model-with-out","title":"A graph neural network-based model with Out-of-Distribution Robustness for enhancing Antiretroviral Therapy Outcome Prediction for HIV-1","date":"2023-12-29","arxiv_id":"2312.17506","repositories_listed":1,"syntology":null},{"url":"/paper/molsets-molecular-graph-deep-sets-learning","slug":"molsets-molecular-graph-deep-sets-learning","title":"MolSets: Molecular Graph Deep Sets Learning for Mixture Property Modeling","date":"2023-12-27","arxiv_id":"2312.16473","repositories_listed":1,"syntology":null},{"url":"/paper/olfactory-label-prediction-on-aroma-chemical","slug":"olfactory-label-prediction-on-aroma-chemical","title":"Olfactory Label Prediction on Aroma-Chemical Pairs","date":"2023-12-26","arxiv_id":"2312.16124","repositories_listed":1,"syntology":null},{"url":"/paper/combinatorial-music-generation-model-with","slug":"combinatorial-music-generation-model-with","title":"Combinatorial music generation model with song structure graph analysis","date":"2023-12-24","arxiv_id":"2312.15400","repositories_listed":1,"syntology":null},{"url":"/paper/graph-coarsening-via-convolution-matching-for","slug":"graph-coarsening-via-convolution-matching-for","title":"Graph Coarsening via Convolution Matching for Scalable Graph Neural Network Training","date":"2023-12-24","arxiv_id":"2312.15520","repositories_listed":1,"syntology":null},{"url":"/paper/towards-fine-grained-explainability-for","slug":"towards-fine-grained-explainability-for","title":"Towards Fine-Grained Explainability for Heterogeneous Graph Neural Network","date":"2023-12-23","arxiv_id":"2312.15237","repositories_listed":1,"syntology":null},{"url":"/paper/joint-learning-neuronal-skeleton-and-brain","slug":"joint-learning-neuronal-skeleton-and-brain","title":"Joint Learning Neuronal Skeleton and Brain Circuit Topology with Permutation Invariant Encoders for Neuron Classification","date":"2023-12-22","arxiv_id":"2312.14518","repositories_listed":1,"syntology":null},{"url":"/paper/fine-tuning-graph-neural-networks-by","slug":"fine-tuning-graph-neural-networks-by","title":"Fine-tuning Graph Neural Networks by Preserving Graph Generative Patterns","date":"2023-12-21","arxiv_id":"2312.13583","repositories_listed":1,"syntology":{"n":13,"n_ran":13,"n_constructed":0,"n_ran_checked":12,"n_instrument":1,"n_unverified":0,"n_honours":2,"n_violates":1,"n_no_contract":9,"n_pointer_only":13,"phrase":"13 ran (of which 0 constructed an object rather than computing a result; 12 with no instrument failure: 2 honoured, 1 violated, 9 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/fine-tuning-graph-neural-networks-by#ran","syntology_url":"https://syntology.ai/paper/2312.13583","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2312.13583"}},"official":{"repos":["zjunet/G-Tuning"],"state":"official (archive's flag): 13 ran","n_ran":13,"n_constructed":0,"n_ran_no_instrument_failure":12,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/object-attribute-matters-in-visual-question","slug":"object-attribute-matters-in-visual-question","title":"Object Attribute Matters in Visual Question Answering","date":"2023-12-20","arxiv_id":"2401.09442","repositories_listed":1,"syntology":null},{"url":"/paper/hierarchical-and-incremental-structural","slug":"hierarchical-and-incremental-structural","title":"Hierarchical and Incremental Structural Entropy Minimization for Unsupervised Social Event Detection","date":"2023-12-19","arxiv_id":"2312.11891","repositories_listed":1,"syntology":null},{"url":"/paper/learning-flexible-body-collision-dynamics","slug":"learning-flexible-body-collision-dynamics","title":"Learning Flexible Body Collision Dynamics with Hierarchical Contact Mesh Transformer","date":"2023-12-19","arxiv_id":"2312.12467","repositories_listed":1,"syntology":{"n":17,"n_ran":12,"n_constructed":0,"n_ran_checked":12,"n_instrument":0,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":12,"n_pointer_only":6,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 12 with no instrument failure: 0 honoured, 0 violated, 12 with no contract checked; 0 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/learning-flexible-body-collision-dynamics#ran","syntology_url":"https://syntology.ai/paper/2312.12467","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2312.12467"}},"official":{"repos":["yuyudeep/hcmt"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":1,"ran_from_kinds":["found_in_text","official"]}}},{"url":"/paper/survey-on-trustworthy-graph-neural-networks","slug":"survey-on-trustworthy-graph-neural-networks","title":"When Graph Neural Network Meets Causality: Opportunities, Methodologies and An Outlook","date":"2023-12-19","arxiv_id":"2312.12477","repositories_listed":1,"syntology":null},{"url":"/paper/non-euclidean-spatial-graph-neural-network","slug":"non-euclidean-spatial-graph-neural-network","title":"Non-Euclidean Spatial Graph Neural Network","date":"2023-12-17","arxiv_id":"2312.10808","repositories_listed":1,"syntology":null},{"url":"/paper/hierarchical-graph-pattern-understanding-for","slug":"hierarchical-graph-pattern-understanding-for","title":"Hierarchical Graph Pattern Understanding for Zero-Shot VOS","date":"2023-12-15","arxiv_id":"2312.09525","repositories_listed":1,"syntology":null},{"url":"/paper/combhelper-a-neural-approach-to-reduce-search","slug":"combhelper-a-neural-approach-to-reduce-search","title":"COMBHelper: A Neural Approach to Reduce Search Space for Graph Combinatorial Problems","date":"2023-12-14","arxiv_id":"2312.09086","repositories_listed":1,"syntology":null},{"url":"/paper/patch-wise-graph-contrastive-learning-for","slug":"patch-wise-graph-contrastive-learning-for","title":"Patch-wise Graph Contrastive Learning for Image Translation","date":"2023-12-13","arxiv_id":"2312.08223","repositories_listed":1,"syntology":null},{"url":"/paper/i-open-at-the-close-a-deep-reinforcement","slug":"i-open-at-the-close-a-deep-reinforcement","title":"I Open at the Close: A Deep Reinforcement Learning Evaluation of Open Streets Initiatives","date":"2023-12-12","arxiv_id":"2312.07680","repositories_listed":1,"syntology":null},{"url":"/paper/robust-graph-neural-network-based-on-graph","slug":"robust-graph-neural-network-based-on-graph","title":"Robust Graph Neural Network based on Graph Denoising","date":"2023-12-11","arxiv_id":"2312.06557","repositories_listed":1,"syntology":null},{"url":"/paper/synthesizing-traffic-datasets-using-graph","slug":"synthesizing-traffic-datasets-using-graph","title":"Synthesizing Traffic Datasets using Graph Neural Networks","date":"2023-12-08","arxiv_id":"2312.05031","repositories_listed":1,"syntology":null},{"url":"/paper/graphmetro-mitigating-complex-distribution","slug":"graphmetro-mitigating-complex-distribution","title":"GraphMETRO: Mitigating Complex Graph Distribution Shifts via Mixture of Aligned Experts","date":"2023-12-07","arxiv_id":"2312.04693","repositories_listed":1,"syntology":{"n":9,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":9,"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) · 3 unverified","sample_list":"/paper/graphmetro-mitigating-complex-distribution#ran","syntology_url":"https://syntology.ai/paper/2312.04693","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2312.04693"}},"official":{"repos":["wuyxin/graphmetro"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/simulating-the-air-quality-impact-of","slug":"simulating-the-air-quality-impact-of","title":"Simulating the Air Quality Impact of Prescribed Fires Using Graph Neural Network-Based PM$_{2.5}$ Forecasts","date":"2023-12-07","arxiv_id":"2312.04291","repositories_listed":1,"syntology":null},{"url":"/paper/gnn2r-weakly-supervised-rationale-providing","slug":"gnn2r-weakly-supervised-rationale-providing","title":"GNN2R: Weakly-Supervised Rationale-Providing Question Answering over Knowledge Graphs","date":"2023-12-04","arxiv_id":"2312.02317","repositories_listed":1,"syntology":null},{"url":"/paper/pytorch-geometric-high-order-a-unified","slug":"pytorch-geometric-high-order-a-unified","title":"PyTorch Geometric High Order: A Unified Library for High Order Graph Neural Network","date":"2023-11-28","arxiv_id":"2311.16670","repositories_listed":1,"syntology":null},{"url":"/paper/accurate-and-interpretable-drug-drug","slug":"accurate-and-interpretable-drug-drug","title":"Accurate and interpretable drug-drug interaction prediction enabled by knowledge subgraph learning","date":"2023-11-25","arxiv_id":"2311.15056","repositories_listed":1,"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":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","sample_list":"/paper/accurate-and-interpretable-drug-drug#ran","syntology_url":"https://syntology.ai/paper/2311.15056","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2311.15056"}},"official":{"repos":["lars-research/knowddi"],"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"]}}},{"url":"/paper/bhgnn-rt-network-embedding-for-directed","slug":"bhgnn-rt-network-embedding-for-directed","title":"BHGNN-RT: Network embedding for directed heterogeneous graphs","date":"2023-11-24","arxiv_id":"2311.14404","repositories_listed":1,"syntology":null},{"url":"/paper/finite-volume-features-global-geometry","slug":"finite-volume-features-global-geometry","title":"Finite Volume Features, Global Geometry Representations, and Residual Training for Deep Learning-based CFD Simulation","date":"2023-11-24","arxiv_id":"2311.14464","repositories_listed":1,"syntology":{"n":1,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 1 unverified","sample_list":"/paper/finite-volume-features-global-geometry#ran","syntology_url":"https://syntology.ai/paper/2311.14464","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2311.14464"}},"official":{"repos":["toggled/FvFGeo"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]}}},{"url":"/paper/comprehensive-evaluation-of-gnn-training","slug":"comprehensive-evaluation-of-gnn-training","title":"Comprehensive Evaluation of GNN Training Systems: A Data Management Perspective","date":"2023-11-22","arxiv_id":"2311.13279","repositories_listed":1,"syntology":null},{"url":"/paper/node-classification-in-random-trees","slug":"node-classification-in-random-trees","title":"Node Classification in Random Trees","date":"2023-11-20","arxiv_id":"2311.12167","repositories_listed":1,"syntology":null},{"url":"/paper/graph-sparsifications-using-neural-network","slug":"graph-sparsifications-using-neural-network","title":"Graph Sparsifications using Neural Network Assisted Monte Carlo Tree Search","date":"2023-11-17","arxiv_id":"2311.10316","repositories_listed":1,"syntology":null},{"url":"/paper/disentangling-the-potential-impacts-of-papers","slug":"disentangling-the-potential-impacts-of-papers","title":"Predicting Scientific Impact Through Diffusion, Conformity, and Contribution Disentanglement","date":"2023-11-15","arxiv_id":"2311.09262","repositories_listed":1,"syntology":null},{"url":"/paper/emerging-drug-interaction-prediction-enabled","slug":"emerging-drug-interaction-prediction-enabled","title":"Emerging Drug Interaction Prediction Enabled by Flow-based Graph Neural Network with Biomedical Network","date":"2023-11-15","arxiv_id":"2311.09261","repositories_listed":1,"syntology":null},{"url":"/paper/language-semantic-graph-guided-data-efficient","slug":"language-semantic-graph-guided-data-efficient","title":"Language Semantic Graph Guided Data-Efficient Learning","date":"2023-11-15","arxiv_id":"2311.08782","repositories_listed":1,"syntology":{"n":8,"n_ran":5,"n_constructed":1,"n_ran_checked":4,"n_instrument":1,"n_unverified":3,"n_honours":1,"n_violates":1,"n_no_contract":2,"n_pointer_only":0,"phrase":"5 ran (of which 1 constructed an object rather than computing a result; 4 with no instrument failure: 1 honoured, 1 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/language-semantic-graph-guided-data-efficient#ran","syntology_url":"https://syntology.ai/paper/2311.08782","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2311.08782"}},"official":{"repos":["bit-da/lsg"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":1,"n_ran_no_instrument_failure":4,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/uplift-modeling-based-on-graph-neural-network","slug":"uplift-modeling-based-on-graph-neural-network","title":"Uplift Modeling based on Graph Neural Network Combined with Causal Knowledge","date":"2023-11-14","arxiv_id":"2311.08434","repositories_listed":1,"syntology":null},{"url":"/paper/adamm-anomaly-detection-of-attributed-multi","slug":"adamm-anomaly-detection-of-attributed-multi","title":"ADAMM: Anomaly Detection of Attributed Multi-graphs with Metadata: A Unified Neural Network Approach","date":"2023-11-13","arxiv_id":"2311.07355","repositories_listed":1,"syntology":null},{"url":"/paper/connecting-the-dots-graph-neural-network","slug":"connecting-the-dots-graph-neural-network","title":"Connecting the Dots: Graph Neural Network Powered Ensemble and Classification of Medical Images","date":"2023-11-13","arxiv_id":"2311.07321","repositories_listed":1,"syntology":null},{"url":"/paper/clamp-a-contrastive-language-and-molecule-pre","slug":"clamp-a-contrastive-language-and-molecule-pre","title":"CLAMP: A Contrastive Language And Molecule Pre-training Network","date":"2023-11-12","arxiv_id":"2311.07617","repositories_listed":1,"syntology":null},{"url":"/paper/relational-visual-representations-underlie","slug":"relational-visual-representations-underlie","title":"Relational visual representations underlie human social interaction recognition","date":"2023-11-11","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/fouriergnn-rethinking-multivariate-time-1","slug":"fouriergnn-rethinking-multivariate-time-1","title":"FourierGNN: Rethinking Multivariate Time Series Forecasting from a Pure Graph Perspective","date":"2023-11-10","arxiv_id":"2311.06190","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/fouriergnn-rethinking-multivariate-time-1#ran","syntology_url":"https://syntology.ai/paper/2311.06190","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2311.06190"}},"official":{"repos":["aikunyi/fouriergnn"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/mixture-of-weak-strong-experts-on-graphs","slug":"mixture-of-weak-strong-experts-on-graphs","title":"Mixture of Weak & Strong Experts on Graphs","date":"2023-11-09","arxiv_id":"2311.05185","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/mixture-of-weak-strong-experts-on-graphs#ran","syntology_url":"https://syntology.ai/paper/2311.05185","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2311.05185"}},"official":{"repos":["facebookresearch/mowst-gnn"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/ai-accelerated-discovery-of-altermagnetic","slug":"ai-accelerated-discovery-of-altermagnetic","title":"AI-accelerated Discovery of Altermagnetic Materials","date":"2023-11-08","arxiv_id":"2311.04418","repositories_listed":1,"syntology":null},{"url":"/paper/conversation-understanding-using-relational","slug":"conversation-understanding-using-relational","title":"Conversation Understanding using Relational Temporal Graph Neural Networks with Auxiliary Cross-Modality Interaction","date":"2023-11-08","arxiv_id":"2311.04507","repositories_listed":1,"syntology":null},{"url":"/paper/pepland-a-large-scale-pre-trained-peptide","slug":"pepland-a-large-scale-pre-trained-peptide","title":"PepLand: a large-scale pre-trained peptide representation model for a comprehensive landscape of both canonical and non-canonical amino acids","date":"2023-11-08","arxiv_id":"2311.04419","repositories_listed":1,"syntology":{"n":8,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":1,"n_honours":2,"n_violates":0,"n_no_contract":5,"n_pointer_only":1,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 2 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/pepland-a-large-scale-pre-trained-peptide#ran","syntology_url":"https://syntology.ai/paper/2311.04419","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2311.04419"}},"official":{"repos":["zhangruochi/pepland"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/brain-networks-and-intelligence-a-graph","slug":"brain-networks-and-intelligence-a-graph","title":"Brain Networks and Intelligence: A Graph Neural Network Based Approach to Resting State fMRI Data","date":"2023-11-06","arxiv_id":"2311.03520","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"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) · 1 unverified","sample_list":"/paper/brain-networks-and-intelligence-a-graph#ran","syntology_url":"https://syntology.ai/paper/2311.03520","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2311.03520"}},"official":{"repos":["bishalth01/BrainRGIN"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/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","repositories_listed":1,"syntology":{"n":10,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":8,"n_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","sample_list":"/paper/robust-graph-clustering-via-meta-weighting#ran","syntology_url":"https://syntology.ai/paper/2311.00322","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2311.00322"}},"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"]}}},{"url":"/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","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_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","sample_list":"/paper/maximum-independent-set-self-training-through#ran","syntology_url":"https://syntology.ai/paper/2310.18672","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.18672"}},"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"]}}},{"url":"/paper/do-graph-neural-networks-dream-of-landau","slug":"do-graph-neural-networks-dream-of-landau","title":"Learning the dynamics of a one-dimensional plasma model with graph neural networks","date":"2023-10-26","arxiv_id":"2310.17646","repositories_listed":1,"syntology":null},{"url":"/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","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_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","sample_list":"/paper/using-causality-aware-graph-neural-networks#ran","syntology_url":"https://syntology.ai/paper/2310.15865","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.15865"}},"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"]}}},{"url":"/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","repositories_listed":1,"syntology":{"n":8,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_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","sample_list":"/paper/efficient-heterogeneous-graph-learning-via#ran","syntology_url":"https://syntology.ai/paper/2310.14481","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.14481"}},"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"]}}},{"url":"/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","repositories_listed":1,"syntology":null},{"url":"/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","repositories_listed":1,"syntology":null},{"url":"/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","repositories_listed":1,"syntology":null},{"url":"/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","repositories_listed":1,"syntology":null},{"url":"/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","repositories_listed":1,"syntology":null},{"url":"/paper/mitigating-the-missing-fragmentation-problem","slug":"mitigating-the-missing-fragmentation-problem","title":"Mitigating the missing-fragmentation problem in de novo peptide sequencing with a two-stage graph-based deep learning model","date":"2023-10-19","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/open-world-lifelong-graph-learning","slug":"open-world-lifelong-graph-learning","title":"Open-World Lifelong Graph Learning","date":"2023-10-19","arxiv_id":"2310.12565","repositories_listed":1,"syntology":{"n":15,"n_ran":12,"n_constructed":0,"n_ran_checked":12,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":12,"n_pointer_only":15,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 12 with no instrument failure: 0 honoured, 0 violated, 12 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/open-world-lifelong-graph-learning#ran","syntology_url":"https://syntology.ai/paper/2310.12565","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.12565"}},"official":{"repos":["bobowner/open-world-lgl"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":0,"n_ran_no_instrument_failure":12,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/pretraining-language-models-with-text","slug":"pretraining-language-models-with-text","title":"Pretraining Language Models with Text-Attributed Heterogeneous Graphs","date":"2023-10-19","arxiv_id":"2310.12580","repositories_listed":1,"syntology":null},{"url":"/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","repositories_listed":1,"syntology":null},{"url":"/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","repositories_listed":1,"syntology":null},{"url":"/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","repositories_listed":1,"syntology":null},{"url":"/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","repositories_listed":1,"syntology":null},{"url":"/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","repositories_listed":1,"syntology":null},{"url":"/paper/learning-visual-based-deformable-object","slug":"learning-visual-based-deformable-object","title":"Learning visual-based deformable object rearrangement with local graph neural networks","date":"2023-10-16","arxiv_id":"2310.10307","repositories_listed":1,"syntology":null},{"url":"/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","repositories_listed":1,"syntology":null},{"url":"/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","repositories_listed":1,"syntology":null},{"url":"/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","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":1,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_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","sample_list":"/paper/gmocat-a-graph-enhanced-multi-objective#ran","syntology_url":"https://syntology.ai/paper/2310.07477","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.07477"}},"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"]}}},{"url":"/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","repositories_listed":1,"syntology":{"n":5,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_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","sample_list":"/paper/non-backtracking-graph-neural-networks#ran","syntology_url":"https://syntology.ai/paper/2310.07430","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.07430"}},"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"]}}},{"url":"/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","repositories_listed":1,"syntology":{"n":5,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_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","sample_list":"/paper/neural-relational-inference-with-fast-modular-1#ran","syntology_url":"https://syntology.ai/paper/2310.07015","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.07015"}},"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"]}}},{"url":"/paper/tango-time-reversal-latent-graphode-for-multi","slug":"tango-time-reversal-latent-graphode-for-multi","title":"TANGO: Time-Reversal Latent GraphODE for Multi-Agent Dynamical Systems","date":"2023-10-10","arxiv_id":"2310.06427","repositories_listed":1,"syntology":null},{"url":"/paper/tailoring-self-attention-for-graph-via-rooted-1","slug":"tailoring-self-attention-for-graph-via-rooted-1","title":"Tailoring Self-Attention for Graph via Rooted Subtrees","date":"2023-10-08","arxiv_id":"2310.05296","repositories_listed":1,"syntology":{"n":10,"n_ran":7,"n_constructed":0,"n_ran_checked":5,"n_instrument":2,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":10,"phrase":"7 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; 2 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/tailoring-self-attention-for-graph-via-rooted-1#ran","syntology_url":"https://syntology.ai/paper/2310.05296","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.05296"}},"official":{"repos":["lumia-group/subtree-attention"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":3,"ran_from_kinds":["official"]}}}],"record_sha256":"a495da41dd1f1e148399d9fe16f7b84a7cd433440ab3f177696c0b4efe0e9aee","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}