{"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-attention/papers/ran/1","list_of":"/task/graph-attention","task":"Graph Attention","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":"ran","order_definition":"only papers where Syntology ran at least one harvested sample; date (newest first), ties by arXiv id","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.","absence":"A paper missing from this list is not a recorded non-run: it may have no arXiv id, no harvested code, or only samples that have not run yet.","page":1,"pages_in_order":1,"rows_per_page":100,"rows":[1,60],"of":60,"counts":{"archive_papers_tagged":1088,"with_a_code_link":413,"where_syntology_ran_a_sample":60,"not_listed_spam_title":0,"listed":1088,"listed_where_code_ran":60,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":52,"every_run_a_failure_of_syntologys_instrument":8,"listed_with_a_run_with_no_instrument_failure":52,"listed_every_run_a_failure_of_syntologys_instrument":8,"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-attention/papers/ran/1","prev":null,"next":null,"papers":[{"url":"/paper/gates-cost-aware-dynamic-workflow-scheduling","slug":"gates-cost-aware-dynamic-workflow-scheduling","title":"GATES: Cost-aware Dynamic Workflow Scheduling via Graph Attention Networks and Evolution Strategy","date":"2025-05-18","arxiv_id":"2505.12355","repositories_listed":1,"syntology":{"n":6,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/gates-cost-aware-dynamic-workflow-scheduling#ran","syntology_url":"https://syntology.ai/paper/2505.12355","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2505.12355"}},"official":{"repos":["yashen998/gates"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/modality-guided-dynamic-graph-fusion-and","slug":"modality-guided-dynamic-graph-fusion-and","title":"Modality-Guided Dynamic Graph Fusion and Temporal Diffusion for Self-Supervised RGB-T Tracking","date":"2025-05-06","arxiv_id":"2505.03507","repositories_listed":1,"syntology":{"n":8,"n_ran":6,"n_constructed":5,"n_ran_checked":6,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":8,"phrase":"6 ran (of which 5 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/modality-guided-dynamic-graph-fusion-and#ran","syntology_url":"https://syntology.ai/paper/2505.03507","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2505.03507"}},"official":{"repos":["lishenglana/gdstrack"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":5,"n_ran_no_instrument_failure":6,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/grain-exact-graph-reconstruction-from","slug":"grain-exact-graph-reconstruction-from","title":"GRAIN: Exact Graph Reconstruction from Gradients","date":"2025-03-03","arxiv_id":"2503.01838","repositories_listed":1,"syntology":{"n":6,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":1,"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) · 1 unverified","sample_list":"/paper/grain-exact-graph-reconstruction-from#ran","syntology_url":"https://syntology.ai/paper/2503.01838","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2503.01838"}},"official":{"repos":["insait-institute/grain"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/relgnn-composite-message-passing-for","slug":"relgnn-composite-message-passing-for","title":"RelGNN: Composite Message Passing for Relational Deep Learning","date":"2025-02-10","arxiv_id":"2502.06784","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/relgnn-composite-message-passing-for#ran","syntology_url":"https://syntology.ai/paper/2502.06784","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2502.06784"}},"official":{"repos":["snap-stanford/relgnn"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/rethinking-functional-brain-connectome","slug":"rethinking-functional-brain-connectome","title":"Rethinking Functional Brain Connectome Analysis: Do Graph Deep Learning Models Help?","date":"2025-01-28","arxiv_id":"2501.17207","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":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/rethinking-functional-brain-connectome#ran","syntology_url":"https://syntology.ai/paper/2501.17207","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2501.17207"}},"official":{"repos":["learningkeqi/rethinkingbca"],"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/understanding-when-and-why-graph-attention","slug":"understanding-when-and-why-graph-attention","title":"Graph Attention is Not Always Beneficial: A Theoretical Analysis of Graph Attention Mechanisms via Contextual Stochastic Block Models","date":"2024-12-20","arxiv_id":"2412.15496","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":1,"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/understanding-when-and-why-graph-attention#ran","syntology_url":"https://syntology.ai/paper/2412.15496","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2412.15496"}},"official":{"repos":["mztmzt/gat_csbm"],"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/disengcd-a-meta-multigraph-assisted","slug":"disengcd-a-meta-multigraph-assisted","title":"DisenGCD: A Meta Multigraph-assisted Disentangled Graph Learning Framework for Cognitive Diagnosis","date":"2024-10-23","arxiv_id":"2410.17564","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":8,"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/disengcd-a-meta-multigraph-assisted#ran","syntology_url":"https://syntology.ai/paper/2410.17564","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.17564"}},"official":{"repos":["bimk/intelligent-education"],"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/multivariate-time-series-anomaly-detection-5","slug":"multivariate-time-series-anomaly-detection-5","title":"Multivariate Time-Series Anomaly Detection based on Enhancing Graph Attention Networks with Topological Analysis","date":"2024-08-23","arxiv_id":"2408.13082","repositories_listed":1,"syntology":{"n":12,"n_ran":8,"n_constructed":0,"n_ran_checked":7,"n_instrument":1,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":12,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 1 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/multivariate-time-series-anomaly-detection-5#ran","syntology_url":"https://syntology.ai/paper/2408.13082","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2408.13082"}},"official":{"repos":["ljj-cyber/topogdn"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/graph-attention-with-random-rewiring","slug":"graph-attention-with-random-rewiring","title":"Greener GRASS: Enhancing GNNs with Encoding, Rewiring, and Attention","date":"2024-07-08","arxiv_id":"2407.05649","repositories_listed":0,"syntology":{"n":10,"n_ran":4,"n_constructed":4,"n_ran_checked":4,"n_instrument":0,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":10,"phrase":"4 ran (of which 4 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 6 unverified; every one of the 4 samples that ran constructed an object rather than computing a result","sample_list":"/paper/graph-attention-with-random-rewiring#ran","syntology_url":"https://syntology.ai/paper/2407.05649","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.05649"}},"official":null}},{"url":"/paper/towards-universal-mesh-movement-networks","slug":"towards-universal-mesh-movement-networks","title":"Towards Universal Mesh Movement Networks","date":"2024-06-29","arxiv_id":"2407.00382","repositories_listed":1,"syntology":{"n":7,"n_ran":3,"n_constructed":1,"n_ran_checked":1,"n_instrument":2,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"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) · 4 unverified","sample_list":"/paper/towards-universal-mesh-movement-networks#ran","syntology_url":"https://syntology.ai/paper/2407.00382","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.00382"}},"official":{"repos":["mesh-adaptation/um2n"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/composing-object-relations-and-attributes-for-1","slug":"composing-object-relations-and-attributes-for-1","title":"Composing Object Relations and Attributes for Image-Text Matching","date":"2024-06-17","arxiv_id":"2406.11820","repositories_listed":1,"syntology":{"n":5,"n_ran":4,"n_constructed":1,"n_ran_checked":1,"n_instrument":3,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":5,"phrase":"4 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; 3 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/composing-object-relations-and-attributes-for-1#ran","syntology_url":"https://syntology.ai/paper/2406.11820","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.11820"}},"official":{"repos":["vkhoi/cora_cvpr24"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/scaling-graph-convolutions-for-mobile-vision","slug":"scaling-graph-convolutions-for-mobile-vision","title":"Scaling Graph Convolutions for Mobile Vision","date":"2024-06-09","arxiv_id":"2406.05850","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/scaling-graph-convolutions-for-mobile-vision#ran","syntology_url":"https://syntology.ai/paper/2406.05850","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.05850"}},"official":{"repos":["sldgroup/mobilevigv2"],"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/gate-how-to-keep-out-intrusive-neighbors","slug":"gate-how-to-keep-out-intrusive-neighbors","title":"GATE: How to Keep Out Intrusive Neighbors","date":"2024-06-01","arxiv_id":"2406.00418","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":8,"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/gate-how-to-keep-out-intrusive-neighbors#ran","syntology_url":"https://syntology.ai/paper/2406.00418","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.00418"}},"official":{"repos":["relationalml/gate"],"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/on-the-theoretical-expressive-power-and-the","slug":"on-the-theoretical-expressive-power-and-the","title":"On the Theoretical Expressive Power and the Design Space of Higher-Order Graph Transformers","date":"2024-04-04","arxiv_id":"2404.03380","repositories_listed":1,"syntology":{"n":13,"n_ran":11,"n_constructed":0,"n_ran_checked":10,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":10,"n_pointer_only":5,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 0 honoured, 0 violated, 10 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/on-the-theoretical-expressive-power-and-the#ran","syntology_url":"https://syntology.ai/paper/2404.03380","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.03380"}},"official":{"repos":["zhouc20/k-transformer"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/spikegraphormer-a-high-performance-graph","slug":"spikegraphormer-a-high-performance-graph","title":"SpikeGraphormer: A High-Performance Graph Transformer with Spiking Graph Attention","date":"2024-03-21","arxiv_id":"2403.15480","repositories_listed":1,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":1,"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) · 0 unverified","sample_list":"/paper/spikegraphormer-a-high-performance-graph#ran","syntology_url":"https://syntology.ai/paper/2403.15480","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.15480"}},"official":{"repos":["phd-lanyu/spikegraphormer"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/testam-a-time-enhanced-spatio-temporal","slug":"testam-a-time-enhanced-spatio-temporal","title":"TESTAM: A Time-Enhanced Spatio-Temporal Attention Model with Mixture of Experts","date":"2024-03-05","arxiv_id":"2403.02600","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":1,"n_honours":0,"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; 2 with no instrument failure: 0 honoured, 2 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/testam-a-time-enhanced-spatio-temporal#ran","syntology_url":"https://syntology.ai/paper/2403.02600","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.02600"}},"official":{"repos":["hyunwookl/testam"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/less-is-more-hop-wise-graph-attention-for","slug":"less-is-more-hop-wise-graph-attention-for","title":"Less is More: Hop-Wise Graph Attention for Scalable and Generalizable Learning on Circuits","date":"2024-03-02","arxiv_id":"2403.01317","repositories_listed":1,"syntology":{"n":6,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":1,"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) · 1 unverified","sample_list":"/paper/less-is-more-hop-wise-graph-attention-for#ran","syntology_url":"https://syntology.ai/paper/2403.01317","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.01317"}},"official":{"repos":["cornell-zhang/hoga"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/dhgcn-dynamic-hop-graph-convolution-network","slug":"dhgcn-dynamic-hop-graph-convolution-network","title":"DHGCN: Dynamic Hop Graph Convolution Network for Self-Supervised Point Cloud Learning","date":"2024-01-05","arxiv_id":"2401.02610","repositories_listed":1,"syntology":{"n":13,"n_ran":8,"n_constructed":1,"n_ran_checked":5,"n_instrument":3,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":13,"phrase":"8 ran (of which 1 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) · 5 unverified","sample_list":"/paper/dhgcn-dynamic-hop-graph-convolution-network#ran","syntology_url":"https://syntology.ai/paper/2401.02610","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2401.02610"}},"official":{"repos":["jinec98/dhgcn"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":1,"n_ran_no_instrument_failure":5,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/neural-multi-objective-combinatorial","slug":"neural-multi-objective-combinatorial","title":"Neural Multi-Objective Combinatorial Optimization with Diversity Enhancement","date":"2023-10-22","arxiv_id":"2310.15195","repositories_listed":1,"syntology":{"n":8,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":7,"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) · 7 unverified","sample_list":"/paper/neural-multi-objective-combinatorial#ran","syntology_url":"https://syntology.ai/paper/2310.15195","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.15195"}},"official":{"repos":["bill-cjb/nhde"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":7,"ran_from_kinds":["official"]}}},{"url":"/paper/tailoring-self-attention-for-graph-via-rooted-1","slug":"tailoring-self-attention-for-graph-via-rooted-1","title":"Tailoring Self-Attention for Graph via Rooted Subtrees","date":"2023-10-08","arxiv_id":"2310.05296","repositories_listed":1,"syntology":{"n":10,"n_ran":7,"n_constructed":0,"n_ran_checked":5,"n_instrument":2,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":10,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 2 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/tailoring-self-attention-for-graph-via-rooted-1#ran","syntology_url":"https://syntology.ai/paper/2310.05296","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.05296"}},"official":{"repos":["lumia-group/subtree-attention"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/learning-structure-from-motion-with-graph","slug":"learning-structure-from-motion-with-graph","title":"Learning Structure-from-Motion with Graph Attention Networks","date":"2023-08-30","arxiv_id":"2308.15984","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/learning-structure-from-motion-with-graph#ran","syntology_url":"https://syntology.ai/paper/2308.15984","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.15984"}},"official":{"repos":["lucasbrynte/gasfm"],"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/learning-on-graphs-with-out-of-distribution","slug":"learning-on-graphs-with-out-of-distribution","title":"Learning on Graphs with Out-of-Distribution Nodes","date":"2023-08-13","arxiv_id":"2308.06714","repositories_listed":1,"syntology":{"n":9,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":9,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/learning-on-graphs-with-out-of-distribution#ran","syntology_url":"https://syntology.ai/paper/2308.06714","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.06714"}},"official":{"repos":["songyyyy/kdd22-oodgat"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/spatial-temporal-enhanced-transformer-towards","slug":"spatial-temporal-enhanced-transformer-towards","title":"Spatial-Temporal Graph Enhanced DETR Towards Multi-Frame 3D Object Detection","date":"2023-07-01","arxiv_id":"2307.00347","repositories_listed":1,"syntology":{"n":8,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/spatial-temporal-enhanced-transformer-towards#ran","syntology_url":"https://syntology.ai/paper/2307.00347","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2307.00347"}},"official":{"repos":["eaphan/stemd"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/mobilevig-graph-based-sparse-attention-for","slug":"mobilevig-graph-based-sparse-attention-for","title":"MobileViG: Graph-Based Sparse Attention for Mobile Vision Applications","date":"2023-07-01","arxiv_id":"2307.00395","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/mobilevig-graph-based-sparse-attention-for#ran","syntology_url":"https://syntology.ai/paper/2307.00395","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2307.00395"}},"official":{"repos":["sldgroup/mobilevig"],"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/fisher-information-embedding-for-node-and","slug":"fisher-information-embedding-for-node-and","title":"Fisher Information Embedding for Node and Graph Learning","date":"2023-05-12","arxiv_id":"2305.07580","repositories_listed":1,"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":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) · 0 unverified","sample_list":"/paper/fisher-information-embedding-for-node-and#ran","syntology_url":"https://syntology.ai/paper/2305.07580","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.07580"}},"official":{"repos":["BorgwardtLab/fisher_information_embedding"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/self-supervised-trajectory-representation","slug":"self-supervised-trajectory-representation","title":"Self-supervised Trajectory Representation Learning with Temporal Regularities and Travel Semantics","date":"2022-11-17","arxiv_id":"2211.09510","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/self-supervised-trajectory-representation#ran","syntology_url":"https://syntology.ai/paper/2211.09510","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2211.09510"}},"official":{"repos":["aptx1231/start"],"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/what-makes-graph-neural-networks","slug":"what-makes-graph-neural-networks","title":"What Makes Graph Neural Networks Miscalibrated?","date":"2022-10-12","arxiv_id":"2210.06391","repositories_listed":1,"syntology":{"n":4,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":3,"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) · 3 unverified","sample_list":"/paper/what-makes-graph-neural-networks#ran","syntology_url":"https://syntology.ai/paper/2210.06391","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.06391"}},"official":{"repos":["hans66hsu/gats"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/cell-attention-networks","slug":"cell-attention-networks","title":"Cell Attention Networks","date":"2022-09-16","arxiv_id":"2209.08179","repositories_listed":1,"syntology":{"n":5,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":3,"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) · 3 unverified","sample_list":"/paper/cell-attention-networks#ran","syntology_url":"https://syntology.ai/paper/2209.08179","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2209.08179"}},"official":{"repos":["lrnzgiusti/can"],"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/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/onepose-one-shot-object-pose-estimation","slug":"onepose-one-shot-object-pose-estimation","title":"OnePose: One-Shot Object Pose Estimation without CAD Models","date":"2022-05-24","arxiv_id":"2205.12257","repositories_listed":1,"syntology":{"n":10,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":0,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/onepose-one-shot-object-pose-estimation#ran","syntology_url":"https://syntology.ai/paper/2205.12257","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.12257"}},"official":{"repos":["zju3dv/OnePose"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/heterformer-a-transformer-architecture-for","slug":"heterformer-a-transformer-architecture-for","title":"Heterformer: Transformer-based Deep Node Representation Learning on Heterogeneous Text-Rich Networks","date":"2022-05-20","arxiv_id":"2205.10282","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":0,"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) · 0 unverified","sample_list":"/paper/heterformer-a-transformer-architecture-for#ran","syntology_url":"https://syntology.ai/paper/2205.10282","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.10282"}},"official":{"repos":["petergriffinjin/heterformer"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/tie-topological-information-enhanced","slug":"tie-topological-information-enhanced","title":"TIE: Topological Information Enhanced Structural Reading Comprehension on Web Pages","date":"2022-05-13","arxiv_id":"2205.06435","repositories_listed":1,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":5,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":2,"phrase":"6 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; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/tie-topological-information-enhanced#ran","syntology_url":"https://syntology.ai/paper/2205.06435","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.06435"}},"official":{"repos":["x-lance/tie"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/robust-controlled-table-to-text-generation-1","slug":"robust-controlled-table-to-text-generation-1","title":"Robust (Controlled) Table-to-Text Generation with Structure-Aware Equivariance Learning","date":"2022-05-08","arxiv_id":"2205.03972","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/robust-controlled-table-to-text-generation-1#ran","syntology_url":"https://syntology.ai/paper/2205.03972","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.03972"}},"official":{"repos":["luka-group/lattice"],"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/long-term-spatio-temporal-forecasting-via","slug":"long-term-spatio-temporal-forecasting-via","title":"Long-term Spatio-temporal Forecasting via Dynamic Multiple-Graph Attention","date":"2022-04-23","arxiv_id":"2204.11008","repositories_listed":1,"syntology":{"n":9,"n_ran":6,"n_constructed":5,"n_ran_checked":6,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":9,"phrase":"6 ran (of which 5 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/long-term-spatio-temporal-forecasting-via#ran","syntology_url":"https://syntology.ai/paper/2204.11008","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2204.11008"}},"official":{"repos":["swsamleo/mlstgcn"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":5,"n_ran_no_instrument_failure":6,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/how-to-find-your-friendly-neighborhood-graph-1","slug":"how-to-find-your-friendly-neighborhood-graph-1","title":"How to Find Your Friendly Neighborhood: Graph Attention Design with Self-Supervision","date":"2022-04-11","arxiv_id":"2204.04879","repositories_listed":2,"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":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) · 0 unverified","sample_list":"/paper/how-to-find-your-friendly-neighborhood-graph-1#ran","syntology_url":"https://syntology.ai/paper/2204.04879","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2204.04879"}},"official":{"repos":["dongkwan-kim/SuperGAT"],"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/global-reasoned-multi-task-learning-model-for","slug":"global-reasoned-multi-task-learning-model-for","title":"Global-Reasoned Multi-Task Learning Model for Surgical Scene Understanding","date":"2022-01-28","arxiv_id":"2201.11957","repositories_listed":2,"syntology":{"n":8,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":7,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":8,"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) · 7 unverified","sample_list":"/paper/global-reasoned-multi-task-learning-model-for#ran","syntology_url":"https://syntology.ai/paper/2201.11957","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2201.11957"}},"official":{"repos":["lalithjets/global-reasoned-multi-task-model"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/gat-cadnet-graph-attention-network-for","slug":"gat-cadnet-graph-attention-network-for","title":"GAT-CADNet: Graph Attention Network for Panoptic Symbol Spotting in CAD Drawings","date":"2022-01-03","arxiv_id":"2201.00625","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":3,"n_ran_checked":4,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":4,"phrase":"4 ran (of which 3 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/gat-cadnet-graph-attention-network-for#ran","syntology_url":"https://syntology.ai/paper/2201.00625","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2201.00625"}},"official":null}},{"url":"/paper/gbk-gnn-gated-bi-kernel-graph-neural-networks","slug":"gbk-gnn-gated-bi-kernel-graph-neural-networks","title":"GBK-GNN: Gated Bi-Kernel Graph Neural Networks for Modeling Both Homophily and Heterophily","date":"2021-10-29","arxiv_id":"2110.15777","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/gbk-gnn-gated-bi-kernel-graph-neural-networks#ran","syntology_url":"https://syntology.ai/paper/2110.15777","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.15777"}},"official":{"repos":["xzh0u/gbk-gnn"],"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/alignment-attention-by-matching-key-and-query","slug":"alignment-attention-by-matching-key-and-query","title":"Alignment Attention by Matching Key and Query Distributions","date":"2021-10-25","arxiv_id":"2110.12567","repositories_listed":1,"syntology":{"n":4,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":3,"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) · 3 unverified","sample_list":"/paper/alignment-attention-by-matching-key-and-query#ran","syntology_url":"https://syntology.ai/paper/2110.12567","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.12567"}},"official":{"repos":["szhang42/alignment_attention"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/aasist-audio-anti-spoofing-using-integrated","slug":"aasist-audio-anti-spoofing-using-integrated","title":"AASIST: Audio Anti-Spoofing using Integrated Spectro-Temporal Graph Attention Networks","date":"2021-10-04","arxiv_id":"2110.01200","repositories_listed":2,"syntology":{"n":12,"n_ran":11,"n_constructed":0,"n_ran_checked":9,"n_instrument":2,"n_unverified":1,"n_honours":3,"n_violates":0,"n_no_contract":6,"n_pointer_only":2,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 3 honoured, 0 violated, 6 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/aasist-audio-anti-spoofing-using-integrated#ran","syntology_url":"https://syntology.ai/paper/2110.01200","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.01200"}},"official":{"repos":["clovaai/aasist"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":1,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/drug-target-interaction-prediction-with-graph","slug":"drug-target-interaction-prediction-with-graph","title":"Drug-Target Interaction Prediction with Graph Attention networks","date":"2021-07-10","arxiv_id":"2107.06099","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/drug-target-interaction-prediction-with-graph#ran","syntology_url":"https://syntology.ai/paper/2107.06099","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2107.06099"}},"official":{"repos":["Haiyang-W/DTI-GRAPH"],"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/spatial-graph-attention-and-curiosity-driven","slug":"spatial-graph-attention-and-curiosity-driven","title":"Spatial Graph Attention and Curiosity-driven Policy for Antiviral Drug Discovery","date":"2021-06-04","arxiv_id":"2106.02190","repositories_listed":4,"syntology":{"n":14,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":0,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 0 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/spatial-graph-attention-and-curiosity-driven#ran","syntology_url":"https://syntology.ai/paper/2106.02190","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.02190"}},"official":{"repos":["njchoma/DGAPN","yulun-rayn/dgapn","yulun-rayn/SGAnCP4ADD"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/how-attentive-are-graph-attention-networks","slug":"how-attentive-are-graph-attention-networks","title":"How Attentive are Graph Attention Networks?","date":"2021-05-30","arxiv_id":"2105.14491","repositories_listed":8,"syntology":{"n":16,"n_ran":11,"n_constructed":1,"n_ran_checked":11,"n_instrument":0,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":11,"n_pointer_only":1,"phrase":"11 ran (of which 1 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) · 5 unverified","sample_list":"/paper/how-attentive-are-graph-attention-networks#ran","syntology_url":"https://syntology.ai/paper/2105.14491","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.14491"}},"official":{"repos":["tech-srl/how_attentive_are_gats"],"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/gate-graph-attention-transformer-encoder-for","slug":"gate-graph-attention-transformer-encoder-for","title":"GATE: Graph Attention Transformer Encoder for Cross-lingual Relation and Event Extraction","date":"2020-10-06","arxiv_id":"2010.03009","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":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/gate-graph-attention-transformer-encoder-for#ran","syntology_url":"https://syntology.ai/paper/2010.03009","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.03009"}},"official":null}},{"url":"/paper/kg-bart-knowledge-graph-augmented-bart-for","slug":"kg-bart-knowledge-graph-augmented-bart-for","title":"KG-BART: Knowledge Graph-Augmented BART for Generative Commonsense Reasoning","date":"2020-09-26","arxiv_id":"2009.12677","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 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; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/kg-bart-knowledge-graph-augmented-bart-for#ran","syntology_url":"https://syntology.ai/paper/2009.12677","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2009.12677"}},"official":{"repos":["yeliu918/KG-BART"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/multivariate-time-series-anomaly-detection","slug":"multivariate-time-series-anomaly-detection","title":"Multivariate Time-series Anomaly Detection via Graph Attention Network","date":"2020-09-04","arxiv_id":"2009.02040","repositories_listed":2,"syntology":{"n":8,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":2,"n_no_contract":6,"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, 2 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/multivariate-time-series-anomaly-detection#ran","syntology_url":"https://syntology.ai/paper/2009.02040","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2009.02040"}},"official":null}},{"url":"/paper/molecule-edit-graph-attention-network","slug":"molecule-edit-graph-attention-network","title":"Molecule Edit Graph Attention Network: Modeling Chemical Reactions as Sequences of Graph Edits","date":"2020-06-27","arxiv_id":"2006.15426","repositories_listed":1,"syntology":{"n":6,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":1,"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) · 1 unverified","sample_list":"/paper/molecule-edit-graph-attention-network#ran","syntology_url":"https://syntology.ai/paper/2006.15426","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.15426"}},"official":{"repos":["molecule-one/megan"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/bandit-samplers-for-training-graph-neural","slug":"bandit-samplers-for-training-graph-neural","title":"Bandit Samplers for Training Graph Neural Networks","date":"2020-06-10","arxiv_id":"2006.05806","repositories_listed":2,"syntology":{"n":8,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":5,"n_honours":1,"n_violates":1,"n_no_contract":1,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 1 honoured, 1 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/bandit-samplers-for-training-graph-neural#ran","syntology_url":"https://syntology.ai/paper/2006.05806","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.05806"}},"official":{"repos":["xavierzw/ogb-geniepath-bs"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/document-modeling-with-graph-attention","slug":"document-modeling-with-graph-attention","title":"Document Modeling with Graph Attention Networks for Multi-grained Machine Reading Comprehension","date":"2020-05-12","arxiv_id":"2005.05806","repositories_listed":1,"syntology":{"n":16,"n_ran":8,"n_constructed":8,"n_ran_checked":8,"n_instrument":0,"n_unverified":8,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":16,"phrase":"8 ran (of which 8 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) · 8 unverified; every one of the 8 samples that ran constructed an object rather than computing a result","sample_list":"/paper/document-modeling-with-graph-attention#ran","syntology_url":"https://syntology.ai/paper/2005.05806","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.05806"}},"official":{"repos":["DancingSoul/NQ_BERT-DM"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":8,"n_ran_no_instrument_failure":8,"n_unverified":8,"ran_from_kinds":["official"]}}},{"url":"/paper/machine-learning-on-graphs-a-model-and","slug":"machine-learning-on-graphs-a-model-and","title":"Machine Learning on Graphs: A Model and Comprehensive Taxonomy","date":"2020-05-07","arxiv_id":"2005.03675","repositories_listed":1,"syntology":{"n":8,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":6,"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) · 6 unverified","sample_list":"/paper/machine-learning-on-graphs-a-model-and#ran","syntology_url":"https://syntology.ai/paper/2005.03675","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.03675"}},"official":{"repos":["google/gcnn-survey-paper"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":6,"ran_from_kinds":["official"]}}},{"url":"/paper/relational-graph-attention-network-for-aspect","slug":"relational-graph-attention-network-for-aspect","title":"Relational Graph Attention Network for Aspect-based Sentiment Analysis","date":"2020-04-26","arxiv_id":"2004.12362","repositories_listed":1,"syntology":{"n":6,"n_ran":4,"n_constructed":1,"n_ran_checked":4,"n_instrument":0,"n_unverified":2,"n_honours":1,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"4 ran (of which 1 constructed an object rather than computing a result; 4 with no instrument failure: 1 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/relational-graph-attention-network-for-aspect#ran","syntology_url":"https://syntology.ai/paper/2004.12362","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.12362"}},"official":{"repos":["shenwzh3/RGAT-ABSA"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":1,"n_ran_no_instrument_failure":4,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/disease-state-prediction-from-single-cell","slug":"disease-state-prediction-from-single-cell","title":"Disease State Prediction From Single-Cell Data Using Graph Attention Networks","date":"2020-02-14","arxiv_id":"2002.07128","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":2,"n_pointer_only":1,"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) · 0 unverified","sample_list":"/paper/disease-state-prediction-from-single-cell#ran","syntology_url":"https://syntology.ai/paper/2002.07128","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.07128"}},"official":{"repos":["vandijklab/scGAT"],"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/kernel-graph-attention-network-for-fact","slug":"kernel-graph-attention-network-for-fact","title":"Fine-grained Fact Verification with Kernel Graph Attention Network","date":"2019-10-22","arxiv_id":"1910.09796","repositories_listed":1,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":3,"n_instrument":1,"n_unverified":1,"n_honours":3,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 3 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/kernel-graph-attention-network-for-fact#ran","syntology_url":"https://syntology.ai/paper/1910.09796","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.09796"}},"official":{"repos":["thunlp/KernelGAT"],"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","unlocated"]}}},{"url":"/paper/knowledge-enriched-transformer-for-emotion","slug":"knowledge-enriched-transformer-for-emotion","title":"Knowledge-Enriched Transformer for Emotion Detection in Textual Conversations","date":"2019-09-24","arxiv_id":"1909.10681","repositories_listed":1,"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/knowledge-enriched-transformer-for-emotion#ran","syntology_url":"https://syntology.ai/paper/1909.10681","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1909.10681"}},"official":{"repos":["zhongpeixiang/KET"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/graph-based-reasoning-over-heterogeneous","slug":"graph-based-reasoning-over-heterogeneous","title":"Graph-Based Reasoning over Heterogeneous External Knowledge for Commonsense Question Answering","date":"2019-09-09","arxiv_id":"1909.05311","repositories_listed":1,"syntology":{"n":17,"n_ran":12,"n_constructed":0,"n_ran_checked":7,"n_instrument":5,"n_unverified":5,"n_honours":2,"n_violates":0,"n_no_contract":5,"n_pointer_only":2,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 2 honoured, 0 violated, 5 with no contract checked; 5 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/graph-based-reasoning-over-heterogeneous#ran","syntology_url":"https://syntology.ai/paper/1909.05311","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1909.05311"}},"official":{"repos":["DecstionBack/AAAI_2020_CommonsenseQA"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/relational-graph-attention-networks-1","slug":"relational-graph-attention-networks-1","title":"Relational Graph Attention Networks","date":"2019-04-11","arxiv_id":"1904.05811","repositories_listed":2,"syntology":{"n":10,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/relational-graph-attention-networks-1#ran","syntology_url":"https://syntology.ai/paper/1904.05811","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.05811"}},"official":{"repos":["Babylonpartners/rgat"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/relation-aware-graph-attention-network-for","slug":"relation-aware-graph-attention-network-for","title":"Relation-Aware Graph Attention Network for Visual Question Answering","date":"2019-03-29","arxiv_id":"1903.12314","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":2,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 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; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/relation-aware-graph-attention-network-for#ran","syntology_url":"https://syntology.ai/paper/1903.12314","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1903.12314"}},"official":{"repos":["linjieli222/VQA_ReGAT"],"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/session-based-social-recommendation-via","slug":"session-based-social-recommendation-via","title":"Session-based Social Recommendation via Dynamic Graph Attention Networks","date":"2019-02-25","arxiv_id":"1902.09362","repositories_listed":2,"syntology":{"n":13,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":12,"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) · 12 unverified","sample_list":"/paper/session-based-social-recommendation-via#ran","syntology_url":"https://syntology.ai/paper/1902.09362","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1902.09362"}},"official":{"repos":["DeepGraphLearning/RecommenderSystems"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":12,"ran_from_kinds":["official"]}}},{"url":"/paper/representation-learning-on-graphs-with","slug":"representation-learning-on-graphs-with","title":"Representation Learning on Graphs with Jumping Knowledge Networks","date":"2018-06-09","arxiv_id":"1806.03536","repositories_listed":5,"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/representation-learning-on-graphs-with#ran","syntology_url":"https://syntology.ai/paper/1806.03536","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1806.03536"}},"official":null}},{"url":"/paper/graph-attention-networks","slug":"graph-attention-networks","title":"Graph Attention Networks","date":"2017-10-30","arxiv_id":"1710.10903","repositories_listed":93,"syntology":{"n":106,"n_ran":61,"n_constructed":28,"n_ran_checked":52,"n_instrument":9,"n_unverified":45,"n_honours":1,"n_violates":2,"n_no_contract":49,"n_pointer_only":46,"phrase":"61 ran (of which 28 constructed an object rather than computing a result; 52 with no instrument failure: 1 honoured, 2 violated, 49 with no contract checked; 9 where Syntology's instrument failed) · 45 unverified","sample_list":"/paper/graph-attention-networks#ran","syntology_url":"https://syntology.ai/paper/1710.10903","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1710.10903"}},"official":{"repos":["PetarV-/GAT"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}}],"record_sha256":"d444e9beaa41cd967d776d04e59a0583e6ef89ec3447d5c11ad1a67eb66aada8","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}