{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/task/graph-classification/papers/3","list_of":"/task/graph-classification","task":"Graph 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":"archive","order_definition":"repositories listed in the archive (most first), then date (newest first), then slug","page":3,"pages_in_order":10,"rows_per_page":100,"rows":[201,300],"of":927,"counts":{"archive_papers_tagged":927,"with_a_code_link":483,"where_syntology_ran_a_sample":174,"not_listed_spam_title":0,"listed":927,"listed_where_code_ran":174,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":150,"every_run_a_failure_of_syntologys_instrument":24,"listed_with_a_run_with_no_instrument_failure":150,"listed_every_run_a_failure_of_syntologys_instrument":24,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"first_page":"/task/graph-classification","prev":"/task/graph-classification/papers/2","next":"/task/graph-classification/papers/4","papers":[{"url":"/paper/fine-tuning-graph-neural-networks-by","slug":"fine-tuning-graph-neural-networks-by","title":"Fine-tuning Graph Neural Networks by Preserving Graph Generative Patterns","date":"2023-12-21","arxiv_id":"2312.13583","repositories_listed":1,"syntology":{"n":13,"n_ran":13,"n_constructed":0,"n_ran_checked":12,"n_instrument":1,"n_unverified":0,"n_honours":2,"n_violates":1,"n_no_contract":9,"n_pointer_only":13,"phrase":"13 ran (of which 0 constructed an object rather than computing a result; 12 with no instrument failure: 2 honoured, 1 violated, 9 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/fine-tuning-graph-neural-networks-by#ran","syntology_url":"https://syntology.ai/paper/2312.13583","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2312.13583"}},"official":{"repos":["zjunet/G-Tuning"],"state":"official (archive's flag): 13 ran","n_ran":13,"n_constructed":0,"n_ran_no_instrument_failure":12,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/lightgcn-evaluated-and-enhanced","slug":"lightgcn-evaluated-and-enhanced","title":"LightGCN: Evaluated and Enhanced","date":"2023-12-17","arxiv_id":"2312.16183","repositories_listed":1,"syntology":null},{"url":"/paper/improving-subgraph-gnns-via-edge-level-ego","slug":"improving-subgraph-gnns-via-edge-level-ego","title":"Improving Subgraph-GNNs via Edge-Level Ego-Network Encodings","date":"2023-12-10","arxiv_id":"2312.05905","repositories_listed":1,"syntology":null},{"url":"/paper/on-the-initialization-of-graph-neural","slug":"on-the-initialization-of-graph-neural","title":"On the Initialization of Graph Neural Networks","date":"2023-12-05","arxiv_id":"2312.02622","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":2,"n_instrument":3,"n_unverified":0,"n_honours":1,"n_violates":1,"n_no_contract":0,"n_pointer_only":5,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 1 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/on-the-initialization-of-graph-neural#ran","syntology_url":"https://syntology.ai/paper/2312.02622","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2312.02622"}},"official":{"repos":["lspongebobjh/virgo_icml2023"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/recurrent-distance-encoding-neural-networks","slug":"recurrent-distance-encoding-neural-networks","title":"Recurrent Distance Filtering for Graph Representation Learning","date":"2023-12-03","arxiv_id":"2312.01538","repositories_listed":1,"syntology":{"n":21,"n_ran":12,"n_constructed":2,"n_ran_checked":9,"n_instrument":3,"n_unverified":9,"n_honours":0,"n_violates":1,"n_no_contract":8,"n_pointer_only":21,"phrase":"12 ran (of which 2 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 1 violated, 8 with no contract checked; 3 where Syntology's instrument failed) · 9 unverified","sample_list":"/paper/recurrent-distance-encoding-neural-networks#ran","syntology_url":"https://syntology.ai/paper/2312.01538","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2312.01538"}},"official":{"repos":["skeletondyh/gred"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":2,"n_ran_no_instrument_failure":9,"n_unverified":9,"ran_from_kinds":["official"]}}},{"url":"/paper/hard-label-black-box-node-injection-attack-on","slug":"hard-label-black-box-node-injection-attack-on","title":"Hard Label Black Box Node Injection Attack on Graph Neural Networks","date":"2023-11-22","arxiv_id":"2311.13244","repositories_listed":1,"syntology":null},{"url":"/paper/architecture-matters-uncovering-implicit-1","slug":"architecture-matters-uncovering-implicit-1","title":"Architecture Matters: Uncovering Implicit Mechanisms in Graph Contrastive Learning","date":"2023-11-05","arxiv_id":"2311.02687","repositories_listed":1,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":1,"n_instrument":5,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 5 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/architecture-matters-uncovering-implicit-1#ran","syntology_url":"https://syntology.ai/paper/2311.02687","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2311.02687"}},"official":{"repos":["pku-ml/architecturemattersgcl"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/enhancing-graph-neural-networks-with","slug":"enhancing-graph-neural-networks-with","title":"PSP: Pre-Training and Structure Prompt Tuning for Graph Neural Networks","date":"2023-10-26","arxiv_id":"2310.17394","repositories_listed":1,"syntology":{"n":8,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":7,"n_pointer_only":8,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 1 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/enhancing-graph-neural-networks-with#ran","syntology_url":"https://syntology.ai/paper/2310.17394","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.17394"}},"official":{"repos":["gqq1210/psp"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/mirage-model-agnostic-graph-distillation-for","slug":"mirage-model-agnostic-graph-distillation-for","title":"Mirage: Model-Agnostic Graph Distillation for Graph Classification","date":"2023-10-14","arxiv_id":"2310.09486","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/mirage-model-agnostic-graph-distillation-for#ran","syntology_url":"https://syntology.ai/paper/2310.09486","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.09486"}},"official":{"repos":["idea-iitd/mirage"],"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/enhanced-graph-neural-networks-with-ego","slug":"enhanced-graph-neural-networks-with-ego","title":"Enhanced Graph Neural Networks with Ego-Centric Spectral Subgraph Embeddings Augmentation","date":"2023-10-10","arxiv_id":"2310.12169","repositories_listed":1,"syntology":null},{"url":"/paper/one-for-all-towards-training-one-graph-model","slug":"one-for-all-towards-training-one-graph-model","title":"One for All: Towards Training One Graph Model for All Classification Tasks","date":"2023-09-29","arxiv_id":"2310.00149","repositories_listed":1,"syntology":{"n":18,"n_ran":9,"n_constructed":0,"n_ran_checked":7,"n_instrument":2,"n_unverified":9,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":5,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 2 where Syntology's instrument failed) · 9 unverified","sample_list":"/paper/one-for-all-towards-training-one-graph-model#ran","syntology_url":"https://syntology.ai/paper/2310.00149","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.00149"}},"official":{"repos":["lechengkong/oneforall"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":9,"ran_from_kinds":["official"]}}},{"url":"/paper/graph-level-representation-learning-with","slug":"graph-level-representation-learning-with","title":"Graph-level Representation Learning with Joint-Embedding Predictive Architectures","date":"2023-09-27","arxiv_id":"2309.16014","repositories_listed":1,"syntology":{"n":11,"n_ran":10,"n_constructed":0,"n_ran_checked":9,"n_instrument":1,"n_unverified":1,"n_honours":2,"n_violates":0,"n_no_contract":7,"n_pointer_only":4,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 2 honoured, 0 violated, 7 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/graph-level-representation-learning-with#ran","syntology_url":"https://syntology.ai/paper/2309.16014","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2309.16014"}},"official":{"repos":["geriskenderi/graph-jepa"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/graph-neural-networks-use-graphs-when-they","slug":"graph-neural-networks-use-graphs-when-they","title":"Graph Neural Networks Use Graphs When They Shouldn't","date":"2023-09-08","arxiv_id":"2309.04332","repositories_listed":1,"syntology":null},{"url":"/paper/filtration-surfaces-for-dynamic-graph","slug":"filtration-surfaces-for-dynamic-graph","title":"Filtration Surfaces for Dynamic Graph Classification","date":"2023-09-07","arxiv_id":"2309.03616","repositories_listed":1,"syntology":null},{"url":"/paper/generalized-simplicial-attention-neural","slug":"generalized-simplicial-attention-neural","title":"Generalized Simplicial Attention Neural Networks","date":"2023-09-05","arxiv_id":"2309.02138","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":6,"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/generalized-simplicial-attention-neural#ran","syntology_url":"https://syntology.ai/paper/2309.02138","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2309.02138"}},"official":{"repos":["luciatesta97/generalized-simplicial-attention-neural-networks"],"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/curvature-based-pooling-within-graph-neural","slug":"curvature-based-pooling-within-graph-neural","title":"Curvature-based Pooling within Graph Neural Networks","date":"2023-08-31","arxiv_id":"2308.16516","repositories_listed":1,"syntology":null},{"url":"/paper/self-pruning-graph-neural-network-for","slug":"self-pruning-graph-neural-network-for","title":"Self-pruning Graph Neural Network for Predicting Inflammatory Disease Activity in Multiple Sclerosis from Brain MR Images","date":"2023-08-31","arxiv_id":"2308.16863","repositories_listed":1,"syntology":null},{"url":"/paper/can-transformer-and-gnn-help-each-other","slug":"can-transformer-and-gnn-help-each-other","title":"TransGNN: Harnessing the Collaborative Power of Transformers and Graph Neural Networks for Recommender Systems","date":"2023-08-28","arxiv_id":"2308.14355","repositories_listed":1,"syntology":null},{"url":"/paper/graph-isomorphism-unet","slug":"graph-isomorphism-unet","title":"Graph isomorphism UNet","date":"2023-08-23","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/transformers-for-capturing-multi-level-graph","slug":"transformers-for-capturing-multi-level-graph","title":"Enhancing Graph Transformers with Hierarchical Distance Structural Encoding","date":"2023-08-22","arxiv_id":"2308.11129","repositories_listed":1,"syntology":{"n":1,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 1 unverified","sample_list":"/paper/transformers-for-capturing-multi-level-graph#ran","syntology_url":"https://syntology.ai/paper/2308.11129","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.11129"}},"official":{"repos":["luoyk1999/hdse"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]}}},{"url":"/paper/modeling-edge-features-with-deep-bayesian","slug":"modeling-edge-features-with-deep-bayesian","title":"Modeling Edge Features with Deep Bayesian Graph Networks","date":"2023-08-17","arxiv_id":"2308.09087","repositories_listed":1,"syntology":null},{"url":"/paper/s-mixup-structural-mixup-for-graph-neural","slug":"s-mixup-structural-mixup-for-graph-neural","title":"S-Mixup: Structural Mixup for Graph Neural Networks","date":"2023-08-16","arxiv_id":"2308.08097","repositories_listed":1,"syntology":null},{"url":"/paper/implicit-graph-neural-diffusion-based-on","slug":"implicit-graph-neural-diffusion-based-on","title":"Implicit Graph Neural Diffusion Networks: Convergence, Generalization, and Over-Smoothing","date":"2023-08-07","arxiv_id":"2308.03306","repositories_listed":1,"syntology":{"n":12,"n_ran":12,"n_constructed":0,"n_ran_checked":11,"n_instrument":1,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":10,"n_pointer_only":1,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 1 honoured, 0 violated, 10 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/implicit-graph-neural-diffusion-based-on#ran","syntology_url":"https://syntology.ai/paper/2308.03306","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.03306"}},"official":{"repos":["guoji-fu/dignn"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":0,"n_ran_no_instrument_failure":11,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/evaluating-link-prediction-explanations-for","slug":"evaluating-link-prediction-explanations-for","title":"Evaluating Link Prediction Explanations for Graph Neural Networks","date":"2023-08-03","arxiv_id":"2308.01682","repositories_listed":1,"syntology":null},{"url":"/paper/counterfactual-explanations-for-graph","slug":"counterfactual-explanations-for-graph","title":"Counterfactual Explanations for Graph Classification Through the Lenses of Density","date":"2023-07-27","arxiv_id":"2307.14849","repositories_listed":1,"syntology":null},{"url":"/paper/hypergraph-isomorphism-computation","slug":"hypergraph-isomorphism-computation","title":"Hypergraph Isomorphism Computation","date":"2023-07-26","arxiv_id":"2307.14394","repositories_listed":1,"syntology":null},{"url":"/paper/how-curvature-enhance-the-adaptation-power-of","slug":"how-curvature-enhance-the-adaptation-power-of","title":"How Curvature Enhance the Adaptation Power of Framelet GCNs","date":"2023-07-19","arxiv_id":"2307.09768","repositories_listed":1,"syntology":{"n":5,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":1,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/how-curvature-enhance-the-adaptation-power-of#ran","syntology_url":"https://syntology.ai/paper/2307.09768","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2307.09768"}},"official":{"repos":["dshi3553usyd/curvature_enhanced_graph_convolution"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/interpretable-sparsification-of-brain-graphs","slug":"interpretable-sparsification-of-brain-graphs","title":"Interpretable Sparsification of Brain Graphs: Better Practices and Effective Designs for Graph Neural Networks","date":"2023-06-26","arxiv_id":"2306.14375","repositories_listed":1,"syntology":null},{"url":"/paper/modeling-graphs-beyond-hyperbolic-graph","slug":"modeling-graphs-beyond-hyperbolic-graph","title":"Modeling Graphs Beyond Hyperbolic: Graph Neural Networks in Symmetric Positive Definite Matrices","date":"2023-06-24","arxiv_id":"2306.14064","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/modeling-graphs-beyond-hyperbolic-graph#ran","syntology_url":"https://syntology.ai/paper/2306.14064","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.14064"}},"official":{"repos":["andyweizhao/spd4gnns"],"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/on-exploring-node-feature-and-graph-structure-1","slug":"on-exploring-node-feature-and-graph-structure-1","title":"On Exploring Node-feature and Graph-structure Diversities for Node Drop Graph Pooling","date":"2023-06-22","arxiv_id":"2306.12726","repositories_listed":1,"syntology":null},{"url":"/paper/structure-aware-robustness-certificates-for","slug":"structure-aware-robustness-certificates-for","title":"Structure-Aware Robustness Certificates for Graph Classification","date":"2023-06-20","arxiv_id":"2306.11915","repositories_listed":1,"syntology":null},{"url":"/paper/a-gromov-wasserstein-geometric-view-of","slug":"a-gromov-wasserstein-geometric-view-of","title":"A Gromov--Wasserstein Geometric View of Spectrum-Preserving Graph Coarsening","date":"2023-06-15","arxiv_id":"2306.08854","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/a-gromov-wasserstein-geometric-view-of#ran","syntology_url":"https://syntology.ai/paper/2306.08854","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.08854"}},"official":{"repos":["ychen-stat-ml/gw-graph-coarsening"],"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/analysis-and-approximate-inference-of-large","slug":"analysis-and-approximate-inference-of-large","title":"Analysis and Approximate Inference of Large Random Kronecker Graphs","date":"2023-06-14","arxiv_id":"2306.08489","repositories_listed":1,"syntology":null},{"url":"/paper/graph-mixup-with-soft-alignments","slug":"graph-mixup-with-soft-alignments","title":"Graph Mixup with Soft Alignments","date":"2023-06-11","arxiv_id":"2306.06788","repositories_listed":1,"syntology":null},{"url":"/paper/path-neural-networks-expressive-and-accurate","slug":"path-neural-networks-expressive-and-accurate","title":"Path Neural Networks: Expressive and Accurate Graph Neural Networks","date":"2023-06-09","arxiv_id":"2306.05955","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/path-neural-networks-expressive-and-accurate#ran","syntology_url":"https://syntology.ai/paper/2306.05955","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.05955"}},"official":{"repos":["gasmichel/pathnns_expressive"],"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/cin-enhancing-topological-message-passing","slug":"cin-enhancing-topological-message-passing","title":"CIN++: Enhancing Topological Message Passing","date":"2023-06-06","arxiv_id":"2306.03561","repositories_listed":1,"syntology":null},{"url":"/paper/randomized-schur-complement-views-for-graph","slug":"randomized-schur-complement-views-for-graph","title":"Randomized Schur Complement Views for Graph Contrastive Learning","date":"2023-06-06","arxiv_id":"2306.04004","repositories_listed":1,"syntology":{"n":2,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 2 unverified","sample_list":"/paper/randomized-schur-complement-views-for-graph#ran","syntology_url":"https://syntology.ai/paper/2306.04004","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.04004"}},"official":{"repos":["kvignesh1420/rlap"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":[]}}},{"url":"/paper/learning-probabilistic-symmetrization-for-1","slug":"learning-probabilistic-symmetrization-for-1","title":"Learning Probabilistic Symmetrization for Architecture Agnostic Equivariance","date":"2023-06-05","arxiv_id":"2306.02866","repositories_listed":1,"syntology":{"n":13,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":5,"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) · 5 unverified","sample_list":"/paper/learning-probabilistic-symmetrization-for-1#ran","syntology_url":"https://syntology.ai/paper/2306.02866","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.02866"}},"official":{"repos":["jw9730/lps"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":5,"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/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/sega-structural-entropy-guided-anchor-view","slug":"sega-structural-entropy-guided-anchor-view","title":"SEGA: Structural Entropy Guided Anchor View for Graph Contrastive Learning","date":"2023-05-08","arxiv_id":"2305.04501","repositories_listed":1,"syntology":{"n":9,"n_ran":8,"n_constructed":1,"n_ran_checked":3,"n_instrument":5,"n_unverified":1,"n_honours":2,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"8 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; 5 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/sega-structural-entropy-guided-anchor-view#ran","syntology_url":"https://syntology.ai/paper/2305.04501","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.04501"}},"official":{"repos":["wu-junran/sega"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":1,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/strengthening-structural-baselines-for-graph","slug":"strengthening-structural-baselines-for-graph","title":"Strengthening structural baselines for graph classification using Local Topological Profile","date":"2023-05-01","arxiv_id":"2305.00724","repositories_listed":1,"syntology":null},{"url":"/paper/stochastic-subgraph-neighborhood-pooling-for","slug":"stochastic-subgraph-neighborhood-pooling-for","title":"Stochastic Subgraph Neighborhood Pooling for Subgraph Classification","date":"2023-04-17","arxiv_id":"2304.08556","repositories_listed":1,"syntology":null},{"url":"/paper/graph-toolformer-to-empower-llms-with-graph","slug":"graph-toolformer-to-empower-llms-with-graph","title":"Graph-ToolFormer: To Empower LLMs with Graph Reasoning Ability via Prompt Dataset Augmented by ChatGPT","date":"2023-04-10","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/transformer-and-snowball-graph-convolution","slug":"transformer-and-snowball-graph-convolution","title":"Transformer and Snowball Graph Convolution Learning for Brain functional network Classification","date":"2023-03-28","arxiv_id":"2303.16132","repositories_listed":1,"syntology":null},{"url":"/paper/topological-pooling-on-graphs","slug":"topological-pooling-on-graphs","title":"Topological Pooling on Graphs","date":"2023-03-25","arxiv_id":"2303.14543","repositories_listed":1,"syntology":null},{"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/search-to-capture-long-range-dependency-with","slug":"search-to-capture-long-range-dependency-with","title":"Search to Capture Long-range Dependency with Stacking GNNs for Graph Classification","date":"2023-02-17","arxiv_id":"2302.08671","repositories_listed":1,"syntology":null},{"url":"/paper/unnoticeable-backdoor-attacks-on-graph-neural","slug":"unnoticeable-backdoor-attacks-on-graph-neural","title":"Unnoticeable Backdoor Attacks on Graph Neural Networks","date":"2023-02-11","arxiv_id":"2303.01263","repositories_listed":1,"syntology":null},{"url":"/paper/on-the-connection-between-mpnn-and-graph","slug":"on-the-connection-between-mpnn-and-graph","title":"On the Connection Between MPNN and Graph Transformer","date":"2023-01-27","arxiv_id":"2301.11956","repositories_listed":1,"syntology":null},{"url":"/paper/task-agnostic-graph-neural-network-evaluation","slug":"task-agnostic-graph-neural-network-evaluation","title":"Task-Agnostic Graph Neural Network Evaluation via Adversarial Collaboration","date":"2023-01-27","arxiv_id":"2301.11517","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":1,"n_ran_checked":3,"n_instrument":1,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"4 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; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/task-agnostic-graph-neural-network-evaluation#ran","syntology_url":"https://syntology.ai/paper/2301.11517","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2301.11517"}},"official":{"repos":["victorzxy/graphac"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":1,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/efficiently-predicting-high-resolution-mass","slug":"efficiently-predicting-high-resolution-mass","title":"Efficiently predicting high resolution mass spectra with graph neural networks","date":"2023-01-26","arxiv_id":"2301.11419","repositories_listed":1,"syntology":null},{"url":"/paper/exploring-fake-news-detection-with","slug":"exploring-fake-news-detection-with","title":"Exploring Fake News Detection with Heterogeneous Social Media Context Graphs","date":"2022-12-13","arxiv_id":"2212.06560","repositories_listed":1,"syntology":null},{"url":"/paper/regularized-optimal-transport-layers-for","slug":"regularized-optimal-transport-layers-for","title":"Regularized Optimal Transport Layers for Generalized Global Pooling Operations","date":"2022-12-13","arxiv_id":"2212.06339","repositories_listed":1,"syntology":null},{"url":"/paper/clustering-with-total-variation-graph-neural","slug":"clustering-with-total-variation-graph-neural","title":"Total Variation Graph Neural Networks","date":"2022-11-11","arxiv_id":"2211.06218","repositories_listed":1,"syntology":null},{"url":"/paper/graph-contrastive-learning-with-implicit","slug":"graph-contrastive-learning-with-implicit","title":"Graph Contrastive Learning with Implicit Augmentations","date":"2022-11-07","arxiv_id":"2211.03710","repositories_listed":1,"syntology":null},{"url":"/paper/unlearning-nonlinear-graph-classifiers-in-the","slug":"unlearning-nonlinear-graph-classifiers-in-the","title":"Unlearning Graph Classifiers with Limited Data Resources","date":"2022-11-06","arxiv_id":"2211.03216","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/unlearning-nonlinear-graph-classifiers-in-the#ran","syntology_url":"https://syntology.ai/paper/2211.03216","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2211.03216"}},"official":null}},{"url":"/paper/adversarial-causal-augmentation-for-graph","slug":"adversarial-causal-augmentation-for-graph","title":"Unleashing the Power of Graph Data Augmentation on Covariate Distribution Shift","date":"2022-11-05","arxiv_id":"2211.02843","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/adversarial-causal-augmentation-for-graph#ran","syntology_url":"https://syntology.ai/paper/2211.02843","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2211.02843"}},"official":{"repos":["yongduosui/aia"],"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/page-prototype-based-model-level-explanations","slug":"page-prototype-based-model-level-explanations","title":"PAGE: Prototype-Based Model-Level Explanations for Graph Neural Networks","date":"2022-10-31","arxiv_id":"2210.17159","repositories_listed":1,"syntology":null},{"url":"/paper/graph-fuzzy-system-concepts-models-and","slug":"graph-fuzzy-system-concepts-models-and","title":"Graph Fuzzy System: Concepts, Models and Algorithms","date":"2022-10-30","arxiv_id":"2210.16730","repositories_listed":1,"syntology":null},{"url":"/paper/graphmad-graph-mixup-for-data-augmentation","slug":"graphmad-graph-mixup-for-data-augmentation","title":"GraphMAD: Graph Mixup for Data Augmentation using Data-Driven Convex Clustering","date":"2022-10-27","arxiv_id":"2210.15721","repositories_listed":1,"syntology":null},{"url":"/paper/efficient-automatic-machine-learning-via","slug":"efficient-automatic-machine-learning-via","title":"Efficient Automatic Machine Learning via Design Graphs","date":"2022-10-21","arxiv_id":"2210.12257","repositories_listed":1,"syntology":null},{"url":"/paper/global-counterfactual-explainer-for-graph","slug":"global-counterfactual-explainer-for-graph","title":"Global Counterfactual Explainer for Graph Neural Networks","date":"2022-10-21","arxiv_id":"2210.11695","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/global-counterfactual-explainer-for-graph#ran","syntology_url":"https://syntology.ai/paper/2210.11695","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.11695"}},"official":{"repos":["mertkosan/GCFExplainer"],"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/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/pooling-strategies-for-simplicial","slug":"pooling-strategies-for-simplicial","title":"Pooling Strategies for Simplicial Convolutional Networks","date":"2022-10-11","arxiv_id":"2210.05490","repositories_listed":1,"syntology":null},{"url":"/paper/enhancing-mixup-based-graph-learning-for","slug":"enhancing-mixup-based-graph-learning-for","title":"On the Effectiveness of Hybrid Pooling in Mixup-Based Graph Learning for Language Processing","date":"2022-10-06","arxiv_id":"2210.03123","repositories_listed":1,"syntology":null},{"url":"/paper/expander-graph-propagation","slug":"expander-graph-propagation","title":"Expander Graph Propagation","date":"2022-10-06","arxiv_id":"2210.02997","repositories_listed":1,"syntology":null},{"url":"/paper/geodesic-graph-neural-network-for-efficient","slug":"geodesic-graph-neural-network-for-efficient","title":"Geodesic Graph Neural Network for Efficient Graph Representation Learning","date":"2022-10-06","arxiv_id":"2210.02636","repositories_listed":1,"syntology":{"n":5,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/geodesic-graph-neural-network-for-efficient#ran","syntology_url":"https://syntology.ai/paper/2210.02636","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.02636"}},"official":{"repos":["woodcutter1998/gdgnn"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/tree-mover-s-distance-bridging-graph-metrics","slug":"tree-mover-s-distance-bridging-graph-metrics","title":"Tree Mover's Distance: Bridging Graph Metrics and Stability of Graph Neural Networks","date":"2022-10-04","arxiv_id":"2210.01906","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/tree-mover-s-distance-bridging-graph-metrics#ran","syntology_url":"https://syntology.ai/paper/2210.01906","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.01906"}},"official":{"repos":["chingyaoc/tmd"],"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/debiasing-graph-neural-networks-via-learning","slug":"debiasing-graph-neural-networks-via-learning","title":"Debiasing Graph Neural Networks via Learning Disentangled Causal Substructure","date":"2022-09-28","arxiv_id":"2209.14107","repositories_listed":1,"syntology":null},{"url":"/paper/cell-attention-networks","slug":"cell-attention-networks","title":"Cell Attention Networks","date":"2022-09-16","arxiv_id":"2209.08179","repositories_listed":1,"syntology":{"n":5,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/cell-attention-networks#ran","syntology_url":"https://syntology.ai/paper/2209.08179","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2209.08179"}},"official":{"repos":["lrnzgiusti/can"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/explainability-in-subgraphs-enhanced-graph","slug":"explainability-in-subgraphs-enhanced-graph","title":"Explainability in subgraphs-enhanced Graph Neural Networks","date":"2022-09-16","arxiv_id":"2209.07926","repositories_listed":1,"syntology":null},{"url":"/paper/graph-perceiver-io-a-general-architecture-for","slug":"graph-perceiver-io-a-general-architecture-for","title":"Graph Perceiver IO: A General Architecture for Graph Structured Data","date":"2022-09-14","arxiv_id":"2209.06418","repositories_listed":1,"syntology":null},{"url":"/paper/higher-order-clustering-and-pooling-for-graph","slug":"higher-order-clustering-and-pooling-for-graph","title":"Higher-order Clustering and Pooling for Graph Neural Networks","date":"2022-09-02","arxiv_id":"2209.03473","repositories_listed":1,"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/higher-order-clustering-and-pooling-for-graph#ran","syntology_url":"https://syntology.ai/paper/2209.03473","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2209.03473"}},"official":{"repos":["alexduvalinho/hoscpool"],"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/the-pwlr-graph-representation-a-persistent","slug":"the-pwlr-graph-representation-a-persistent","title":"The PWLR Graph Representation: A Persistent Weisfeiler-Lehman scheme with Random Walks for Graph Classification","date":"2022-08-29","arxiv_id":"2208.13427","repositories_listed":1,"syntology":null},{"url":"/paper/second-order-global-attention-networks-for","slug":"second-order-global-attention-networks-for","title":"Second-Order Global Attention Networks for Graph Classification and Regression","date":"2022-08-27","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/graph-pooling-with-maximum-weight-k","slug":"graph-pooling-with-maximum-weight-k","title":"Generalizing Downsampling from Regular Data to Graphs","date":"2022-08-06","arxiv_id":"2208.03523","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/graph-pooling-with-maximum-weight-k#ran","syntology_url":"https://syntology.ai/paper/2208.03523","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2208.03523"}},"official":{"repos":["flandolfi/k-mis-pool"],"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/sizeshiftreg-a-regularization-method-for","slug":"sizeshiftreg-a-regularization-method-for","title":"SizeShiftReg: a Regularization Method for Improving Size-Generalization in Graph Neural Networks","date":"2022-07-16","arxiv_id":"2207.07888","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":0,"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/sizeshiftreg-a-regularization-method-for#ran","syntology_url":"https://syntology.ai/paper/2207.07888","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2207.07888"}},"official":{"repos":["DavideBuffelli/SizeShiftReg"],"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/graph-property-prediction-on-open-graph","slug":"graph-property-prediction-on-open-graph","title":"Graph Property Prediction on Open Graph Benchmark: A Winning Solution by Graph Neural Architecture Search","date":"2022-07-13","arxiv_id":"2207.06027","repositories_listed":1,"syntology":null},{"url":"/paper/wasserstein-graph-distance-based-on-l-1","slug":"wasserstein-graph-distance-based-on-l-1","title":"Wasserstein Graph Distance Based on $L_1$-Approximated Tree Edit Distance between Weisfeiler-Lehman Subtrees","date":"2022-07-09","arxiv_id":"2207.04216","repositories_listed":1,"syntology":null},{"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/transforming-pagerank-into-an-infinite-depth","slug":"transforming-pagerank-into-an-infinite-depth","title":"Transforming PageRank into an Infinite-Depth Graph Neural Network","date":"2022-07-01","arxiv_id":"2207.00684","repositories_listed":1,"syntology":null},{"url":"/paper/bagel-a-benchmark-for-assessing-graph-neural","slug":"bagel-a-benchmark-for-assessing-graph-neural","title":"BAGEL: A Benchmark for Assessing Graph Neural Network Explanations","date":"2022-06-28","arxiv_id":"2206.13983","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":1,"n_honours":1,"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; 3 with no instrument failure: 1 honoured, 2 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/bagel-a-benchmark-for-assessing-graph-neural#ran","syntology_url":"https://syntology.ai/paper/2206.13983","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.13983"}},"official":{"repos":["mandeep-rathee/bagel-benchmark"],"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/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/agent-based-graph-neural-networks","slug":"agent-based-graph-neural-networks","title":"Agent-based Graph Neural Networks","date":"2022-06-22","arxiv_id":"2206.11010","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/agent-based-graph-neural-networks#ran","syntology_url":"https://syntology.ai/paper/2206.11010","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.11010"}},"official":{"repos":["karolismart/agentnet"],"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/boosting-graph-structure-learning-with-dummy","slug":"boosting-graph-structure-learning-with-dummy","title":"Boosting Graph Structure Learning with Dummy Nodes","date":"2022-06-17","arxiv_id":"2206.08561","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/boosting-graph-structure-learning-with-dummy#ran","syntology_url":"https://syntology.ai/paper/2206.08561","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.08561"}},"official":{"repos":["hkust-knowcomp/dummynode4graphlearning"],"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/neo-gnns-neighborhood-overlap-aware-graph-1","slug":"neo-gnns-neighborhood-overlap-aware-graph-1","title":"Neo-GNNs: Neighborhood Overlap-aware Graph Neural Networks for Link Prediction","date":"2022-06-09","arxiv_id":"2206.04216","repositories_listed":1,"syntology":null},{"url":"/paper/metric-based-few-shot-graph-classification","slug":"metric-based-few-shot-graph-classification","title":"Metric Based Few-Shot Graph Classification","date":"2022-06-08","arxiv_id":"2206.03695","repositories_listed":1,"syntology":null},{"url":"/paper/a-simple-yet-effective-method-for-graph","slug":"a-simple-yet-effective-method-for-graph","title":"A Simple yet Effective Method for Graph Classification","date":"2022-06-06","arxiv_id":"2206.02404","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":2,"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 2 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/a-simple-yet-effective-method-for-graph#ran","syntology_url":"https://syntology.ai/paper/2206.02404","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.02404"}},"official":{"repos":["wu-junran/hierarchicalreporting"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":2,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/approximate-network-motif-mining-via-graph","slug":"approximate-network-motif-mining-via-graph","title":"Approximate Network Motif Mining Via Graph Learning","date":"2022-06-02","arxiv_id":"2206.01008","repositories_listed":1,"syntology":null},{"url":"/paper/graph-kernels-based-on-multi-scale-graph","slug":"graph-kernels-based-on-multi-scale-graph","title":"Multi-scale Wasserstein Shortest-path Graph Kernels for Graph Classification","date":"2022-06-02","arxiv_id":"2206.00979","repositories_listed":1,"syntology":null},{"url":"/paper/shortest-path-networks-for-graph-property","slug":"shortest-path-networks-for-graph-property","title":"Shortest Path Networks for Graph Property Prediction","date":"2022-06-02","arxiv_id":"2206.01003","repositories_listed":1,"syntology":null},{"url":"/paper/automatic-relation-aware-graph-network","slug":"automatic-relation-aware-graph-network","title":"Automatic Relation-aware Graph Network Proliferation","date":"2022-05-31","arxiv_id":"2205.15678","repositories_listed":1,"syntology":null},{"url":"/paper/template-based-graph-neural-network-with","slug":"template-based-graph-neural-network-with","title":"Template based Graph Neural Network with Optimal Transport Distances","date":"2022-05-31","arxiv_id":"2205.15733","repositories_listed":1,"syntology":null},{"url":"/paper/cgmn-a-contrastive-graph-matching-network-for","slug":"cgmn-a-contrastive-graph-matching-network-for","title":"CGMN: A Contrastive Graph Matching Network for Self-Supervised Graph Similarity Learning","date":"2022-05-30","arxiv_id":"2205.15083","repositories_listed":1,"syntology":null},{"url":"/paper/compressing-deep-graph-neural-networks-via","slug":"compressing-deep-graph-neural-networks-via","title":"Compressing Deep Graph Neural Networks via Adversarial Knowledge Distillation","date":"2022-05-24","arxiv_id":"2205.11678","repositories_listed":1,"syntology":null},{"url":"/paper/towards-explanation-for-unsupervised-graph","slug":"towards-explanation-for-unsupervised-graph","title":"Towards Explanation for Unsupervised Graph-Level Representation Learning","date":"2022-05-20","arxiv_id":"2205.09934","repositories_listed":1,"syntology":null},{"url":"/paper/graphhd-efficient-graph-classification-using","slug":"graphhd-efficient-graph-classification-using","title":"GraphHD: Efficient graph classification using hyperdimensional computing","date":"2022-05-16","arxiv_id":"2205.07826","repositories_listed":1,"syntology":null},{"url":"/paper/orthogonal-gromov-wasserstein-discrepancy","slug":"orthogonal-gromov-wasserstein-discrepancy","title":"Orthogonal Gromov-Wasserstein Discrepancy with Efficient Lower Bound","date":"2022-05-12","arxiv_id":"2205.05838","repositories_listed":1,"syntology":null},{"url":"/paper/bandits-for-structure-perturbation-based","slug":"bandits-for-structure-perturbation-based","title":"Bandits for Structure Perturbation-based Black-box Attacks to Graph Neural Networks with Theoretical Guarantees","date":"2022-05-07","arxiv_id":"2205.03546","repositories_listed":1,"syntology":null}],"record_sha256":"fc94ed676ac8101c6851004a465869d080a531142b445d9a401dc542b93b9ba1","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}