{"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/9","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":9,"pages_in_order":36,"rows_per_page":100,"rows":[801,900],"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/8","next":"/task/graph-neural-network/papers/10","papers":[{"url":"/paper/scene2bir-material-aware-learning-based","slug":"scene2bir-material-aware-learning-based","title":"Listen2Scene: Interactive material-aware binaural sound propagation for reconstructed 3D scenes","date":"2023-02-02","arxiv_id":"2302.02809","repositories_listed":1,"syntology":null},{"url":"/paper/company-as-tribe-company-financial-risk","slug":"company-as-tribe-company-financial-risk","title":"Company-as-Tribe: Company Financial Risk Assessment on Tribe-Style Graph with Hierarchical Graph Neural Networks","date":"2023-01-31","arxiv_id":"2301.13492","repositories_listed":1,"syntology":null},{"url":"/paper/finding-the-law-enhancing-statutory-article","slug":"finding-the-law-enhancing-statutory-article","title":"Finding the Law: Enhancing Statutory Article Retrieval via Graph Neural Networks","date":"2023-01-30","arxiv_id":"2301.12847","repositories_listed":1,"syntology":null},{"url":"/paper/task-agnostic-graph-neural-network-evaluation","slug":"task-agnostic-graph-neural-network-evaluation","title":"Task-Agnostic Graph Neural Network Evaluation via Adversarial Collaboration","date":"2023-01-27","arxiv_id":"2301.11517","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":1,"n_ran_checked":3,"n_instrument":1,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"4 ran (of which 1 constructed an object rather than computing a result; 3 with no instrument failure: 2 honoured, 0 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/task-agnostic-graph-neural-network-evaluation#ran","syntology_url":"https://syntology.ai/paper/2301.11517","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2301.11517"}},"official":{"repos":["victorzxy/graphac"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":1,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/explainable-multilayer-graph-neural-network","slug":"explainable-multilayer-graph-neural-network","title":"Explainable Multilayer Graph Neural Network for Cancer Gene Prediction","date":"2023-01-20","arxiv_id":"2301.08831","repositories_listed":1,"syntology":null},{"url":"/paper/flex-net-a-graph-neural-network-approach-to","slug":"flex-net-a-graph-neural-network-approach-to","title":"Flex-Net: A Graph Neural Network Approach to Resource Management in Flexible Duplex Networks","date":"2023-01-20","arxiv_id":"2301.11166","repositories_listed":1,"syntology":null},{"url":"/paper/who-should-i-engage-with-at-what-time-a","slug":"who-should-i-engage-with-at-what-time-a","title":"Who Should I Engage with At What Time? A Missing Event Aware Temporal Graph Neural Network","date":"2023-01-20","arxiv_id":"2301.08399","repositories_listed":1,"syntology":null},{"url":"/paper/pdformer-propagation-delay-aware-dynamic-long","slug":"pdformer-propagation-delay-aware-dynamic-long","title":"PDFormer: Propagation Delay-Aware Dynamic Long-Range Transformer for Traffic Flow Prediction","date":"2023-01-19","arxiv_id":"2301.07945","repositories_listed":1,"syntology":{"n":8,"n_ran":6,"n_constructed":6,"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 6 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; every one of the 6 samples that ran constructed an object rather than computing a result","sample_list":"/paper/pdformer-propagation-delay-aware-dynamic-long#ran","syntology_url":"https://syntology.ai/paper/2301.07945","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2301.07945"}},"official":{"repos":["BUAABIGSCity/PDFormer"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":6,"n_ran_no_instrument_failure":6,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/crysgnn-distilling-pre-trained-knowledge-to","slug":"crysgnn-distilling-pre-trained-knowledge-to","title":"CrysGNN : Distilling pre-trained knowledge to enhance property prediction for crystalline materials","date":"2023-01-14","arxiv_id":"2301.05852","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"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) · 1 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/crysgnn-distilling-pre-trained-knowledge-to#ran","syntology_url":"https://syntology.ai/paper/2301.05852","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2301.05852"}},"official":{"repos":["kdmsit/crysgnn"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/evaluating-the-transferability-of-machine","slug":"evaluating-the-transferability-of-machine","title":"Evaluating the Transferability of Machine-Learned Force Fields for Material Property Modeling","date":"2023-01-10","arxiv_id":"2301.03729","repositories_listed":1,"syntology":null},{"url":"/paper/instagram-instance-level-graph-modeling-for","slug":"instagram-instance-level-graph-modeling-for","title":"InstaGraM: Instance-level Graph Modeling for Vectorized HD Map Learning","date":"2023-01-10","arxiv_id":"2301.04470","repositories_listed":1,"syntology":null},{"url":"/paper/scene-reasoning-about-traffic-scenes-using","slug":"scene-reasoning-about-traffic-scenes-using","title":"SCENE: Reasoning about Traffic Scenes using Heterogeneous Graph Neural Networks","date":"2023-01-09","arxiv_id":"2301.03512","repositories_listed":1,"syntology":null},{"url":"/paper/autoac-towards-automated-attribute-completion","slug":"autoac-towards-automated-attribute-completion","title":"AutoAC: Towards Automated Attribute Completion for Heterogeneous Graph Neural Network","date":"2023-01-08","arxiv_id":"2301.03049","repositories_listed":1,"syntology":null},{"url":"/paper/topics-as-entity-clusters-entity-based-topics","slug":"topics-as-entity-clusters-entity-based-topics","title":"Topics as Entity Clusters: Entity-based Topics from Large Language Models and Graph Neural Networks","date":"2023-01-06","arxiv_id":"2301.02458","repositories_listed":1,"syntology":null},{"url":"/paper/training-a-deep-q-learning-agent-inside-a","slug":"training-a-deep-q-learning-agent-inside-a","title":"Learning a Generic Value-Selection Heuristic Inside a Constraint Programming Solver","date":"2023-01-05","arxiv_id":"2301.01913","repositories_listed":1,"syntology":null},{"url":"/paper/ci-gnn-a-granger-causality-inspired-graph","slug":"ci-gnn-a-granger-causality-inspired-graph","title":"CI-GNN: A Granger Causality-Inspired Graph Neural Network for Interpretable Brain Network-Based Psychiatric Diagnosis","date":"2023-01-04","arxiv_id":"2301.01642","repositories_listed":1,"syntology":null},{"url":"/paper/vision-hgnn-an-image-is-more-than-a-graph-of","slug":"vision-hgnn-an-image-is-more-than-a-graph-of","title":"Vision HGNN: An Image is More than a Graph of Nodes","date":"2023-01-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/power-control-for-6g-industrial-wireless","slug":"power-control-for-6g-industrial-wireless","title":"Power Control for 6G Industrial Wireless Subnetworks: A Graph Neural Network Approach","date":"2022-12-30","arxiv_id":"2212.14051","repositories_listed":1,"syntology":null},{"url":"/paper/a-novel-self-supervised-learning-based","slug":"a-novel-self-supervised-learning-based","title":"A Novel Self-Supervised Learning-Based Anomaly Node Detection Method Based on an Autoencoder in Wireless Sensor Networks","date":"2022-12-26","arxiv_id":"2212.13904","repositories_listed":1,"syntology":null},{"url":"/paper/recognition-and-reconstruction-of-cell","slug":"recognition-and-reconstruction-of-cell","title":"Recognition and reconstruction of cell differentiation patterns with deep learning","date":"2022-12-20","arxiv_id":"2212.10058","repositories_listed":1,"syntology":null},{"url":"/paper/predicting-citi-bike-demand-evolution-using","slug":"predicting-citi-bike-demand-evolution-using","title":"Predicting Citi Bike Demand Evolution Using Dynamic Graphs","date":"2022-12-18","arxiv_id":"2212.09175","repositories_listed":1,"syntology":null},{"url":"/paper/exploring-fake-news-detection-with","slug":"exploring-fake-news-detection-with","title":"Exploring Fake News Detection with Heterogeneous Social Media Context Graphs","date":"2022-12-13","arxiv_id":"2212.06560","repositories_listed":1,"syntology":null},{"url":"/paper/deepcut-unsupervised-segmentation-using-graph","slug":"deepcut-unsupervised-segmentation-using-graph","title":"DeepCut: Unsupervised Segmentation using Graph Neural Networks Clustering","date":"2022-12-12","arxiv_id":"2212.05853","repositories_listed":1,"syntology":{"n":8,"n_ran":8,"n_constructed":0,"n_ran_checked":7,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":4,"phrase":"8 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; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/deepcut-unsupervised-segmentation-using-graph#ran","syntology_url":"https://syntology.ai/paper/2212.05853","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2212.05853"}},"official":null}},{"url":"/paper/latent-graph-representations-for-critical","slug":"latent-graph-representations-for-critical","title":"Latent Graph Representations for Critical View of Safety Assessment","date":"2022-12-08","arxiv_id":"2212.04155","repositories_listed":1,"syntology":null},{"url":"/paper/learning-rigid-dynamics-with-face-interaction","slug":"learning-rigid-dynamics-with-face-interaction","title":"Learning rigid dynamics with face interaction graph networks","date":"2022-12-07","arxiv_id":"2212.03574","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":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/learning-rigid-dynamics-with-face-interaction#ran","syntology_url":"https://syntology.ai/paper/2212.03574","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2212.03574"}},"official":null}},{"url":"/paper/node-oriented-spectral-filtering-for-graph","slug":"node-oriented-spectral-filtering-for-graph","title":"Node-oriented Spectral Filtering for Graph Neural Networks","date":"2022-12-07","arxiv_id":"2212.03654","repositories_listed":1,"syntology":null},{"url":"/paper/dissimilar-nodes-improve-graph-active","slug":"dissimilar-nodes-improve-graph-active","title":"Dissimilar Nodes Improve Graph Active Learning","date":"2022-12-05","arxiv_id":"2212.01968","repositories_listed":1,"syntology":null},{"url":"/paper/gibbs-helmholtz-graph-neural-network","slug":"gibbs-helmholtz-graph-neural-network","title":"Gibbs-Helmholtz Graph Neural Network: capturing the temperature dependency of activity coefficients at infinite dilution","date":"2022-12-02","arxiv_id":"2212.01199","repositories_listed":1,"syntology":null},{"url":"/paper/meshdqn-a-deep-reinforcement-learning","slug":"meshdqn-a-deep-reinforcement-learning","title":"MeshDQN: A Deep Reinforcement Learning Framework for Improving Meshes in Computational Fluid Dynamics","date":"2022-12-02","arxiv_id":"2212.01428","repositories_listed":1,"syntology":null},{"url":"/paper/enhancing-joint-multiple-intent-detection-and","slug":"enhancing-joint-multiple-intent-detection-and","title":"Enhancing Joint Multiple Intent Detection and Slot Filling with Global Intent-Slot Co-occurrence","date":"2022-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/proactive-robot-assistance-via-spatio","slug":"proactive-robot-assistance-via-spatio","title":"Proactive Robot Assistance via Spatio-Temporal Object Modeling","date":"2022-11-28","arxiv_id":"2211.15501","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":1,"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) · 1 unverified","sample_list":"/paper/proactive-robot-assistance-via-spatio#ran","syntology_url":"https://syntology.ai/paper/2211.15501","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2211.15501"}},"official":{"repos":["maithili/spatiotemporalobjecttracking"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/patchgt-transformer-over-non-trainable","slug":"patchgt-transformer-over-non-trainable","title":"PatchGT: Transformer over Non-trainable Clusters for Learning Graph Representations","date":"2022-11-26","arxiv_id":"2211.14425","repositories_listed":1,"syntology":null},{"url":"/paper/mecch-metapath-context-convolution-based","slug":"mecch-metapath-context-convolution-based","title":"MECCH: Metapath Context Convolution-based Heterogeneous Graph Neural Networks","date":"2022-11-23","arxiv_id":"2211.12792","repositories_listed":1,"syntology":null},{"url":"/paper/spatiotemporal-modeling-of-multivariate","slug":"spatiotemporal-modeling-of-multivariate","title":"Modeling Multivariate Biosignals With Graph Neural Networks and Structured State Space Models","date":"2022-11-21","arxiv_id":"2211.11176","repositories_listed":1,"syntology":{"n":12,"n_ran":11,"n_constructed":0,"n_ran_checked":8,"n_instrument":3,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":0,"phrase":"11 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; 3 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/spatiotemporal-modeling-of-multivariate#ran","syntology_url":"https://syntology.ai/paper/2211.11176","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2211.11176"}},"official":{"repos":["tsy935/graphs4mer"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/learning-to-search-for-job-shop-scheduling","slug":"learning-to-search-for-job-shop-scheduling","title":"Deep Reinforcement Learning Guided Improvement Heuristic for Job Shop Scheduling","date":"2022-11-20","arxiv_id":"2211.10936","repositories_listed":1,"syntology":null},{"url":"/paper/rhco-a-relation-aware-heterogeneous-graph","slug":"rhco-a-relation-aware-heterogeneous-graph","title":"RHCO: A Relation-aware Heterogeneous Graph Neural Network with Contrastive Learning for Large-scale Graphs","date":"2022-11-20","arxiv_id":"2211.11752","repositories_listed":1,"syntology":null},{"url":"/paper/spectral-adversarial-training-for-robust","slug":"spectral-adversarial-training-for-robust","title":"Spectral Adversarial Training for Robust Graph Neural Network","date":"2022-11-20","arxiv_id":"2211.10896","repositories_listed":1,"syntology":null},{"url":"/paper/delay-aware-backpressure-routing-using-graph","slug":"delay-aware-backpressure-routing-using-graph","title":"Delay-aware Backpressure Routing Using Graph Neural Networks","date":"2022-11-19","arxiv_id":"2211.10748","repositories_listed":1,"syntology":null},{"url":"/paper/dgrec-graph-neural-network-for-recommendation","slug":"dgrec-graph-neural-network-for-recommendation","title":"DGRec: Graph Neural Network for Recommendation with Diversified Embedding Generation","date":"2022-11-18","arxiv_id":"2211.10486","repositories_listed":1,"syntology":null},{"url":"/paper/gns-a-generalizable-graph-neural-network","slug":"gns-a-generalizable-graph-neural-network","title":"GNS: A generalizable Graph Neural Network-based simulator for particulate and fluid modeling","date":"2022-11-18","arxiv_id":"2211.10228","repositories_listed":1,"syntology":null},{"url":"/paper/abstractive-summarization-guided-by-latent","slug":"abstractive-summarization-guided-by-latent","title":"Abstractive Summarization Guided by Latent Hierarchical Document Structure","date":"2022-11-17","arxiv_id":"2211.09458","repositories_listed":1,"syntology":null},{"url":"/paper/prototype-based-interpretable-graph-neural","slug":"prototype-based-interpretable-graph-neural","title":"Prototype-based Interpretable Graph Neural Networks","date":"2022-11-16","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/hierarchical-inference-of-the-lensing","slug":"hierarchical-inference-of-the-lensing","title":"Hierarchical Inference of the Lensing Convergence from Photometric Catalogs with Bayesian Graph Neural Networks","date":"2022-11-15","arxiv_id":"2211.07807","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":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/hierarchical-inference-of-the-lensing#ran","syntology_url":"https://syntology.ai/paper/2211.07807","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2211.07807"}},"official":{"repos":["jiwoncpark/node-to-joy"],"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/similarity-based-feature-extraction-for-large","slug":"similarity-based-feature-extraction-for-large","title":"Similarity-based Feature Extraction for Large-scale Sparse Traffic Forecasting","date":"2022-11-13","arxiv_id":"2211.07031","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":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/similarity-based-feature-extraction-for-large#ran","syntology_url":"https://syntology.ai/paper/2211.07031","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2211.07031"}},"official":{"repos":["c-lyu/traffic4cast2022-tse"],"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/a-new-graph-node-classification-benchmark","slug":"a-new-graph-node-classification-benchmark","title":"A New Graph Node Classification Benchmark: Learning Structure from Histology Cell Graphs","date":"2022-11-11","arxiv_id":"2211.06292","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/a-new-graph-node-classification-benchmark#ran","syntology_url":"https://syntology.ai/paper/2211.06292","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2211.06292"}},"official":{"repos":["nellaker-group/placenta"],"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/reducing-down-stream-time-pretraining","slug":"reducing-down-stream-time-pretraining","title":"Reducing Down(stream)time: Pretraining Molecular GNNs using Heterogeneous AI Accelerators","date":"2022-11-08","arxiv_id":"2211.04598","repositories_listed":1,"syntology":null},{"url":"/paper/nsnet-a-general-neural-probabilistic","slug":"nsnet-a-general-neural-probabilistic","title":"NSNet: A General Neural Probabilistic Framework for Satisfiability Problems","date":"2022-11-07","arxiv_id":"2211.03880","repositories_listed":1,"syntology":null},{"url":"/paper/characterizing-the-efficiency-of-graph-neural","slug":"characterizing-the-efficiency-of-graph-neural","title":"Characterizing the Efficiency of Graph Neural Network Frameworks with a Magnifying Glass","date":"2022-11-06","arxiv_id":"2211.03021","repositories_listed":1,"syntology":null},{"url":"/paper/inductive-graph-transformer-for-delivery-time","slug":"inductive-graph-transformer-for-delivery-time","title":"Inductive Graph Transformer for Delivery Time Estimation","date":"2022-11-05","arxiv_id":"2211.02863","repositories_listed":1,"syntology":null},{"url":"/paper/geometry-complete-perceptron-networks-for-3d","slug":"geometry-complete-perceptron-networks-for-3d","title":"Geometry-Complete Perceptron Networks for 3D Molecular Graphs","date":"2022-11-04","arxiv_id":"2211.02504","repositories_listed":1,"syntology":null},{"url":"/paper/materials-property-prediction-with","slug":"materials-property-prediction-with","title":"Materials Property Prediction with Uncertainty Quantification: A Benchmark Study","date":"2022-11-04","arxiv_id":"2211.02235","repositories_listed":1,"syntology":null},{"url":"/paper/towards-better-out-of-distribution","slug":"towards-better-out-of-distribution","title":"Towards Better Out-of-Distribution Generalization of Neural Algorithmic Reasoning Tasks","date":"2022-11-01","arxiv_id":"2211.00692","repositories_listed":1,"syntology":{"n":6,"n_ran":4,"n_constructed":0,"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 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","sample_list":"/paper/towards-better-out-of-distribution#ran","syntology_url":"https://syntology.ai/paper/2211.00692","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2211.00692"}},"official":{"repos":["smahdavi4/clrs"],"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"]}}},{"url":"/paper/the-open-matsci-ml-toolkit-a-flexible","slug":"the-open-matsci-ml-toolkit-a-flexible","title":"The Open MatSci ML Toolkit: A Flexible Framework for Machine Learning in Materials Science","date":"2022-10-31","arxiv_id":"2210.17484","repositories_listed":1,"syntology":null},{"url":"/paper/towards-relation-centered-pooling-and","slug":"towards-relation-centered-pooling-and","title":"Towards Relation-centered Pooling and Convolution for Heterogeneous Graph Learning Networks","date":"2022-10-31","arxiv_id":"2210.17142","repositories_listed":1,"syntology":null},{"url":"/paper/graph-fuzzy-system-concepts-models-and","slug":"graph-fuzzy-system-concepts-models-and","title":"Graph Fuzzy System: Concepts, Models and Algorithms","date":"2022-10-30","arxiv_id":"2210.16730","repositories_listed":1,"syntology":null},{"url":"/paper/learning-to-compare-nodes-in-branch-and-bound","slug":"learning-to-compare-nodes-in-branch-and-bound","title":"Learning to Compare Nodes in Branch and Bound with Graph Neural Networks","date":"2022-10-30","arxiv_id":"2210.16934","repositories_listed":1,"syntology":null},{"url":"/paper/search-to-pass-messages-for-temporal","slug":"search-to-pass-messages-for-temporal","title":"Search to Pass Messages for Temporal Knowledge Graph Completion","date":"2022-10-30","arxiv_id":"2210.16740","repositories_listed":1,"syntology":null},{"url":"/paper/two-level-temporal-relation-model-for-online","slug":"two-level-temporal-relation-model-for-online","title":"Two-Level Temporal Relation Model for Online Video Instance Segmentation","date":"2022-10-30","arxiv_id":"2210.16795","repositories_listed":1,"syntology":null},{"url":"/paper/physics-aware-graph-neural-network-for","slug":"physics-aware-graph-neural-network-for","title":"Physics-aware Graph Neural Network for Accurate RNA 3D Structure Prediction","date":"2022-10-28","arxiv_id":"2210.16392","repositories_listed":1,"syntology":null},{"url":"/paper/fusing-modalities-by-multiplexed-graph-neural","slug":"fusing-modalities-by-multiplexed-graph-neural","title":"Fusing Modalities by Multiplexed Graph Neural Networks for Outcome Prediction in Tuberculosis","date":"2022-10-25","arxiv_id":"2210.14377","repositories_listed":1,"syntology":null},{"url":"/paper/motif-backdoor-rethinking-the-backdoor-attack","slug":"motif-backdoor-rethinking-the-backdoor-attack","title":"Motif-Backdoor: Rethinking the Backdoor Attack on Graph Neural Networks via Motifs","date":"2022-10-25","arxiv_id":"2210.13710","repositories_listed":1,"syntology":{"n":2,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"0 ran · 2 unverified","sample_list":"/paper/motif-backdoor-rethinking-the-backdoor-attack#ran","syntology_url":"https://syntology.ai/paper/2210.13710","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.13710"}},"official":{"repos":["seaocn/motif-backdoor"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":[]}}},{"url":"/paper/teal-learning-accelerated-optimization-of","slug":"teal-learning-accelerated-optimization-of","title":"Teal: Learning-Accelerated Optimization of WAN Traffic Engineering","date":"2022-10-25","arxiv_id":"2210.13763","repositories_listed":1,"syntology":null},{"url":"/paper/abductive-action-inference","slug":"abductive-action-inference","title":"Inferring Past Human Actions in Homes with Abductive Reasoning","date":"2022-10-24","arxiv_id":"2210.13984","repositories_listed":1,"syntology":null},{"url":"/paper/efficient-automatic-machine-learning-via","slug":"efficient-automatic-machine-learning-via","title":"Efficient Automatic Machine Learning via Design Graphs","date":"2022-10-21","arxiv_id":"2210.12257","repositories_listed":1,"syntology":null},{"url":"/paper/dagad-data-augmentation-for-graph-anomaly","slug":"dagad-data-augmentation-for-graph-anomaly","title":"DAGAD: Data Augmentation for Graph Anomaly Detection","date":"2022-10-18","arxiv_id":"2210.09766","repositories_listed":1,"syntology":null},{"url":"/paper/graph-based-multilingual-label-propagation","slug":"graph-based-multilingual-label-propagation","title":"Graph-Based Multilingual Label Propagation for Low-Resource Part-of-Speech Tagging","date":"2022-10-18","arxiv_id":"2210.09840","repositories_listed":1,"syntology":null},{"url":"/paper/intelligent-resource-allocation-in-joint","slug":"intelligent-resource-allocation-in-joint","title":"Intelligent Resource Allocation in Joint Radar-Communication With Graph Neural Networks","date":"2022-10-17","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/unsupervised-optimal-power-flow-using-graph","slug":"unsupervised-optimal-power-flow-using-graph","title":"Unsupervised Optimal Power Flow Using Graph Neural Networks","date":"2022-10-17","arxiv_id":"2210.09277","repositories_listed":1,"syntology":null},{"url":"/paper/mgnni-multiscale-graph-neural-networks-with","slug":"mgnni-multiscale-graph-neural-networks-with","title":"MGNNI: Multiscale Graph Neural Networks with Implicit Layers","date":"2022-10-15","arxiv_id":"2210.08353","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"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) · 1 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/mgnni-multiscale-graph-neural-networks-with#ran","syntology_url":"https://syntology.ai/paper/2210.08353","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.08353"}},"official":{"repos":["liu-jc/mgnni"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/travel-the-same-path-a-novel-tsp-solving","slug":"travel-the-same-path-a-novel-tsp-solving","title":"Travel the Same Path: A Novel TSP Solving Strategy","date":"2022-10-12","arxiv_id":"2210.05906","repositories_listed":1,"syntology":null},{"url":"/paper/a-general-learning-framework-for-open-ad-hoc","slug":"a-general-learning-framework-for-open-ad-hoc","title":"A General Learning Framework for Open Ad Hoc Teamwork Using Graph-based Policy Learning","date":"2022-10-11","arxiv_id":"2210.05448","repositories_listed":1,"syntology":null},{"url":"/paper/event-driven-tactile-learning-with-various","slug":"event-driven-tactile-learning-with-various","title":"Boost Event-Driven Tactile Learning with Location Spiking Neurons","date":"2022-10-09","arxiv_id":"2210.04277","repositories_listed":1,"syntology":null},{"url":"/paper/granite-a-graph-neural-network-model-for","slug":"granite-a-graph-neural-network-model-for","title":"GRANITE: A Graph Neural Network Model for Basic Block Throughput Estimation","date":"2022-10-08","arxiv_id":"2210.03894","repositories_listed":1,"syntology":null},{"url":"/paper/kernel-based-substructure-exploration-for","slug":"kernel-based-substructure-exploration-for","title":"Kernel-based Substructure Exploration for Next POI Recommendation","date":"2022-10-08","arxiv_id":"2210.03969","repositories_listed":1,"syntology":null},{"url":"/paper/machine-learning-meets-the-herbrand-universe","slug":"machine-learning-meets-the-herbrand-universe","title":"Machine Learning Meets The Herbrand Universe","date":"2022-10-07","arxiv_id":"2210.03590","repositories_listed":1,"syntology":null},{"url":"/paper/enhancing-mixup-based-graph-learning-for","slug":"enhancing-mixup-based-graph-learning-for","title":"On the Effectiveness of Hybrid Pooling in Mixup-Based Graph Learning for Language Processing","date":"2022-10-06","arxiv_id":"2210.03123","repositories_listed":1,"syntology":null},{"url":"/paper/geodesic-graph-neural-network-for-efficient","slug":"geodesic-graph-neural-network-for-efficient","title":"Geodesic Graph Neural Network for Efficient Graph Representation Learning","date":"2022-10-06","arxiv_id":"2210.02636","repositories_listed":1,"syntology":{"n":5,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"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) · 4 unverified","sample_list":"/paper/geodesic-graph-neural-network-for-efficient#ran","syntology_url":"https://syntology.ai/paper/2210.02636","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.02636"}},"official":{"repos":["woodcutter1998/gdgnn"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/grape-knowledge-graph-enhanced-passage-reader","slug":"grape-knowledge-graph-enhanced-passage-reader","title":"Grape: Knowledge Graph Enhanced Passage Reader for Open-domain Question Answering","date":"2022-10-06","arxiv_id":"2210.02933","repositories_listed":1,"syntology":null},{"url":"/paper/ddos-a-graph-neural-network-based-drug","slug":"ddos-a-graph-neural-network-based-drug","title":"DDoS: A Graph Neural Network based Drug Synergy Prediction Algorithm","date":"2022-10-03","arxiv_id":"2210.00802","repositories_listed":1,"syntology":null},{"url":"/paper/deep-spatial-domain-generalization","slug":"deep-spatial-domain-generalization","title":"Deep Spatial Domain Generalization","date":"2022-10-03","arxiv_id":"2210.00729","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":2,"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/deep-spatial-domain-generalization#ran","syntology_url":"https://syntology.ai/paper/2210.00729","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.00729"}},"official":{"repos":["dyu62/deep-domain-generalization"],"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/heterogeneous-graph-neural-network-for-2","slug":"heterogeneous-graph-neural-network-for-2","title":"Heterogeneous Graph Neural Network for Privacy-Preserving Recommendation","date":"2022-10-02","arxiv_id":"2210.00538","repositories_listed":1,"syntology":null},{"url":"/paper/inability-of-a-graph-neural-network-heuristic","slug":"inability-of-a-graph-neural-network-heuristic","title":"Inability of a graph neural network heuristic to outperform greedy algorithms in solving combinatorial optimization problems like Max-Cut","date":"2022-10-02","arxiv_id":"2210.00623","repositories_listed":1,"syntology":null},{"url":"/paper/multi-graph-neural-network-for-extractive","slug":"multi-graph-neural-network-for-extractive","title":"Multi Graph Neural Network for Extractive Long Document Summarization","date":"2022-10-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/multi-level-community-awareness-graph-neural","slug":"multi-level-community-awareness-graph-neural","title":"Multi-level Community-awareness Graph Neural Networks for Neural Machine Translation","date":"2022-10-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/social-bot-aware-graph-neural-network-for","slug":"social-bot-aware-graph-neural-network-for","title":"Social Bot-Aware Graph Neural Network for Early Rumor Detection","date":"2022-10-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/modelangelo-automated-model-building-in-cryo","slug":"modelangelo-automated-model-building-in-cryo","title":"A Graph Neural Network Approach to Automated Model Building in Cryo-EM Maps","date":"2022-09-30","arxiv_id":"2210.00006","repositories_listed":1,"syntology":null},{"url":"/paper/ll-gnn-low-latency-graph-neural-networks-on","slug":"ll-gnn-low-latency-graph-neural-networks-on","title":"LL-GNN: Low Latency Graph Neural Networks on FPGAs for High Energy Physics","date":"2022-09-28","arxiv_id":"2209.14065","repositories_listed":1,"syntology":null},{"url":"/paper/pareto-actor-critic-for-equilibrium-selection","slug":"pareto-actor-critic-for-equilibrium-selection","title":"Pareto Actor-Critic for Equilibrium Selection in Multi-Agent Reinforcement Learning","date":"2022-09-28","arxiv_id":"2209.14344","repositories_listed":1,"syntology":null},{"url":"/paper/explainable-graph-pyramid-autoformer-for-long","slug":"explainable-graph-pyramid-autoformer-for-long","title":"Explainable Graph Pyramid Autoformer for Long-Term Traffic Forecasting","date":"2022-09-27","arxiv_id":"2209.13123","repositories_listed":1,"syntology":null},{"url":"/paper/on-representing-linear-programs-by-graph","slug":"on-representing-linear-programs-by-graph","title":"On Representing Linear Programs by Graph Neural Networks","date":"2022-09-25","arxiv_id":"2209.12288","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":2,"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) · 1 unverified","sample_list":"/paper/on-representing-linear-programs-by-graph#ran","syntology_url":"https://syntology.ai/paper/2209.12288","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2209.12288"}},"official":{"repos":["liujl11git/GNN-LP"],"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"]}}},{"url":"/paper/learning-rigid-body-dynamics-with-lagrangian","slug":"learning-rigid-body-dynamics-with-lagrangian","title":"Learning Articulated Rigid Body Dynamics with Lagrangian Graph Neural Network","date":"2022-09-23","arxiv_id":"2209.11588","repositories_listed":1,"syntology":{"n":7,"n_ran":4,"n_constructed":0,"n_ran_checked":2,"n_instrument":2,"n_unverified":3,"n_honours":1,"n_violates":1,"n_no_contract":0,"n_pointer_only":1,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 1 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/learning-rigid-body-dynamics-with-lagrangian#ran","syntology_url":"https://syntology.ai/paper/2209.11588","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2209.11588"}},"official":{"repos":["m3rg-iitd/rigid_body_dynamics_graph"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":3,"ran_from_kinds":["official","unlocated"]}}},{"url":"/paper/a-simple-temporal-information-matching","slug":"a-simple-temporal-information-matching","title":"A Simple Temporal Information Matching Mechanism for Entity Alignment Between Temporal Knowledge Graphs","date":"2022-09-20","arxiv_id":"2209.09677","repositories_listed":1,"syntology":null},{"url":"/paper/dynamic-relevance-graph-network-for-knowledge-1","slug":"dynamic-relevance-graph-network-for-knowledge-1","title":"Dynamic Relevance Graph Network for Knowledge-Aware Question Answering","date":"2022-09-20","arxiv_id":"2209.09947","repositories_listed":1,"syntology":null},{"url":"/paper/a-generalized-template-based-graph-neural","slug":"a-generalized-template-based-graph-neural","title":"A generalized-template-based graph neural network for accurate organic reactivity prediction","date":"2022-09-15","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/earthquake-phase-association-with-graph","slug":"earthquake-phase-association-with-graph","title":"Earthquake Phase Association with Graph Neural Networks","date":"2022-09-15","arxiv_id":"2209.07086","repositories_listed":1,"syntology":null},{"url":"/paper/meta-reggnn-predicting-verbal-and-full-scale","slug":"meta-reggnn-predicting-verbal-and-full-scale","title":"Meta-RegGNN: Predicting Verbal and Full-Scale Intelligence Scores using Graph Neural Networks and Meta-Learning","date":"2022-09-14","arxiv_id":"2209.13530","repositories_listed":1,"syntology":null},{"url":"/paper/predicting-brain-multigraph-population-from-a","slug":"predicting-brain-multigraph-population-from-a","title":"Predicting Brain Multigraph Population From a Single Graph Template for Boosting One-Shot Classification","date":"2022-09-13","arxiv_id":"2209.06005","repositories_listed":1,"syntology":null},{"url":"/paper/analyzing-the-effect-of-sampling-in-gnns-on","slug":"analyzing-the-effect-of-sampling-in-gnns-on","title":"Analyzing the Effect of Sampling in GNNs on Individual Fairness","date":"2022-09-08","arxiv_id":"2209.03904","repositories_listed":1,"syntology":null},{"url":"/paper/graph-neural-networks-for-low-energy-event","slug":"graph-neural-networks-for-low-energy-event","title":"Graph Neural Networks for Low-Energy Event Classification & Reconstruction in IceCube","date":"2022-09-07","arxiv_id":"2209.03042","repositories_listed":1,"syntology":null},{"url":"/paper/sr-gnn-spatial-relation-aware-graph-neural","slug":"sr-gnn-spatial-relation-aware-graph-neural","title":"SR-GNN: Spatial Relation-aware Graph Neural Network for Fine-Grained Image Categorization","date":"2022-09-05","arxiv_id":"2209.02109","repositories_listed":1,"syntology":null}],"record_sha256":"0cc86f2416c97b8d73baa0dde28c58f1b880c2b6da41eadba96e7460bc4d4683","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}