{"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/10","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":10,"pages_in_order":36,"rows_per_page":100,"rows":[901,1000],"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/9","next":"/task/graph-neural-network/papers/11","papers":[{"url":"/paper/a-novel-approach-for-pill-prescription","slug":"a-novel-approach-for-pill-prescription","title":"A Novel Approach for Pill-Prescription Matching with GNN Assistance and Contrastive Learning","date":"2022-09-02","arxiv_id":"2209.01152","repositories_listed":1,"syntology":null},{"url":"/paper/efficient-chemical-space-exploration-using","slug":"efficient-chemical-space-exploration-using","title":"Efficient Chemical Space Exploration Using Active Learning Based on Marginalized Graph Kernel: an Application for Predicting the Thermodynamic Properties of Alkanes with Molecular Simulation","date":"2022-09-01","arxiv_id":"2209.00514","repositories_listed":1,"syntology":null},{"url":"/paper/msgnn-a-spectral-graph-neural-network-based","slug":"msgnn-a-spectral-graph-neural-network-based","title":"MSGNN: A Spectral Graph Neural Network Based on a Novel Magnetic Signed Laplacian","date":"2022-09-01","arxiv_id":"2209.00546","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/msgnn-a-spectral-graph-neural-network-based#ran","syntology_url":"https://syntology.ai/paper/2209.00546","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2209.00546"}},"official":{"repos":["sherylhyx/msgnn"],"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/learning-tree-structures-from-leaves-for","slug":"learning-tree-structures-from-leaves-for","title":"Learning Tree Structures from Leaves For Particle Decay Reconstruction","date":"2022-08-31","arxiv_id":"2208.14924","repositories_listed":1,"syntology":null},{"url":"/paper/spatio-temporal-wind-speed-forecasting-using","slug":"spatio-temporal-wind-speed-forecasting-using","title":"Spatio-Temporal Wind Speed Forecasting using Graph Networks and Novel Transformer Architectures","date":"2022-08-29","arxiv_id":"2208.13585","repositories_listed":1,"syntology":null},{"url":"/paper/learning-heterogeneous-interaction-strengths","slug":"learning-heterogeneous-interaction-strengths","title":"Learning Heterogeneous Interaction Strengths by Trajectory Prediction with Graph Neural Network","date":"2022-08-28","arxiv_id":"2208.13179","repositories_listed":1,"syntology":null},{"url":"/paper/data-augmentation-on-graphs-for-table-type","slug":"data-augmentation-on-graphs-for-table-type","title":"Data augmentation on graphs for table type classification","date":"2022-08-23","arxiv_id":"2208.11210","repositories_listed":1,"syntology":null},{"url":"/paper/epignn-exploring-spatial-transmission-with","slug":"epignn-exploring-spatial-transmission-with","title":"EpiGNN: Exploring Spatial Transmission with Graph Neural Network for Regional Epidemic Forecasting","date":"2022-08-23","arxiv_id":"2208.11517","repositories_listed":1,"syntology":null},{"url":"/paper/flexer-flexible-entity-resolution-for","slug":"flexer-flexible-entity-resolution-for","title":"FlexER: Flexible Entity Resolution for Multiple Intents","date":"2022-08-23","arxiv_id":"2209.07569","repositories_listed":1,"syntology":null},{"url":"/paper/one-model-any-csp-graph-neural-networks-as","slug":"one-model-any-csp-graph-neural-networks-as","title":"One Model, Any CSP: Graph Neural Networks as Fast Global Search Heuristics for Constraint Satisfaction","date":"2022-08-22","arxiv_id":"2208.10227","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/one-model-any-csp-graph-neural-networks-as#ran","syntology_url":"https://syntology.ai/paper/2208.10227","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2208.10227"}},"official":{"repos":["toenshoff/runcsp-pytorch"],"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/molgraph-a-python-package-for-the","slug":"molgraph-a-python-package-for-the","title":"MolGraph: a Python package for the implementation of molecular graphs and graph neural networks with TensorFlow and Keras","date":"2022-08-21","arxiv_id":"2208.09944","repositories_listed":1,"syntology":null},{"url":"/paper/ginex-ssd-enabled-billion-scale-graph-neural","slug":"ginex-ssd-enabled-billion-scale-graph-neural","title":"Ginex: SSD-enabled Billion-scale Graph Neural Network Training on a Single Machine via Provably Optimal In-memory Caching","date":"2022-08-19","arxiv_id":"2208.09151","repositories_listed":1,"syntology":null},{"url":"/paper/grato-graph-neural-network-framework-tackling","slug":"grato-graph-neural-network-framework-tackling","title":"GraTO: Graph Neural Network Framework Tackling Over-smoothing with Neural Architecture Search","date":"2022-08-18","arxiv_id":"2208.09027","repositories_listed":1,"syntology":null},{"url":"/paper/robust-causal-graph-representation-learning","slug":"robust-causal-graph-representation-learning","title":"Robust Causal Graph Representation Learning against Confounding Effects","date":"2022-08-18","arxiv_id":"2208.08584","repositories_listed":1,"syntology":{"n":3,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"0 ran · 3 unverified","sample_list":"/paper/robust-causal-graph-representation-learning#ran","syntology_url":"https://syntology.ai/paper/2208.08584","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2208.08584"}},"official":{"repos":["hang53/rcgrl"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":3,"ran_from_kinds":[]}}},{"url":"/paper/mm-gnn-mix-moment-graph-neural-network","slug":"mm-gnn-mix-moment-graph-neural-network","title":"MM-GNN: Mix-Moment Graph Neural Network towards Modeling Neighborhood Feature Distribution","date":"2022-08-15","arxiv_id":"2208.07012","repositories_listed":1,"syntology":{"n":5,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":3,"n_honours":1,"n_violates":1,"n_no_contract":0,"n_pointer_only":5,"phrase":"2 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; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/mm-gnn-mix-moment-graph-neural-network#ran","syntology_url":"https://syntology.ai/paper/2208.07012","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2208.07012"}},"official":{"repos":["wendongbi/MMGNN"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/eegnn-edge-enhanced-graph-neural-networks","slug":"eegnn-edge-enhanced-graph-neural-networks","title":"EEGNN: Edge Enhanced Graph Neural Network with a Bayesian Nonparametric Graph Model","date":"2022-08-12","arxiv_id":"2208.06322","repositories_listed":1,"syntology":null},{"url":"/paper/partition-pooling-for-convolutional-graph","slug":"partition-pooling-for-convolutional-graph","title":"Partition Pooling for Convolutional Graph Network Applications in Particle Physics","date":"2022-08-11","arxiv_id":"2208.05952","repositories_listed":1,"syntology":null},{"url":"/paper/uncertainty-quantification-of-sparse-travel","slug":"uncertainty-quantification-of-sparse-travel","title":"Uncertainty Quantification of Sparse Travel Demand Prediction with Spatial-Temporal Graph Neural Networks","date":"2022-08-11","arxiv_id":"2208.05908","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/uncertainty-quantification-of-sparse-travel#ran","syntology_url":"https://syntology.ai/paper/2208.05908","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2208.05908"}},"official":{"repos":["zhuangdingyi/stzinb"],"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/path-aware-siamese-graph-neural-network-for","slug":"path-aware-siamese-graph-neural-network-for","title":"Path-aware Siamese Graph Neural Network for Link Prediction","date":"2022-08-10","arxiv_id":"2208.05781","repositories_listed":1,"syntology":null},{"url":"/paper/neuro-symbolic-computing-with-spiking-neural","slug":"neuro-symbolic-computing-with-spiking-neural","title":"Neuro-symbolic computing with spiking neural networks","date":"2022-08-04","arxiv_id":"2208.02576","repositories_listed":1,"syntology":null},{"url":"/paper/semantic-interleaving-global-channel","slug":"semantic-interleaving-global-channel","title":"Semantic Interleaving Global Channel Attention for Multilabel Remote Sensing Image Classification","date":"2022-08-04","arxiv_id":"2208.02613","repositories_listed":1,"syntology":null},{"url":"/paper/grown-up-a-graph-representation-of-a-webpage","slug":"grown-up-a-graph-representation-of-a-webpage","title":"GROWN+UP: A Graph Representation Of a Webpage Network Utilizing Pre-training","date":"2022-08-03","arxiv_id":"2208.02252","repositories_listed":1,"syntology":null},{"url":"/paper/robust-graph-neural-networks-using-weighted","slug":"robust-graph-neural-networks-using-weighted","title":"Robust Graph Neural Networks using Weighted Graph Laplacian","date":"2022-08-03","arxiv_id":"2208.01853","repositories_listed":1,"syntology":null},{"url":"/paper/adapting-triplet-importance-of-implicit","slug":"adapting-triplet-importance-of-implicit","title":"Adapting Triplet Importance of Implicit Feedback for Personalized Recommendation","date":"2022-08-02","arxiv_id":"2208.01709","repositories_listed":1,"syntology":null},{"url":"/paper/graph-neural-network-with-local-frame-for","slug":"graph-neural-network-with-local-frame-for","title":"Graph Neural Network with Local Frame for Molecular Potential Energy Surface","date":"2022-08-01","arxiv_id":"2208.00716","repositories_listed":1,"syntology":null},{"url":"/paper/factorial-user-modeling-with-hierarchical","slug":"factorial-user-modeling-with-hierarchical","title":"Factorial User Modeling with Hierarchical Graph Neural Network for Enhanced Sequential Recommendation","date":"2022-07-27","arxiv_id":"2207.13262","repositories_listed":1,"syntology":null},{"url":"/paper/learned-label-aggregation-for-weak","slug":"learned-label-aggregation-for-weak","title":"Learning Hyper Label Model for Programmatic Weak Supervision","date":"2022-07-27","arxiv_id":"2207.13545","repositories_listed":1,"syntology":{"n":14,"n_ran":6,"n_constructed":0,"n_ran_checked":4,"n_instrument":2,"n_unverified":8,"n_honours":1,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 1 honoured, 0 violated, 3 with no contract checked; 2 where Syntology's instrument failed) · 8 unverified","sample_list":"/paper/learned-label-aggregation-for-weak#ran","syntology_url":"https://syntology.ai/paper/2207.13545","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2207.13545"}},"official":{"repos":["wurenzhi/hyper_label_model"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":8,"ran_from_kinds":["official"]}}},{"url":"/paper/sgat-simplicial-graph-attention-network","slug":"sgat-simplicial-graph-attention-network","title":"SGAT: Simplicial Graph Attention Network","date":"2022-07-24","arxiv_id":"2207.11761","repositories_listed":1,"syntology":null},{"url":"/paper/distributed-nonlinear-state-estimation-in","slug":"distributed-nonlinear-state-estimation-in","title":"Distributed Nonlinear State Estimation in Electric Power Systems using Graph Neural Networks","date":"2022-07-23","arxiv_id":"2207.11465","repositories_listed":1,"syntology":null},{"url":"/paper/beyond-homophily-structure-aware-path","slug":"beyond-homophily-structure-aware-path","title":"Beyond Homophily: Structure-aware Path Aggregation Graph Neural Network","date":"2022-07-20","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/posernet-refining-relative-camera-poses","slug":"posernet-refining-relative-camera-poses","title":"PoserNet: Refining Relative Camera Poses Exploiting Object Detections","date":"2022-07-19","arxiv_id":"2207.09445","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/posernet-refining-relative-camera-poses#ran","syntology_url":"https://syntology.ai/paper/2207.09445","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2207.09445"}},"official":{"repos":["iit-pavis/posernet"],"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/simplifying-clustering-with-graph-neural","slug":"simplifying-clustering-with-graph-neural","title":"Simplifying Clustering with Graph Neural Networks","date":"2022-07-18","arxiv_id":"2207.08779","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"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) · 0 unverified","sample_list":"/paper/simplifying-clustering-with-graph-neural#ran","syntology_url":"https://syntology.ai/paper/2207.08779","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2207.08779"}},"official":{"repos":["filippomb/simplifying-clustering-with-graph-neural-networks"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/graph-property-prediction-on-open-graph","slug":"graph-property-prediction-on-open-graph","title":"Graph Property Prediction on Open Graph Benchmark: A Winning Solution by Graph Neural Architecture Search","date":"2022-07-13","arxiv_id":"2207.06027","repositories_listed":1,"syntology":null},{"url":"/paper/qt-routenet-improved-gnn-generalization-to","slug":"qt-routenet-improved-gnn-generalization-to","title":"QT-Routenet: Improved GNN generalization to larger 5G networks by fine-tuning predictions from queueing theory","date":"2022-07-13","arxiv_id":"2207.06336","repositories_listed":1,"syntology":null},{"url":"/paper/the-cosmic-graph-optimal-information","slug":"the-cosmic-graph-optimal-information","title":"The Cosmic Graph: Optimal Information Extraction from Large-Scale Structure using Catalogues","date":"2022-07-11","arxiv_id":"2207.05202","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":1,"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) · 1 unverified","sample_list":"/paper/the-cosmic-graph-optimal-information#ran","syntology_url":"https://syntology.ai/paper/2207.05202","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2207.05202"}},"official":{"repos":["tlmakinen/cosmicgraphs"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/state-augmented-learnable-algorithms-for","slug":"state-augmented-learnable-algorithms-for","title":"State-Augmented Learnable Algorithms for Resource Management in Wireless Networks","date":"2022-07-05","arxiv_id":"2207.02242","repositories_listed":1,"syntology":null},{"url":"/paper/cross-document-misinformation-detection-based-1","slug":"cross-document-misinformation-detection-based-1","title":"Cross-document Misinformation Detection based on Event Graph Reasoning","date":"2022-07-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/explicit-graph-reasoning-fusing-knowledge-and","slug":"explicit-graph-reasoning-fusing-knowledge-and","title":"Explicit Graph Reasoning Fusing Knowledge and Contextual Information for Multi-hop Question Answering","date":"2022-07-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/great-truths-are-always-simple-a-rather-2","slug":"great-truths-are-always-simple-a-rather-2","title":"Great~Truths~are ~Always ~Simple: A Rather Simple Knowledge Encoder for Enhancing the Commonsense Reasoning Capacity of Pre-Trained Models","date":"2022-07-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/trajectory-forecasting-on-temporal-graphs","slug":"trajectory-forecasting-on-temporal-graphs","title":"Trajectory Forecasting on Temporal Graphs","date":"2022-07-01","arxiv_id":"2207.00255","repositories_listed":1,"syntology":null},{"url":"/paper/transforming-pagerank-into-an-infinite-depth","slug":"transforming-pagerank-into-an-infinite-depth","title":"Transforming PageRank into an Infinite-Depth Graph Neural Network","date":"2022-07-01","arxiv_id":"2207.00684","repositories_listed":1,"syntology":null},{"url":"/paper/bagel-a-benchmark-for-assessing-graph-neural","slug":"bagel-a-benchmark-for-assessing-graph-neural","title":"BAGEL: A Benchmark for Assessing Graph Neural Network Explanations","date":"2022-06-28","arxiv_id":"2206.13983","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":1,"n_honours":1,"n_violates":2,"n_no_contract":0,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 1 honoured, 2 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/bagel-a-benchmark-for-assessing-graph-neural#ran","syntology_url":"https://syntology.ai/paper/2206.13983","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.13983"}},"official":{"repos":["mandeep-rathee/bagel-benchmark"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/learning-the-evolutionary-and-multi-scale","slug":"learning-the-evolutionary-and-multi-scale","title":"Learning the Evolutionary and Multi-scale Graph Structure for Multivariate Time Series Forecasting","date":"2022-06-28","arxiv_id":"2206.13816","repositories_listed":1,"syntology":null},{"url":"/paper/automatic-identification-of-segmentation","slug":"automatic-identification-of-segmentation","title":"Automatic identification of segmentation errors for radiotherapy using geometric learning","date":"2022-06-27","arxiv_id":"2206.13317","repositories_listed":1,"syntology":null},{"url":"/paper/cracking-nuts-with-a-sledgehammer-when-modern","slug":"cracking-nuts-with-a-sledgehammer-when-modern","title":"Modern graph neural networks do worse than classical greedy algorithms in solving combinatorial optimization problems like maximum independent set","date":"2022-06-27","arxiv_id":"2206.13211","repositories_listed":1,"syntology":null},{"url":"/paper/learning-to-control-local-search-for","slug":"learning-to-control-local-search-for","title":"Learning to Control Local Search for Combinatorial Optimization","date":"2022-06-27","arxiv_id":"2206.13181","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":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) · 1 unverified","sample_list":"/paper/learning-to-control-local-search-for#ran","syntology_url":"https://syntology.ai/paper/2206.13181","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.13181"}},"official":{"repos":["jokofa/neurols"],"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/image-aesthetics-assessment-using-graph","slug":"image-aesthetics-assessment-using-graph","title":"Image Aesthetics Assessment Using Graph Attention Network","date":"2022-06-26","arxiv_id":"2206.12869","repositories_listed":1,"syntology":null},{"url":"/paper/retrograph-retrosynthetic-planning-with-graph","slug":"retrograph-retrosynthetic-planning-with-graph","title":"RetroGraph: Retrosynthetic Planning with Graph Search","date":"2022-06-23","arxiv_id":"2206.11477","repositories_listed":1,"syntology":null},{"url":"/paper/agent-based-graph-neural-networks","slug":"agent-based-graph-neural-networks","title":"Agent-based Graph Neural Networks","date":"2022-06-22","arxiv_id":"2206.11010","repositories_listed":1,"syntology":{"n":7,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":3,"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) · 3 unverified","sample_list":"/paper/agent-based-graph-neural-networks#ran","syntology_url":"https://syntology.ai/paper/2206.11010","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.11010"}},"official":{"repos":["karolismart/agentnet"],"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/graph-neural-network-aided-mu-mimo-detectors","slug":"graph-neural-network-aided-mu-mimo-detectors","title":"Graph Neural Network Aided MU-MIMO Detectors","date":"2022-06-19","arxiv_id":"2206.09381","repositories_listed":1,"syntology":null},{"url":"/paper/decoupled-dynamic-spatial-temporal-graph","slug":"decoupled-dynamic-spatial-temporal-graph","title":"Decoupled Dynamic Spatial-Temporal Graph Neural Network for Traffic Forecasting","date":"2022-06-18","arxiv_id":"2206.09112","repositories_listed":1,"syntology":null},{"url":"/paper/nas-bench-graph-benchmarking-graph-neural","slug":"nas-bench-graph-benchmarking-graph-neural","title":"NAS-Bench-Graph: Benchmarking Graph Neural Architecture Search","date":"2022-06-18","arxiv_id":"2206.09166","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/nas-bench-graph-benchmarking-graph-neural#ran","syntology_url":"https://syntology.ai/paper/2206.09166","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.09166"}},"official":{"repos":["thumnlab/nas-bench-graph"],"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/comenet-towards-complete-and-efficient","slug":"comenet-towards-complete-and-efficient","title":"ComENet: Towards Complete and Efficient Message Passing for 3D Molecular Graphs","date":"2022-06-17","arxiv_id":"2206.08515","repositories_listed":1,"syntology":null},{"url":"/paper/sheaf-neural-networks-with-connection","slug":"sheaf-neural-networks-with-connection","title":"Sheaf Neural Networks with Connection Laplacians","date":"2022-06-17","arxiv_id":"2206.08702","repositories_listed":1,"syntology":null},{"url":"/paper/reinforcement-learning-enhanced-shared","slug":"reinforcement-learning-enhanced-shared","title":"Reinforcement Learning-enhanced Shared-account Cross-domain Sequential Recommendation","date":"2022-06-16","arxiv_id":"2206.08088","repositories_listed":1,"syntology":null},{"url":"/paper/time-interval-enhanced-graph-neural-network","slug":"time-interval-enhanced-graph-neural-network","title":"Time Interval-enhanced Graph Neural Network for Shared-account Cross-domain Sequential Recommendation","date":"2022-06-16","arxiv_id":"2206.08050","repositories_listed":1,"syntology":null},{"url":"/paper/tbdfs-temporal-graph-neural-network","slug":"tbdfs-temporal-graph-neural-network","title":"tBDFS: Temporal Graph Neural Network Leveraging DFS","date":"2022-06-12","arxiv_id":"2206.05692","repositories_listed":1,"syntology":null},{"url":"/paper/soft-mask-adaptive-substructure-extractions","slug":"soft-mask-adaptive-substructure-extractions","title":"Soft-mask: Adaptive Substructure Extractions for Graph Neural Networks","date":"2022-06-11","arxiv_id":"2206.05499","repositories_listed":1,"syntology":null},{"url":"/paper/deeptpi-test-point-insertion-with-deep","slug":"deeptpi-test-point-insertion-with-deep","title":"DeepTPI: Test Point Insertion with Deep Reinforcement Learning","date":"2022-06-07","arxiv_id":"2206.06975","repositories_listed":1,"syntology":null},{"url":"/paper/improving-fairness-in-graph-neural-networks","slug":"improving-fairness-in-graph-neural-networks","title":"Improving Fairness in Graph Neural Networks via Mitigating Sensitive Attribute Leakage","date":"2022-06-07","arxiv_id":"2206.03426","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":1,"phrase":"0 ran · 1 unverified","sample_list":"/paper/improving-fairness-in-graph-neural-networks#ran","syntology_url":"https://syntology.ai/paper/2206.03426","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.03426"}},"official":{"repos":["yuwvandy/fairvgnn"],"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/efficient-and-accurate-physics-aware","slug":"efficient-and-accurate-physics-aware","title":"Efficient and Accurate Physics-aware Multiplex Graph Neural Networks for 3D Small Molecules and Macromolecule Complexes","date":"2022-06-06","arxiv_id":"2206.02789","repositories_listed":1,"syntology":null},{"url":"/paper/investigating-brain-connectivity-with-graph","slug":"investigating-brain-connectivity-with-graph","title":"Investigating Brain Connectivity with Graph Neural Networks and GNNExplainer","date":"2022-06-04","arxiv_id":"2206.01930","repositories_listed":1,"syntology":null},{"url":"/paper/can-hybrid-geometric-scattering-networks-help","slug":"can-hybrid-geometric-scattering-networks-help","title":"Can Hybrid Geometric Scattering Networks Help Solve the Maximum Clique Problem?","date":"2022-06-03","arxiv_id":"2206.01506","repositories_listed":1,"syntology":{"n":8,"n_ran":4,"n_constructed":1,"n_ran_checked":2,"n_instrument":2,"n_unverified":4,"n_honours":1,"n_violates":0,"n_no_contract":1,"n_pointer_only":8,"phrase":"4 ran (of which 1 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 0 violated, 1 with no contract checked; 2 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/can-hybrid-geometric-scattering-networks-help#ran","syntology_url":"https://syntology.ai/paper/2206.01506","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.01506"}},"official":{"repos":["yimengmin/geometricscatteringmaximalclique"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":1,"n_ran_no_instrument_failure":2,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/a-federated-graph-neural-network-framework","slug":"a-federated-graph-neural-network-framework","title":"A federated graph neural network framework for privacy-preserving personalization","date":"2022-06-02","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/invertible-neural-networks-for-graph","slug":"invertible-neural-networks-for-graph","title":"Invertible Neural Networks for Graph Prediction","date":"2022-06-02","arxiv_id":"2206.01163","repositories_listed":1,"syntology":null},{"url":"/paper/shortest-path-networks-for-graph-property","slug":"shortest-path-networks-for-graph-property","title":"Shortest Path Networks for Graph Property Prediction","date":"2022-06-02","arxiv_id":"2206.01003","repositories_listed":1,"syntology":null},{"url":"/paper/augmenting-message-passing-by-retrieving","slug":"augmenting-message-passing-by-retrieving","title":"An Empirical Study of Retrieval-enhanced Graph Neural Networks","date":"2022-06-01","arxiv_id":"2206.00362","repositories_listed":1,"syntology":null},{"url":"/paper/induct-gcn-inductive-graph-convolutional-1","slug":"induct-gcn-inductive-graph-convolutional-1","title":"InducT-GCN: Inductive Graph Convolutional Networks for Text Classification","date":"2022-06-01","arxiv_id":"2206.00265","repositories_listed":1,"syntology":null},{"url":"/paper/neural-improvement-heuristics-for-preference","slug":"neural-improvement-heuristics-for-preference","title":"Neural Improvement Heuristics for Graph Combinatorial Optimization Problems","date":"2022-06-01","arxiv_id":"2206.00383","repositories_listed":1,"syntology":null},{"url":"/paper/label-enhanced-graph-neural-network-for-semi","slug":"label-enhanced-graph-neural-network-for-semi","title":"Label-Enhanced Graph Neural Network for Semi-supervised Node Classification","date":"2022-05-31","arxiv_id":"2205.15653","repositories_listed":1,"syntology":null},{"url":"/paper/rethinking-graph-neural-networks-for-anomaly","slug":"rethinking-graph-neural-networks-for-anomaly","title":"Rethinking Graph Neural Networks for Anomaly Detection","date":"2022-05-31","arxiv_id":"2205.15508","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":1,"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; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/rethinking-graph-neural-networks-for-anomaly#ran","syntology_url":"https://syntology.ai/paper/2205.15508","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.15508"}},"official":{"repos":["squareroot3/rethinking-anomaly-detection"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/template-based-graph-neural-network-with","slug":"template-based-graph-neural-network-with","title":"Template based Graph Neural Network with Optimal Transport Distances","date":"2022-05-31","arxiv_id":"2205.15733","repositories_listed":1,"syntology":null},{"url":"/paper/bias-reduction-via-cooperative-bargaining-in","slug":"bias-reduction-via-cooperative-bargaining-in","title":"Bias Reduction via Cooperative Bargaining in Synthetic Graph Dataset Generation","date":"2022-05-27","arxiv_id":"2205.13901","repositories_listed":1,"syntology":null},{"url":"/paper/geometer-graph-few-shot-class-incremental","slug":"geometer-graph-few-shot-class-incremental","title":"Geometer: Graph Few-Shot Class-Incremental Learning via Prototype Representation","date":"2022-05-27","arxiv_id":"2205.13954","repositories_listed":1,"syntology":{"n":6,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":4,"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) · 4 unverified","sample_list":"/paper/geometer-graph-few-shot-class-incremental#ran","syntology_url":"https://syntology.ai/paper/2205.13954","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.13954"}},"official":{"repos":["RobinLu1209/Geometer"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/mip-gnn-a-data-driven-framework-for-guiding","slug":"mip-gnn-a-data-driven-framework-for-guiding","title":"MIP-GNN: A Data-Driven Framework for Guiding Combinatorial Solvers","date":"2022-05-27","arxiv_id":"2205.14210","repositories_listed":1,"syntology":null},{"url":"/paper/reinforcement-learning-approach-for-mapping","slug":"reinforcement-learning-approach-for-mapping","title":"Reinforcement Learning Approach for Mapping Applications to Dataflow-Based Coarse-Grained Reconfigurable Array","date":"2022-05-26","arxiv_id":"2205.13675","repositories_listed":1,"syntology":null},{"url":"/paper/transformer-for-partial-differential","slug":"transformer-for-partial-differential","title":"Transformer for Partial Differential Equations' Operator Learning","date":"2022-05-26","arxiv_id":"2205.13671","repositories_listed":1,"syntology":{"n":13,"n_ran":12,"n_constructed":0,"n_ran_checked":12,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":1,"n_no_contract":11,"n_pointer_only":0,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 12 with no instrument failure: 0 honoured, 1 violated, 11 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/transformer-for-partial-differential#ran","syntology_url":"https://syntology.ai/paper/2205.13671","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.13671"}},"official":{"repos":["BaratiLab/OFormer"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":0,"n_ran_no_instrument_failure":12,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/fbnetgen-task-aware-gnn-based-fmri-analysis","slug":"fbnetgen-task-aware-gnn-based-fmri-analysis","title":"FBNETGEN: Task-aware GNN-based fMRI Analysis via Functional Brain Network Generation","date":"2022-05-25","arxiv_id":"2205.12465","repositories_listed":1,"syntology":null},{"url":"/paper/qgnn-value-function-factorisation-with-graph","slug":"qgnn-value-function-factorisation-with-graph","title":"QGNN: Value Function Factorisation with Graph Neural Networks","date":"2022-05-25","arxiv_id":"2205.13005","repositories_listed":1,"syntology":null},{"url":"/paper/ss-gnn-a-simple-structured-graph-neural","slug":"ss-gnn-a-simple-structured-graph-neural","title":"SS-GNN: A Simple-Structured Graph Neural Network for Affinity Prediction","date":"2022-05-25","arxiv_id":"2206.07015","repositories_listed":1,"syntology":null},{"url":"/paper/physics-embedded-neural-networks-boldsymbol","slug":"physics-embedded-neural-networks-boldsymbol","title":"Physics-Embedded Neural Networks: Graph Neural PDE Solvers with Mixed Boundary Conditions","date":"2022-05-24","arxiv_id":"2205.11912","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/physics-embedded-neural-networks-boldsymbol#ran","syntology_url":"https://syntology.ai/paper/2205.11912","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.11912"}},"official":{"repos":["yellowshippo/penn-neurips2022"],"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/recipe2vec-multi-modal-recipe-representation","slug":"recipe2vec-multi-modal-recipe-representation","title":"Recipe2Vec: Multi-modal Recipe Representation Learning with Graph Neural Networks","date":"2022-05-24","arxiv_id":"2205.12396","repositories_listed":1,"syntology":null},{"url":"/paper/deep-representations-for-time-varying-brain-1","slug":"deep-representations-for-time-varying-brain-1","title":"Deep Representations for Time-varying Brain Datasets","date":"2022-05-23","arxiv_id":"2205.11648","repositories_listed":1,"syntology":null},{"url":"/paper/egr-equivariant-graph-refinement-and","slug":"egr-equivariant-graph-refinement-and","title":"EGR: Equivariant Graph Refinement and Assessment of 3D Protein Complex Structures","date":"2022-05-20","arxiv_id":"2205.10390","repositories_listed":1,"syntology":null},{"url":"/paper/a-simple-yet-effective-svd-gcn-for-directed","slug":"a-simple-yet-effective-svd-gcn-for-directed","title":"A Simple Yet Effective SVD-GCN for Directed Graphs","date":"2022-05-19","arxiv_id":"2205.09335","repositories_listed":1,"syntology":{"n":6,"n_ran":5,"n_constructed":0,"n_ran_checked":0,"n_instrument":5,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":6,"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) · 1 unverified","sample_list":"/paper/a-simple-yet-effective-svd-gcn-for-directed#ran","syntology_url":"https://syntology.ai/paper/2205.09335","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.09335"}},"official":{"repos":["thisisforreview/svd-gcn"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/plane-geometry-diagram-parsing","slug":"plane-geometry-diagram-parsing","title":"Plane Geometry Diagram Parsing","date":"2022-05-19","arxiv_id":"2205.09363","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":2,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/plane-geometry-diagram-parsing#ran","syntology_url":"https://syntology.ai/paper/2205.09363","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.09363"}},"official":{"repos":["mingliangzhang2018/PGDP"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/a-graph-representation-of-molecular-ensembles","slug":"a-graph-representation-of-molecular-ensembles","title":"A graph representation of molecular ensembles for polymer property prediction","date":"2022-05-17","arxiv_id":"2205.08619","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"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) · 0 unverified","sample_list":"/paper/a-graph-representation-of-molecular-ensembles#ran","syntology_url":"https://syntology.ai/paper/2205.08619","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.08619"}},"official":{"repos":["coleygroup/polymer-chemprop-data"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/neural-symbolic-models-for-logical-queries-on","slug":"neural-symbolic-models-for-logical-queries-on","title":"Neural-Symbolic Models for Logical Queries on Knowledge Graphs","date":"2022-05-16","arxiv_id":"2205.10128","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":2,"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) · 1 unverified","sample_list":"/paper/neural-symbolic-models-for-logical-queries-on#ran","syntology_url":"https://syntology.ai/paper/2205.10128","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.10128"}},"official":{"repos":["DeepGraphLearning/GNN-QE"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/topology-aware-graph-neural-networks-for","slug":"topology-aware-graph-neural-networks-for","title":"Topology-aware Graph Neural Networks for Learning Feasible and Adaptive ac-OPF Solutions","date":"2022-05-16","arxiv_id":"2205.10129","repositories_listed":1,"syntology":null},{"url":"/paper/distribution-aware-graph-representation","slug":"distribution-aware-graph-representation","title":"Distribution-Aware Graph Representation Learning for Transient Stability Assessment of Power System","date":"2022-05-12","arxiv_id":"2205.06576","repositories_listed":1,"syntology":null},{"url":"/paper/a-neural-network-architecture-for-program-1","slug":"a-neural-network-architecture-for-program-1","title":"A Neural Network Architecture for Program Understanding Inspired by Human Behaviors","date":"2022-05-10","arxiv_id":"2206.04730","repositories_listed":1,"syntology":{"n":9,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":4,"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) · 4 unverified","sample_list":"/paper/a-neural-network-architecture-for-program-1#ran","syntology_url":"https://syntology.ai/paper/2206.04730","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.04730"}},"official":{"repos":["recklessronan/pgnn-ek"],"state":"official: no sample here; runs from other or unrecorded repositories","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["found_in_text"]}}},{"url":"/paper/meta-learning-based-knowledge-extrapolation","slug":"meta-learning-based-knowledge-extrapolation","title":"Meta-Learning Based Knowledge Extrapolation for Knowledge Graphs in the Federated Setting","date":"2022-05-10","arxiv_id":"2205.04692","repositories_listed":1,"syntology":null},{"url":"/paper/brainib-interpretable-brain-network-based","slug":"brainib-interpretable-brain-network-based","title":"BrainIB: Interpretable Brain Network-based Psychiatric Diagnosis with Graph Information Bottleneck","date":"2022-05-07","arxiv_id":"2205.03612","repositories_listed":1,"syntology":null},{"url":"/paper/great-truths-are-always-simple-a-rather-1","slug":"great-truths-are-always-simple-a-rather-1","title":"Great Truths are Always Simple: A Rather Simple Knowledge Encoder for Enhancing the Commonsense Reasoning Capacity of Pre-Trained Models","date":"2022-05-04","arxiv_id":"2205.01841","repositories_listed":1,"syntology":{"n":4,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 4 unverified","sample_list":"/paper/great-truths-are-always-simple-a-rather-1#ran","syntology_url":"https://syntology.ai/paper/2205.01841","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.01841"}},"official":{"repos":["rucaibox/safe"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":4,"ran_from_kinds":[]}}},{"url":"/paper/ru-net-regularized-unrolling-network-for","slug":"ru-net-regularized-unrolling-network-for","title":"RU-Net: Regularized Unrolling Network for Scene Graph Generation","date":"2022-05-03","arxiv_id":"2205.01297","repositories_listed":1,"syntology":{"n":5,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":2,"n_honours":1,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 1 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/ru-net-regularized-unrolling-network-for#ran","syntology_url":"https://syntology.ai/paper/2205.01297","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.01297"}},"official":{"repos":["siml3/ru-net"],"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/heterogeneous-graph-neural-network-for-power","slug":"heterogeneous-graph-neural-network-for-power","title":"Heterogeneous graph neural network for power allocation in multicarrier-division duplex cell-free massive MIMO systems","date":"2022-05-01","arxiv_id":"2205.00546","repositories_listed":1,"syntology":null},{"url":"/paper/learning-and-evaluating-character-1","slug":"learning-and-evaluating-character-1","title":"Learning and Evaluating Character Representations in Novels","date":"2022-05-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/a-practical-two-stage-ranking-framework-for","slug":"a-practical-two-stage-ranking-framework-for","title":"A Practical Two-stage Ranking Framework for Cross-market Recommendation","date":"2022-04-27","arxiv_id":"2204.12682","repositories_listed":1,"syntology":null},{"url":"/paper/flowgnn-a-dataflow-architecture-for-universal","slug":"flowgnn-a-dataflow-architecture-for-universal","title":"FlowGNN: A Dataflow Architecture for Real-Time Workload-Agnostic Graph Neural Network Inference","date":"2022-04-27","arxiv_id":"2204.13103","repositories_listed":1,"syntology":null},{"url":"/paper/euler-detecting-network-lateral-movement-via","slug":"euler-detecting-network-lateral-movement-via","title":"Euler: Detecting Network Lateral Movement via Scalable Temporal Link Prediction","date":"2022-04-24","arxiv_id":null,"repositories_listed":1,"syntology":null}],"record_sha256":"81c05ffa5778007f3fbbe929a9bf50c1f44a12b0bbfca187c7e36bc2bf78e927","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}