{"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/2","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":2,"pages_in_order":4,"rows_per_page":100,"rows":[101,200],"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":"/task/node-classification/papers/ran/1","next":"/task/node-classification/papers/ran/3","papers":[{"url":"/paper/transitivity-preserving-graph-representation","slug":"transitivity-preserving-graph-representation","title":"Transitivity-Preserving Graph Representation Learning for Bridging Local Connectivity and Role-based Similarity","date":"2023-08-18","arxiv_id":"2308.09517","repositories_listed":3,"syntology":{"n":26,"n_ran":19,"n_constructed":0,"n_ran_checked":16,"n_instrument":3,"n_unverified":7,"n_honours":0,"n_violates":0,"n_no_contract":16,"n_pointer_only":0,"phrase":"19 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; 3 where Syntology's instrument failed) · 7 unverified","sample_list":"/paper/transitivity-preserving-graph-representation#ran","syntology_url":"https://syntology.ai/paper/2308.09517","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.09517"}},"official":{"repos":["nslab-cuk/unified-graph-transformer"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":3,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/investigating-the-interplay-between-features","slug":"investigating-the-interplay-between-features","title":"Investigating the Interplay between Features and Structures in Graph Learning","date":"2023-08-18","arxiv_id":"2308.09570","repositories_listed":1,"syntology":{"n":17,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":8,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":17,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 0 where Syntology's instrument failed) · 8 unverified","sample_list":"/paper/investigating-the-interplay-between-features#ran","syntology_url":"https://syntology.ai/paper/2308.09570","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.09570"}},"official":{"repos":["danielecastellana22/feature-structure-interplay-graph-learning"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":8,"ran_from_kinds":["official"]}}},{"url":"/paper/simteg-a-frustratingly-simple-approach","slug":"simteg-a-frustratingly-simple-approach","title":"SimTeG: A Frustratingly Simple Approach Improves Textual Graph Learning","date":"2023-08-03","arxiv_id":"2308.02565","repositories_listed":2,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/simteg-a-frustratingly-simple-approach#ran","syntology_url":"https://syntology.ai/paper/2308.02565","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.02565"}},"official":{"repos":["vermouthdky/simteg"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/long-range-dependency-based-multi-layer","slug":"long-range-dependency-based-multi-layer","title":"Long-range Meta-path Search on Large-scale Heterogeneous Graphs","date":"2023-07-17","arxiv_id":"2307.08430","repositories_listed":4,"syntology":{"n":7,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":7,"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) · 4 unverified","sample_list":"/paper/long-range-dependency-based-multi-layer#ran","syntology_url":"https://syntology.ai/paper/2307.08430","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2307.08430"}},"official":{"repos":["jhl-hust/ldmlp","jhl-hust/lmsps"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/re-think-and-re-design-graph-neural-networks","slug":"re-think-and-re-design-graph-neural-networks","title":"Re-Think and Re-Design Graph Neural Networks in Spaces of Continuous Graph Diffusion Functionals","date":"2023-07-01","arxiv_id":"2307.00222","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/re-think-and-re-design-graph-neural-networks#ran","syntology_url":"https://syntology.ai/paper/2307.00222","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2307.00222"}},"official":{"repos":["Dandy5721/GNN-PDE-COV"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/diffusion-jump-gnns-homophiliation-via","slug":"diffusion-jump-gnns-homophiliation-via","title":"Diffusion-Jump GNNs: Homophiliation via Learnable Metric Filters","date":"2023-06-29","arxiv_id":"2306.16976","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/diffusion-jump-gnns-homophiliation-via#ran","syntology_url":"https://syntology.ai/paper/2306.16976","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.16976"}},"official":{"repos":["AhmedBegggaUA/TFM"],"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/unsupervised-episode-generation-for-graph","slug":"unsupervised-episode-generation-for-graph","title":"Unsupervised Episode Generation for Graph Meta-learning","date":"2023-06-27","arxiv_id":"2306.15217","repositories_listed":1,"syntology":{"n":6,"n_ran":5,"n_constructed":3,"n_ran_checked":4,"n_instrument":1,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":3,"n_pointer_only":6,"phrase":"5 ran (of which 3 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) · 1 unverified","sample_list":"/paper/unsupervised-episode-generation-for-graph#ran","syntology_url":"https://syntology.ai/paper/2306.15217","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.15217"}},"official":{"repos":["jhngjng/naq-pytorch"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":3,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/cat-walk-inductive-hypergraph-learning-via","slug":"cat-walk-inductive-hypergraph-learning-via","title":"CAT-Walk: Inductive Hypergraph Learning via Set Walks","date":"2023-06-19","arxiv_id":"2306.11147","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":1,"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 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) · 1 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/cat-walk-inductive-hypergraph-learning-via#ran","syntology_url":"https://syntology.ai/paper/2306.11147","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.11147"}},"official":{"repos":["ubc-systopia/CATWalk"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/from-hypergraph-energy-functions-to","slug":"from-hypergraph-energy-functions-to","title":"From Hypergraph Energy Functions to Hypergraph Neural Networks","date":"2023-06-16","arxiv_id":"2306.09623","repositories_listed":1,"syntology":{"n":12,"n_ran":7,"n_constructed":0,"n_ran_checked":6,"n_instrument":1,"n_unverified":5,"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) · 5 unverified","sample_list":"/paper/from-hypergraph-energy-functions-to#ran","syntology_url":"https://syntology.ai/paper/2306.09623","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.09623"}},"official":{"repos":["yxzwang/phenomnn"],"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":["found_in_text","official"]}}},{"url":"/paper/accelerating-dynamic-network-embedding-with","slug":"accelerating-dynamic-network-embedding-with","title":"Accelerating Dynamic Network Embedding with Billions of Parameter Updates to Milliseconds","date":"2023-06-15","arxiv_id":"2306.08967","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":1,"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; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/accelerating-dynamic-network-embedding-with#ran","syntology_url":"https://syntology.ai/paper/2306.08967","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.08967"}},"official":{"repos":["zjunet/damf"],"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":["official"]}}},{"url":"/paper/why-using-either-aggregated-features-or","slug":"why-using-either-aggregated-features-or","title":"A Simple and Scalable Graph Neural Network for Large Directed Graphs","date":"2023-06-14","arxiv_id":"2306.08274","repositories_listed":1,"syntology":{"n":13,"n_ran":10,"n_constructed":0,"n_ran_checked":7,"n_instrument":3,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":2,"phrase":"10 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; 3 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/why-using-either-aggregated-features-or#ran","syntology_url":"https://syntology.ai/paper/2306.08274","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.08274"}},"official":{"repos":["seijimaekawa/a2dug"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/nodeformer-a-scalable-graph-structure","slug":"nodeformer-a-scalable-graph-structure","title":"NodeFormer: A Scalable Graph Structure Learning Transformer for Node Classification","date":"2023-06-14","arxiv_id":"2306.08385","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"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) · 1 unverified","sample_list":"/paper/nodeformer-a-scalable-graph-structure#ran","syntology_url":"https://syntology.ai/paper/2306.08385","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.08385"}},"official":{"repos":["qitianwu/nodeformer"],"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/task-equivariant-graph-few-shot-learning","slug":"task-equivariant-graph-few-shot-learning","title":"Task-Equivariant Graph Few-shot Learning","date":"2023-05-30","arxiv_id":"2305.18758","repositories_listed":1,"syntology":{"n":7,"n_ran":5,"n_constructed":0,"n_ran_checked":4,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":1,"n_no_contract":3,"n_pointer_only":3,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 1 violated, 3 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/task-equivariant-graph-few-shot-learning#ran","syntology_url":"https://syntology.ai/paper/2305.18758","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.18758"}},"official":{"repos":["sung-won-kim/teg"],"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/node-embedding-from-neural-hamiltonian-orbits","slug":"node-embedding-from-neural-hamiltonian-orbits","title":"Node Embedding from Neural Hamiltonian Orbits in Graph Neural Networks","date":"2023-05-30","arxiv_id":"2305.18965","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/node-embedding-from-neural-hamiltonian-orbits#ran","syntology_url":"https://syntology.ai/paper/2305.18965","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.18965"}},"official":{"repos":["zknus/hamiltonian-gnn"],"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":["official","unlocated"]}}},{"url":"/paper/graph-inductive-biases-in-transformers","slug":"graph-inductive-biases-in-transformers","title":"Graph Inductive Biases in Transformers without Message Passing","date":"2023-05-27","arxiv_id":"2305.17589","repositories_listed":2,"syntology":{"n":12,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":1,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/graph-inductive-biases-in-transformers#ran","syntology_url":"https://syntology.ai/paper/2305.17589","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.17589"}},"official":{"repos":["liamma/grit"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/confidence-based-feature-imputation-for","slug":"confidence-based-feature-imputation-for","title":"Confidence-Based Feature Imputation for Graphs with Partially Known Features","date":"2023-05-26","arxiv_id":"2305.16618","repositories_listed":1,"syntology":{"n":12,"n_ran":10,"n_constructed":0,"n_ran_checked":10,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":10,"n_pointer_only":5,"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) · 2 unverified","sample_list":"/paper/confidence-based-feature-imputation-for#ran","syntology_url":"https://syntology.ai/paper/2305.16618","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.16618"}},"official":{"repos":["daehoum1/pcfi"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/graph-neural-convection-diffusion-with","slug":"graph-neural-convection-diffusion-with","title":"Graph Neural Convection-Diffusion with Heterophily","date":"2023-05-26","arxiv_id":"2305.16780","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-neural-convection-diffusion-with#ran","syntology_url":"https://syntology.ai/paper/2305.16780","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.16780"}},"official":{"repos":["zknus/graph-diffusion-cde"],"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/fast-online-node-labeling-for-very-large","slug":"fast-online-node-labeling-for-very-large","title":"Fast Online Node Labeling for Very Large Graphs","date":"2023-05-25","arxiv_id":"2305.16257","repositories_listed":1,"syntology":{"n":9,"n_ran":5,"n_constructed":0,"n_ran_checked":4,"n_instrument":1,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 1 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/fast-online-node-labeling-for-very-large#ran","syntology_url":"https://syntology.ai/paper/2305.16257","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.16257"}},"official":{"repos":["baojian/FastONL"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/degree-decomposition-based-explanation-for-1","slug":"degree-decomposition-based-explanation-for-1","title":"DEGREE: Decomposition Based Explanation For Graph Neural Networks","date":"2023-05-22","arxiv_id":"2305.12895","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/degree-decomposition-based-explanation-for-1#ran","syntology_url":"https://syntology.ai/paper/2305.12895","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.12895"}},"official":{"repos":["Qizhang-Feng/DEGREE"],"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-propagation-transformer-for-graph","slug":"graph-propagation-transformer-for-graph","title":"Graph Propagation Transformer for Graph Representation Learning","date":"2023-05-19","arxiv_id":"2305.11424","repositories_listed":1,"syntology":{"n":8,"n_ran":4,"n_constructed":4,"n_ran_checked":4,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":8,"phrase":"4 ran (of which 4 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified; every one of the 4 samples that ran constructed an object rather than computing a result","sample_list":"/paper/graph-propagation-transformer-for-graph#ran","syntology_url":"https://syntology.ai/paper/2305.11424","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.11424"}},"official":{"repos":["czczup/gptrans"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":4,"n_ran_no_instrument_failure":4,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/edge-directionality-improves-learning-on","slug":"edge-directionality-improves-learning-on","title":"Edge Directionality Improves Learning on Heterophilic Graphs","date":"2023-05-17","arxiv_id":"2305.10498","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":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) · 1 unverified","sample_list":"/paper/edge-directionality-improves-learning-on#ran","syntology_url":"https://syntology.ai/paper/2305.10498","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.10498"}},"official":{"repos":["emalgorithm/directed-graph-neural-network"],"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/drew-dynamically-rewired-message-passing-with","slug":"drew-dynamically-rewired-message-passing-with","title":"DRew: Dynamically Rewired Message Passing with Delay","date":"2023-05-13","arxiv_id":"2305.08018","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":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) · 3 unverified","sample_list":"/paper/drew-dynamically-rewired-message-passing-with#ran","syntology_url":"https://syntology.ai/paper/2305.08018","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.08018"}},"official":{"repos":["bengutteridge/drew"],"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/fisher-information-embedding-for-node-and","slug":"fisher-information-embedding-for-node-and","title":"Fisher Information Embedding for Node and Graph Learning","date":"2023-05-12","arxiv_id":"2305.07580","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/fisher-information-embedding-for-node-and#ran","syntology_url":"https://syntology.ai/paper/2305.07580","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.07580"}},"official":{"repos":["BorgwardtLab/fisher_information_embedding"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/gnns-you-can-be-stronger-deeper-and-faster","slug":"gnns-you-can-be-stronger-deeper-and-faster","title":"Deep Graph Neural Networks via Posteriori-Sampling-based Node-Adaptive Residual Module","date":"2023-05-09","arxiv_id":"2305.05368","repositories_listed":1,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":3,"n_pointer_only":3,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 1 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/gnns-you-can-be-stronger-deeper-and-faster#ran","syntology_url":"https://syntology.ai/paper/2305.05368","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.05368"}},"official":{"repos":["jingbo02/psnr-gnn"],"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/csgcl-community-strength-enhanced-graph","slug":"csgcl-community-strength-enhanced-graph","title":"CSGCL: Community-Strength-Enhanced Graph Contrastive Learning","date":"2023-05-08","arxiv_id":"2305.04658","repositories_listed":1,"syntology":{"n":9,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":7,"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) · 7 unverified","sample_list":"/paper/csgcl-community-strength-enhanced-graph#ran","syntology_url":"https://syntology.ai/paper/2305.04658","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.04658"}},"official":{"repos":["hanchen-hust/csgcl"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":7,"ran_from_kinds":["official"]}}},{"url":"/paper/when-do-graph-neural-networks-help-with-node","slug":"when-do-graph-neural-networks-help-with-node","title":"When Do Graph Neural Networks Help with Node Classification? Investigating the Impact of Homophily Principle on Node Distinguishability","date":"2023-04-25","arxiv_id":"2304.14274","repositories_listed":1,"syntology":{"n":10,"n_ran":8,"n_constructed":0,"n_ran_checked":6,"n_instrument":2,"n_unverified":2,"n_honours":1,"n_violates":1,"n_no_contract":4,"n_pointer_only":0,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 1 honoured, 1 violated, 4 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/when-do-graph-neural-networks-help-with-node#ran","syntology_url":"https://syntology.ai/paper/2304.14274","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2304.14274"}},"official":{"repos":["SitaoLuan/When-Do-GNNs-Help"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/towards-better-dynamic-graph-learning-new-1","slug":"towards-better-dynamic-graph-learning-new-1","title":"Towards Better Dynamic Graph Learning: New Architecture and Unified Library","date":"2023-03-23","arxiv_id":"2303.13047","repositories_listed":2,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/towards-better-dynamic-graph-learning-new-1#ran","syntology_url":"https://syntology.ai/paper/2303.13047","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2303.13047"}},"official":{"repos":["yule-buaa/dyglib"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/easydgl-encode-train-and-interpret-for","slug":"easydgl-encode-train-and-interpret-for","title":"EasyDGL: Encode, Train and Interpret for Continuous-time Dynamic Graph Learning","date":"2023-03-22","arxiv_id":"2303.12341","repositories_listed":1,"syntology":{"n":8,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/easydgl-encode-train-and-interpret-for#ran","syntology_url":"https://syntology.ai/paper/2303.12341","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2303.12341"}},"official":{"repos":["cchao0116/EasyDGL"],"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/unreal-unlabeled-nodes-retrieval-and-labeling","slug":"unreal-unlabeled-nodes-retrieval-and-labeling","title":"UNREAL:Unlabeled Nodes Retrieval and Labeling for Heavily-imbalanced Node Classification","date":"2023-03-18","arxiv_id":"2303.10371","repositories_listed":1,"syntology":{"n":15,"n_ran":10,"n_constructed":4,"n_ran_checked":4,"n_instrument":6,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"10 ran (of which 4 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 6 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/unreal-unlabeled-nodes-retrieval-and-labeling#ran","syntology_url":"https://syntology.ai/paper/2303.10371","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2303.10371"}},"official":{"repos":["yanliang3612/UNREAL"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":4,"n_ran_no_instrument_failure":4,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/exphormer-sparse-transformers-for-graphs","slug":"exphormer-sparse-transformers-for-graphs","title":"Exphormer: Sparse Transformers for Graphs","date":"2023-03-10","arxiv_id":"2303.06147","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/exphormer-sparse-transformers-for-graphs#ran","syntology_url":"https://syntology.ai/paper/2303.06147","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2303.06147"}},"official":{"repos":["hamed1375/exphormer"],"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/ordered-gnn-ordering-message-passing-to-deal","slug":"ordered-gnn-ordering-message-passing-to-deal","title":"Ordered GNN: Ordering Message Passing to Deal with Heterophily and Over-smoothing","date":"2023-02-03","arxiv_id":"2302.01524","repositories_listed":1,"syntology":{"n":10,"n_ran":6,"n_constructed":0,"n_ran_checked":5,"n_instrument":1,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":8,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 1 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/ordered-gnn-ordering-message-passing-to-deal#ran","syntology_url":"https://syntology.ai/paper/2302.01524","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2302.01524"}},"official":{"repos":["lumia-group/orderedgnn"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/semi-supervised-classification-with-graph-1","slug":"semi-supervised-classification-with-graph-1","title":"Unsupervised Neighborhood Propagation Kernel Layers for Semi-supervised Node Classification","date":"2023-01-31","arxiv_id":"2301.13764","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/semi-supervised-classification-with-graph-1#ran","syntology_url":"https://syntology.ai/paper/2301.13764","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2301.13764"}},"official":{"repos":["sonnyachten/gckm"],"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/difformer-scalable-graph-transformers-induced","slug":"difformer-scalable-graph-transformers-induced","title":"DIFFormer: Scalable (Graph) Transformers Induced by Energy Constrained Diffusion","date":"2023-01-23","arxiv_id":"2301.09474","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":2,"n_no_contract":0,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 2 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/difformer-scalable-graph-transformers-induced#ran","syntology_url":"https://syntology.ai/paper/2301.09474","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2301.09474"}},"official":{"repos":["qitianwu/difformer"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["community"]}}},{"url":"/paper/few-shot-node-classification-with-extremely","slug":"few-shot-node-classification-with-extremely","title":"Few-shot Node Classification with Extremely Weak Supervision","date":"2023-01-06","arxiv_id":"2301.02708","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":1,"n_violates":1,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 1 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/few-shot-node-classification-with-extremely#ran","syntology_url":"https://syntology.ai/paper/2301.02708","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2301.02708"}},"official":{"repos":["songw-sw/x-fnc"],"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":["official","unlocated"]}}},{"url":"/paper/ultraprop-principled-and-explainable","slug":"ultraprop-principled-and-explainable","title":"NetEffect: Discovery and Exploitation of Generalized Network Effects","date":"2022-12-31","arxiv_id":"2301.00270","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/ultraprop-principled-and-explainable#ran","syntology_url":"https://syntology.ai/paper/2301.00270","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2301.00270"}},"official":{"repos":["mengchillee/neteffect"],"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/gread-graph-neural-reaction-diffusion","slug":"gread-graph-neural-reaction-diffusion","title":"GREAD: Graph Neural Reaction-Diffusion Networks","date":"2022-11-25","arxiv_id":"2211.14208","repositories_listed":1,"syntology":{"n":10,"n_ran":9,"n_constructed":0,"n_ran_checked":6,"n_instrument":3,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":4,"phrase":"9 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; 3 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/gread-graph-neural-reaction-diffusion#ran","syntology_url":"https://syntology.ai/paper/2211.14208","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2211.14208"}},"official":{"repos":["jeongwhanchoi/gread"],"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","unlocated"]}}},{"url":"/paper/a-new-graph-node-classification-benchmark","slug":"a-new-graph-node-classification-benchmark","title":"A New Graph Node Classification Benchmark: Learning Structure from Histology Cell Graphs","date":"2022-11-11","arxiv_id":"2211.06292","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/a-new-graph-node-classification-benchmark#ran","syntology_url":"https://syntology.ai/paper/2211.06292","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2211.06292"}},"official":{"repos":["nellaker-group/placenta"],"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/graph-neural-networks-for-community-detection","slug":"graph-neural-networks-for-community-detection","title":"A Spectral Analysis of Graph Neural Networks on Dense and Sparse Graphs","date":"2022-11-06","arxiv_id":"2211.03231","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/graph-neural-networks-for-community-detection#ran","syntology_url":"https://syntology.ai/paper/2211.03231","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2211.03231"}},"official":{"repos":["nhuang37/gnn_community_detection"],"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/a-graph-is-more-than-its-nodes-towards","slug":"a-graph-is-more-than-its-nodes-towards","title":"A Graph Is More Than Its Nodes: Towards Structured Uncertainty-Aware Learning on Graphs","date":"2022-10-27","arxiv_id":"2210.15575","repositories_listed":1,"syntology":{"n":6,"n_ran":5,"n_constructed":3,"n_ran_checked":3,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"5 ran (of which 3 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/a-graph-is-more-than-its-nodes-towards#ran","syntology_url":"https://syntology.ai/paper/2210.15575","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.15575"}},"official":{"repos":["hans66hsu/structured_uncertainty_metrics"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":3,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/graph-few-shot-learning-with-task-specific","slug":"graph-few-shot-learning-with-task-specific","title":"Graph Few-shot Learning with Task-specific Structures","date":"2022-10-21","arxiv_id":"2210.12130","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/graph-few-shot-learning-with-task-specific#ran","syntology_url":"https://syntology.ai/paper/2210.12130","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.12130"}},"official":{"repos":["songw-sw/glitter"],"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/sa-mlp-distilling-graph-knowledge-from-gnns","slug":"sa-mlp-distilling-graph-knowledge-from-gnns","title":"SA-MLP: Distilling Graph Knowledge from GNNs into Structure-Aware MLP","date":"2022-10-18","arxiv_id":"2210.09609","repositories_listed":4,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/sa-mlp-distilling-graph-knowledge-from-gnns#ran","syntology_url":"https://syntology.ai/paper/2210.09609","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.09609"}},"official":{"repos":["jc-202/sa-mlp"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/mgnni-multiscale-graph-neural-networks-with","slug":"mgnni-multiscale-graph-neural-networks-with","title":"MGNNI: Multiscale Graph Neural Networks with Implicit Layers","date":"2022-10-15","arxiv_id":"2210.08353","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"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) · 1 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/mgnni-multiscale-graph-neural-networks-with#ran","syntology_url":"https://syntology.ai/paper/2210.08353","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.08353"}},"official":{"repos":["liu-jc/mgnni"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/a-comprehensive-study-on-large-scale-graph","slug":"a-comprehensive-study-on-large-scale-graph","title":"A Comprehensive Study on Large-Scale Graph Training: Benchmarking and Rethinking","date":"2022-10-14","arxiv_id":"2210.07494","repositories_listed":2,"syntology":{"n":6,"n_ran":4,"n_constructed":4,"n_ran_checked":4,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 4 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified; every one of the 4 samples that ran constructed an object rather than computing a result","sample_list":"/paper/a-comprehensive-study-on-large-scale-graph#ran","syntology_url":"https://syntology.ai/paper/2210.07494","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.07494"}},"official":{"repos":["vita-group/large_scale_gcn_benchmarking"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":4,"n_ran_no_instrument_failure":4,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/revisiting-heterophily-for-graph-neural","slug":"revisiting-heterophily-for-graph-neural","title":"Revisiting Heterophily For Graph Neural Networks","date":"2022-10-14","arxiv_id":"2210.07606","repositories_listed":1,"syntology":{"n":7,"n_ran":4,"n_constructed":0,"n_ran_checked":2,"n_instrument":2,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":2,"phrase":"4 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; 2 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/revisiting-heterophily-for-graph-neural#ran","syntology_url":"https://syntology.ai/paper/2210.07606","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.07606"}},"official":{"repos":["SitaoLuan/ACM-GNN"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/mlpinit-embarrassingly-simple-gnn-training","slug":"mlpinit-embarrassingly-simple-gnn-training","title":"MLPInit: Embarrassingly Simple GNN Training Acceleration with MLP Initialization","date":"2022-09-30","arxiv_id":"2210.00102","repositories_listed":2,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":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/mlpinit-embarrassingly-simple-gnn-training#ran","syntology_url":"https://syntology.ai/paper/2210.00102","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.00102"}},"official":{"repos":["snap-research/MLPInit-for-GNNs"],"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/towards-sparsification-of-graph-neural","slug":"towards-sparsification-of-graph-neural","title":"Towards Sparsification of Graph Neural Networks","date":"2022-09-11","arxiv_id":"2209.04766","repositories_listed":1,"syntology":{"n":7,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/towards-sparsification-of-graph-neural#ran","syntology_url":"https://syntology.ai/paper/2209.04766","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2209.04766"}},"official":{"repos":["harveyp123/iccd_sptrn_slr"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/scaling-up-dynamic-graph-representation","slug":"scaling-up-dynamic-graph-representation","title":"Scaling Up Dynamic Graph Representation Learning via Spiking Neural Networks","date":"2022-08-15","arxiv_id":"2208.10364","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/scaling-up-dynamic-graph-representation#ran","syntology_url":"https://syntology.ai/paper/2208.10364","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2208.10364"}},"official":{"repos":["edisonleeeee/spikenet"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/e2eg-end-to-end-node-classification-using","slug":"e2eg-end-to-end-node-classification-using","title":"E2EG: End-to-End Node Classification Using Graph Topology and Text-based Node Attributes","date":"2022-08-09","arxiv_id":"2208.04609","repositories_listed":1,"syntology":{"n":9,"n_ran":5,"n_constructed":0,"n_ran_checked":3,"n_instrument":2,"n_unverified":4,"n_honours":1,"n_violates":0,"n_no_contract":2,"n_pointer_only":4,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 1 honoured, 0 violated, 2 with no contract checked; 2 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/e2eg-end-to-end-node-classification-using#ran","syntology_url":"https://syntology.ai/paper/2208.04609","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2208.04609"}},"official":{"repos":["tuanh23/e2eg"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/generative-subgraph-contrast-for-self","slug":"generative-subgraph-contrast-for-self","title":"Generative Subgraph Contrast for Self-Supervised Graph Representation Learning","date":"2022-07-25","arxiv_id":"2207.11996","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":1,"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 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) · 1 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/generative-subgraph-contrast-for-self#ran","syntology_url":"https://syntology.ai/paper/2207.11996","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2207.11996"}},"official":{"repos":["yh-han/gsc"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/equivariant-hypergraph-diffusion-neural","slug":"equivariant-hypergraph-diffusion-neural","title":"Equivariant Hypergraph Diffusion Neural Operators","date":"2022-07-14","arxiv_id":"2207.06680","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/equivariant-hypergraph-diffusion-neural#ran","syntology_url":"https://syntology.ai/paper/2207.06680","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2207.06680"}},"official":{"repos":["graph-com/ed-hnn"],"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/graph-trees-with-attention","slug":"graph-trees-with-attention","title":"TREE-G: Decision Trees Contesting Graph Neural Networks","date":"2022-07-06","arxiv_id":"2207.02760","repositories_listed":1,"syntology":{"n":10,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":0,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/graph-trees-with-attention#ran","syntology_url":"https://syntology.ai/paper/2207.02760","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2207.02760"}},"official":{"repos":["mayabechlerspeicher/tree-g"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/a-representation-learning-framework-for-1","slug":"a-representation-learning-framework-for-1","title":"A Representation Learning Framework for Property Graphs","date":"2022-06-27","arxiv_id":"2206.13176","repositories_listed":1,"syntology":{"n":12,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":4,"n_honours":1,"n_violates":0,"n_no_contract":7,"n_pointer_only":4,"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) · 4 unverified","sample_list":"/paper/a-representation-learning-framework-for-1#ran","syntology_url":"https://syntology.ai/paper/2206.13176","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.13176"}},"official":{"repos":["yifan-h/pge"],"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/tam-topology-aware-margin-loss-for-class","slug":"tam-topology-aware-margin-loss-for-class","title":"TAM: Topology-Aware Margin Loss for Class-Imbalanced Node Classification","date":"2022-06-26","arxiv_id":"2206.12917","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/tam-topology-aware-margin-loss-for-class#ran","syntology_url":"https://syntology.ai/paper/2206.12917","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.12917"}},"official":{"repos":["Jaeyun-Song/TAM"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/structural-entropy-guided-graph-hierarchical","slug":"structural-entropy-guided-graph-hierarchical","title":"Structural Entropy Guided Graph Hierarchical Pooling","date":"2022-06-26","arxiv_id":"2206.13510","repositories_listed":1,"syntology":{"n":9,"n_ran":8,"n_constructed":0,"n_ran_checked":4,"n_instrument":4,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":3,"n_pointer_only":4,"phrase":"8 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; 4 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/structural-entropy-guided-graph-hierarchical#ran","syntology_url":"https://syntology.ai/paper/2206.13510","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.13510"}},"official":{"repos":["wu-junran/sep"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/task-adaptive-few-shot-node-classification","slug":"task-adaptive-few-shot-node-classification","title":"Task-Adaptive Few-shot Node Classification","date":"2022-06-23","arxiv_id":"2206.11972","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":1,"n_violates":1,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 1 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/task-adaptive-few-shot-node-classification#ran","syntology_url":"https://syntology.ai/paper/2206.11972","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.11972"}},"official":{"repos":["songw-sw/tent"],"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","unlocated"]}}},{"url":"/paper/graph-neural-networks-as-gradient-flows","slug":"graph-neural-networks-as-gradient-flows","title":"Understanding convolution on graphs via energies","date":"2022-06-22","arxiv_id":"2206.10991","repositories_listed":2,"syntology":{"n":9,"n_ran":6,"n_constructed":0,"n_ran_checked":4,"n_instrument":2,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":3,"phrase":"6 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; 2 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/graph-neural-networks-as-gradient-flows#ran","syntology_url":"https://syntology.ai/paper/2206.10991","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.10991"}},"official":{"repos":["jrowbottomgit/graff"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/graphframex-towards-systematic-evaluation-of","slug":"graphframex-towards-systematic-evaluation-of","title":"GraphFramEx: Towards Systematic Evaluation of Explainability Methods for Graph Neural Networks","date":"2022-06-20","arxiv_id":"2206.09677","repositories_listed":1,"syntology":{"n":8,"n_ran":8,"n_constructed":0,"n_ran_checked":4,"n_instrument":4,"n_unverified":0,"n_honours":4,"n_violates":0,"n_no_contract":0,"n_pointer_only":7,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 4 honoured, 0 violated, 0 with no contract checked; 4 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/graphframex-towards-systematic-evaluation-of#ran","syntology_url":"https://syntology.ai/paper/2206.09677","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.09677"}},"official":{"repos":["graphframex/graphframex"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["community","official"]}}},{"url":"/paper/beyond-real-world-benchmark-datasets-an","slug":"beyond-real-world-benchmark-datasets-an","title":"Beyond Real-world Benchmark Datasets: An Empirical Study of Node Classification with GNNs","date":"2022-06-18","arxiv_id":"2206.09144","repositories_listed":1,"syntology":{"n":8,"n_ran":7,"n_constructed":0,"n_ran_checked":4,"n_instrument":3,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":1,"phrase":"7 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; 3 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/beyond-real-world-benchmark-datasets-an#ran","syntology_url":"https://syntology.ai/paper/2206.09144","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.09144"}},"official":{"repos":["seijimaekawa/empirical-study-of-gnns"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/acmp-allen-cahn-message-passing-for-graph","slug":"acmp-allen-cahn-message-passing-for-graph","title":"ACMP: Allen-Cahn Message Passing for Graph Neural Networks with Particle Phase Transition","date":"2022-06-11","arxiv_id":"2206.05437","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/acmp-allen-cahn-message-passing-for-graph#ran","syntology_url":"https://syntology.ai/paper/2206.05437","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.05437"}},"official":{"repos":["ykiiiiii/acmp"],"state":"official: no sample here; runs from other or unrecorded repositories","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["unlocated"]}}},{"url":"/paper/nagphormer-neighborhood-aggregation-graph","slug":"nagphormer-neighborhood-aggregation-graph","title":"NAGphormer: A Tokenized Graph Transformer for Node Classification in Large Graphs","date":"2022-06-10","arxiv_id":"2206.04910","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":1,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"2 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/nagphormer-neighborhood-aggregation-graph#ran","syntology_url":"https://syntology.ai/paper/2206.04910","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.04910"}},"official":{"repos":["jhl-hust/nagphormer"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/pseudo-poincare-a-unification-framework-for","slug":"pseudo-poincare-a-unification-framework-for","title":"A Unification Framework for Euclidean and Hyperbolic Graph Neural Networks","date":"2022-06-09","arxiv_id":"2206.04285","repositories_listed":1,"syntology":{"n":12,"n_ran":10,"n_constructed":0,"n_ran_checked":10,"n_instrument":0,"n_unverified":2,"n_honours":2,"n_violates":1,"n_no_contract":7,"n_pointer_only":4,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 2 honoured, 1 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/pseudo-poincare-a-unification-framework-for#ran","syntology_url":"https://syntology.ai/paper/2206.04285","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.04285"}},"official":{"repos":["oom-debugger/ijcai23"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/geometer-graph-few-shot-class-incremental","slug":"geometer-graph-few-shot-class-incremental","title":"Geometer: Graph Few-Shot Class-Incremental Learning via Prototype Representation","date":"2022-05-27","arxiv_id":"2205.13954","repositories_listed":1,"syntology":{"n":6,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/geometer-graph-few-shot-class-incremental#ran","syntology_url":"https://syntology.ai/paper/2205.13954","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.13954"}},"official":{"repos":["RobinLu1209/Geometer"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/recipe-for-a-general-powerful-scalable-graph","slug":"recipe-for-a-general-powerful-scalable-graph","title":"Recipe for a General, Powerful, Scalable Graph Transformer","date":"2022-05-25","arxiv_id":"2205.12454","repositories_listed":4,"syntology":{"n":21,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":18,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"3 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; 2 where Syntology's instrument failed) · 18 unverified","sample_list":"/paper/recipe-for-a-general-powerful-scalable-graph#ran","syntology_url":"https://syntology.ai/paper/2205.12454","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.12454"}},"official":{"repos":["rampasek/GraphGPS"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/graphmae-self-supervised-masked-graph","slug":"graphmae-self-supervised-masked-graph","title":"GraphMAE: Self-Supervised Masked Graph Autoencoders","date":"2022-05-22","arxiv_id":"2205.10803","repositories_listed":3,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"2 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; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/graphmae-self-supervised-masked-graph#ran","syntology_url":"https://syntology.ai/paper/2205.10803","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.10803"}},"official":{"repos":["thudm/graphmae"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/maskgae-masked-graph-modeling-meets-graph","slug":"maskgae-masked-graph-modeling-meets-graph","title":"What's Behind the Mask: Understanding Masked Graph Modeling for Graph Autoencoders","date":"2022-05-20","arxiv_id":"2205.10053","repositories_listed":2,"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/maskgae-masked-graph-modeling-meets-graph#ran","syntology_url":"https://syntology.ai/paper/2205.10053","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.10053"}},"official":{"repos":["edisonleeeee/maskgae","pyg-team/pytorch_geometric"],"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/heterformer-a-transformer-architecture-for","slug":"heterformer-a-transformer-architecture-for","title":"Heterformer: Transformer-based Deep Node Representation Learning on Heterogeneous Text-Rich Networks","date":"2022-05-20","arxiv_id":"2205.10282","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/heterformer-a-transformer-architecture-for#ran","syntology_url":"https://syntology.ai/paper/2205.10282","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.10282"}},"official":{"repos":["petergriffinjin/heterformer"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/a-simple-yet-effective-svd-gcn-for-directed","slug":"a-simple-yet-effective-svd-gcn-for-directed","title":"A Simple Yet Effective SVD-GCN for Directed Graphs","date":"2022-05-19","arxiv_id":"2205.09335","repositories_listed":1,"syntology":{"n":6,"n_ran":5,"n_constructed":0,"n_ran_checked":0,"n_instrument":5,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":6,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 5 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/a-simple-yet-effective-svd-gcn-for-directed#ran","syntology_url":"https://syntology.ai/paper/2205.09335","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.09335"}},"official":{"repos":["thisisforreview/svd-gcn"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/lpgnet-link-private-graph-networks-for-node","slug":"lpgnet-link-private-graph-networks-for-node","title":"LPGNet: Link Private Graph Networks for Node Classification","date":"2022-05-06","arxiv_id":"2205.03105","repositories_listed":1,"syntology":{"n":12,"n_ran":10,"n_constructed":0,"n_ran_checked":10,"n_instrument":0,"n_unverified":2,"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) · 2 unverified","sample_list":"/paper/lpgnet-link-private-graph-networks-for-node#ran","syntology_url":"https://syntology.ai/paper/2205.03105","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.03105"}},"official":{"repos":["ashgeek/lpgnet-prototype"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/rosa-a-robust-self-aligned-framework-for-node","slug":"rosa-a-robust-self-aligned-framework-for-node","title":"RoSA: A Robust Self-Aligned Framework for Node-Node Graph Contrastive Learning","date":"2022-04-29","arxiv_id":"2204.13846","repositories_listed":1,"syntology":{"n":6,"n_ran":2,"n_constructed":1,"n_ran_checked":1,"n_instrument":1,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":6,"phrase":"2 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/rosa-a-robust-self-aligned-framework-for-node#ran","syntology_url":"https://syntology.ai/paper/2204.13846","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2204.13846"}},"official":{"repos":["zhuyun97/rosa"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/neural-structured-prediction-for-inductive-1","slug":"neural-structured-prediction-for-inductive-1","title":"Neural Structured Prediction for Inductive Node Classification","date":"2022-04-15","arxiv_id":"2204.07524","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/neural-structured-prediction-for-inductive-1#ran","syntology_url":"https://syntology.ai/paper/2204.07524","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2204.07524"}},"official":{"repos":["deepgraphlearning/spn"],"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-ordering-attention-networks","slug":"graph-ordering-attention-networks","title":"Graph Ordering Attention Networks","date":"2022-04-11","arxiv_id":"2204.05351","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":4,"n_instrument":1,"n_unverified":0,"n_honours":1,"n_violates":1,"n_no_contract":2,"n_pointer_only":2,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 1 honoured, 1 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/graph-ordering-attention-networks#ran","syntology_url":"https://syntology.ai/paper/2204.05351","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2204.05351"}},"official":{"repos":["michailchatzianastasis/goat"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/tgl-a-general-framework-for-temporal-gnn","slug":"tgl-a-general-framework-for-temporal-gnn","title":"TGL: A General Framework for Temporal GNN Training on Billion-Scale Graphs","date":"2022-03-28","arxiv_id":"2203.14883","repositories_listed":2,"syntology":{"n":6,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":3,"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) · 3 unverified","sample_list":"/paper/tgl-a-general-framework-for-temporal-gnn#ran","syntology_url":"https://syntology.ai/paper/2203.14883","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.14883"}},"official":{"repos":["amazon-research/tgl"],"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":["listed","official"]}}},{"url":"/paper/gap-differentially-private-graph-neural","slug":"gap-differentially-private-graph-neural","title":"GAP: Differentially Private Graph Neural Networks with Aggregation Perturbation","date":"2022-03-02","arxiv_id":"2203.00949","repositories_listed":1,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":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) · 0 unverified","sample_list":"/paper/gap-differentially-private-graph-neural#ran","syntology_url":"https://syntology.ai/paper/2203.00949","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.00949"}},"official":{"repos":["sisaman/gap"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/hyla-hyperbolic-laplacian-features-for-graph","slug":"hyla-hyperbolic-laplacian-features-for-graph","title":"Random Laplacian Features for Learning with Hyperbolic Space","date":"2022-02-14","arxiv_id":"2202.06854","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":1,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":1,"n_pointer_only":3,"phrase":"3 ran (of which 1 constructed an object rather than computing a result; 3 with no instrument failure: 2 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/hyla-hyperbolic-laplacian-features-for-graph#ran","syntology_url":"https://syntology.ai/paper/2202.06854","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2202.06854"}},"official":{"repos":["ydtydr/hyla"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":1,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/convolutional-neural-networks-on-graphs-with-1","slug":"convolutional-neural-networks-on-graphs-with-1","title":"Convolutional Neural Networks on Graphs with Chebyshev Approximation, Revisited","date":"2022-02-04","arxiv_id":"2202.03580","repositories_listed":1,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/convolutional-neural-networks-on-graphs-with-1#ran","syntology_url":"https://syntology.ai/paper/2202.03580","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2202.03580"}},"official":{"repos":["ivam-he/chebnetii"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/fedgcn-convergence-and-communication","slug":"fedgcn-convergence-and-communication","title":"FedGCN: Convergence-Communication Tradeoffs in Federated Training of Graph Convolutional Networks","date":"2022-01-28","arxiv_id":"2201.12433","repositories_listed":2,"syntology":{"n":19,"n_ran":13,"n_constructed":0,"n_ran_checked":13,"n_instrument":0,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":13,"n_pointer_only":0,"phrase":"13 ran (of which 0 constructed an object rather than computing a result; 13 with no instrument failure: 0 honoured, 0 violated, 13 with no contract checked; 0 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/fedgcn-convergence-and-communication#ran","syntology_url":"https://syntology.ai/paper/2201.12433","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2201.12433"}},"official":{"repos":["yh-yao/FedGCN"],"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":["listed","official"]}}},{"url":"/paper/decoupling-the-depth-and-scope-of-graph-1","slug":"decoupling-the-depth-and-scope-of-graph-1","title":"Decoupling the Depth and Scope of Graph Neural Networks","date":"2022-01-19","arxiv_id":"2201.07858","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/decoupling-the-depth-and-scope-of-graph-1#ran","syntology_url":"https://syntology.ai/paper/2201.07858","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2201.07858"}},"official":{"repos":["facebookresearch/shaDow_GNN"],"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/towards-unsupervised-deep-graph-structure","slug":"towards-unsupervised-deep-graph-structure","title":"Towards Unsupervised Deep Graph Structure Learning","date":"2022-01-17","arxiv_id":"2201.06367","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":4,"n_instrument":1,"n_unverified":0,"n_honours":1,"n_violates":1,"n_no_contract":2,"n_pointer_only":4,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 1 honoured, 1 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/towards-unsupervised-deep-graph-structure#ran","syntology_url":"https://syntology.ai/paper/2201.06367","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2201.06367"}},"official":{"repos":["grand-lab/sublime"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/deformable-graph-convolutional-networks","slug":"deformable-graph-convolutional-networks","title":"Deformable Graph Convolutional Networks","date":"2021-12-29","arxiv_id":"2112.14438","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":2,"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) · 0 unverified","sample_list":"/paper/deformable-graph-convolutional-networks#ran","syntology_url":"https://syntology.ai/paper/2112.14438","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2112.14438"}},"official":{"repos":["mlvlab/DeformableGCN"],"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":["official"]}}},{"url":"/paper/skipnode-on-alleviating-over-smoothing-for","slug":"skipnode-on-alleviating-over-smoothing-for","title":"SkipNode: On Alleviating Performance Degradation for Deep Graph Convolutional Networks","date":"2021-12-22","arxiv_id":"2112.11628","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/skipnode-on-alleviating-over-smoothing-for#ran","syntology_url":"https://syntology.ai/paper/2112.11628","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2112.11628"}},"official":{"repos":["weiganglu/skipnode"],"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-convolutional-networks-with-dual","slug":"graph-convolutional-networks-with-dual","title":"Graph Convolutional Networks with Dual Message Passing for Subgraph Isomorphism Counting and Matching","date":"2021-12-16","arxiv_id":"2112.08764","repositories_listed":1,"syntology":{"n":8,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":0,"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) · 0 unverified","sample_list":"/paper/graph-convolutional-networks-with-dual#ran","syntology_url":"https://syntology.ai/paper/2112.08764","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2112.08764"}},"official":{"repos":["hkust-knowcomp/dualmessagepassing"],"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/improving-the-training-of-graph-neural","slug":"improving-the-training-of-graph-neural","title":"SCR: Training Graph Neural Networks with Consistency Regularization","date":"2021-12-08","arxiv_id":"2112.04319","repositories_listed":4,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/improving-the-training-of-graph-neural#ran","syntology_url":"https://syntology.ai/paper/2112.04319","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2112.04319"}},"official":{"repos":["thudm/crgnn","thudm/scr"],"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","unlocated"]}}},{"url":"/paper/source-free-unsupervised-graph-domain","slug":"source-free-unsupervised-graph-domain","title":"Source Free Unsupervised Graph Domain Adaptation","date":"2021-12-02","arxiv_id":"2112.00955","repositories_listed":1,"syntology":{"n":9,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":3,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/source-free-unsupervised-graph-domain#ran","syntology_url":"https://syntology.ai/paper/2112.00955","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2112.00955"}},"official":{"repos":["haitaomao/soga"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/understanding-over-squashing-and-bottlenecks-1","slug":"understanding-over-squashing-and-bottlenecks-1","title":"Understanding over-squashing and bottlenecks on graphs via curvature","date":"2021-11-29","arxiv_id":"2111.14522","repositories_listed":4,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/understanding-over-squashing-and-bottlenecks-1#ran","syntology_url":"https://syntology.ai/paper/2111.14522","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2111.14522"}},"official":{"repos":["jctops/understanding-oversquashing"],"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/on-the-unreasonable-effectiveness-of-feature-1","slug":"on-the-unreasonable-effectiveness-of-feature-1","title":"On the Unreasonable Effectiveness of Feature propagation in Learning on Graphs with Missing Node Features","date":"2021-11-23","arxiv_id":"2111.12128","repositories_listed":1,"syntology":{"n":14,"n_ran":12,"n_constructed":0,"n_ran_checked":12,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":12,"n_pointer_only":4,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 12 with no instrument failure: 0 honoured, 0 violated, 12 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/on-the-unreasonable-effectiveness-of-feature-1#ran","syntology_url":"https://syntology.ai/paper/2111.12128","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2111.12128"}},"official":{"repos":["twitter-research/feature-propagation"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":0,"n_ran_no_instrument_failure":12,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/p-laplacian-based-graph-neural-networks-1","slug":"p-laplacian-based-graph-neural-networks-1","title":"$p$-Laplacian Based Graph Neural Networks","date":"2021-11-14","arxiv_id":"2111.07337","repositories_listed":2,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":3,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":1,"phrase":"4 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; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/p-laplacian-based-graph-neural-networks-1#ran","syntology_url":"https://syntology.ai/paper/2111.07337","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2111.07337"}},"official":{"repos":["guoji-fu/pgnns"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/cold-brew-distilling-graph-node-1","slug":"cold-brew-distilling-graph-node-1","title":"Cold Brew: Distilling Graph Node Representations with Incomplete or Missing Neighborhoods","date":"2021-11-08","arxiv_id":"2111.04840","repositories_listed":2,"syntology":{"n":16,"n_ran":14,"n_constructed":0,"n_ran_checked":14,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":14,"n_pointer_only":0,"phrase":"14 ran (of which 0 constructed an object rather than computing a result; 14 with no instrument failure: 0 honoured, 0 violated, 14 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/cold-brew-distilling-graph-node-1#ran","syntology_url":"https://syntology.ai/paper/2111.04840","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2111.04840"}},"official":{"repos":["amazon-research/gnn-tail-generalization"],"state":"official (archive's flag): 14 ran","n_ran":14,"n_constructed":0,"n_ran_no_instrument_failure":14,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/topological-relational-learning-on-graphs","slug":"topological-relational-learning-on-graphs","title":"Topological Relational Learning on Graphs","date":"2021-10-29","arxiv_id":"2110.15529","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/topological-relational-learning-on-graphs#ran","syntology_url":"https://syntology.ai/paper/2110.15529","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.15529"}},"official":{"repos":["tri-gnn/tri-gnn"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/large-scale-learning-on-non-homophilous","slug":"large-scale-learning-on-non-homophilous","title":"Large Scale Learning on Non-Homophilous Graphs: New Benchmarks and Strong Simple Methods","date":"2021-10-27","arxiv_id":"2110.14446","repositories_listed":5,"syntology":{"n":21,"n_ran":15,"n_constructed":5,"n_ran_checked":15,"n_instrument":0,"n_unverified":6,"n_honours":1,"n_violates":0,"n_no_contract":14,"n_pointer_only":11,"phrase":"15 ran (of which 5 constructed an object rather than computing a result; 15 with no instrument failure: 1 honoured, 0 violated, 14 with no contract checked; 0 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/large-scale-learning-on-non-homophilous#ran","syntology_url":"https://syntology.ai/paper/2110.14446","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.14446"}},"official":{"repos":["cuai/non-homophily-large-scale"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/graph-posterior-network-bayesian-predictive","slug":"graph-posterior-network-bayesian-predictive","title":"Graph Posterior Network: Bayesian Predictive Uncertainty for Node Classification","date":"2021-10-26","arxiv_id":"2110.14012","repositories_listed":2,"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/graph-posterior-network-bayesian-predictive#ran","syntology_url":"https://syntology.ai/paper/2110.14012","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.14012"}},"official":{"repos":["stadlmax/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/graph-less-neural-networks-teaching-old-mlps-1","slug":"graph-less-neural-networks-teaching-old-mlps-1","title":"Graph-less Neural Networks: Teaching Old MLPs New Tricks via Distillation","date":"2021-10-17","arxiv_id":"2110.08727","repositories_listed":1,"syntology":{"n":8,"n_ran":7,"n_constructed":0,"n_ran_checked":6,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":1,"n_no_contract":5,"n_pointer_only":8,"phrase":"7 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; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/graph-less-neural-networks-teaching-old-mlps-1#ran","syntology_url":"https://syntology.ai/paper/2110.08727","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.08727"}},"official":{"repos":["snap-research/graphless-neural-networks"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/topology-imbalance-learning-for-semi","slug":"topology-imbalance-learning-for-semi","title":"Topology-Imbalance Learning for Semi-Supervised Node Classification","date":"2021-10-08","arxiv_id":"2110.04099","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":1,"n_ran_checked":1,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"3 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/topology-imbalance-learning-for-semi#ran","syntology_url":"https://syntology.ai/paper/2110.04099","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.04099"}},"official":{"repos":["victorchen96/renode"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/node-feature-kernels-increase-graph","slug":"node-feature-kernels-increase-graph","title":"Node Feature Kernels Increase Graph Convolutional Network Robustness","date":"2021-09-04","arxiv_id":"2109.01785","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/node-feature-kernels-increase-graph#ran","syntology_url":"https://syntology.ai/paper/2109.01785","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2109.01785"}},"official":{"repos":["changminwu/robustgcn"],"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/an-empirical-study-of-graph-contrastive","slug":"an-empirical-study-of-graph-contrastive","title":"An Empirical Study of Graph Contrastive Learning","date":"2021-09-02","arxiv_id":"2109.01116","repositories_listed":3,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/an-empirical-study-of-graph-contrastive#ran","syntology_url":"https://syntology.ai/paper/2109.01116","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2109.01116"}},"official":{"repos":["GraphCL/PyGCL"],"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":["listed","official"]}}},{"url":"/paper/edge-augmented-graph-transformers-global-self","slug":"edge-augmented-graph-transformers-global-self","title":"Global Self-Attention as a Replacement for Graph Convolution","date":"2021-08-07","arxiv_id":"2108.03348","repositories_listed":3,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/edge-augmented-graph-transformers-global-self#ran","syntology_url":"https://syntology.ai/paper/2108.03348","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2108.03348"}},"official":{"repos":["shamim-hussain/egt","shamim-hussain/egt_pytorch","shamim-hussain/egt_triangular"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/asymptotics-of-network-embeddings-learned-via","slug":"asymptotics-of-network-embeddings-learned-via","title":"Asymptotics of Network Embeddings Learned via Subsampling","date":"2021-07-06","arxiv_id":"2107.02363","repositories_listed":2,"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":0,"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/asymptotics-of-network-embeddings-learned-via#ran","syntology_url":"https://syntology.ai/paper/2107.02363","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2107.02363"}},"official":{"repos":["aday651/embed-asym-exeriments","aday651/embed-asym-experiments"],"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/nodepiece-compositional-and-parameter","slug":"nodepiece-compositional-and-parameter","title":"NodePiece: Compositional and Parameter-Efficient Representations of Large Knowledge Graphs","date":"2021-06-23","arxiv_id":"2106.12144","repositories_listed":4,"syntology":{"n":7,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/nodepiece-compositional-and-parameter#ran","syntology_url":"https://syntology.ai/paper/2106.12144","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.12144"}},"official":{"repos":["migalkin/NodePiece"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["listed"]}}},{"url":"/paper/breaking-the-limit-of-graph-neural-networks","slug":"breaking-the-limit-of-graph-neural-networks","title":"Breaking the Limit of Graph Neural Networks by Improving the Assortativity of Graphs with Local Mixing Patterns","date":"2021-06-11","arxiv_id":"2106.06586","repositories_listed":1,"syntology":{"n":12,"n_ran":6,"n_constructed":0,"n_ran_checked":5,"n_instrument":1,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 1 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/breaking-the-limit-of-graph-neural-networks#ran","syntology_url":"https://syntology.ai/paper/2106.06586","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.06586"}},"official":{"repos":["susheels/gnns-and-local-assortativity"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":6,"ran_from_kinds":["official"]}}},{"url":"/paper/symmetric-spaces-for-graph-embeddings-a","slug":"symmetric-spaces-for-graph-embeddings-a","title":"Symmetric Spaces for Graph Embeddings: A Finsler-Riemannian Approach","date":"2021-06-09","arxiv_id":"2106.04941","repositories_listed":2,"syntology":{"n":8,"n_ran":5,"n_constructed":3,"n_ran_checked":5,"n_instrument":0,"n_unverified":3,"n_honours":1,"n_violates":1,"n_no_contract":3,"n_pointer_only":8,"phrase":"5 ran (of which 3 constructed an object rather than computing a result; 5 with no instrument failure: 1 honoured, 1 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/symmetric-spaces-for-graph-embeddings-a#ran","syntology_url":"https://syntology.ai/paper/2106.04941","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.04941"}},"official":{"repos":["fedelopez77/sympa"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/semi-riemannian-graph-convolutional-networks","slug":"semi-riemannian-graph-convolutional-networks","title":"Pseudo-Riemannian Graph Convolutional Networks","date":"2021-06-06","arxiv_id":"2106.03134","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":1,"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/semi-riemannian-graph-convolutional-networks#ran","syntology_url":"https://syntology.ai/paper/2106.03134","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.03134"}},"official":{"repos":["xiongbo010/qgcn"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]}}}],"record_sha256":"8de9a5d5a45e0e1ba33173eafa3678bdf3a09e43529b597254729650042510e9","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}