{"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","name":"Graph Neural Network","slug":"graph-neural-network","description_markdown":null,"categories":[{"name":"Graphs","url":"/area/graphs"}],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"derived"},"counts":{"papers_tagged":3598,"papers_with_code":1516,"benchmarks":1,"benchmark_tables_in_archive":1,"benchmark_tables_shown":1,"benchmark_tables_withheld_as_spam":0,"benchmark_definition":"a leaderboard table with at least one row; benchmark_tables_shown also counts the zero-row tables; benchmark_tables_in_archive adds the tables withheld as spam","datasets":0,"subtasks":0,"parent_tasks":2},"benchmarks":[{"leaderboard":"/sota/graph-neural-network-on","slug":"graph-neural-network-on","dataset":"..","dataset_url":null,"rows_in_archive":1,"metrics":["0S"],"first_row_in_archive_order":{"model":"air","paper_title":"HighAir: A Hierarchical Graph Neural Network-Based Air Quality Forecasting Method","paper_url":"/paper/highair-a-hierarchical-graph-neural-network","paper_date":"2021-01-12","arxiv_id":"2101.04264","code_links":[{"title":"Friger/HighAir","url":"https://github.com/Friger/HighAir"}],"syntology":null}}],"datasets":[],"subtasks":[],"parent_tasks":[{"url":"/task/privacy-preserving","name":"Privacy Preserving"},{"url":"/task/recommendation-systems","name":"Recommendation Systems"}],"papers":{"order":"repositories listed in the archive (most first), then date (newest first), then slug; the archive holds no stars","population":"every paper the archive tags with this task (distinct papers; spam titles not listed). 'of' counts the papers listed; until 2026-09-25 it counted only the papers with a code link, and that number is of_with_code","page":1,"pages_in_order":36,"rows_per_page":100,"shown":100,"of":3598,"of_with_code":1516,"tagged_in_all":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":298,"every_run_a_failure_of_syntologys_instrument":52,"listed_with_a_run_with_no_instrument_failure":298,"listed_every_run_a_failure_of_syntologys_instrument":52,"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"},"items":[{"url":"/paper/superglue-learning-feature-matching-with","slug":"superglue-learning-feature-matching-with","title":"SuperGlue: Learning Feature Matching with Graph Neural Networks","date":"2019-11-26","arxiv_id":"1911.11763","repositories_listed":19,"syntology":{"n":22,"n_ran":16,"n_constructed":0,"n_ran_checked":11,"n_instrument":5,"n_unverified":6,"n_honours":1,"n_violates":0,"n_no_contract":10,"n_pointer_only":6,"phrase":"16 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 1 honoured, 0 violated, 10 with no contract checked; 5 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/superglue-learning-feature-matching-with#ran","syntology_url":"https://syntology.ai/paper/1911.11763","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.11763"}},"official":{"repos":["magicleap/SuperGluePretrainedNetwork"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/hierarchical-graph-representation-learning","slug":"hierarchical-graph-representation-learning","title":"Hierarchical Graph Representation Learning with Differentiable Pooling","date":"2018-06-22","arxiv_id":"1806.08804","repositories_listed":14,"syntology":{"n":20,"n_ran":10,"n_constructed":0,"n_ran_checked":9,"n_instrument":1,"n_unverified":10,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":0,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 1 where Syntology's instrument failed) · 10 unverified","sample_list":"/paper/hierarchical-graph-representation-learning#ran","syntology_url":"https://syntology.ai/paper/1806.08804","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1806.08804"}},"official":null}},{"url":"/paper/gnn-explainer-a-tool-for-post-hoc-explanation","slug":"gnn-explainer-a-tool-for-post-hoc-explanation","title":"GNNExplainer: Generating Explanations for Graph Neural Networks","date":"2019-03-10","arxiv_id":"1903.03894","repositories_listed":12,"syntology":{"n":22,"n_ran":18,"n_constructed":0,"n_ran_checked":17,"n_instrument":1,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":17,"n_pointer_only":1,"phrase":"18 ran (of which 0 constructed an object rather than computing a result; 17 with no instrument failure: 0 honoured, 0 violated, 17 with no contract checked; 1 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/gnn-explainer-a-tool-for-post-hoc-explanation#ran","syntology_url":"https://syntology.ai/paper/1903.03894","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1903.03894"}},"official":{"repos":["RexYing/gnn-model-explainer"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":2,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/inductive-relation-prediction-on-knowledge","slug":"inductive-relation-prediction-on-knowledge","title":"Inductive Relation Prediction by Subgraph Reasoning","date":"2019-11-16","arxiv_id":"1911.06962","repositories_listed":10,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/inductive-relation-prediction-on-knowledge#ran","syntology_url":"https://syntology.ai/paper/1911.06962","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.06962"}},"official":{"repos":["kkteru/grail"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/link-prediction-based-on-graph-neural","slug":"link-prediction-based-on-graph-neural","title":"Link Prediction Based on Graph Neural Networks","date":"2018-02-27","arxiv_id":"1802.09691","repositories_listed":10,"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/link-prediction-based-on-graph-neural#ran","syntology_url":"https://syntology.ai/paper/1802.09691","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1802.09691"}},"official":{"repos":["muhanzhang/SEAL"],"state":"official: not harvested","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":[]}}},{"url":"/paper/190600121","slug":"190600121","title":"Graph WaveNet for Deep Spatial-Temporal Graph Modeling","date":"2019-05-31","arxiv_id":"1906.00121","repositories_listed":9,"syntology":{"n":7,"n_ran":5,"n_constructed":0,"n_ran_checked":2,"n_instrument":3,"n_unverified":2,"n_honours":0,"n_violates":2,"n_no_contract":0,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 2 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/190600121#ran","syntology_url":"https://syntology.ai/paper/1906.00121","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.00121"}},"official":{"repos":["nnzhan/Graph-WaveNet"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/graph-neural-networks-for-social","slug":"graph-neural-networks-for-social","title":"Graph Neural Networks for Social Recommendation","date":"2019-02-19","arxiv_id":"1902.07243","repositories_listed":9,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":1,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/graph-neural-networks-for-social#ran","syntology_url":"https://syntology.ai/paper/1902.07243","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1902.07243"}},"official":{"repos":["wenqifan03/GraphRec-WWW19"],"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":["listed","official"]}}},{"url":"/paper/kgat-knowledge-graph-attention-network-for","slug":"kgat-knowledge-graph-attention-network-for","title":"KGAT: Knowledge Graph Attention Network for Recommendation","date":"2019-05-20","arxiv_id":"1905.07854","repositories_listed":7,"syntology":{"n":13,"n_ran":10,"n_constructed":0,"n_ran_checked":6,"n_instrument":4,"n_unverified":3,"n_honours":0,"n_violates":1,"n_no_contract":5,"n_pointer_only":7,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 1 violated, 5 with no contract checked; 4 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/kgat-knowledge-graph-attention-network-for#ran","syntology_url":"https://syntology.ai/paper/1905.07854","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.07854"}},"official":{"repos":["xiangwang1223/knowledge_graph_attention_network"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/deepsphere-towards-an-equivariant-graph-based","slug":"deepsphere-towards-an-equivariant-graph-based","title":"DeepSphere: towards an equivariant graph-based spherical CNN","date":"2019-04-08","arxiv_id":"1904.05146","repositories_listed":7,"syntology":{"n":12,"n_ran":10,"n_constructed":0,"n_ran_checked":9,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":0,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/deepsphere-towards-an-equivariant-graph-based#ran","syntology_url":"https://syntology.ai/paper/1904.05146","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.05146"}},"official":{"repos":["deepsphere/deepsphere-tf1"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/chickenpox-cases-in-hungary-a-benchmark","slug":"chickenpox-cases-in-hungary-a-benchmark","title":"Chickenpox Cases in Hungary: a Benchmark Dataset for Spatiotemporal Signal Processing with Graph Neural Networks","date":"2021-02-16","arxiv_id":"2102.08100","repositories_listed":6,"syntology":null},{"url":"/paper/enhancing-graph-neural-network-based-fraud","slug":"enhancing-graph-neural-network-based-fraud","title":"Enhancing Graph Neural Network-based Fraud Detectors against Camouflaged Fraudsters","date":"2020-08-19","arxiv_id":"2008.08692","repositories_listed":6,"syntology":{"n":17,"n_ran":12,"n_constructed":0,"n_ran_checked":11,"n_instrument":1,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":11,"n_pointer_only":1,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 0 honoured, 0 violated, 11 with no contract checked; 1 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/enhancing-graph-neural-network-based-fraud#ran","syntology_url":"https://syntology.ai/paper/2008.08692","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2008.08692"}},"official":{"repos":["YingtongDou/CARE-GNN","safe-graph/DGFraud"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":2,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/knowledge-graph-convolutional-networks-for","slug":"knowledge-graph-convolutional-networks-for","title":"Knowledge-aware Graph Neural Networks with Label Smoothness Regularization for Recommender Systems","date":"2019-05-11","arxiv_id":"1905.04413","repositories_listed":6,"syntology":{"n":4,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":2,"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) · 2 unverified","sample_list":"/paper/knowledge-graph-convolutional-networks-for#ran","syntology_url":"https://syntology.ai/paper/1905.04413","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.04413"}},"official":null}},{"url":"/paper/few-shot-learning-with-graph-neural-networks","slug":"few-shot-learning-with-graph-neural-networks","title":"Few-Shot Learning with Graph Neural Networks","date":"2017-11-10","arxiv_id":"1711.04043","repositories_listed":6,"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/few-shot-learning-with-graph-neural-networks#ran","syntology_url":"https://syntology.ai/paper/1711.04043","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1711.04043"}},"official":{"repos":["vgsatorras/few-shot-gnn"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/the-open-catalyst-2020-oc20-dataset-and","slug":"the-open-catalyst-2020-oc20-dataset-and","title":"The Open Catalyst 2020 (OC20) Dataset and Community Challenges","date":"2020-10-20","arxiv_id":"2010.09990","repositories_listed":5,"syntology":{"n":11,"n_ran":11,"n_constructed":0,"n_ran_checked":11,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":11,"n_pointer_only":11,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 0 honoured, 0 violated, 11 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/the-open-catalyst-2020-oc20-dataset-and#ran","syntology_url":"https://syntology.ai/paper/2010.09990","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.09990"}},"official":{"repos":["Open-Catalyst-Project/Open-Catalyst-Dataset","Open-Catalyst-Project/ocp"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/a-fair-comparison-of-graph-neural-networks-1","slug":"a-fair-comparison-of-graph-neural-networks-1","title":"A Fair Comparison of Graph Neural Networks for Graph Classification","date":"2019-12-20","arxiv_id":"1912.09893","repositories_listed":5,"syntology":null},{"url":"/paper/clutrr-a-diagnostic-benchmark-for-inductive","slug":"clutrr-a-diagnostic-benchmark-for-inductive","title":"CLUTRR: A Diagnostic Benchmark for Inductive Reasoning from Text","date":"2019-08-16","arxiv_id":"1908.06177","repositories_listed":5,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/clutrr-a-diagnostic-benchmark-for-inductive#ran","syntology_url":"https://syntology.ai/paper/1908.06177","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1908.06177"}},"official":{"repos":["facebookresearch/clutrr"],"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/eeg-based-emotion-recognition-using","slug":"eeg-based-emotion-recognition-using","title":"EEG-Based Emotion Recognition Using Regularized Graph Neural Networks","date":"2019-07-18","arxiv_id":"1907.07835","repositories_listed":5,"syntology":null},{"url":"/paper/graph-neural-networks-a-review-of-methods-and","slug":"graph-neural-networks-a-review-of-methods-and","title":"Graph Neural Networks: A Review of Methods and Applications","date":"2018-12-20","arxiv_id":"1812.08434","repositories_listed":5,"syntology":null},{"url":"/paper/multi-paradigm-analysis-of-thai-capital","slug":"multi-paradigm-analysis-of-thai-capital","title":"Multi-Paradigm Analysis of Thai Capital Market Linkages: Bivariate/Vine Copulas, Granger Causality, Network Centrality, and Graph Neural Network/Graph Embedding Approaches","date":"2023-02-23","arxiv_id":null,"repositories_listed":4,"syntology":null},{"url":"/paper/equiformer-equivariant-graph-attention","slug":"equiformer-equivariant-graph-attention","title":"Equiformer: Equivariant Graph Attention Transformer for 3D Atomistic Graphs","date":"2022-06-23","arxiv_id":"2206.11990","repositories_listed":4,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"3 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; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/equiformer-equivariant-graph-attention#ran","syntology_url":"https://syntology.ai/paper/2206.11990","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.11990"}},"official":{"repos":["atomicarchitects/equiformer"],"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":["listed","official"]}}},{"url":"/paper/pocket2mol-efficient-molecular-sampling-based","slug":"pocket2mol-efficient-molecular-sampling-based","title":"Pocket2Mol: Efficient Molecular Sampling Based on 3D Protein Pockets","date":"2022-05-15","arxiv_id":"2205.07249","repositories_listed":4,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":0,"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, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/pocket2mol-efficient-molecular-sampling-based#ran","syntology_url":"https://syntology.ai/paper/2205.07249","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.07249"}},"official":{"repos":["pengxingang/pocket2mol"],"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/bipartite-graph-network-with-adaptive-message","slug":"bipartite-graph-network-with-adaptive-message","title":"Bipartite Graph Network with Adaptive Message Passing for Unbiased Scene Graph Generation","date":"2021-04-01","arxiv_id":"2104.00308","repositories_listed":4,"syntology":null},{"url":"/paper/hierarchical-cell-to-tissue-graph","slug":"hierarchical-cell-to-tissue-graph","title":"Hierarchical Graph Representations in Digital Pathology","date":"2021-02-22","arxiv_id":"2102.11057","repositories_listed":4,"syntology":null},{"url":"/paper/graph-neural-network-for-traffic-forecasting","slug":"graph-neural-network-for-traffic-forecasting","title":"Graph Neural Network for Traffic Forecasting: A Survey","date":"2021-01-27","arxiv_id":"2101.11174","repositories_listed":4,"syntology":null},{"url":"/paper/parameterized-explainer-for-graph-neural","slug":"parameterized-explainer-for-graph-neural","title":"Parameterized Explainer for Graph Neural Network","date":"2020-11-09","arxiv_id":"2011.04573","repositories_listed":4,"syntology":{"n":8,"n_ran":3,"n_constructed":3,"n_ran_checked":3,"n_instrument":0,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":8,"phrase":"3 ran (of which 3 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) · 5 unverified; every one of the 3 samples that ran constructed an object rather than computing a result","sample_list":"/paper/parameterized-explainer-for-graph-neural#ran","syntology_url":"https://syntology.ai/paper/2011.04573","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2011.04573"}},"official":{"repos":["flyingdoog/PGExplainer"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/learning-to-dispatch-for-job-shop-scheduling","slug":"learning-to-dispatch-for-job-shop-scheduling","title":"Learning to Dispatch for Job Shop Scheduling via Deep Reinforcement Learning","date":"2020-10-23","arxiv_id":"2010.12367","repositories_listed":4,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":2,"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) · 2 unverified","sample_list":"/paper/learning-to-dispatch-for-job-shop-scheduling#ran","syntology_url":"https://syntology.ai/paper/2010.12367","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.12367"}},"official":{"repos":["zcajiayin/L2D"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/detecting-relevant-feature-interactions-for","slug":"detecting-relevant-feature-interactions-for","title":"Detecting Beneficial Feature Interactions for Recommender Systems","date":"2020-08-02","arxiv_id":"2008.00404","repositories_listed":4,"syntology":null},{"url":"/paper/generalizing-graph-neural-networks-beyond","slug":"generalizing-graph-neural-networks-beyond","title":"Beyond Homophily in Graph Neural Networks: Current Limitations and Effective Designs","date":"2020-06-20","arxiv_id":"2006.11468","repositories_listed":4,"syntology":{"n":21,"n_ran":16,"n_constructed":2,"n_ran_checked":13,"n_instrument":3,"n_unverified":5,"n_honours":4,"n_violates":2,"n_no_contract":7,"n_pointer_only":13,"phrase":"16 ran (of which 2 constructed an object rather than computing a result; 13 with no instrument failure: 4 honoured, 2 violated, 7 with no contract checked; 3 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/generalizing-graph-neural-networks-beyond#ran","syntology_url":"https://syntology.ai/paper/2006.11468","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.11468"}},"official":{"repos":["GemsLab/H2GCN"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":1,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["found_in_text","listed","official"]}}},{"url":"/paper/gcc-graph-contrastive-coding-for-graph-neural","slug":"gcc-graph-contrastive-coding-for-graph-neural","title":"GCC: Graph Contrastive Coding for Graph Neural Network Pre-Training","date":"2020-06-17","arxiv_id":"2006.09963","repositories_listed":4,"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/gcc-graph-contrastive-coding-for-graph-neural#ran","syntology_url":"https://syntology.ai/paper/2006.09963","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.09963"}},"official":{"repos":["THUDM/GCC"],"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/multipole-graph-neural-operator-for","slug":"multipole-graph-neural-operator-for","title":"Multipole Graph Neural Operator for Parametric Partial Differential Equations","date":"2020-06-16","arxiv_id":"2006.09535","repositories_listed":4,"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":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) · 0 unverified","sample_list":"/paper/multipole-graph-neural-operator-for#ran","syntology_url":"https://syntology.ai/paper/2006.09535","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.09535"}},"official":{"repos":["zongyi-li/graph-pde"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/vectornet-encoding-hd-maps-and-agent-dynamics","slug":"vectornet-encoding-hd-maps-and-agent-dynamics","title":"VectorNet: Encoding HD Maps and Agent Dynamics from Vectorized Representation","date":"2020-05-08","arxiv_id":"2005.04259","repositories_listed":4,"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/vectornet-encoding-hd-maps-and-agent-dynamics#ran","syntology_url":"https://syntology.ai/paper/2005.04259","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.04259"}},"official":null}},{"url":"/paper/incrementally-improving-graph-wavenet","slug":"incrementally-improving-graph-wavenet","title":"Incrementally Improving Graph WaveNet Performance on Traffic Prediction","date":"2019-12-11","arxiv_id":"1912.07390","repositories_listed":4,"syntology":null},{"url":"/paper/mincut-pooling-in-graph-neural-networks","slug":"mincut-pooling-in-graph-neural-networks","title":"Spectral Clustering with Graph Neural Networks for Graph Pooling","date":"2019-06-30","arxiv_id":"1907.00481","repositories_listed":4,"syntology":{"n":9,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":1,"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) · 6 unverified","sample_list":"/paper/mincut-pooling-in-graph-neural-networks#ran","syntology_url":"https://syntology.ai/paper/1907.00481","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1907.00481"}},"official":{"repos":["FilippoMB/Spectral-Clustering-with-Graph-Neural-Networks-for-Graph-Pooling","FilippoMB/Benchmark_dataset_for_graph_classification"],"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":["listed","official"]}}},{"url":"/paper/edge-labeling-graph-neural-network-for-few","slug":"edge-labeling-graph-neural-network-for-few","title":"Edge-labeling Graph Neural Network for Few-shot Learning","date":"2019-05-04","arxiv_id":"1905.01436","repositories_listed":4,"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/edge-labeling-graph-neural-network-for-few#ran","syntology_url":"https://syntology.ai/paper/1905.01436","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.01436"}},"official":{"repos":["khy0809/fewshot-egnn"],"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/pdp-a-general-neural-framework-for-learning","slug":"pdp-a-general-neural-framework-for-learning","title":"PDP: A General Neural Framework for Learning Constraint Satisfaction Solvers","date":"2019-03-05","arxiv_id":"1903.01969","repositories_listed":4,"syntology":{"n":7,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":3,"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) · 2 unverified","sample_list":"/paper/pdp-a-general-neural-framework-for-learning#ran","syntology_url":"https://syntology.ai/paper/1903.01969","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1903.01969"}},"official":{"repos":["Microsoft/PDP-Solver"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/relbench-a-benchmark-for-deep-learning-on","slug":"relbench-a-benchmark-for-deep-learning-on","title":"RelBench: A Benchmark for Deep Learning on Relational Databases","date":"2024-07-29","arxiv_id":"2407.20060","repositories_listed":3,"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":3,"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/relbench-a-benchmark-for-deep-learning-on#ran","syntology_url":"https://syntology.ai/paper/2407.20060","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.20060"}},"official":{"repos":["snap-stanford/relbench","snap-stanford/relbench-user-study"],"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/gnn4eeg-a-benchmark-and-toolkit-for","slug":"gnn4eeg-a-benchmark-and-toolkit-for","title":"GNN4EEG: A Benchmark and Toolkit for Electroencephalography Classification with Graph Neural Network","date":"2023-09-27","arxiv_id":"2309.15515","repositories_listed":3,"syntology":null},{"url":"/paper/explanations-as-features-llm-based-features","slug":"explanations-as-features-llm-based-features","title":"Harnessing Explanations: LLM-to-LM Interpreter for Enhanced Text-Attributed Graph Representation Learning","date":"2023-05-31","arxiv_id":"2305.19523","repositories_listed":3,"syntology":{"n":7,"n_ran":6,"n_constructed":0,"n_ran_checked":3,"n_instrument":3,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":2,"n_pointer_only":1,"phrase":"6 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; 3 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/explanations-as-features-llm-based-features#ran","syntology_url":"https://syntology.ai/paper/2305.19523","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.19523"}},"official":{"repos":["XiaoxinHe/TAPE","xiaoxinhe/tape_arxiv_2023"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/2305-14749","slug":"2305-14749","title":"gRNAde: Geometric Deep Learning for 3D RNA inverse design","date":"2023-05-24","arxiv_id":"2305.14749","repositories_listed":3,"syntology":{"n":29,"n_ran":17,"n_constructed":1,"n_ran_checked":4,"n_instrument":13,"n_unverified":12,"n_honours":1,"n_violates":2,"n_no_contract":1,"n_pointer_only":0,"phrase":"17 ran (of which 1 constructed an object rather than computing a result; 4 with no instrument failure: 1 honoured, 2 violated, 1 with no contract checked; 13 where Syntology's instrument failed) · 12 unverified","sample_list":"/paper/2305-14749#ran","syntology_url":"https://syntology.ai/paper/2305.14749","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.14749"}},"official":{"repos":["chaitjo/geometric-rna-design"],"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":["listed","official"]}}},{"url":"/paper/joint-flying-relay-location-and-routing","slug":"joint-flying-relay-location-and-routing","title":"Joint Flying Relay Location and Routing Optimization for 6G UAV–IoT Networks: A Graph Neural Network-Based Approach","date":"2022-09-03","arxiv_id":null,"repositories_listed":3,"syntology":null},{"url":"/paper/end-to-end-active-speaker-detection","slug":"end-to-end-active-speaker-detection","title":"End-to-End Active Speaker Detection","date":"2022-03-27","arxiv_id":"2203.14250","repositories_listed":3,"syntology":{"n":5,"n_ran":3,"n_constructed":1,"n_ran_checked":1,"n_instrument":2,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":5,"phrase":"3 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; 2 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/end-to-end-active-speaker-detection#ran","syntology_url":"https://syntology.ai/paper/2203.14250","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.14250"}},"official":{"repos":["fuankarion/end-to-end-asd"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official","unlocated"]}}},{"url":"/paper/graph-guided-network-for-irregularly-sampled-1","slug":"graph-guided-network-for-irregularly-sampled-1","title":"Graph-Guided Network for Irregularly Sampled Multivariate Time Series","date":"2021-10-11","arxiv_id":"2110.05357","repositories_listed":3,"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/graph-guided-network-for-irregularly-sampled-1#ran","syntology_url":"https://syntology.ai/paper/2110.05357","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.05357"}},"official":{"repos":["WenjieDu/PyPOTS"],"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":["named_in_paper"]}}},{"url":"/paper/knowledge-graph-reasoning-with-relational","slug":"knowledge-graph-reasoning-with-relational","title":"Knowledge Graph Reasoning with Relational Digraph","date":"2021-08-13","arxiv_id":"2108.06040","repositories_listed":3,"syntology":null},{"url":"/paper/learning-hierarchical-graph-neural-networks","slug":"learning-hierarchical-graph-neural-networks","title":"Learning Hierarchical Graph Neural Networks for Image Clustering","date":"2021-07-03","arxiv_id":"2107.01319","repositories_listed":3,"syntology":null},{"url":"/paper/combinatorial-optimization-with-physics","slug":"combinatorial-optimization-with-physics","title":"Combinatorial Optimization with Physics-Inspired Graph Neural Networks","date":"2021-07-02","arxiv_id":"2107.01188","repositories_listed":3,"syntology":null},{"url":"/paper/neural-bellman-ford-networks-a-general-graph","slug":"neural-bellman-ford-networks-a-general-graph","title":"Neural Bellman-Ford Networks: A General Graph Neural Network Framework for Link Prediction","date":"2021-06-13","arxiv_id":"2106.06935","repositories_listed":3,"syntology":{"n":15,"n_ran":12,"n_constructed":0,"n_ran_checked":8,"n_instrument":4,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":2,"phrase":"12 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; 4 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/neural-bellman-ford-networks-a-general-graph#ran","syntology_url":"https://syntology.ai/paper/2106.06935","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.06935"}},"official":{"repos":["DeepGraphLearning/NBFNet"],"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":["community","listed","official"]}}},{"url":"/paper/self-supervised-heterogeneous-graph-neural","slug":"self-supervised-heterogeneous-graph-neural","title":"Self-supervised Heterogeneous Graph Neural Network with Co-contrastive Learning","date":"2021-05-19","arxiv_id":"2105.09111","repositories_listed":3,"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":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) · 0 unverified","sample_list":"/paper/self-supervised-heterogeneous-graph-neural#ran","syntology_url":"https://syntology.ai/paper/2105.09111","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.09111"}},"official":{"repos":["liun-online/HeCo"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/tcl-transformer-based-dynamic-graph-modelling","slug":"tcl-transformer-based-dynamic-graph-modelling","title":"TCL: Transformer-based Dynamic Graph Modelling via Contrastive Learning","date":"2021-05-17","arxiv_id":"2105.07944","repositories_listed":3,"syntology":null},{"url":"/paper/e-graphsage-a-graph-neural-network-based","slug":"e-graphsage-a-graph-neural-network-based","title":"E-GraphSAGE: A Graph Neural Network based Intrusion Detection System for IoT","date":"2021-03-30","arxiv_id":"2103.16329","repositories_listed":3,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/e-graphsage-a-graph-neural-network-based#ran","syntology_url":"https://syntology.ai/paper/2103.16329","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.16329"}},"official":{"repos":["waimorris/E-GraphSAGE"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/spectral-temporal-graph-neural-network-for-1","slug":"spectral-temporal-graph-neural-network-for-1","title":"Spectral Temporal Graph Neural Network for Multivariate Time-series Forecasting","date":"2021-03-13","arxiv_id":"2103.07719","repositories_listed":3,"syntology":{"n":13,"n_ran":2,"n_constructed":1,"n_ran_checked":2,"n_instrument":0,"n_unverified":11,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":2,"phrase":"2 ran (of which 1 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) · 11 unverified","sample_list":"/paper/spectral-temporal-graph-neural-network-for-1#ran","syntology_url":"https://syntology.ai/paper/2103.07719","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.07719"}},"official":{"repos":["WenjieDu/PyPOTS"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/a-graph-neural-network-to-model-user-comfort","slug":"a-graph-neural-network-to-model-user-comfort","title":"A Graph Neural Network to Model Disruption in Human-Aware Robot Navigation","date":"2021-02-17","arxiv_id":"2102.08863","repositories_listed":3,"syntology":null},{"url":"/paper/molecular-mechanics-driven-graph-neural","slug":"molecular-mechanics-driven-graph-neural","title":"Molecular Mechanics-Driven Graph Neural Network with Multiplex Graph for Molecular Structures","date":"2020-11-15","arxiv_id":"2011.07457","repositories_listed":3,"syntology":null},{"url":"/paper/strongly-incremental-constituency-parsing","slug":"strongly-incremental-constituency-parsing","title":"Strongly Incremental Constituency Parsing with Graph Neural Networks","date":"2020-10-27","arxiv_id":"2010.14568","repositories_listed":3,"syntology":{"n":5,"n_ran":2,"n_constructed":1,"n_ran_checked":1,"n_instrument":1,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"2 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; 1 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/strongly-incremental-constituency-parsing#ran","syntology_url":"https://syntology.ai/paper/2010.14568","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.14568"}},"official":{"repos":["princeton-vl/attach-juxtapose-parser"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/masked-label-prediction-unified-massage","slug":"masked-label-prediction-unified-massage","title":"Masked Label Prediction: Unified Message Passing Model for Semi-Supervised Classification","date":"2020-09-08","arxiv_id":"2009.03509","repositories_listed":3,"syntology":{"n":7,"n_ran":7,"n_constructed":0,"n_ran_checked":6,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":2,"n_no_contract":4,"n_pointer_only":2,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 2 violated, 4 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/masked-label-prediction-unified-massage#ran","syntology_url":"https://syntology.ai/paper/2009.03509","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2009.03509"}},"official":{"repos":["PaddlePaddle/PGL"],"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":["listed","official"]}}},{"url":"/paper/simplifying-architecture-search-for-graph","slug":"simplifying-architecture-search-for-graph","title":"Simplifying Architecture Search for Graph Neural Network","date":"2020-08-26","arxiv_id":"2008.11652","repositories_listed":3,"syntology":null},{"url":"/paper/towards-deeper-graph-neural-networks","slug":"towards-deeper-graph-neural-networks","title":"Towards Deeper Graph Neural Networks","date":"2020-07-18","arxiv_id":"2007.09296","repositories_listed":3,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 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; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/towards-deeper-graph-neural-networks#ran","syntology_url":"https://syntology.ai/paper/2007.09296","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.09296"}},"official":{"repos":["divelab/DeeperGNN"],"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","unlocated"]}}},{"url":"/paper/adaptive-graph-convolutional-recurrent","slug":"adaptive-graph-convolutional-recurrent","title":"Adaptive Graph Convolutional Recurrent Network for Traffic Forecasting","date":"2020-07-06","arxiv_id":"2007.02842","repositories_listed":3,"syntology":{"n":7,"n_ran":5,"n_constructed":5,"n_ran_checked":5,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":1,"phrase":"5 ran (of which 5 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) · 2 unverified; every one of the 5 samples that ran constructed an object rather than computing a result","sample_list":"/paper/adaptive-graph-convolutional-recurrent#ran","syntology_url":"https://syntology.ai/paper/2007.02842","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.02842"}},"official":{"repos":["LeiBAI/AGCRN"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":3,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/from-graph-low-rank-global-attention-to-2-fwl","slug":"from-graph-low-rank-global-attention-to-2-fwl","title":"Global Attention Improves Graph Networks Generalization","date":"2020-06-14","arxiv_id":"2006.07846","repositories_listed":3,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":1,"n_instrument":3,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":4,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/from-graph-low-rank-global-attention-to-2-fwl#ran","syntology_url":"https://syntology.ai/paper/2006.07846","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.07846"}},"official":null}},{"url":"/paper/generative-3d-part-assembly-via-dynamic-graph","slug":"generative-3d-part-assembly-via-dynamic-graph","title":"Generative 3D Part Assembly via Dynamic Graph Learning","date":"2020-06-14","arxiv_id":"2006.07793","repositories_listed":3,"syntology":null},{"url":"/paper/on-the-bottleneck-of-graph-neural-networks","slug":"on-the-bottleneck-of-graph-neural-networks","title":"On the Bottleneck of Graph Neural Networks and its Practical Implications","date":"2020-06-09","arxiv_id":"2006.05205","repositories_listed":3,"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/on-the-bottleneck-of-graph-neural-networks#ran","syntology_url":"https://syntology.ai/paper/2006.05205","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.05205"}},"official":{"repos":["tech-srl/bottleneck"],"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/connecting-the-dots-multivariate-time-series","slug":"connecting-the-dots-multivariate-time-series","title":"Connecting the Dots: Multivariate Time Series Forecasting with Graph Neural Networks","date":"2020-05-24","arxiv_id":"2005.11650","repositories_listed":3,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":1,"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: 0 honoured, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/connecting-the-dots-multivariate-time-series#ran","syntology_url":"https://syntology.ai/paper/2005.11650","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.11650"}},"official":{"repos":["nnzhan/MTGNN"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["unlocated"]}}},{"url":"/paper/graph-structure-learning-for-robust-graph","slug":"graph-structure-learning-for-robust-graph","title":"Graph Structure Learning for Robust Graph Neural Networks","date":"2020-05-20","arxiv_id":"2005.10203","repositories_listed":3,"syntology":null},{"url":"/paper/typilus-neural-type-hints","slug":"typilus-neural-type-hints","title":"Typilus: Neural Type Hints","date":"2020-04-06","arxiv_id":"2004.10657","repositories_listed":3,"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/typilus-neural-type-hints#ran","syntology_url":"https://syntology.ai/paper/2004.10657","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.10657"}},"official":{"repos":["typilus/typilus"],"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":["listed","official"]}}},{"url":"/paper/ocgnn-one-class-classification-with-graph","slug":"ocgnn-one-class-classification-with-graph","title":"One-Class Graph Neural Networks for Anomaly Detection in Attributed Networks","date":"2020-02-22","arxiv_id":"2002.09594","repositories_listed":3,"syntology":null},{"url":"/paper/taxoexpan-self-supervised-taxonomy-expansion","slug":"taxoexpan-self-supervised-taxonomy-expansion","title":"TaxoExpan: Self-supervised Taxonomy Expansion with Position-Enhanced Graph Neural Network","date":"2020-01-26","arxiv_id":"2001.09522","repositories_listed":3,"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/taxoexpan-self-supervised-taxonomy-expansion#ran","syntology_url":"https://syntology.ai/paper/2001.09522","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2001.09522"}},"official":{"repos":["mickeystroller/TaxoExpan"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/contrastive-learning-of-structured-world-1","slug":"contrastive-learning-of-structured-world-1","title":"Contrastive Learning of Structured World Models","date":"2019-11-27","arxiv_id":"1911.12247","repositories_listed":3,"syntology":{"n":10,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":0,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/contrastive-learning-of-structured-world-1#ran","syntology_url":"https://syntology.ai/paper/1911.12247","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.12247"}},"official":{"repos":["tkipf/c-swm"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/hierarchical-graph-pooling-with-structure","slug":"hierarchical-graph-pooling-with-structure","title":"Hierarchical Graph Pooling with Structure Learning","date":"2019-11-14","arxiv_id":"1911.05954","repositories_listed":3,"syntology":null},{"url":"/paper/personalizing-graph-neural-networks-with","slug":"personalizing-graph-neural-networks-with","title":"Personalized Graph Neural Networks with Attention Mechanism for Session-Aware Recommendation","date":"2019-10-20","arxiv_id":"1910.08887","repositories_listed":3,"syntology":null},{"url":"/paper/deep-bayesian-optimization-on-attributed","slug":"deep-bayesian-optimization-on-attributed","title":"Deep Bayesian Optimization on Attributed Graphs","date":"2019-05-31","arxiv_id":"1905.13403","repositories_listed":3,"syntology":{"n":18,"n_ran":13,"n_constructed":0,"n_ran_checked":11,"n_instrument":2,"n_unverified":5,"n_honours":3,"n_violates":2,"n_no_contract":6,"n_pointer_only":7,"phrase":"13 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 3 honoured, 2 violated, 6 with no contract checked; 2 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/deep-bayesian-optimization-on-attributed#ran","syntology_url":"https://syntology.ai/paper/1905.13403","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.13403"}},"official":null}},{"url":"/paper/190505006","slug":"190505006","title":"Time-Series Event Prediction with Evolutionary State Graph","date":"2019-05-10","arxiv_id":"1905.05006","repositories_listed":3,"syntology":null},{"url":"/paper/inductive-graph-pattern-learning-for","slug":"inductive-graph-pattern-learning-for","title":"Inductive Matrix Completion Based on Graph Neural Networks","date":"2019-04-26","arxiv_id":"1904.12058","repositories_listed":3,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/inductive-graph-pattern-learning-for#ran","syntology_url":"https://syntology.ai/paper/1904.12058","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.12058"}},"official":{"repos":["muhanzhang/IGMC"],"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/dag-gnn-dag-structure-learning-with-graph","slug":"dag-gnn-dag-structure-learning-with-graph","title":"DAG-GNN: DAG Structure Learning with Graph Neural Networks","date":"2019-04-22","arxiv_id":"1904.10098","repositories_listed":3,"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":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) · 0 unverified","sample_list":"/paper/dag-gnn-dag-structure-learning-with-graph#ran","syntology_url":"https://syntology.ai/paper/1904.10098","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.10098"}},"official":{"repos":["fishmoon1234/DAG-GNN"],"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/open-vocabulary-learning-on-source-code-with","slug":"open-vocabulary-learning-on-source-code-with","title":"Open Vocabulary Learning on Source Code with a Graph-Structured Cache","date":"2018-10-18","arxiv_id":"1810.08305","repositories_listed":3,"syntology":null},{"url":"/paper/learning-to-solve-np-complete-problems-a","slug":"learning-to-solve-np-complete-problems-a","title":"Learning to Solve NP-Complete Problems - A Graph Neural Network for Decision TSP","date":"2018-09-08","arxiv_id":"1809.02721","repositories_listed":3,"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/learning-to-solve-np-complete-problems-a#ran","syntology_url":"https://syntology.ai/paper/1809.02721","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1809.02721"}},"official":null}},{"url":"/paper/graph-edit-distance-computation-via-graph","slug":"graph-edit-distance-computation-via-graph","title":"SimGNN: A Neural Network Approach to Fast Graph Similarity Computation","date":"2018-08-16","arxiv_id":"1808.05689","repositories_listed":3,"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/graph-edit-distance-computation-via-graph#ran","syntology_url":"https://syntology.ai/paper/1808.05689","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1808.05689"}},"official":null}},{"url":"/paper/efficient-interactive-annotation-of","slug":"efficient-interactive-annotation-of","title":"Efficient Interactive Annotation of Segmentation Datasets with Polygon-RNN++","date":"2018-03-26","arxiv_id":"1803.09693","repositories_listed":3,"syntology":null},{"url":"/paper/zero-shot-recognition-via-semantic-embeddings","slug":"zero-shot-recognition-via-semantic-embeddings","title":"Zero-shot Recognition via Semantic Embeddings and Knowledge Graphs","date":"2018-03-21","arxiv_id":"1803.08035","repositories_listed":3,"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/zero-shot-recognition-via-semantic-embeddings#ran","syntology_url":"https://syntology.ai/paper/1803.08035","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1803.08035"}},"official":null}},{"url":"/paper/graph-neural-networks-for-jamming-source","slug":"graph-neural-networks-for-jamming-source","title":"Graph Neural Networks for Jamming Source Localization","date":"2025-06-01","arxiv_id":"2506.03196","repositories_listed":2,"syntology":null},{"url":"/paper/semi-supervised-credit-card-fraud-detection-1","slug":"semi-supervised-credit-card-fraud-detection-1","title":"Semi-supervised Credit Card Fraud Detection via Attribute-Driven Graph Representation","date":"2024-12-24","arxiv_id":"2412.18287","repositories_listed":2,"syntology":null},{"url":"/paper/pre-training-graph-neural-networks-on-1","slug":"pre-training-graph-neural-networks-on-1","title":"Pre-training Graph Neural Networks on Molecules by Using Subgraph-Conditioned Graph Information Bottleneck","date":"2024-12-20","arxiv_id":"2412.15589","repositories_listed":2,"syntology":{"n":4,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"2 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; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/pre-training-graph-neural-networks-on-1#ran","syntology_url":"https://syntology.ai/paper/2412.15589","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2412.15589"}},"official":{"repos":["NSLab-CUK/S-CGIB"],"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":["listed","official"]}}},{"url":"/paper/fragmented-layer-grouping-in-gui-designs","slug":"fragmented-layer-grouping-in-gui-designs","title":"Fragmented Layer Grouping in GUI Designs Through Graph Learning Based on Multimodal Information","date":"2024-12-07","arxiv_id":"2412.05555","repositories_listed":2,"syntology":null},{"url":"/paper/topotune-a-framework-for-generalized","slug":"topotune-a-framework-for-generalized","title":"TopoTune : A Framework for Generalized Combinatorial Complex Neural Networks","date":"2024-10-09","arxiv_id":"2410.06530","repositories_listed":2,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"3 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; 3 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/topotune-a-framework-for-generalized#ran","syntology_url":"https://syntology.ai/paper/2410.06530","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.06530"}},"official":{"repos":["geometric-intelligence/topobenchmark","pyt-team/TopoBenchmarkX"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/interpretable-graph-neural-networks-for-2","slug":"interpretable-graph-neural-networks-for-2","title":"Interpretable Graph Neural Networks for Heterogeneous Tabular Data","date":"2024-08-14","arxiv_id":"2408.07661","repositories_listed":2,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":3,"n_instrument":1,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"4 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; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/interpretable-graph-neural-networks-for-2#ran","syntology_url":"https://syntology.ai/paper/2408.07661","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2408.07661"}},"official":{"repos":["amrmalkhatib/ignh"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/udc-a-unified-neural-divide-and-conquer","slug":"udc-a-unified-neural-divide-and-conquer","title":"UDC: A Unified Neural Divide-and-Conquer Framework for Large-Scale Combinatorial Optimization Problems","date":"2024-06-29","arxiv_id":"2407.00312","repositories_listed":2,"syntology":null},{"url":"/paper/joint-admission-control-and-resource","slug":"joint-admission-control-and-resource","title":"Joint Admission Control and Resource Allocation of Virtual Network Embedding via Hierarchical Deep Reinforcement Learning","date":"2024-06-25","arxiv_id":"2406.17334","repositories_listed":2,"syntology":{"n":7,"n_ran":4,"n_constructed":0,"n_ran_checked":3,"n_instrument":1,"n_unverified":3,"n_honours":0,"n_violates":1,"n_no_contract":2,"n_pointer_only":7,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 1 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/joint-admission-control-and-resource#ran","syntology_url":"https://syntology.ai/paper/2406.17334","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.17334"}},"official":{"repos":["geminilight/hrl-acra"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/unleashing-the-potential-of-fractional","slug":"unleashing-the-potential-of-fractional","title":"Unleashing the Potential of Fractional Calculus in Graph Neural Networks with FROND","date":"2024-04-26","arxiv_id":"2404.17099","repositories_listed":2,"syntology":{"n":10,"n_ran":7,"n_constructed":0,"n_ran_checked":6,"n_instrument":1,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":10,"phrase":"7 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; 1 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/unleashing-the-potential-of-fractional#ran","syntology_url":"https://syntology.ai/paper/2404.17099","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.17099"}},"official":{"repos":["zknus/iclr2024-frond","zknus/torchfde"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/can-gnn-be-good-adapter-for-llms","slug":"can-gnn-be-good-adapter-for-llms","title":"Can GNN be Good Adapter for LLMs?","date":"2024-02-20","arxiv_id":"2402.12984","repositories_listed":2,"syntology":{"n":8,"n_ran":6,"n_constructed":0,"n_ran_checked":2,"n_instrument":4,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":8,"phrase":"6 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; 4 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/can-gnn-be-good-adapter-for-llms#ran","syntology_url":"https://syntology.ai/paper/2402.12984","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.12984"}},"official":{"repos":["zjunet/graphadapter","hxttkl/GraphAdapter"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/asgea-exploiting-logic-rules-from-align","slug":"asgea-exploiting-logic-rules-from-align","title":"ASGEA: Exploiting Logic Rules from Align-Subgraphs for Entity Alignment","date":"2024-02-16","arxiv_id":"2402.11000","repositories_listed":2,"syntology":null},{"url":"/paper/product-manifold-representations-for-learning","slug":"product-manifold-representations-for-learning","title":"Product Manifold Representations for Learning on Biological Pathways","date":"2024-01-27","arxiv_id":"2401.15478","repositories_listed":2,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":1,"n_instrument":5,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":6,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 5 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/product-manifold-representations-for-learning#ran","syntology_url":"https://syntology.ai/paper/2401.15478","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2401.15478"}},"official":{"repos":["mcneela/mixed-curvature-gcn","mcneela/mixed-curvature-pathways"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/falcon-feature-label-constrained-graph-net","slug":"falcon-feature-label-constrained-graph-net","title":"FALCON: Feature-Label Constrained Graph Net Collapse for Memory Efficient GNNs","date":"2023-12-27","arxiv_id":"2312.16542","repositories_listed":2,"syntology":null},{"url":"/paper/higher-order-equivariant-neural-networks-for","slug":"higher-order-equivariant-neural-networks-for","title":"Higher-Order Equivariant Neural Networks for Charge Density Prediction in Materials","date":"2023-12-08","arxiv_id":"2312.05388","repositories_listed":2,"syntology":{"n":9,"n_ran":7,"n_constructed":0,"n_ran_checked":5,"n_instrument":2,"n_unverified":2,"n_honours":1,"n_violates":0,"n_no_contract":4,"n_pointer_only":3,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 1 honoured, 0 violated, 4 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/higher-order-equivariant-neural-networks-for#ran","syntology_url":"https://syntology.ai/paper/2312.05388","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2312.05388"}},"official":{"repos":["AIforGreatGood/charge3net"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/reads-v-real-time-automated-detection-of","slug":"reads-v-real-time-automated-detection-of","title":"VSViG: Real-time Video-based Seizure Detection via Skeleton-based Spatiotemporal ViG","date":"2023-11-24","arxiv_id":"2311.14775","repositories_listed":2,"syntology":null},{"url":"/paper/constructing-temporal-dynamic-knowledge","slug":"constructing-temporal-dynamic-knowledge","title":"Constructing Temporal Dynamic Knowledge Graphs from Interactive Text-based Games","date":"2023-11-03","arxiv_id":"2311.01928","repositories_listed":2,"syntology":null},{"url":"/paper/splitgnn-spectral-graph-neural-network-for","slug":"splitgnn-spectral-graph-neural-network-for","title":"SplitGNN: Spectral Graph Neural Network for Fraud Detection against Heterophily","date":"2023-10-21","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/interpretable-graph-neural-networks-for-1","slug":"interpretable-graph-neural-networks-for-1","title":"Interpretable Graph Neural Networks for Tabular Data","date":"2023-08-17","arxiv_id":"2308.08945","repositories_listed":2,"syntology":null},{"url":"/paper/automating-style-analysis-and-visualization","slug":"automating-style-analysis-and-visualization","title":"Automating Style Analysis and Visualization With Explainable AI -- Case Studies on Brand Recognition","date":"2023-06-05","arxiv_id":"2306.03021","repositories_listed":2,"syntology":null},{"url":"/paper/temporal-and-heterogeneous-graph-neural","slug":"temporal-and-heterogeneous-graph-neural","title":"Temporal and Heterogeneous Graph Neural Network for Financial Time Series Prediction","date":"2023-05-09","arxiv_id":"2305.08740","repositories_listed":2,"syntology":null},{"url":"/paper/evaluation-of-differentially-constrained","slug":"evaluation-of-differentially-constrained","title":"Evaluation of Differentially Constrained Motion Models for Graph-Based Trajectory Prediction","date":"2023-04-11","arxiv_id":"2304.05116","repositories_listed":2,"syntology":null},{"url":"/paper/gluestick-robust-image-matching-by-sticking","slug":"gluestick-robust-image-matching-by-sticking","title":"GlueStick: Robust Image Matching by Sticking Points and Lines Together","date":"2023-04-04","arxiv_id":"2304.02008","repositories_listed":2,"syntology":{"n":29,"n_ran":20,"n_constructed":10,"n_ran_checked":13,"n_instrument":7,"n_unverified":9,"n_honours":0,"n_violates":2,"n_no_contract":11,"n_pointer_only":15,"phrase":"20 ran (of which 10 constructed an object rather than computing a result; 13 with no instrument failure: 0 honoured, 2 violated, 11 with no contract checked; 7 where Syntology's instrument failed) · 9 unverified","sample_list":"/paper/gluestick-robust-image-matching-by-sticking#ran","syntology_url":"https://syntology.ai/paper/2304.02008","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2304.02008"}},"official":{"repos":["cvg/gluestick"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":5,"n_ran_no_instrument_failure":5,"n_unverified":5,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/equipocket-an-e-3-equivariant-geometric-graph","slug":"equipocket-an-e-3-equivariant-geometric-graph","title":"EquiPocket: an E(3)-Equivariant Geometric Graph Neural Network for Ligand Binding Site Prediction","date":"2023-02-23","arxiv_id":"2302.12177","repositories_listed":2,"syntology":{"n":11,"n_ran":8,"n_constructed":2,"n_ran_checked":5,"n_instrument":3,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"8 ran (of which 2 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 3 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/equipocket-an-e-3-equivariant-geometric-graph#ran","syntology_url":"https://syntology.ai/paper/2302.12177","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2302.12177"}},"official":{"repos":["fengyuewuya/equipocket"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":2,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["listed","official"]}}}],"syntology_records":60,"syntology_note":"a paper without a record is not a recorded non-run: it may lack an arXiv id or simply be absent from the graph layer"},"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)"},"since_archive_judged":{"papers":0,"papers_placed":0,"judged_by":{"model":"a model","models_as_recorded":[],"from":"lb_rows_run_verified.jsonl: each record's `model` field (the extractor's call that wrote decisions[])"},"note":"a model's judgement from the paper's own tables that they report on this leaderboard, not a result: no value from a paper that was not placed is printed or carried here; papers counts each paper once over these leaderboards","backfill":"8,886 of 18,637 newer papers checked so far (733 more had nothing to place; 41 could not be read)","backfill_complete":false,"leaderboards":[]},"papers_where_code_ran":350,"papers_where_code_ran_first_page":"/task/graph-neural-network/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not run it on this task or check it against the task's benchmarks.","pages":[{"order":"archive","page":2,"of":36,"url":"/task/graph-neural-network/papers/2","json":"/task/graph-neural-network/papers/2.json","rows":100},{"order":"archive","page":3,"of":36,"url":"/task/graph-neural-network/papers/3","json":"/task/graph-neural-network/papers/3.json","rows":100},{"order":"archive","page":4,"of":36,"url":"/task/graph-neural-network/papers/4","json":"/task/graph-neural-network/papers/4.json","rows":100},{"order":"archive","page":5,"of":36,"url":"/task/graph-neural-network/papers/5","json":"/task/graph-neural-network/papers/5.json","rows":100},{"order":"archive","page":6,"of":36,"url":"/task/graph-neural-network/papers/6","json":"/task/graph-neural-network/papers/6.json","rows":100},{"order":"archive","page":7,"of":36,"url":"/task/graph-neural-network/papers/7","json":"/task/graph-neural-network/papers/7.json","rows":100},{"order":"archive","page":8,"of":36,"url":"/task/graph-neural-network/papers/8","json":"/task/graph-neural-network/papers/8.json","rows":100},{"order":"archive","page":9,"of":36,"url":"/task/graph-neural-network/papers/9","json":"/task/graph-neural-network/papers/9.json","rows":100},{"order":"archive","page":10,"of":36,"url":"/task/graph-neural-network/papers/10","json":"/task/graph-neural-network/papers/10.json","rows":100},{"order":"archive","page":11,"of":36,"url":"/task/graph-neural-network/papers/11","json":"/task/graph-neural-network/papers/11.json","rows":100},{"order":"archive","page":12,"of":36,"url":"/task/graph-neural-network/papers/12","json":"/task/graph-neural-network/papers/12.json","rows":100},{"order":"archive","page":13,"of":36,"url":"/task/graph-neural-network/papers/13","json":"/task/graph-neural-network/papers/13.json","rows":100},{"order":"archive","page":14,"of":36,"url":"/task/graph-neural-network/papers/14","json":"/task/graph-neural-network/papers/14.json","rows":100},{"order":"archive","page":15,"of":36,"url":"/task/graph-neural-network/papers/15","json":"/task/graph-neural-network/papers/15.json","rows":100},{"order":"archive","page":16,"of":36,"url":"/task/graph-neural-network/papers/16","json":"/task/graph-neural-network/papers/16.json","rows":100},{"order":"archive","page":17,"of":36,"url":"/task/graph-neural-network/papers/17","json":"/task/graph-neural-network/papers/17.json","rows":100},{"order":"archive","page":18,"of":36,"url":"/task/graph-neural-network/papers/18","json":"/task/graph-neural-network/papers/18.json","rows":100},{"order":"archive","page":19,"of":36,"url":"/task/graph-neural-network/papers/19","json":"/task/graph-neural-network/papers/19.json","rows":100},{"order":"archive","page":20,"of":36,"url":"/task/graph-neural-network/papers/20","json":"/task/graph-neural-network/papers/20.json","rows":100},{"order":"archive","page":21,"of":36,"url":"/task/graph-neural-network/papers/21","json":"/task/graph-neural-network/papers/21.json","rows":100},{"order":"archive","page":22,"of":36,"url":"/task/graph-neural-network/papers/22","json":"/task/graph-neural-network/papers/22.json","rows":100},{"order":"archive","page":23,"of":36,"url":"/task/graph-neural-network/papers/23","json":"/task/graph-neural-network/papers/23.json","rows":100},{"order":"archive","page":24,"of":36,"url":"/task/graph-neural-network/papers/24","json":"/task/graph-neural-network/papers/24.json","rows":100},{"order":"archive","page":25,"of":36,"url":"/task/graph-neural-network/papers/25","json":"/task/graph-neural-network/papers/25.json","rows":100},{"order":"archive","page":26,"of":36,"url":"/task/graph-neural-network/papers/26","json":"/task/graph-neural-network/papers/26.json","rows":100},{"order":"archive","page":27,"of":36,"url":"/task/graph-neural-network/papers/27","json":"/task/graph-neural-network/papers/27.json","rows":100},{"order":"archive","page":28,"of":36,"url":"/task/graph-neural-network/papers/28","json":"/task/graph-neural-network/papers/28.json","rows":100},{"order":"archive","page":29,"of":36,"url":"/task/graph-neural-network/papers/29","json":"/task/graph-neural-network/papers/29.json","rows":100},{"order":"archive","page":30,"of":36,"url":"/task/graph-neural-network/papers/30","json":"/task/graph-neural-network/papers/30.json","rows":100},{"order":"archive","page":31,"of":36,"url":"/task/graph-neural-network/papers/31","json":"/task/graph-neural-network/papers/31.json","rows":100},{"order":"archive","page":32,"of":36,"url":"/task/graph-neural-network/papers/32","json":"/task/graph-neural-network/papers/32.json","rows":100},{"order":"archive","page":33,"of":36,"url":"/task/graph-neural-network/papers/33","json":"/task/graph-neural-network/papers/33.json","rows":100},{"order":"archive","page":34,"of":36,"url":"/task/graph-neural-network/papers/34","json":"/task/graph-neural-network/papers/34.json","rows":100},{"order":"archive","page":35,"of":36,"url":"/task/graph-neural-network/papers/35","json":"/task/graph-neural-network/papers/35.json","rows":100},{"order":"archive","page":36,"of":36,"url":"/task/graph-neural-network/papers/36","json":"/task/graph-neural-network/papers/36.json","rows":98},{"order":"ran","page":1,"of":4,"url":"/task/graph-neural-network/papers/ran/1","json":"/task/graph-neural-network/papers/ran/1.json","rows":100},{"order":"ran","page":2,"of":4,"url":"/task/graph-neural-network/papers/ran/2","json":"/task/graph-neural-network/papers/ran/2.json","rows":100},{"order":"ran","page":3,"of":4,"url":"/task/graph-neural-network/papers/ran/3","json":"/task/graph-neural-network/papers/ran/3.json","rows":100},{"order":"ran","page":4,"of":4,"url":"/task/graph-neural-network/papers/ran/4","json":"/task/graph-neural-network/papers/ran/4.json","rows":50}],"description_links":{"kept":0,"unwrapped_to_text":0,"bare_urls_linked":0,"relative_images_dropped":0,"rule":"internal links are kept only when the target slug exists in the catalog"},"syntology":{"read_at":"2026-10-05T00:36:11+00:00","claim":"Per-sample execution status on synthesized fixtures ('ran N of M samples'); not a correctness claim and not a ranking signal.","status_vocabulary":{"ran_honours":"ran, honoured the contract we drafted","ran_violates":"ran, violated the contract we drafted","ran_draft_wrong":"ran; our contract draft was wrong, not the code","ran_fixture":"ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"row_route":"each syntology object on a benchmark's first row and on a paper carries sample_list (this site's paper page, #ran), syntology_url (syntology.ai's page for the paper, only when that route probed live) and mcp (the agent call that lists the paper's harvested samples; not a verdict on the paper)","developers":"https://syntology.ai/developers"},"not_shown":{"libraries":"the archive has no per-task library table","trend_sparklines":"the Trend column of the benchmarks table was a rendered image; it is not in the archive","social_and_latest_sorts":"stars and social signals are not in the archive"},"record_sha256":"888caa66235ed22a0fbd30b0d53cd79c1b5f937d618b99801246d24b03cff84e","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}