{"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-learning/papers/ran/1","list_of":"/task/graph-learning","task":"Graph Learning","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":2,"rows_per_page":100,"rows":[1,100],"of":193,"counts":{"archive_papers_tagged":1570,"with_a_code_link":686,"where_syntology_ran_a_sample":193,"not_listed_spam_title":0,"listed":1570,"listed_where_code_ran":193,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":162,"every_run_a_failure_of_syntologys_instrument":31,"listed_with_a_run_with_no_instrument_failure":162,"listed_every_run_a_failure_of_syntologys_instrument":31,"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-learning/papers/ran/1","prev":null,"next":"/task/graph-learning/papers/ran/2","papers":[{"url":"/paper/2506-08618","slug":"2506-08618","title":"HSG-12M: A Large-Scale Spatial Multigraph Dataset","date":"2025-06-10","arxiv_id":"2506.08618","repositories_listed":2,"syntology":{"n":14,"n_ran":10,"n_constructed":0,"n_ran_checked":5,"n_instrument":5,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"10 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; 5 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/2506-08618#ran","syntology_url":"https://syntology.ai/paper/2506.08618","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2506.08618"}},"official":{"repos":["sarinstein-yan/hsg-12m","sarinstein-yan/poly2graph"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/scalable-graph-generative-modeling-via","slug":"scalable-graph-generative-modeling-via","title":"Scalable Graph Generative Modeling via Substructure Sequences","date":"2025-05-22","arxiv_id":"2505.16130","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/scalable-graph-generative-modeling-via#ran","syntology_url":"https://syntology.ai/paper/2505.16130","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2505.16130"}},"official":{"repos":["zehong-wang/g2pm"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/between-linear-and-sinusoidal-rethinking-the","slug":"between-linear-and-sinusoidal-rethinking-the","title":"Between Linear and Sinusoidal: Rethinking the Time Encoder in Dynamic Graph Learning","date":"2025-04-10","arxiv_id":"2504.08129","repositories_listed":1,"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":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) · 2 unverified","sample_list":"/paper/between-linear-and-sinusoidal-rethinking-the#ran","syntology_url":"https://syntology.ai/paper/2504.08129","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2504.08129"}},"official":{"repos":["hsinghuan/dg-linear-time"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/exploring-graph-tasks-with-pure-llms-a","slug":"exploring-graph-tasks-with-pure-llms-a","title":"Exploring Graph Tasks with Pure LLMs: A Comprehensive Benchmark and Investigation","date":"2025-02-26","arxiv_id":"2502.18771","repositories_listed":1,"syntology":{"n":12,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":4,"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) · 4 unverified","sample_list":"/paper/exploring-graph-tasks-with-pure-llms-a#ran","syntology_url":"https://syntology.ai/paper/2502.18771","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2502.18771"}},"official":{"repos":["myflashbarry/LLM-benchmarking"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/decoupled-graph-energy-based-model-for-node","slug":"decoupled-graph-energy-based-model-for-node","title":"Decoupled Graph Energy-based Model for Node Out-of-Distribution Detection on Heterophilic Graphs","date":"2025-02-25","arxiv_id":"2502.17912","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/decoupled-graph-energy-based-model-for-node#ran","syntology_url":"https://syntology.ai/paper/2502.17912","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2502.17912"}},"official":{"repos":["draym28/degem"],"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/no-metric-to-rule-them-all-toward-principled","slug":"no-metric-to-rule-them-all-toward-principled","title":"No Metric to Rule Them All: Toward Principled Evaluations of Graph-Learning Datasets","date":"2025-02-04","arxiv_id":"2502.02379","repositories_listed":1,"syntology":{"n":7,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":4,"n_honours":1,"n_violates":1,"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: 1 honoured, 1 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/no-metric-to-rule-them-all-toward-principled#ran","syntology_url":"https://syntology.ai/paper/2502.02379","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2502.02379"}},"official":{"repos":["aidos-lab/rings"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/neural-graph-pattern-machine","slug":"neural-graph-pattern-machine","title":"Beyond Message Passing: Neural Graph Pattern Machine","date":"2025-01-30","arxiv_id":"2501.18739","repositories_listed":2,"syntology":{"n":11,"n_ran":10,"n_constructed":0,"n_ran_checked":7,"n_instrument":3,"n_unverified":1,"n_honours":1,"n_violates":2,"n_no_contract":4,"n_pointer_only":2,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 1 honoured, 2 violated, 4 with no contract checked; 3 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/neural-graph-pattern-machine#ran","syntology_url":"https://syntology.ai/paper/2501.18739","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2501.18739"}},"official":{"repos":["zehong-wang/gpm"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/boosting-short-text-classification-with-multi","slug":"boosting-short-text-classification-with-multi","title":"Boosting Short Text Classification with Multi-Source Information Exploration and Dual-Level Contrastive Learning","date":"2025-01-16","arxiv_id":"2501.09214","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":2,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":3,"phrase":"3 ran (of which 2 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/boosting-short-text-classification-with-multi#ran","syntology_url":"https://syntology.ai/paper/2501.09214","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2501.09214"}},"official":{"repos":["keaml-jlu/mi-delight"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":2,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/a-simple-graph-contrastive-learning-framework","slug":"a-simple-graph-contrastive-learning-framework","title":"A Simple Graph Contrastive Learning Framework for Short Text Classification","date":"2025-01-16","arxiv_id":"2501.09219","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"1 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/a-simple-graph-contrastive-learning-framework#ran","syntology_url":"https://syntology.ai/paper/2501.09219","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2501.09219"}},"official":{"repos":["keaml-jlu/simstc"],"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/enhancing-graph-representation-learning-with-1","slug":"enhancing-graph-representation-learning-with-1","title":"Enhancing Graph Representation Learning with Localized Topological Features","date":"2025-01-15","arxiv_id":"2501.09178","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/enhancing-graph-representation-learning-with-1#ran","syntology_url":"https://syntology.ai/paper/2501.09178","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2501.09178"}},"official":{"repos":["pkuyzy/TLC-GNN"],"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-range-brain-graph-transformer","slug":"long-range-brain-graph-transformer","title":"Long-range Brain Graph Transformer","date":"2025-01-02","arxiv_id":"2501.01100","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/long-range-brain-graph-transformer#ran","syntology_url":"https://syntology.ai/paper/2501.01100","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2501.01100"}},"official":{"repos":["yushuowiki/alter"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/training-mlps-on-graphs-without-supervision","slug":"training-mlps-on-graphs-without-supervision","title":"Training MLPs on Graphs without Supervision","date":"2024-12-05","arxiv_id":"2412.03864","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/training-mlps-on-graphs-without-supervision#ran","syntology_url":"https://syntology.ai/paper/2412.03864","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2412.03864"}},"official":{"repos":["zehong-wang/simmlp"],"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/gft-graph-foundation-model-with-transferable","slug":"gft-graph-foundation-model-with-transferable","title":"GFT: Graph Foundation Model with Transferable Tree Vocabulary","date":"2024-11-09","arxiv_id":"2411.06070","repositories_listed":1,"syntology":{"n":25,"n_ran":18,"n_constructed":0,"n_ran_checked":10,"n_instrument":8,"n_unverified":7,"n_honours":1,"n_violates":2,"n_no_contract":7,"n_pointer_only":10,"phrase":"18 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 1 honoured, 2 violated, 7 with no contract checked; 8 where Syntology's instrument failed) · 7 unverified","sample_list":"/paper/gft-graph-foundation-model-with-transferable#ran","syntology_url":"https://syntology.ai/paper/2411.06070","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2411.06070"}},"official":{"repos":["zehong-wang/gft"],"state":"official (archive's flag): 17 ran","n_ran":17,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":7,"ran_from_kinds":["community","official"]}}},{"url":"/paper/distributed-order-fractional-graph-operating","slug":"distributed-order-fractional-graph-operating","title":"Distributed-Order Fractional Graph Operating Network","date":"2024-11-08","arxiv_id":"2411.05274","repositories_listed":1,"syntology":{"n":8,"n_ran":8,"n_constructed":0,"n_ran_checked":5,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":8,"phrase":"8 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; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/distributed-order-fractional-graph-operating#ran","syntology_url":"https://syntology.ai/paper/2411.05274","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2411.05274"}},"official":{"repos":["zknus/neurips-2024-dragon"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":0,"ran_from_kinds":["official","unlocated"]}}},{"url":"/paper/pagerank-bandits-for-link-prediction","slug":"pagerank-bandits-for-link-prediction","title":"PageRank Bandits for Link Prediction","date":"2024-11-03","arxiv_id":"2411.01410","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":4,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"5 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; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/pagerank-bandits-for-link-prediction#ran","syntology_url":"https://syntology.ai/paper/2411.01410","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2411.01410"}},"official":{"repos":["jiaruzouu/prb"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/graph-learning-for-numeric-planning","slug":"graph-learning-for-numeric-planning","title":"Graph Learning for Numeric Planning","date":"2024-10-31","arxiv_id":"2410.24080","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/graph-learning-for-numeric-planning#ran","syntology_url":"https://syntology.ai/paper/2410.24080","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.24080"}},"official":{"repos":["DillonZChen/goose"],"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/fedssp-federated-graph-learning-with-spectral","slug":"fedssp-federated-graph-learning-with-spectral","title":"FedSSP: Federated Graph Learning with Spectral Knowledge and Personalized Preference","date":"2024-10-26","arxiv_id":"2410.20105","repositories_listed":1,"syntology":{"n":6,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":1,"n_honours":2,"n_violates":0,"n_no_contract":3,"n_pointer_only":6,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 2 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/fedssp-federated-graph-learning-with-spectral#ran","syntology_url":"https://syntology.ai/paper/2410.20105","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.20105"}},"official":{"repos":["oakleytan/fedssp"],"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/homomorphism-counts-as-structural-encodings","slug":"homomorphism-counts-as-structural-encodings","title":"Homomorphism Counts as Structural Encodings for Graph Learning","date":"2024-10-24","arxiv_id":"2410.18676","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":1,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":1,"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; 2 with no instrument failure: 1 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/homomorphism-counts-as-structural-encodings#ran","syntology_url":"https://syntology.ai/paper/2410.18676","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.18676"}},"official":{"repos":["linusbao/MoSE"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":1,"n_ran_no_instrument_failure":2,"n_unverified":1,"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/learning-graph-quantized-tokenizers-for","slug":"learning-graph-quantized-tokenizers-for","title":"Learning Graph Quantized Tokenizers","date":"2024-10-17","arxiv_id":"2410.13798","repositories_listed":1,"syntology":{"n":13,"n_ran":11,"n_constructed":0,"n_ran_checked":7,"n_instrument":4,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":3,"phrase":"11 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; 4 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/learning-graph-quantized-tokenizers-for#ran","syntology_url":"https://syntology.ai/paper/2410.13798","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.13798"}},"official":{"repos":["limei0307/GQT"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/cluster-wise-graph-transformer-with-dual","slug":"cluster-wise-graph-transformer-with-dual","title":"Cluster-wise Graph Transformer with Dual-granularity Kernelized Attention","date":"2024-10-09","arxiv_id":"2410.06746","repositories_listed":1,"syntology":{"n":14,"n_ran":13,"n_constructed":0,"n_ran_checked":10,"n_instrument":3,"n_unverified":1,"n_honours":2,"n_violates":0,"n_no_contract":8,"n_pointer_only":14,"phrase":"13 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 2 honoured, 0 violated, 8 with no contract checked; 3 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/cluster-wise-graph-transformer-with-dual#ran","syntology_url":"https://syntology.ai/paper/2410.06746","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.06746"}},"official":{"repos":["lumia-group/cluster-wise-graph-transformer"],"state":"official (archive's flag): 13 ran","n_ran":13,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/beyond-redundancy-information-aware","slug":"beyond-redundancy-information-aware","title":"Beyond Redundancy: Information-aware Unsupervised Multiplex Graph Structure Learning","date":"2024-09-25","arxiv_id":"2409.17386","repositories_listed":1,"syntology":{"n":10,"n_ran":5,"n_constructed":0,"n_ran_checked":3,"n_instrument":2,"n_unverified":5,"n_honours":1,"n_violates":0,"n_no_contract":2,"n_pointer_only":10,"phrase":"5 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; 2 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/beyond-redundancy-information-aware#ran","syntology_url":"https://syntology.ai/paper/2409.17386","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2409.17386"}},"official":{"repos":["zxlearningdeep/infomgf"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/cliqueph-higher-order-information-for-graph","slug":"cliqueph-higher-order-information-for-graph","title":"CliquePH: Higher-Order Information for Graph Neural Networks through Persistent Homology on Clique Graphs","date":"2024-09-12","arxiv_id":"2409.08217","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":1,"n_no_contract":6,"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, 1 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/cliqueph-higher-order-information-for-graph#ran","syntology_url":"https://syntology.ai/paper/2409.08217","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2409.08217"}},"official":{"repos":["DavideBuffelli/CliquePH"],"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/multi-task-heterogeneous-graph-learning-on","slug":"multi-task-heterogeneous-graph-learning-on","title":"Multi-task Heterogeneous Graph Learning on Electronic Health Records","date":"2024-08-14","arxiv_id":"2408.07569","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":2,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/multi-task-heterogeneous-graph-learning-on#ran","syntology_url":"https://syntology.ai/paper/2408.07569","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2408.07569"}},"official":{"repos":["hku-medai/mult-ehr"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/dyg-mamba-continuous-state-space-modeling-on","slug":"dyg-mamba-continuous-state-space-modeling-on","title":"DyG-Mamba: Continuous State Space Modeling on Dynamic Graphs","date":"2024-08-13","arxiv_id":"2408.06966","repositories_listed":0,"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":6,"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/dyg-mamba-continuous-state-space-modeling-on#ran","syntology_url":"https://syntology.ai/paper/2408.06966","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2408.06966"}},"official":null}},{"url":"/paper/joint-graph-rewiring-and-feature-denoising","slug":"joint-graph-rewiring-and-feature-denoising","title":"Joint Graph Rewiring and Feature Denoising via Spectral Resonance","date":"2024-08-13","arxiv_id":"2408.07191","repositories_listed":1,"syntology":{"n":9,"n_ran":7,"n_constructed":0,"n_ran_checked":2,"n_instrument":5,"n_unverified":2,"n_honours":0,"n_violates":2,"n_no_contract":0,"n_pointer_only":9,"phrase":"7 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; 5 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/joint-graph-rewiring-and-feature-denoising#ran","syntology_url":"https://syntology.ai/paper/2408.07191","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2408.07191"}},"official":{"repos":["jlinki/JDR"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/you-can-t-ignore-either-unifying-structure","slug":"you-can-t-ignore-either-unifying-structure","title":"You Can't Ignore Either: Unifying Structure and Feature Denoising for Robust Graph Learning","date":"2024-08-01","arxiv_id":"2408.00700","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/you-can-t-ignore-either-unifying-structure#ran","syntology_url":"https://syntology.ai/paper/2408.00700","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2408.00700"}},"official":{"repos":["youngtimmy/ugd"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/2408-00165","slug":"2408-00165","title":"Non-convolutional Graph Neural Networks","date":"2024-07-31","arxiv_id":"2408.00165","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/2408-00165#ran","syntology_url":"https://syntology.ai/paper/2408.00165","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2408.00165"}},"official":{"repos":["yuanqing-wang/rum"],"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/rethinking-the-effectiveness-of-graph","slug":"rethinking-the-effectiveness-of-graph","title":"Rethinking the Effectiveness of Graph Classification Datasets in Benchmarks for Assessing GNNs","date":"2024-07-06","arxiv_id":"2407.04999","repositories_listed":1,"syntology":{"n":14,"n_ran":11,"n_constructed":0,"n_ran_checked":9,"n_instrument":2,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":1,"phrase":"11 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; 2 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/rethinking-the-effectiveness-of-graph#ran","syntology_url":"https://syntology.ai/paper/2407.04999","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.04999"}},"official":{"repos":["ICLab4DL/GNNBenchEffectiveness"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/federated-graph-semantic-and-structural","slug":"federated-graph-semantic-and-structural","title":"Federated Graph Semantic and Structural Learning","date":"2024-06-27","arxiv_id":"2406.18937","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/federated-graph-semantic-and-structural#ran","syntology_url":"https://syntology.ai/paper/2406.18937","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.18937"}},"official":{"repos":["guanchengwan/fgssl"],"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/kagnns-kolmogorov-arnold-networks-meet-graph","slug":"kagnns-kolmogorov-arnold-networks-meet-graph","title":"KAGNNs: Kolmogorov-Arnold Networks meet Graph Learning","date":"2024-06-26","arxiv_id":"2406.18380","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":8,"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/kagnns-kolmogorov-arnold-networks-meet-graph#ran","syntology_url":"https://syntology.ai/paper/2406.18380","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.18380"}},"official":{"repos":["RomanBresson/KAGNN"],"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/distance-recomputator-and-topology","slug":"distance-recomputator-and-topology","title":"Distance Recomputator and Topology Reconstructor for Graph Neural Networks","date":"2024-06-25","arxiv_id":"2406.17281","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":3,"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/distance-recomputator-and-topology#ran","syntology_url":"https://syntology.ai/paper/2406.17281","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.17281"}},"official":{"repos":["NoakLiu/Distance-Recomputator-and-Topology-Reconstructor"],"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/graphsnapshot-graph-machine-learning","slug":"graphsnapshot-graph-machine-learning","title":"GraphSnapShot: Caching Local Structure for Fast Graph Learning","date":"2024-06-25","arxiv_id":"2406.17918","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/graphsnapshot-graph-machine-learning#ran","syntology_url":"https://syntology.ai/paper/2406.17918","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.17918"}},"official":{"repos":["noakliu/graphsnapshot"],"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/next-level-message-passing-with-hierarchical","slug":"next-level-message-passing-with-hierarchical","title":"Next Level Message-Passing with Hierarchical Support Graphs","date":"2024-06-22","arxiv_id":"2406.15852","repositories_listed":1,"syntology":{"n":10,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":2,"n_no_contract":5,"n_pointer_only":6,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 2 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/next-level-message-passing-with-hierarchical#ran","syntology_url":"https://syntology.ai/paper/2406.15852","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.15852"}},"official":{"repos":["carlosinator/support-graphs"],"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/igl-bench-establishing-the-comprehensive","slug":"igl-bench-establishing-the-comprehensive","title":"IGL-Bench: Establishing the Comprehensive Benchmark for Imbalanced Graph Learning","date":"2024-06-14","arxiv_id":"2406.09870","repositories_listed":1,"syntology":{"n":9,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":1,"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) · 1 unverified","sample_list":"/paper/igl-bench-establishing-the-comprehensive#ran","syntology_url":"https://syntology.ai/paper/2406.09870","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.09870"}},"official":{"repos":["ringbdstack/igl-bench"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/towards-neural-scaling-laws-for-foundation","slug":"towards-neural-scaling-laws-for-foundation","title":"Towards Neural Scaling Laws for Foundation Models on Temporal Graphs","date":"2024-06-14","arxiv_id":"2406.10426","repositories_listed":1,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/towards-neural-scaling-laws-for-foundation#ran","syntology_url":"https://syntology.ai/paper/2406.10426","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.10426"}},"official":{"repos":["benjaminnNgo/ScalingTGNs"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/scalable-and-flexible-causal-discovery-with","slug":"scalable-and-flexible-causal-discovery-with","title":"Scalable and Flexible Causal Discovery with an Efficient Test for Adjacency","date":"2024-06-13","arxiv_id":"2406.09177","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":4,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/scalable-and-flexible-causal-discovery-with#ran","syntology_url":"https://syntology.ai/paper/2406.09177","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.09177"}},"official":{"repos":["alannawzadamin/dat-graph"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/a-flexible-equivariant-framework-for-subgraph","slug":"a-flexible-equivariant-framework-for-subgraph","title":"A Flexible, Equivariant Framework for Subgraph GNNs via Graph Products and Graph Coarsening","date":"2024-06-13","arxiv_id":"2406.09291","repositories_listed":0,"syntology":{"n":15,"n_ran":13,"n_constructed":0,"n_ran_checked":13,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":1,"n_no_contract":12,"n_pointer_only":0,"phrase":"13 ran (of which 0 constructed an object rather than computing a result; 13 with no instrument failure: 0 honoured, 1 violated, 12 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/a-flexible-equivariant-framework-for-subgraph#ran","syntology_url":"https://syntology.ai/paper/2406.09291","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.09291"}},"official":null}},{"url":"/paper/state-space-models-on-temporal-graphs-a-first","slug":"state-space-models-on-temporal-graphs-a-first","title":"State Space Models on Temporal Graphs: A First-Principles Study","date":"2024-06-03","arxiv_id":"2406.00943","repositories_listed":1,"syntology":{"n":6,"n_ran":5,"n_constructed":3,"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 3 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/state-space-models-on-temporal-graphs-a-first#ran","syntology_url":"https://syntology.ai/paper/2406.00943","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.00943"}},"official":{"repos":["edisonleeeee/graphssm"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":3,"n_ran_no_instrument_failure":5,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/can-graph-learning-improve-task-planning","slug":"can-graph-learning-improve-task-planning","title":"Can Graph Learning Improve Planning in LLM-based Agents?","date":"2024-05-29","arxiv_id":"2405.19119","repositories_listed":1,"syntology":{"n":13,"n_ran":10,"n_constructed":0,"n_ran_checked":10,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":10,"n_pointer_only":0,"phrase":"10 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; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/can-graph-learning-improve-task-planning#ran","syntology_url":"https://syntology.ai/paper/2405.19119","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.19119"}},"official":{"repos":["wxxshirley/gnn4taskplan"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/cross-context-backdoor-attacks-against-graph","slug":"cross-context-backdoor-attacks-against-graph","title":"Cross-Context Backdoor Attacks against Graph Prompt Learning","date":"2024-05-28","arxiv_id":"2405.17984","repositories_listed":1,"syntology":{"n":11,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":11,"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) · 5 unverified","sample_list":"/paper/cross-context-backdoor-attacks-against-graph#ran","syntology_url":"https://syntology.ai/paper/2405.17984","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.17984"}},"official":{"repos":["xtLyu/CrossBA"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/structure-aware-semantic-node-identifiers-for","slug":"structure-aware-semantic-node-identifiers-for","title":"Node Identifiers: Compact, Discrete Representations for Efficient Graph Learning","date":"2024-05-26","arxiv_id":"2405.16435","repositories_listed":1,"syntology":{"n":13,"n_ran":10,"n_constructed":0,"n_ran_checked":9,"n_instrument":1,"n_unverified":3,"n_honours":0,"n_violates":2,"n_no_contract":7,"n_pointer_only":3,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 2 violated, 7 with no contract checked; 1 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/structure-aware-semantic-node-identifiers-for#ran","syntology_url":"https://syntology.ai/paper/2405.16435","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.16435"}},"official":{"repos":["LUOyk1999/NodeID"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/repeat-aware-neighbor-sampling-for-dynamic","slug":"repeat-aware-neighbor-sampling-for-dynamic","title":"Repeat-Aware Neighbor Sampling for Dynamic Graph Learning","date":"2024-05-24","arxiv_id":"2405.17473","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":4,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/repeat-aware-neighbor-sampling-for-dynamic#ran","syntology_url":"https://syntology.ai/paper/2405.17473","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.17473"}},"official":{"repos":["Hope-Rita/RepeatMixer"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/graph-sparsification-via-mixture-of-graphs","slug":"graph-sparsification-via-mixture-of-graphs","title":"Graph Sparsification via Mixture of Graphs","date":"2024-05-23","arxiv_id":"2405.14260","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/graph-sparsification-via-mixture-of-graphs#ran","syntology_url":"https://syntology.ai/paper/2405.14260","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.14260"}},"official":{"repos":["yanweiyue/mog"],"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/fairgt-a-fairness-aware-graph-transformer","slug":"fairgt-a-fairness-aware-graph-transformer","title":"FairGT: A Fairness-aware Graph Transformer","date":"2024-04-26","arxiv_id":"2404.17169","repositories_listed":1,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":3,"n_pointer_only":5,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 1 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/fairgt-a-fairness-aware-graph-transformer#ran","syntology_url":"https://syntology.ai/paper/2404.17169","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.17169"}},"official":{"repos":["yushuowiki/fairgt"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/ckgconv-general-graph-convolution-with","slug":"ckgconv-general-graph-convolution-with","title":"CKGConv: General Graph Convolution with Continuous Kernels","date":"2024-04-21","arxiv_id":"2404.13604","repositories_listed":1,"syntology":{"n":11,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":11,"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) · 3 unverified","sample_list":"/paper/ckgconv-general-graph-convolution-with#ran","syntology_url":"https://syntology.ai/paper/2404.13604","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.13604"}},"official":{"repos":["networkslab/ckgconv"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/grasper-a-generalist-pursuer-for-pursuit","slug":"grasper-a-generalist-pursuer-for-pursuit","title":"Grasper: A Generalist Pursuer for Pursuit-Evasion Problems","date":"2024-04-19","arxiv_id":"2404.12626","repositories_listed":1,"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/grasper-a-generalist-pursuer-for-pursuit#ran","syntology_url":"https://syntology.ai/paper/2404.12626","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.12626"}},"official":{"repos":["ipadli/grasper"],"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":["official"]}}},{"url":"/paper/model-selection-with-model-zoo-via-graph","slug":"model-selection-with-model-zoo-via-graph","title":"Model Selection with Model Zoo via Graph Learning","date":"2024-04-05","arxiv_id":"2404.03988","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":5,"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/model-selection-with-model-zoo-via-graph#ran","syntology_url":"https://syntology.ai/paper/2404.03988","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.03988"}},"official":{"repos":["transfergraph/transfergraph"],"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/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/vcr-graphormer-a-mini-batch-graph-transformer","slug":"vcr-graphormer-a-mini-batch-graph-transformer","title":"VCR-Graphormer: A Mini-batch Graph Transformer via Virtual Connections","date":"2024-03-24","arxiv_id":"2403.16030","repositories_listed":1,"syntology":{"n":6,"n_ran":5,"n_constructed":3,"n_ran_checked":5,"n_instrument":0,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":4,"n_pointer_only":6,"phrase":"5 ran (of which 3 constructed an object rather than computing a result; 5 with no instrument failure: 1 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/vcr-graphormer-a-mini-batch-graph-transformer#ran","syntology_url":"https://syntology.ai/paper/2403.16030","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.16030"}},"official":{"repos":["dongqifu/vcr-graphormer"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":3,"n_ran_no_instrument_failure":5,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/segment-anything-model-for-road-network-graph","slug":"segment-anything-model-for-road-network-graph","title":"Segment Anything Model for Road Network Graph Extraction","date":"2024-03-24","arxiv_id":"2403.16051","repositories_listed":1,"syntology":{"n":18,"n_ran":17,"n_constructed":0,"n_ran_checked":17,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":17,"n_pointer_only":0,"phrase":"17 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; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/segment-anything-model-for-road-network-graph#ran","syntology_url":"https://syntology.ai/paper/2403.16051","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.16051"}},"official":{"repos":["htcr/sam_road"],"state":"official (archive's flag): 17 ran","n_ran":17,"n_constructed":0,"n_ran_no_instrument_failure":17,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/unifews-unified-entry-wise-sparsification-for","slug":"unifews-unified-entry-wise-sparsification-for","title":"Unifews: Unified Entry-Wise Sparsification for Efficient Graph Neural Network","date":"2024-03-20","arxiv_id":"2403.13268","repositories_listed":0,"syntology":{"n":16,"n_ran":14,"n_constructed":0,"n_ran_checked":14,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":14,"n_pointer_only":16,"phrase":"14 ran (of which 0 constructed an object rather than computing a result; 14 with no instrument failure: 0 honoured, 0 violated, 14 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/unifews-unified-entry-wise-sparsification-for#ran","syntology_url":"https://syntology.ai/paper/2403.13268","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.13268"}},"official":null}},{"url":"/paper/stg-mamba-spatial-temporal-graph-learning-via","slug":"stg-mamba-spatial-temporal-graph-learning-via","title":"STG-Mamba: Spatial-Temporal Graph Learning via Selective State Space Model","date":"2024-03-19","arxiv_id":"2403.12418","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":5,"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/stg-mamba-spatial-temporal-graph-learning-via#ran","syntology_url":"https://syntology.ai/paper/2403.12418","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.12418"}},"official":{"repos":["LincanLi98/STG-Mamba"],"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/forward-learning-of-graph-neural-networks","slug":"forward-learning-of-graph-neural-networks","title":"Forward Learning of Graph Neural Networks","date":"2024-03-16","arxiv_id":"2403.11004","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":5,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/forward-learning-of-graph-neural-networks#ran","syntology_url":"https://syntology.ai/paper/2403.11004","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.11004"}},"official":{"repos":["facebookresearch/forwardgnn"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/opengraph-towards-open-graph-foundation","slug":"opengraph-towards-open-graph-foundation","title":"OpenGraph: Towards Open Graph Foundation Models","date":"2024-03-02","arxiv_id":"2403.01121","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/opengraph-towards-open-graph-foundation#ran","syntology_url":"https://syntology.ai/paper/2403.01121","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.01121"}},"official":{"repos":["hkuds/opengraph"],"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/higpt-heterogeneous-graph-language-model","slug":"higpt-heterogeneous-graph-language-model","title":"HiGPT: Heterogeneous Graph Language Model","date":"2024-02-25","arxiv_id":"2402.16024","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":1,"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/higpt-heterogeneous-graph-language-model#ran","syntology_url":"https://syntology.ai/paper/2402.16024","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.16024"}},"official":{"repos":["hkuds/higpt"],"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/unigraph-learning-a-cross-domain-graph","slug":"unigraph-learning-a-cross-domain-graph","title":"UniGraph: Learning a Unified Cross-Domain Foundation Model for Text-Attributed Graphs","date":"2024-02-21","arxiv_id":"2402.13630","repositories_listed":1,"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/unigraph-learning-a-cross-domain-graph#ran","syntology_url":"https://syntology.ai/paper/2402.13630","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.13630"}},"official":{"repos":["yf-he/UniGraph"],"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/zerog-investigating-cross-dataset-zero-shot","slug":"zerog-investigating-cross-dataset-zero-shot","title":"ZeroG: Investigating Cross-dataset Zero-shot Transferability in Graphs","date":"2024-02-17","arxiv_id":"2402.11235","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/zerog-investigating-cross-dataset-zero-shot#ran","syntology_url":"https://syntology.ai/paper/2402.11235","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.11235"}},"official":{"repos":["nineabyss/zerog"],"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/scalable-structure-learning-for-sparse","slug":"scalable-structure-learning-for-sparse","title":"Scalable Structure Learning for Sparse Context-Specific Systems","date":"2024-02-12","arxiv_id":"2402.07762","repositories_listed":1,"syntology":{"n":9,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":2,"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) · 2 unverified","sample_list":"/paper/scalable-structure-learning-for-sparse#ran","syntology_url":"https://syntology.ai/paper/2402.07762","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.07762"}},"official":{"repos":["felixleopoldo/cslearn"],"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":["official"]}}},{"url":"/paper/rethinking-node-wise-propagation-for-large","slug":"rethinking-node-wise-propagation-for-large","title":"Rethinking Node-wise Propagation for Large-scale Graph Learning","date":"2024-02-09","arxiv_id":"2402.06128","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/rethinking-node-wise-propagation-for-large#ran","syntology_url":"https://syntology.ai/paper/2402.06128","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.06128"}},"official":{"repos":["xkli-allen/atp"],"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/descriptive-kernel-convolution-network-with","slug":"descriptive-kernel-convolution-network-with","title":"Descriptive Kernel Convolution Network with Improved Random Walk Kernel","date":"2024-02-08","arxiv_id":"2402.06087","repositories_listed":1,"syntology":{"n":8,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":3,"n_honours":1,"n_violates":0,"n_no_contract":4,"n_pointer_only":8,"phrase":"5 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; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/descriptive-kernel-convolution-network-with#ran","syntology_url":"https://syntology.ai/paper/2402.06087","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.06087"}},"official":{"repos":["mengchillee/rwk_plus"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/triplet-interaction-improves-graph","slug":"triplet-interaction-improves-graph","title":"Triplet Interaction Improves Graph Transformers: Accurate Molecular Graph Learning with Triplet Graph Transformers","date":"2024-02-07","arxiv_id":"2402.04538","repositories_listed":3,"syntology":{"n":13,"n_ran":10,"n_constructed":1,"n_ran_checked":10,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":10,"n_pointer_only":0,"phrase":"10 ran (of which 1 constructed an object rather than computing a result; 10 with no instrument failure: 0 honoured, 0 violated, 10 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/triplet-interaction-improves-graph#ran","syntology_url":"https://syntology.ai/paper/2402.04538","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.04538"}},"official":{"repos":["shamim-hussain/tgt"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":2,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/on-the-completeness-of-invariant-geometric","slug":"on-the-completeness-of-invariant-geometric","title":"On the Completeness of Invariant Geometric Deep Learning Models","date":"2024-02-07","arxiv_id":"2402.04836","repositories_listed":1,"syntology":{"n":7,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":7,"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) · 0 unverified","sample_list":"/paper/on-the-completeness-of-invariant-geometric#ran","syntology_url":"https://syntology.ai/paper/2402.04836","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.04836"}},"official":{"repos":["GraphPKU/GeoNGNN"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/latent-graph-diffusion-a-unified-framework","slug":"latent-graph-diffusion-a-unified-framework","title":"Unifying Generation and Prediction on Graphs with Latent Graph Diffusion","date":"2024-02-04","arxiv_id":"2402.02518","repositories_listed":1,"syntology":{"n":13,"n_ran":8,"n_constructed":0,"n_ran_checked":6,"n_instrument":2,"n_unverified":5,"n_honours":0,"n_violates":1,"n_no_contract":5,"n_pointer_only":4,"phrase":"8 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; 2 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/latent-graph-diffusion-a-unified-framework#ran","syntology_url":"https://syntology.ai/paper/2402.02518","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.02518"}},"official":{"repos":["zhouc20/latentgraphdiffusion"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/graph-contrastive-learning-with-cohesive","slug":"graph-contrastive-learning-with-cohesive","title":"Graph Contrastive Learning with Cohesive Subgraph Awareness","date":"2024-01-31","arxiv_id":"2401.17580","repositories_listed":1,"syntology":{"n":5,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":2,"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) · 2 unverified","sample_list":"/paper/graph-contrastive-learning-with-cohesive#ran","syntology_url":"https://syntology.ai/paper/2401.17580","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2401.17580"}},"official":{"repos":["wuyucheng2002/ctaug"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/a-cross-view-hierarchical-graph-learning","slug":"a-cross-view-hierarchical-graph-learning","title":"A Cross-View Hierarchical Graph Learning Hypernetwork for Skill Demand-Supply Joint Prediction","date":"2024-01-31","arxiv_id":"2401.17838","repositories_listed":1,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":2,"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) · 2 unverified","sample_list":"/paper/a-cross-view-hierarchical-graph-learning#ran","syntology_url":"https://syntology.ai/paper/2401.17838","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2401.17838"}},"official":{"repos":["vincent40416/Skill-Demand-Supply-Joint-Prediction"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/fedgta-topology-aware-averaging-for-federated","slug":"fedgta-topology-aware-averaging-for-federated","title":"FedGTA: Topology-aware Averaging for Federated Graph Learning","date":"2024-01-22","arxiv_id":"2401.11755","repositories_listed":1,"syntology":{"n":6,"n_ran":5,"n_constructed":0,"n_ran_checked":4,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":6,"phrase":"5 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; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/fedgta-topology-aware-averaging-for-federated#ran","syntology_url":"https://syntology.ai/paper/2401.11755","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2401.11755"}},"official":{"repos":["xkli-allen/fedgta"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/towards-principled-graph-transformers","slug":"towards-principled-graph-transformers","title":"Towards Principled Graph Transformers","date":"2024-01-18","arxiv_id":"2401.10119","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/towards-principled-graph-transformers#ran","syntology_url":"https://syntology.ai/paper/2401.10119","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2401.10119"}},"official":{"repos":["luis-mueller/towards-principled-gts"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/puma-efficient-continual-graph-learning-with","slug":"puma-efficient-continual-graph-learning-with","title":"PUMA: Efficient Continual Graph Learning for Node Classification with Graph Condensation","date":"2023-12-22","arxiv_id":"2312.14439","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/puma-efficient-continual-graph-learning-with#ran","syntology_url":"https://syntology.ai/paper/2312.14439","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2312.14439"}},"official":{"repos":["superallen13/puma"],"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/fine-tuning-graph-neural-networks-by","slug":"fine-tuning-graph-neural-networks-by","title":"Fine-tuning Graph Neural Networks by Preserving Graph Generative Patterns","date":"2023-12-21","arxiv_id":"2312.13583","repositories_listed":1,"syntology":{"n":13,"n_ran":13,"n_constructed":0,"n_ran_checked":12,"n_instrument":1,"n_unverified":0,"n_honours":2,"n_violates":1,"n_no_contract":9,"n_pointer_only":13,"phrase":"13 ran (of which 0 constructed an object rather than computing a result; 12 with no instrument failure: 2 honoured, 1 violated, 9 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/fine-tuning-graph-neural-networks-by#ran","syntology_url":"https://syntology.ai/paper/2312.13583","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2312.13583"}},"official":{"repos":["zjunet/G-Tuning"],"state":"official (archive's flag): 13 ran","n_ran":13,"n_constructed":0,"n_ran_no_instrument_failure":12,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/graph-transformers-for-large-graphs","slug":"graph-transformers-for-large-graphs","title":"Graph Transformers for Large Graphs","date":"2023-12-18","arxiv_id":"2312.11109","repositories_listed":1,"syntology":{"n":5,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":5,"phrase":"3 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; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/graph-transformers-for-large-graphs#ran","syntology_url":"https://syntology.ai/paper/2312.11109","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2312.11109"}},"official":{"repos":["snap-research/largegt"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/environment-aware-dynamic-graph-learning-for-1","slug":"environment-aware-dynamic-graph-learning-for-1","title":"Environment-Aware Dynamic Graph Learning for Out-of-Distribution Generalization","date":"2023-11-18","arxiv_id":"2311.11114","repositories_listed":1,"syntology":{"n":37,"n_ran":28,"n_constructed":5,"n_ran_checked":25,"n_instrument":3,"n_unverified":9,"n_honours":0,"n_violates":0,"n_no_contract":25,"n_pointer_only":25,"phrase":"28 ran (of which 5 constructed an object rather than computing a result; 25 with no instrument failure: 0 honoured, 0 violated, 25 with no contract checked; 3 where Syntology's instrument failed) · 9 unverified","sample_list":"/paper/environment-aware-dynamic-graph-learning-for-1#ran","syntology_url":"https://syntology.ai/paper/2311.11114","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2311.11114"}},"official":{"repos":["ringbdstack/eagle"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":3,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["found_in_text","official"]}}},{"url":"/paper/apgl4sr-a-generic-framework-with-adaptive-and","slug":"apgl4sr-a-generic-framework-with-adaptive-and","title":"APGL4SR: A Generic Framework with Adaptive and Personalized Global Collaborative Information in Sequential Recommendation","date":"2023-11-06","arxiv_id":"2311.02816","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":3,"n_instrument":2,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":2,"n_pointer_only":5,"phrase":"5 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; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/apgl4sr-a-generic-framework-with-adaptive-and#ran","syntology_url":"https://syntology.ai/paper/2311.02816","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2311.02816"}},"official":{"repos":["graph-team/apgl4sr"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/architecture-matters-uncovering-implicit-1","slug":"architecture-matters-uncovering-implicit-1","title":"Architecture Matters: Uncovering Implicit Mechanisms in Graph Contrastive Learning","date":"2023-11-05","arxiv_id":"2311.02687","repositories_listed":1,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":1,"n_instrument":5,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"6 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; 5 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/architecture-matters-uncovering-implicit-1#ran","syntology_url":"https://syntology.ai/paper/2311.02687","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2311.02687"}},"official":{"repos":["pku-ml/architecturemattersgcl"],"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/d4explainer-in-distribution-gnn-explanations","slug":"d4explainer-in-distribution-gnn-explanations","title":"D4Explainer: In-Distribution GNN Explanations via Discrete Denoising Diffusion","date":"2023-10-30","arxiv_id":"2310.19321","repositories_listed":2,"syntology":{"n":21,"n_ran":15,"n_constructed":3,"n_ran_checked":5,"n_instrument":10,"n_unverified":6,"n_honours":2,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"15 ran (of which 3 constructed an object rather than computing a result; 5 with no instrument failure: 2 honoured, 0 violated, 3 with no contract checked; 10 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/d4explainer-in-distribution-gnn-explanations#ran","syntology_url":"https://syntology.ai/paper/2310.19321","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.19321"}},"official":{"repos":["graph-and-geometric-learning/d4explainer"],"state":"official (archive's flag): 15 ran","n_ran":15,"n_constructed":3,"n_ran_no_instrument_failure":5,"n_unverified":6,"ran_from_kinds":["official"]}}},{"url":"/paper/does-invariant-graph-learning-via-environment-1","slug":"does-invariant-graph-learning-via-environment-1","title":"Does Invariant Graph Learning via Environment Augmentation Learn Invariance?","date":"2023-10-29","arxiv_id":"2310.19035","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":3,"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; 3 with no instrument failure: 3 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/does-invariant-graph-learning-via-environment-1#ran","syntology_url":"https://syntology.ai/paper/2310.19035","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.19035"}},"official":null}},{"url":"/paper/deceptive-fairness-attacks-on-graphs-via-meta","slug":"deceptive-fairness-attacks-on-graphs-via-meta","title":"Deceptive Fairness Attacks on Graphs via Meta Learning","date":"2023-10-24","arxiv_id":"2310.15653","repositories_listed":1,"syntology":{"n":5,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":5,"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) · 3 unverified","sample_list":"/paper/deceptive-fairness-attacks-on-graphs-via-meta#ran","syntology_url":"https://syntology.ai/paper/2310.15653","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.15653"}},"official":{"repos":["jiank2/fate"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/using-causality-aware-graph-neural-networks","slug":"using-causality-aware-graph-neural-networks","title":"Using Time-Aware Graph Neural Networks to Predict Temporal Centralities in Dynamic Graphs","date":"2023-10-24","arxiv_id":"2310.15865","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":4,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/using-causality-aware-graph-neural-networks#ran","syntology_url":"https://syntology.ai/paper/2310.15865","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.15865"}},"official":{"repos":["pathpy/pathpyg"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/efficient-heterogeneous-graph-learning-via","slug":"efficient-heterogeneous-graph-learning-via","title":"Efficient Heterogeneous Graph Learning via Random Projection","date":"2023-10-23","arxiv_id":"2310.14481","repositories_listed":1,"syntology":{"n":8,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":8,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/efficient-heterogeneous-graph-learning-via#ran","syntology_url":"https://syntology.ai/paper/2310.14481","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.14481"}},"official":{"repos":["CrawlScript/RpHGNN"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/open-world-lifelong-graph-learning","slug":"open-world-lifelong-graph-learning","title":"Open-World Lifelong Graph Learning","date":"2023-10-19","arxiv_id":"2310.12565","repositories_listed":1,"syntology":{"n":15,"n_ran":12,"n_constructed":0,"n_ran_checked":12,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":12,"n_pointer_only":15,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 12 with no instrument failure: 0 honoured, 0 violated, 12 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/open-world-lifelong-graph-learning#ran","syntology_url":"https://syntology.ai/paper/2310.12565","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.12565"}},"official":{"repos":["bobowner/open-world-lgl"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":0,"n_ran_no_instrument_failure":12,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/graphgpt-graph-instruction-tuning-for-large","slug":"graphgpt-graph-instruction-tuning-for-large","title":"GraphGPT: Graph Instruction Tuning for Large Language Models","date":"2023-10-19","arxiv_id":"2310.13023","repositories_listed":1,"syntology":{"n":8,"n_ran":7,"n_constructed":0,"n_ran_checked":4,"n_instrument":3,"n_unverified":1,"n_honours":0,"n_violates":1,"n_no_contract":3,"n_pointer_only":3,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 1 violated, 3 with no contract checked; 3 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/graphgpt-graph-instruction-tuning-for-large#ran","syntology_url":"https://syntology.ai/paper/2310.13023","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.13023"}},"official":{"repos":["HKUDS/GraphGPT"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/multimodal-graph-learning-for-generative","slug":"multimodal-graph-learning-for-generative","title":"Multimodal Graph Learning for Generative Tasks","date":"2023-10-11","arxiv_id":"2310.07478","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/multimodal-graph-learning-for-generative#ran","syntology_url":"https://syntology.ai/paper/2310.07478","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.07478"}},"official":{"repos":["minjiyoon/mmgl"],"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/graphllm-boosting-graph-reasoning-ability-of","slug":"graphllm-boosting-graph-reasoning-ability-of","title":"GraphLLM: Boosting Graph Reasoning Ability of Large Language Model","date":"2023-10-09","arxiv_id":"2310.05845","repositories_listed":1,"syntology":{"n":7,"n_ran":7,"n_constructed":0,"n_ran_checked":6,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":7,"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) · 0 unverified","sample_list":"/paper/graphllm-boosting-graph-reasoning-ability-of#ran","syntology_url":"https://syntology.ai/paper/2310.05845","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.05845"}},"official":{"repos":["mistyreed63849/graph-llm"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":0,"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/holonets-spectral-convolutions-do-extend-to","slug":"holonets-spectral-convolutions-do-extend-to","title":"HoloNets: Spectral Convolutions do extend to Directed Graphs","date":"2023-10-03","arxiv_id":"2310.02232","repositories_listed":1,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":5,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/holonets-spectral-convolutions-do-extend-to#ran","syntology_url":"https://syntology.ai/paper/2310.02232","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.02232"}},"official":{"repos":["ChristianKoke/HoloNets"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/deep-insights-into-noisy-pseudo-labeling-on-1","slug":"deep-insights-into-noisy-pseudo-labeling-on-1","title":"Deep Insights into Noisy Pseudo Labeling on Graph Data","date":"2023-10-02","arxiv_id":"2310.01634","repositories_listed":1,"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":4,"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/deep-insights-into-noisy-pseudo-labeling-on-1#ran","syntology_url":"https://syntology.ai/paper/2310.01634","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.01634"}},"official":{"repos":["AcEbt/CPL"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/one-for-all-towards-training-one-graph-model","slug":"one-for-all-towards-training-one-graph-model","title":"One for All: Towards Training One Graph Model for All Classification Tasks","date":"2023-09-29","arxiv_id":"2310.00149","repositories_listed":1,"syntology":{"n":18,"n_ran":9,"n_constructed":0,"n_ran_checked":7,"n_instrument":2,"n_unverified":9,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":5,"phrase":"9 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; 2 where Syntology's instrument failed) · 9 unverified","sample_list":"/paper/one-for-all-towards-training-one-graph-model#ran","syntology_url":"https://syntology.ai/paper/2310.00149","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.00149"}},"official":{"repos":["lechengkong/oneforall"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":9,"ran_from_kinds":["official"]}}},{"url":"/paper/can-llms-effectively-leverage-structural","slug":"can-llms-effectively-leverage-structural","title":"Can LLMs Effectively Leverage Graph Structural Information through Prompts, and Why?","date":"2023-09-28","arxiv_id":"2309.16595","repositories_listed":2,"syntology":{"n":15,"n_ran":10,"n_constructed":0,"n_ran_checked":8,"n_instrument":2,"n_unverified":5,"n_honours":1,"n_violates":0,"n_no_contract":7,"n_pointer_only":8,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 1 honoured, 0 violated, 7 with no contract checked; 2 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/can-llms-effectively-leverage-structural#ran","syntology_url":"https://syntology.ai/paper/2309.16595","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2309.16595"}},"official":{"repos":["trais-lab/llm-structured-data"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/cat-balanced-continual-graph-learning-with","slug":"cat-balanced-continual-graph-learning-with","title":"CaT: Balanced Continual Graph Learning with Graph Condensation","date":"2023-09-18","arxiv_id":"2309.09455","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":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/cat-balanced-continual-graph-learning-with#ran","syntology_url":"https://syntology.ai/paper/2309.09455","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2309.09455"}},"official":{"repos":["superallen13/CaT-CGL"],"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/where-did-the-gap-go-reassessing-the-long","slug":"where-did-the-gap-go-reassessing-the-long","title":"Where Did the Gap Go? Reassessing the Long-Range Graph Benchmark","date":"2023-09-01","arxiv_id":"2309.00367","repositories_listed":2,"syntology":{"n":12,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":2,"n_no_contract":6,"n_pointer_only":6,"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) · 4 unverified","sample_list":"/paper/where-did-the-gap-go-reassessing-the-long#ran","syntology_url":"https://syntology.ai/paper/2309.00367","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2309.00367"}},"official":{"repos":["toenshoff/lrgb"],"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":["listed","official"]}}},{"url":"/paper/topological-augmentation-for-class-imbalanced","slug":"topological-augmentation-for-class-imbalanced","title":"Class-Imbalanced Graph Learning without Class Rebalancing","date":"2023-08-27","arxiv_id":"2308.14181","repositories_listed":1,"syntology":{"n":19,"n_ran":17,"n_constructed":0,"n_ran_checked":16,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":16,"n_pointer_only":0,"phrase":"17 ran (of which 0 constructed an object rather than computing a result; 16 with no instrument failure: 0 honoured, 0 violated, 16 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/topological-augmentation-for-class-imbalanced#ran","syntology_url":"https://syntology.ai/paper/2308.14181","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.14181"}},"official":{"repos":["zhiningliu1998/bat"],"state":"official (archive's flag): 17 ran","n_ran":17,"n_constructed":0,"n_ran_no_instrument_failure":16,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/investigating-the-interplay-between-features","slug":"investigating-the-interplay-between-features","title":"Investigating the Interplay between Features and Structures in Graph Learning","date":"2023-08-18","arxiv_id":"2308.09570","repositories_listed":1,"syntology":{"n":17,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":8,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":17,"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) · 8 unverified","sample_list":"/paper/investigating-the-interplay-between-features#ran","syntology_url":"https://syntology.ai/paper/2308.09570","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.09570"}},"official":{"repos":["danielecastellana22/feature-structure-interplay-graph-learning"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":8,"ran_from_kinds":["official"]}}},{"url":"/paper/convert-contrastive-graph-clustering-with","slug":"convert-contrastive-graph-clustering-with","title":"CONVERT:Contrastive Graph Clustering with Reliable Augmentation","date":"2023-08-17","arxiv_id":"2308.08963","repositories_listed":2,"syntology":{"n":7,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":2,"n_honours":1,"n_violates":1,"n_no_contract":3,"n_pointer_only":7,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 1 honoured, 1 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/convert-contrastive-graph-clustering-with#ran","syntology_url":"https://syntology.ai/paper/2308.08963","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.08963"}},"official":{"repos":["xihongyang1999/convert"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/natural-language-is-all-a-graph-needs","slug":"natural-language-is-all-a-graph-needs","title":"Language is All a Graph Needs","date":"2023-08-14","arxiv_id":"2308.07134","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/natural-language-is-all-a-graph-needs#ran","syntology_url":"https://syntology.ai/paper/2308.07134","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.07134"}},"official":{"repos":["agiresearch/InstructGLM"],"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/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/xgbd-explanation-guided-graph-backdoor","slug":"xgbd-explanation-guided-graph-backdoor","title":"XGBD: Explanation-Guided Graph Backdoor Detection","date":"2023-08-08","arxiv_id":"2308.04406","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/xgbd-explanation-guided-graph-backdoor#ran","syntology_url":"https://syntology.ai/paper/2308.04406","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.04406"}},"official":{"repos":["guanzihan/gnn_backdoor_detection"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/implicit-graph-neural-diffusion-based-on","slug":"implicit-graph-neural-diffusion-based-on","title":"Implicit Graph Neural Diffusion Networks: Convergence, Generalization, and Over-Smoothing","date":"2023-08-07","arxiv_id":"2308.03306","repositories_listed":1,"syntology":{"n":12,"n_ran":12,"n_constructed":0,"n_ran_checked":11,"n_instrument":1,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":10,"n_pointer_only":1,"phrase":"12 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; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/implicit-graph-neural-diffusion-based-on#ran","syntology_url":"https://syntology.ai/paper/2308.03306","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.03306"}},"official":{"repos":["guoji-fu/dignn"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":0,"n_ran_no_instrument_failure":11,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/unsupervised-multiplex-graph-learning-with","slug":"unsupervised-multiplex-graph-learning-with","title":"Unsupervised Multiplex Graph Learning with Complementary and Consistent Information","date":"2023-08-03","arxiv_id":"2308.01606","repositories_listed":1,"syntology":{"n":7,"n_ran":5,"n_constructed":0,"n_ran_checked":4,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":7,"phrase":"5 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; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/unsupervised-multiplex-graph-learning-with#ran","syntology_url":"https://syntology.ai/paper/2308.01606","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.01606"}},"official":{"repos":["larryuestc/cocomg"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/simteg-a-frustratingly-simple-approach","slug":"simteg-a-frustratingly-simple-approach","title":"SimTeG: A Frustratingly Simple Approach Improves Textual Graph Learning","date":"2023-08-03","arxiv_id":"2308.02565","repositories_listed":2,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/simteg-a-frustratingly-simple-approach#ran","syntology_url":"https://syntology.ai/paper/2308.02565","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.02565"}},"official":{"repos":["vermouthdky/simteg"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/an-empirical-evaluation-of-temporal-graph","slug":"an-empirical-evaluation-of-temporal-graph","title":"An Empirical Evaluation of Temporal Graph Benchmark","date":"2023-07-24","arxiv_id":"2307.12510","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":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) · 0 unverified","sample_list":"/paper/an-empirical-evaluation-of-temporal-graph#ran","syntology_url":"https://syntology.ai/paper/2307.12510","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2307.12510"}},"official":{"repos":["yule-BUAA/DyGLib_TGB"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]}}}],"record_sha256":"387c226270269f3ca18fdae41f7b3523cc917bfa115bf5870e871b08ff9950be","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}