{"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/node-classification/papers/ran/1","list_of":"/task/node-classification","task":"Node Classification","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":4,"rows_per_page":100,"rows":[1,100],"of":305,"counts":{"archive_papers_tagged":1860,"with_a_code_link":991,"where_syntology_ran_a_sample":305,"not_listed_spam_title":0,"listed":1860,"listed_where_code_ran":305,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":256,"every_run_a_failure_of_syntologys_instrument":49,"listed_with_a_run_with_no_instrument_failure":256,"listed_every_run_a_failure_of_syntologys_instrument":49,"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/node-classification/papers/ran/1","prev":null,"next":"/task/node-classification/papers/ran/2","papers":[{"url":"/paper/equivariance-everywhere-all-at-once-a-recipe","slug":"equivariance-everywhere-all-at-once-a-recipe","title":"Equivariance Everywhere All At Once: A Recipe for Graph Foundation Models","date":"2025-06-17","arxiv_id":"2506.14291","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":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) · 3 unverified","sample_list":"/paper/equivariance-everywhere-all-at-once-a-recipe#ran","syntology_url":"https://syntology.ai/paper/2506.14291","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2506.14291"}},"official":{"repos":["benfinkelshtein/equivarianceeverywhere"],"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/improving-the-effective-receptive-field-of","slug":"improving-the-effective-receptive-field-of","title":"Improving the Effective Receptive Field of Message-Passing Neural Networks","date":"2025-05-29","arxiv_id":"2505.23185","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/improving-the-effective-receptive-field-of#ran","syntology_url":"https://syntology.ai/paper/2505.23185","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2505.23185"}},"official":{"repos":["bgu-cs-vil/im-mpnn"],"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/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/towards-quantifying-long-range-interactions","slug":"towards-quantifying-long-range-interactions","title":"Towards Quantifying Long-Range Interactions in Graph Machine Learning: a Large Graph Dataset and a Measurement","date":"2025-03-12","arxiv_id":"2503.09008","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/towards-quantifying-long-range-interactions#ran","syntology_url":"https://syntology.ai/paper/2503.09008","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2503.09008"}},"official":{"repos":["leonresearch/city-networks"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/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/unlocking-the-potential-of-classic-gnns-for","slug":"unlocking-the-potential-of-classic-gnns-for","title":"Unlocking the Potential of Classic GNNs for Graph-level Tasks: Simple Architectures Meet Excellence","date":"2025-02-13","arxiv_id":"2502.09263","repositories_listed":1,"syntology":{"n":12,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":3,"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) · 5 unverified","sample_list":"/paper/unlocking-the-potential-of-classic-gnns-for#ran","syntology_url":"https://syntology.ai/paper/2502.09263","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2502.09263"}},"official":{"repos":["LUOyk1999/GNNPlus"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/gnns-getting-comfy-community-and-feature","slug":"gnns-getting-comfy-community-and-feature","title":"GNNs Getting ComFy: Community and Feature Similarity Guided Rewiring","date":"2025-02-07","arxiv_id":"2502.04891","repositories_listed":1,"syntology":{"n":11,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":7,"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) · 7 unverified","sample_list":"/paper/gnns-getting-comfy-community-and-feature#ran","syntology_url":"https://syntology.ai/paper/2502.04891","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2502.04891"}},"official":{"repos":["RelationalML/ComFy"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":7,"ran_from_kinds":["official"]}}},{"url":"/paper/spectro-riemannian-graph-neural-networks","slug":"spectro-riemannian-graph-neural-networks","title":"Spectro-Riemannian Graph Neural Networks","date":"2025-02-01","arxiv_id":"2502.00401","repositories_listed":0,"syntology":{"n":6,"n_ran":3,"n_constructed":2,"n_ran_checked":2,"n_instrument":1,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":6,"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) · 3 unverified","sample_list":"/paper/spectro-riemannian-graph-neural-networks#ran","syntology_url":"https://syntology.ai/paper/2502.00401","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2502.00401"}},"official":null}},{"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/mamba-based-graph-convolutional-networks","slug":"mamba-based-graph-convolutional-networks","title":"Mamba-Based Graph Convolutional Networks: Tackling Over-smoothing with Selective State Space","date":"2025-01-26","arxiv_id":"2501.15461","repositories_listed":0,"syntology":{"n":3,"n_ran":2,"n_constructed":2,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":3,"phrase":"2 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; 0 where Syntology's instrument failed) · 1 unverified; every one of the 2 samples that ran constructed an object rather than computing a result","sample_list":"/paper/mamba-based-graph-convolutional-networks#ran","syntology_url":"https://syntology.ai/paper/2501.15461","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2501.15461"}},"official":null}},{"url":"/paper/normalize-then-propagate-efficient","slug":"normalize-then-propagate-efficient","title":"Normalize Then Propagate: Efficient Homophilous Regularization for Few-shot Semi-Supervised Node Classification","date":"2025-01-15","arxiv_id":"2501.08581","repositories_listed":1,"syntology":{"n":3,"n_ran":1,"n_constructed":1,"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 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) · 2 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/normalize-then-propagate-efficient#ran","syntology_url":"https://syntology.ai/paper/2501.08581","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2501.08581"}},"official":{"repos":["pallaksch/normprop"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":2,"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/understanding-when-and-why-graph-attention","slug":"understanding-when-and-why-graph-attention","title":"Graph Attention is Not Always Beneficial: A Theoretical Analysis of Graph Attention Mechanisms via Contextual Stochastic Block Models","date":"2024-12-20","arxiv_id":"2412.15496","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/understanding-when-and-why-graph-attention#ran","syntology_url":"https://syntology.ai/paper/2412.15496","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2412.15496"}},"official":{"repos":["mztmzt/gat_csbm"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/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/graph-neural-networks-need-cluster-normalize","slug":"graph-neural-networks-need-cluster-normalize","title":"Graph Neural Networks Need Cluster-Normalize-Activate Modules","date":"2024-12-05","arxiv_id":"2412.04064","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/graph-neural-networks-need-cluster-normalize#ran","syntology_url":"https://syntology.ai/paper/2412.04064","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2412.04064"}},"official":{"repos":["ml-research/cna_modules"],"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/exact-certification-of-graph-neural-networks","slug":"exact-certification-of-graph-neural-networks","title":"Exact Certification of (Graph) Neural Networks Against Label Poisoning","date":"2024-11-30","arxiv_id":"2412.00537","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/exact-certification-of-graph-neural-networks#ran","syntology_url":"https://syntology.ai/paper/2412.00537","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2412.00537"}},"official":{"repos":["saper0/qpcert"],"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/grokformer-graph-fourier-kolmogorov-arnold","slug":"grokformer-graph-fourier-kolmogorov-arnold","title":"GrokFormer: Graph Fourier Kolmogorov-Arnold Transformers","date":"2024-11-26","arxiv_id":"2411.17296","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":3,"n_ran_checked":4,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":4,"phrase":"4 ran (of which 3 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/grokformer-graph-fourier-kolmogorov-arnold#ran","syntology_url":"https://syntology.ai/paper/2411.17296","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2411.17296"}},"official":{"repos":["GGA23/GrokFormer"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":3,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/enhancing-the-expressivity-of-temporal-graph","slug":"enhancing-the-expressivity-of-temporal-graph","title":"Enhancing the Expressivity of Temporal Graph Networks through Source-Target Identification","date":"2024-11-06","arxiv_id":"2411.03596","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/enhancing-the-expressivity-of-temporal-graph#ran","syntology_url":"https://syntology.ai/paper/2411.03596","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2411.03596"}},"official":{"repos":["batjandra/TGNv2-NeurReps"],"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/fast-graph-sharpness-aware-minimization-for","slug":"fast-graph-sharpness-aware-minimization-for","title":"Fast Graph Sharpness-Aware Minimization for Enhancing and Accelerating Few-Shot Node Classification","date":"2024-10-22","arxiv_id":"2410.16845","repositories_listed":1,"syntology":{"n":5,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":5,"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) · 2 unverified","sample_list":"/paper/fast-graph-sharpness-aware-minimization-for#ran","syntology_url":"https://syntology.ai/paper/2410.16845","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.16845"}},"official":{"repos":["draym28/fgsam_neurips24"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/replay-and-forget-free-graph-class","slug":"replay-and-forget-free-graph-class","title":"Replay-and-Forget-Free Graph Class-Incremental Learning: A Task Profiling and Prompting Approach","date":"2024-10-14","arxiv_id":"2410.10341","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":1,"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/replay-and-forget-free-graph-class#ran","syntology_url":"https://syntology.ai/paper/2410.10341","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.10341"}},"official":{"repos":["mala-lab/tpp"],"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/diss-l-ect-dissecting-graph-data-with-local","slug":"diss-l-ect-dissecting-graph-data-with-local","title":"Diss-l-ECT: Dissecting Graph Data with Local Euler Characteristic Transforms","date":"2024-10-03","arxiv_id":"2410.02622","repositories_listed":2,"syntology":{"n":10,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":9,"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) · 9 unverified","sample_list":"/paper/diss-l-ect-dissecting-graph-data-with-local#ran","syntology_url":"https://syntology.ai/paper/2410.02622","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.02622"}},"official":{"repos":["aidos-lab/Diss-l-ECT"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":9,"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/learning-personalized-scoping-for-graph","slug":"learning-personalized-scoping-for-graph","title":"Mixture of Scope Experts at Test: Generalizing Deeper Graph Neural Networks with Shallow Variants","date":"2024-09-11","arxiv_id":"2409.06998","repositories_listed":1,"syntology":{"n":10,"n_ran":10,"n_constructed":0,"n_ran_checked":6,"n_instrument":4,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":10,"phrase":"10 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; 4 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/learning-personalized-scoping-for-graph#ran","syntology_url":"https://syntology.ai/paper/2409.06998","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2409.06998"}},"official":{"repos":["hydrapse/moscat"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/sympgnns-symplectic-graph-neural-networks-for","slug":"sympgnns-symplectic-graph-neural-networks-for","title":"SympGNNs: Symplectic Graph Neural Networks for identifiying high-dimensional Hamiltonian systems and node classification","date":"2024-08-29","arxiv_id":"2408.16698","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":2,"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; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/sympgnns-symplectic-graph-neural-networks-for#ran","syntology_url":"https://syntology.ai/paper/2408.16698","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2408.16698"}},"official":{"repos":["alanjohnvarghese/la-sympgnn"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/llms-as-zero-shot-graph-learners-alignment-of","slug":"llms-as-zero-shot-graph-learners-alignment-of","title":"LLMs as Zero-shot Graph Learners: Alignment of GNN Representations with LLM Token Embeddings","date":"2024-08-25","arxiv_id":"2408.14512","repositories_listed":4,"syntology":{"n":9,"n_ran":9,"n_constructed":0,"n_ran_checked":8,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":0,"phrase":"9 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; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/llms-as-zero-shot-graph-learners-alignment-of#ran","syntology_url":"https://syntology.ai/paper/2408.14512","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2408.14512"}},"official":{"repos":["w-rudder/tea-glm"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/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/bootstrap-latents-of-nodes-and-neighbors-for","slug":"bootstrap-latents-of-nodes-and-neighbors-for","title":"Bootstrap Latents of Nodes and Neighbors for Graph Self-Supervised Learning","date":"2024-08-09","arxiv_id":"2408.05087","repositories_listed":1,"syntology":{"n":11,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":1,"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) · 4 unverified","sample_list":"/paper/bootstrap-latents-of-nodes-and-neighbors-for#ran","syntology_url":"https://syntology.ai/paper/2408.05087","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2408.05087"}},"official":{"repos":["cloudy1225/blnn"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/relaxing-graph-transformers-for-adversarial","slug":"relaxing-graph-transformers-for-adversarial","title":"Relaxing Graph Transformers for Adversarial Attacks","date":"2024-07-16","arxiv_id":"2407.11764","repositories_listed":0,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/relaxing-graph-transformers-for-adversarial#ran","syntology_url":"https://syntology.ai/paper/2407.11764","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.11764"}},"official":null}},{"url":"/paper/conformal-inductive-graph-neural-networks","slug":"conformal-inductive-graph-neural-networks","title":"Conformal Inductive Graph Neural Networks","date":"2024-07-12","arxiv_id":"2407.09173","repositories_listed":0,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/conformal-inductive-graph-neural-networks#ran","syntology_url":"https://syntology.ai/paper/2407.09173","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.09173"}},"official":null}},{"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/gc-bench-a-benchmark-framework-for-graph","slug":"gc-bench-a-benchmark-framework-for-graph","title":"GC4NC: A Benchmark Framework for Graph Condensation on Node Classification with New Insights","date":"2024-06-24","arxiv_id":"2406.16715","repositories_listed":2,"syntology":{"n":10,"n_ran":10,"n_constructed":0,"n_ran_checked":10,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":9,"n_pointer_only":4,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 1 honoured, 0 violated, 9 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/gc-bench-a-benchmark-framework-for-graph#ran","syntology_url":"https://syntology.ai/paper/2406.16715","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.16715"}},"official":{"repos":["emory-melody/graphslim"],"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":["listed","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/taglas-an-atlas-of-text-attributed-graph","slug":"taglas-an-atlas-of-text-attributed-graph","title":"TAGLAS: An atlas of text-attributed graph datasets in the era of large graph and language models","date":"2024-06-20","arxiv_id":"2406.14683","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/taglas-an-atlas-of-text-attributed-graph#ran","syntology_url":"https://syntology.ai/paper/2406.14683","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.14683"}},"official":{"repos":["jiaruifeng/taglas"],"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/robustness-inspired-defense-against-backdoor","slug":"robustness-inspired-defense-against-backdoor","title":"Robustness Inspired Graph Backdoor Defense","date":"2024-06-14","arxiv_id":"2406.09836","repositories_listed":0,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/robustness-inspired-defense-against-backdoor#ran","syntology_url":"https://syntology.ai/paper/2406.09836","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.09836"}},"official":null}},{"url":"/paper/classic-gnns-are-strong-baselines-reassessing","slug":"classic-gnns-are-strong-baselines-reassessing","title":"Classic GNNs are Strong Baselines: Reassessing GNNs for Node Classification","date":"2024-06-13","arxiv_id":"2406.08993","repositories_listed":1,"syntology":{"n":9,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":3,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/classic-gnns-are-strong-baselines-reassessing#ran","syntology_url":"https://syntology.ai/paper/2406.08993","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.08993"}},"official":{"repos":["LUOyk1999/tunedGNN"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/a-comprehensive-graph-pooling-benchmark","slug":"a-comprehensive-graph-pooling-benchmark","title":"A Comprehensive Graph Pooling Benchmark: Effectiveness, Robustness and Generalizability","date":"2024-06-13","arxiv_id":"2406.09031","repositories_listed":1,"syntology":{"n":11,"n_ran":10,"n_constructed":0,"n_ran_checked":8,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":11,"phrase":"10 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; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/a-comprehensive-graph-pooling-benchmark#ran","syntology_url":"https://syntology.ai/paper/2406.09031","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.09031"}},"official":{"repos":["goose315/graph_pooling_benchmark"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/holistic-memory-diversification-for","slug":"holistic-memory-diversification-for","title":"Holistic Memory Diversification for Incremental Learning in Growing Graphs","date":"2024-06-11","arxiv_id":"2406.07413","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/holistic-memory-diversification-for#ran","syntology_url":"https://syntology.ai/paper/2406.07413","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.07413"}},"official":null}},{"url":"/paper/panda-expanded-width-aware-message-passing","slug":"panda-expanded-width-aware-message-passing","title":"PANDA: Expanded Width-Aware Message Passing Beyond Rewiring","date":"2024-06-06","arxiv_id":"2406.03671","repositories_listed":1,"syntology":{"n":9,"n_ran":7,"n_constructed":0,"n_ran_checked":5,"n_instrument":2,"n_unverified":2,"n_honours":1,"n_violates":0,"n_no_contract":4,"n_pointer_only":3,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 1 honoured, 0 violated, 4 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/panda-expanded-width-aware-message-passing#ran","syntology_url":"https://syntology.ai/paper/2406.03671","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.03671"}},"official":{"repos":["jeongwhanchoi/panda"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/linear-opinion-pooling-for-uncertainty","slug":"linear-opinion-pooling-for-uncertainty","title":"Linear Opinion Pooling for Uncertainty Quantification on Graphs","date":"2024-06-06","arxiv_id":"2406.04041","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/linear-opinion-pooling-for-uncertainty#ran","syntology_url":"https://syntology.ai/paper/2406.04041","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.04041"}},"official":{"repos":["cortys/gpn-extensions"],"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/learning-long-range-dependencies-on-graphs","slug":"learning-long-range-dependencies-on-graphs","title":"Learning Long Range Dependencies on Graphs via Random Walks","date":"2024-06-05","arxiv_id":"2406.03386","repositories_listed":1,"syntology":{"n":13,"n_ran":13,"n_constructed":0,"n_ran_checked":10,"n_instrument":3,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":9,"n_pointer_only":1,"phrase":"13 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 1 honoured, 0 violated, 9 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/learning-long-range-dependencies-on-graphs#ran","syntology_url":"https://syntology.ai/paper/2406.03386","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.03386"}},"official":{"repos":["borgwardtlab/neuralwalker"],"state":"official (archive's flag): 13 ran","n_ran":13,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/towards-a-general-gnn-framework-for","slug":"towards-a-general-gnn-framework-for","title":"Towards a General Recipe for Combinatorial Optimization with Multi-Filter GNNs","date":"2024-05-31","arxiv_id":"2405.20543","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":13,"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/towards-a-general-gnn-framework-for#ran","syntology_url":"https://syntology.ai/paper/2405.20543","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.20543"}},"official":{"repos":["wenkelf/copt"],"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/graphany-a-foundation-model-for-node","slug":"graphany-a-foundation-model-for-node","title":"Fully-inductive Node Classification on Arbitrary Graphs","date":"2024-05-30","arxiv_id":"2405.20445","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":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) · 3 unverified","sample_list":"/paper/graphany-a-foundation-model-for-node#ran","syntology_url":"https://syntology.ai/paper/2405.20445","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.20445"}},"official":{"repos":["deepgraphlearning/graphany"],"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/spatio-spectral-graph-neural-networks","slug":"spatio-spectral-graph-neural-networks","title":"Spatio-Spectral Graph Neural Networks","date":"2024-05-29","arxiv_id":"2405.19121","repositories_listed":1,"syntology":{"n":9,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":2,"n_honours":1,"n_violates":0,"n_no_contract":6,"n_pointer_only":2,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 1 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/spatio-spectral-graph-neural-networks#ran","syntology_url":"https://syntology.ai/paper/2405.19121","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.19121"}},"official":{"repos":["sigeisler/s2gnn"],"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/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/similarity-navigated-conformal-prediction-for","slug":"similarity-navigated-conformal-prediction-for","title":"Similarity-Navigated Conformal Prediction for Graph Neural Networks","date":"2024-05-23","arxiv_id":"2405.14303","repositories_listed":1,"syntology":{"n":6,"n_ran":6,"n_constructed":2,"n_ran_checked":5,"n_instrument":1,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":4,"n_pointer_only":6,"phrase":"6 ran (of which 2 constructed an object rather than computing a result; 5 with no instrument failure: 1 honoured, 0 violated, 4 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/similarity-navigated-conformal-prediction-for#ran","syntology_url":"https://syntology.ai/paper/2405.14303","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.14303"}},"official":{"repos":["janqsong/snaps"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":2,"n_ran_no_instrument_failure":5,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/utilizing-description-logics-for-global","slug":"utilizing-description-logics-for-global","title":"Utilizing Description Logics for Global Explanations of Heterogeneous Graph Neural Networks","date":"2024-05-21","arxiv_id":"2405.12654","repositories_listed":1,"syntology":{"n":14,"n_ran":11,"n_constructed":0,"n_ran_checked":11,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":11,"n_pointer_only":14,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 0 honoured, 0 violated, 11 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/utilizing-description-logics-for-global#ran","syntology_url":"https://syntology.ai/paper/2405.12654","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.12654"}},"official":{"repos":["ds-jrg/xgnn-dl"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":11,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/slotgat-slot-based-message-passing-for","slug":"slotgat-slot-based-message-passing-for","title":"SlotGAT: Slot-based Message Passing for Heterogeneous Graph Neural Network","date":"2024-05-03","arxiv_id":"2405.01927","repositories_listed":1,"syntology":{"n":7,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/slotgat-slot-based-message-passing-for#ran","syntology_url":"https://syntology.ai/paper/2405.01927","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.01927"}},"official":{"repos":["scottjiao/slotgat_icml23"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"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/theoretical-and-empirical-insights-into-the","slug":"theoretical-and-empirical-insights-into-the","title":"Theoretical and Empirical Insights into the Origins of Degree Bias in Graph Neural Networks","date":"2024-04-04","arxiv_id":"2404.03139","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/theoretical-and-empirical-insights-into-the#ran","syntology_url":"https://syntology.ai/paper/2404.03139","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.03139"}},"official":{"repos":["arjunsubramonian/degree-bias-exploration"],"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/hypeboy-generative-self-supervised","slug":"hypeboy-generative-self-supervised","title":"HypeBoy: Generative Self-Supervised Representation Learning on Hypergraphs","date":"2024-03-31","arxiv_id":"2404.00638","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":1,"n_instrument":4,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":5,"phrase":"5 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; 4 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/hypeboy-generative-self-supervised#ran","syntology_url":"https://syntology.ai/paper/2404.00638","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.00638"}},"official":{"repos":["kswoo97/hypeboy"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/spectral-invariant-learning-for-dynamic-1","slug":"spectral-invariant-learning-for-dynamic-1","title":"Spectral Invariant Learning for Dynamic Graphs under Distribution Shifts","date":"2024-03-08","arxiv_id":"2403.05026","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/spectral-invariant-learning-for-dynamic-1#ran","syntology_url":"https://syntology.ai/paper/2403.05026","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.05026"}},"official":{"repos":["wondergo2017/sild"],"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/pairwise-alignment-improves-graph-domain","slug":"pairwise-alignment-improves-graph-domain","title":"Pairwise Alignment Improves Graph Domain Adaptation","date":"2024-03-02","arxiv_id":"2403.01092","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":0,"n_instrument":5,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 5 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/pairwise-alignment-improves-graph-domain#ran","syntology_url":"https://syntology.ai/paper/2403.01092","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.01092"}},"official":{"repos":["graph-com/pair-align"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":0,"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/polynormer-polynomial-expressive-graph","slug":"polynormer-polynomial-expressive-graph","title":"Polynormer: Polynomial-Expressive Graph Transformer in Linear Time","date":"2024-03-02","arxiv_id":"2403.01232","repositories_listed":2,"syntology":{"n":8,"n_ran":5,"n_constructed":2,"n_ran_checked":5,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"5 ran (of which 2 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/polynormer-polynomial-expressive-graph#ran","syntology_url":"https://syntology.ai/paper/2403.01232","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.01232"}},"official":{"repos":["cornell-zhang/polynormer"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":2,"n_ran_no_instrument_failure":5,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/graph-parsing-networks","slug":"graph-parsing-networks","title":"Graph Parsing Networks","date":"2024-02-22","arxiv_id":"2402.14393","repositories_listed":2,"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/graph-parsing-networks#ran","syntology_url":"https://syntology.ai/paper/2402.14393","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.14393"}},"official":{"repos":["lumia-group/graphparsingnetworks"],"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/a-simple-and-yet-fairly-effective-defense-for","slug":"a-simple-and-yet-fairly-effective-defense-for","title":"A Simple and Yet Fairly Effective Defense for Graph Neural Networks","date":"2024-02-21","arxiv_id":"2402.13987","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":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) · 2 unverified","sample_list":"/paper/a-simple-and-yet-fairly-effective-defense-for#ran","syntology_url":"https://syntology.ai/paper/2402.13987","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.13987"}},"official":{"repos":["sennadir/noisygnn"],"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/can-gnn-be-good-adapter-for-llms","slug":"can-gnn-be-good-adapter-for-llms","title":"Can GNN be Good Adapter for LLMs?","date":"2024-02-20","arxiv_id":"2402.12984","repositories_listed":2,"syntology":{"n":8,"n_ran":6,"n_constructed":0,"n_ran_checked":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/can-gnn-be-good-adapter-for-llms#ran","syntology_url":"https://syntology.ai/paper/2402.12984","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.12984"}},"official":{"repos":["zjunet/graphadapter","hxttkl/GraphAdapter"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/large-language-model-driven-meta-structure","slug":"large-language-model-driven-meta-structure","title":"Large Language Model-driven Meta-structure Discovery in Heterogeneous Information Network","date":"2024-02-18","arxiv_id":"2402.11518","repositories_listed":1,"syntology":{"n":13,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":9,"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) · 9 unverified","sample_list":"/paper/large-language-model-driven-meta-structure#ran","syntology_url":"https://syntology.ai/paper/2402.11518","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.11518"}},"official":{"repos":["linchen-65/restruct"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":9,"ran_from_kinds":["official"]}}},{"url":"/paper/graph-skeleton-1-nodes-are-sufficient-to","slug":"graph-skeleton-1-nodes-are-sufficient-to","title":"Graph-Skeleton: ~1% Nodes are Sufficient to Represent Billion-Scale Graph","date":"2024-02-14","arxiv_id":"2402.09565","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/graph-skeleton-1-nodes-are-sufficient-to#ran","syntology_url":"https://syntology.ai/paper/2402.09565","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.09565"}},"official":{"repos":["zjunet/graphskeleton"],"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/netinfof-framework-measuring-and-exploiting","slug":"netinfof-framework-measuring-and-exploiting","title":"NetInfoF Framework: Measuring and Exploiting Network Usable Information","date":"2024-02-12","arxiv_id":"2402.07999","repositories_listed":1,"syntology":{"n":8,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/netinfof-framework-measuring-and-exploiting#ran","syntology_url":"https://syntology.ai/paper/2402.07999","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.07999"}},"official":{"repos":["amazon-science/network-usable-info-framework"],"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/graphtranslator-aligning-graph-model-to-large","slug":"graphtranslator-aligning-graph-model-to-large","title":"GraphTranslator: Aligning Graph Model to Large Language Model for Open-ended Tasks","date":"2024-02-11","arxiv_id":"2402.07197","repositories_listed":1,"syntology":{"n":9,"n_ran":8,"n_constructed":0,"n_ran_checked":6,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":1,"n_no_contract":5,"n_pointer_only":1,"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) · 1 unverified","sample_list":"/paper/graphtranslator-aligning-graph-model-to-large#ran","syntology_url":"https://syntology.ai/paper/2402.07197","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.07197"}},"official":{"repos":["alibaba/graphtranslator"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":1,"ran_from_kinds":["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/similarity-based-neighbor-selection-for-graph","slug":"similarity-based-neighbor-selection-for-graph","title":"Similarity-based Neighbor Selection for Graph LLMs","date":"2024-02-06","arxiv_id":"2402.03720","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/similarity-based-neighbor-selection-for-graph#ran","syntology_url":"https://syntology.ai/paper/2402.03720","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.03720"}},"official":{"repos":["ruili33/sns"],"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/topology-informed-graph-transformer","slug":"topology-informed-graph-transformer","title":"Topology-Informed Graph Transformer","date":"2024-02-03","arxiv_id":"2402.02005","repositories_listed":2,"syntology":{"n":21,"n_ran":17,"n_constructed":0,"n_ran_checked":17,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":2,"n_no_contract":15,"n_pointer_only":21,"phrase":"17 ran (of which 0 constructed an object rather than computing a result; 17 with no instrument failure: 0 honoured, 2 violated, 15 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/topology-informed-graph-transformer#ran","syntology_url":"https://syntology.ai/paper/2402.02005","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.02005"}},"official":{"repos":["leemingo/tigt"],"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":["listed","official"]}}},{"url":"/paper/neural-scaling-laws-on-graphs","slug":"neural-scaling-laws-on-graphs","title":"Towards Neural Scaling Laws on Graphs","date":"2024-02-03","arxiv_id":"2402.02054","repositories_listed":1,"syntology":{"n":7,"n_ran":5,"n_constructed":0,"n_ran_checked":4,"n_instrument":1,"n_unverified":2,"n_honours":1,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"5 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; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/neural-scaling-laws-on-graphs#ran","syntology_url":"https://syntology.ai/paper/2402.02054","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.02054"}},"official":{"repos":["liu-jingzhe/graph-scaling-laws"],"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/rendering-graphs-for-graph-reasoning-in","slug":"rendering-graphs-for-graph-reasoning-in","title":"GITA: Graph to Visual and Textual Integration for Vision-Language Graph Reasoning","date":"2024-02-03","arxiv_id":"2402.02130","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":1,"n_no_contract":6,"n_pointer_only":10,"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) · 3 unverified","sample_list":"/paper/rendering-graphs-for-graph-reasoning-in#ran","syntology_url":"https://syntology.ai/paper/2402.02130","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.02130"}},"official":{"repos":["WEIYanbin1999/GITA"],"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/l2g2g-a-scalable-local-to-global-network","slug":"l2g2g-a-scalable-local-to-global-network","title":"L2G2G: a Scalable Local-to-Global Network Embedding with Graph Autoencoders","date":"2024-02-02","arxiv_id":"2402.01614","repositories_listed":1,"syntology":{"n":6,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/l2g2g-a-scalable-local-to-global-network#ran","syntology_url":"https://syntology.ai/paper/2402.01614","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.01614"}},"official":{"repos":["tonyauyeung/local2gae2global"],"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/cross-space-adaptive-filter-integrating-graph","slug":"cross-space-adaptive-filter-integrating-graph","title":"Cross-Space Adaptive Filter: Integrating Graph Topology and Node Attributes for Alleviating the Over-smoothing Problem","date":"2024-01-26","arxiv_id":"2401.14876","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"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 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) · 0 unverified","sample_list":"/paper/cross-space-adaptive-filter-integrating-graph#ran","syntology_url":"https://syntology.ai/paper/2401.14876","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2401.14876"}},"official":{"repos":["huangzichun/cross-space-adaptive-filter"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/pc-conv-unifying-homophily-and-heterophily","slug":"pc-conv-unifying-homophily-and-heterophily","title":"PC-Conv: Unifying Homophily and Heterophily with Two-fold Filtering","date":"2023-12-22","arxiv_id":"2312.14438","repositories_listed":1,"syntology":{"n":14,"n_ran":10,"n_constructed":0,"n_ran_checked":9,"n_instrument":1,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":14,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 1 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/pc-conv-unifying-homophily-and-heterophily#ran","syntology_url":"https://syntology.ai/paper/2312.14438","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2312.14438"}},"official":{"repos":["uestclbh/pc-conv"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":4,"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/dp-adambc-your-dp-adam-is-actually-dp-sgd","slug":"dp-adambc-your-dp-adam-is-actually-dp-sgd","title":"DP-AdamBC: Your DP-Adam Is Actually DP-SGD (Unless You Apply Bias Correction)","date":"2023-12-21","arxiv_id":"2312.14334","repositories_listed":1,"syntology":{"n":15,"n_ran":14,"n_constructed":0,"n_ran_checked":14,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":14,"n_pointer_only":15,"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) · 1 unverified","sample_list":"/paper/dp-adambc-your-dp-adam-is-actually-dp-sgd#ran","syntology_url":"https://syntology.ai/paper/2312.14334","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2312.14334"}},"official":{"repos":["ubc-systopia/DP-AdamBC"],"state":"official (archive's flag): 14 ran","n_ran":14,"n_constructed":0,"n_ran_no_instrument_failure":14,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/nodemixup-tackling-under-reaching-for-graph","slug":"nodemixup-tackling-under-reaching-for-graph","title":"NodeMixup: Tackling Under-Reaching for Graph Neural Networks","date":"2023-12-20","arxiv_id":"2312.13032","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":1,"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/nodemixup-tackling-under-reaching-for-graph#ran","syntology_url":"https://syntology.ai/paper/2312.13032","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2312.13032"}},"official":{"repos":["weiganglu/nodemixup"],"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/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/on-the-initialization-of-graph-neural","slug":"on-the-initialization-of-graph-neural","title":"On the Initialization of Graph Neural Networks","date":"2023-12-05","arxiv_id":"2312.02622","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":2,"n_instrument":3,"n_unverified":0,"n_honours":1,"n_violates":1,"n_no_contract":0,"n_pointer_only":5,"phrase":"5 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; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/on-the-initialization-of-graph-neural#ran","syntology_url":"https://syntology.ai/paper/2312.02622","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2312.02622"}},"official":{"repos":["lspongebobjh/virgo_icml2023"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/provable-adversarial-robustness-for-group-1","slug":"provable-adversarial-robustness-for-group-1","title":"Provable Adversarial Robustness for Group Equivariant Tasks: Graphs, Point Clouds, Molecules, and More","date":"2023-12-05","arxiv_id":"2312.02708","repositories_listed":0,"syntology":{"n":31,"n_ran":22,"n_constructed":1,"n_ran_checked":19,"n_instrument":3,"n_unverified":9,"n_honours":0,"n_violates":0,"n_no_contract":19,"n_pointer_only":4,"phrase":"22 ran (of which 1 constructed an object rather than computing a result; 19 with no instrument failure: 0 honoured, 0 violated, 19 with no contract checked; 3 where Syntology's instrument failed) · 9 unverified","sample_list":"/paper/provable-adversarial-robustness-for-group-1#ran","syntology_url":"https://syntology.ai/paper/2312.02708","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2312.02708"}},"official":null}},{"url":"/paper/the-self-loop-paradox-investigating-the","slug":"the-self-loop-paradox-investigating-the","title":"The Self-Loop Paradox: Investigating the Impact of Self-Loops on Graph Neural Networks","date":"2023-12-04","arxiv_id":"2312.01721","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/the-self-loop-paradox-investigating-the#ran","syntology_url":"https://syntology.ai/paper/2312.01721","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2312.01721"}},"official":{"repos":["m-lampert/self-loop-paradox"],"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/tracing-hyperparameter-dependencies-for-model","slug":"tracing-hyperparameter-dependencies-for-model","title":"Tracing Hyperparameter Dependencies for Model Parsing via Learnable Graph Pooling Network","date":"2023-12-03","arxiv_id":"2312.02224","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/tracing-hyperparameter-dependencies-for-model#ran","syntology_url":"https://syntology.ai/paper/2312.02224","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2312.02224"}},"official":{"repos":["chelsea234/lgpn"],"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/improvements-on-uncertainty-quantification","slug":"improvements-on-uncertainty-quantification","title":"Improvements on Uncertainty Quantification for Node Classification via Distance-Based Regularization","date":"2023-11-10","arxiv_id":"2311.05795","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/improvements-on-uncertainty-quantification#ran","syntology_url":"https://syntology.ai/paper/2311.05795","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2311.05795"}},"official":{"repos":["neoques/graph-posterior-network"],"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/mixture-of-weak-strong-experts-on-graphs","slug":"mixture-of-weak-strong-experts-on-graphs","title":"Mixture of Weak & Strong Experts on Graphs","date":"2023-11-09","arxiv_id":"2311.05185","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/mixture-of-weak-strong-experts-on-graphs#ran","syntology_url":"https://syntology.ai/paper/2311.05185","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2311.05185"}},"official":{"repos":["facebookresearch/mowst-gnn"],"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/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/hyperbolic-graph-neural-networks-at-scale-a","slug":"hyperbolic-graph-neural-networks-at-scale-a","title":"Hyperbolic Graph Neural Networks at Scale: A Meta Learning Approach","date":"2023-10-29","arxiv_id":"2310.18918","repositories_listed":0,"syntology":{"n":6,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":6,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/hyperbolic-graph-neural-networks-at-scale-a#ran","syntology_url":"https://syntology.ai/paper/2310.18918","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.18918"}},"official":null}},{"url":"/paper/rethinking-semi-supervised-imbalanced-node-1","slug":"rethinking-semi-supervised-imbalanced-node-1","title":"Rethinking Semi-Supervised Imbalanced Node Classification from Bias-Variance Decomposition","date":"2023-10-28","arxiv_id":"2310.18765","repositories_listed":1,"syntology":{"n":11,"n_ran":10,"n_constructed":0,"n_ran_checked":10,"n_instrument":0,"n_unverified":1,"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) · 1 unverified","sample_list":"/paper/rethinking-semi-supervised-imbalanced-node-1#ran","syntology_url":"https://syntology.ai/paper/2310.18765","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.18765"}},"official":{"repos":["yanliang3612/revar"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/enhancing-graph-neural-networks-with","slug":"enhancing-graph-neural-networks-with","title":"PSP: Pre-Training and Structure Prompt Tuning for Graph Neural Networks","date":"2023-10-26","arxiv_id":"2310.17394","repositories_listed":1,"syntology":{"n":8,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":7,"n_pointer_only":8,"phrase":"8 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; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/enhancing-graph-neural-networks-with#ran","syntology_url":"https://syntology.ai/paper/2310.17394","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.17394"}},"official":{"repos":["gqq1210/psp"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":0,"ran_from_kinds":["official"]}}},{"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/musegnn-interpretable-and-convergent-graph","slug":"musegnn-interpretable-and-convergent-graph","title":"MuseGNN: Interpretable and Convergent Graph Neural Network Layers at Scale","date":"2023-10-19","arxiv_id":"2310.12457","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":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/musegnn-interpretable-and-convergent-graph#ran","syntology_url":"https://syntology.ai/paper/2310.12457","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.12457"}},"official":null}},{"url":"/paper/non-backtracking-graph-neural-networks","slug":"non-backtracking-graph-neural-networks","title":"Non-backtracking Graph Neural Networks","date":"2023-10-11","arxiv_id":"2310.07430","repositories_listed":1,"syntology":{"n":5,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":5,"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) · 2 unverified","sample_list":"/paper/non-backtracking-graph-neural-networks#ran","syntology_url":"https://syntology.ai/paper/2310.07430","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.07430"}},"official":{"repos":["seonghyun26/nba-gnn"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/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/label-free-node-classification-on-graphs-with","slug":"label-free-node-classification-on-graphs-with","title":"Label-free Node Classification on Graphs with Large Language Models (LLMS)","date":"2023-10-07","arxiv_id":"2310.04668","repositories_listed":1,"syntology":{"n":29,"n_ran":22,"n_constructed":0,"n_ran_checked":19,"n_instrument":3,"n_unverified":7,"n_honours":1,"n_violates":0,"n_no_contract":18,"n_pointer_only":10,"phrase":"22 ran (of which 0 constructed an object rather than computing a result; 19 with no instrument failure: 1 honoured, 0 violated, 18 with no contract checked; 3 where Syntology's instrument failed) · 7 unverified","sample_list":"/paper/label-free-node-classification-on-graphs-with#ran","syntology_url":"https://syntology.ai/paper/2310.04668","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.04668"}},"official":{"repos":["currytang/llmgnn"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":5,"ran_from_kinds":["found_in_text","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/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/higher-order-graph-convolutional-network-with","slug":"higher-order-graph-convolutional-network-with","title":"Higher-order Graph Convolutional Network with Flower-Petals Laplacians on Simplicial Complexes","date":"2023-09-22","arxiv_id":"2309.12971","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/higher-order-graph-convolutional-network-with#ran","syntology_url":"https://syntology.ai/paper/2309.12971","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2309.12971"}},"official":{"repos":["yiminghh/higcn"],"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/graph-contrastive-learning-meets-graph-meta","slug":"graph-contrastive-learning-meets-graph-meta","title":"Graph Contrastive Learning Meets Graph Meta Learning: A Unified Method for Few-shot Node Tasks","date":"2023-09-19","arxiv_id":"2309.10376","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/graph-contrastive-learning-meets-graph-meta#ran","syntology_url":"https://syntology.ai/paper/2309.10376","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2309.10376"}},"official":{"repos":["haoliu-cola/cola"],"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/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/benchtemp-a-general-benchmark-for-evaluating","slug":"benchtemp-a-general-benchmark-for-evaluating","title":"BenchTemp: A General Benchmark for Evaluating Temporal Graph Neural Networks","date":"2023-08-31","arxiv_id":"2308.16385","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/benchtemp-a-general-benchmark-for-evaluating#ran","syntology_url":"https://syntology.ai/paper/2308.16385","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.16385"}},"official":{"repos":["qianghuangwhu/benchtemp"],"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/domain-adaptive-message-passing-graph-neural","slug":"domain-adaptive-message-passing-graph-neural","title":"Domain-adaptive Message Passing Graph Neural Network","date":"2023-08-31","arxiv_id":"2308.16470","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":3,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/domain-adaptive-message-passing-graph-neural#ran","syntology_url":"https://syntology.ai/paper/2308.16470","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.16470"}},"official":{"repos":["shenxiaocam/dm_gnn"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/rank-collapse-causes-over-smoothing-and-over","slug":"rank-collapse-causes-over-smoothing-and-over","title":"Rank Collapse Causes Over-Smoothing and Over-Correlation in Graph Neural Networks","date":"2023-08-31","arxiv_id":"2308.16800","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/rank-collapse-causes-over-smoothing-and-over#ran","syntology_url":"https://syntology.ai/paper/2308.16800","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.16800"}},"official":{"repos":["roth-andreas/rank_collapse"],"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/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/class-label-aware-graph-anomaly-detection","slug":"class-label-aware-graph-anomaly-detection","title":"Class Label-aware Graph Anomaly Detection","date":"2023-08-22","arxiv_id":"2308.11669","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/class-label-aware-graph-anomaly-detection#ran","syntology_url":"https://syntology.ai/paper/2308.11669","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.11669"}},"official":{"repos":["jhkim611/clad"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}}],"record_sha256":"bc3210dcabe64fb289e08b7978afad7459c3553e0cbaf19970086574ae58a51e","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}