{"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/2","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":2,"pages_in_order":10,"rows_per_page":100,"rows":[101,200],"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","next":"/task/graph-classification/papers/3","papers":[{"url":"/paper/dynamic-edge-conditioned-filters-in","slug":"dynamic-edge-conditioned-filters-in","title":"Dynamic Edge-Conditioned Filters in Convolutional Neural Networks on Graphs","date":"2017-04-10","arxiv_id":"1704.02901","repositories_listed":2,"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/dynamic-edge-conditioned-filters-in#ran","syntology_url":"https://syntology.ai/paper/1704.02901","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1704.02901"}},"official":{"repos":["mys007/ecc"],"state":"official: not harvested","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":[]}}},{"url":"/paper/learning-convolutional-neural-networks-for","slug":"learning-convolutional-neural-networks-for","title":"Learning Convolutional Neural Networks for Graphs","date":"2016-05-17","arxiv_id":"1605.05273","repositories_listed":2,"syntology":null},{"url":"/paper/density-aware-walks-for-coordinated-campaign","slug":"density-aware-walks-for-coordinated-campaign","title":"Density-aware Walks for Coordinated Campaign Detection","date":"2025-06-16","arxiv_id":"2506.13912","repositories_listed":1,"syntology":null},{"url":"/paper/positional-encoding-meets-persistent-homology","slug":"positional-encoding-meets-persistent-homology","title":"Positional Encoding meets Persistent Homology on Graphs","date":"2025-06-06","arxiv_id":"2506.05814","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":1,"phrase":"0 ran · 1 unverified","sample_list":"/paper/positional-encoding-meets-persistent-homology#ran","syntology_url":"https://syntology.ai/paper/2506.05814","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2506.05814"}},"official":{"repos":["aalto-quml/pipe"],"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/improving-the-effective-receptive-field-of","slug":"improving-the-effective-receptive-field-of","title":"Improving the Effective Receptive Field of Message-Passing Neural Networks","date":"2025-05-29","arxiv_id":"2505.23185","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/improving-the-effective-receptive-field-of#ran","syntology_url":"https://syntology.ai/paper/2505.23185","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2505.23185"}},"official":{"repos":["bgu-cs-vil/im-mpnn"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/graph-style-transfer-for-counterfactual","slug":"graph-style-transfer-for-counterfactual","title":"Graph Style Transfer for Counterfactual Explainability","date":"2025-05-23","arxiv_id":"2505.17542","repositories_listed":1,"syntology":null},{"url":"/paper/scalable-graph-generative-modeling-via","slug":"scalable-graph-generative-modeling-via","title":"Scalable Graph Generative Modeling via Substructure Sequences","date":"2025-05-22","arxiv_id":"2505.16130","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/scalable-graph-generative-modeling-via#ran","syntology_url":"https://syntology.ai/paper/2505.16130","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2505.16130"}},"official":{"repos":["zehong-wang/g2pm"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/addressing-the-scarcity-of-benchmarks-for","slug":"addressing-the-scarcity-of-benchmarks-for","title":"Addressing the Scarcity of Benchmarks for Graph XAI","date":"2025-05-18","arxiv_id":"2505.12437","repositories_listed":1,"syntology":null},{"url":"/paper/efficient-mixed-precision-quantization-in","slug":"efficient-mixed-precision-quantization-in","title":"Efficient Mixed Precision Quantization in Graph Neural Networks","date":"2025-05-14","arxiv_id":"2505.09361","repositories_listed":1,"syntology":null},{"url":"/paper/adversarial-cooperative-rationalization-the","slug":"adversarial-cooperative-rationalization-the","title":"Adversarial Cooperative Rationalization: The Risk of Spurious Correlations in Even Clean Datasets","date":"2025-05-04","arxiv_id":"2505.02118","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"1 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/adversarial-cooperative-rationalization-the#ran","syntology_url":"https://syntology.ai/paper/2505.02118","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2505.02118"}},"official":{"repos":["jugechengzi/rationalization-a2i"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/graph-fourier-transformer-with-structure","slug":"graph-fourier-transformer-with-structure","title":"Graph Fourier Transformer with Structure-Frequency Information","date":"2025-04-28","arxiv_id":"2504.19740","repositories_listed":1,"syntology":null},{"url":"/paper/graphatc-advancing-multilevel-and-multi-label","slug":"graphatc-advancing-multilevel-and-multi-label","title":"GraphATC: advancing multilevel and multi-label anatomical therapeutic chemical classification via atom-level graph learning","date":"2025-04-26","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/infogain-wavelets-furthering-the-design-of","slug":"infogain-wavelets-furthering-the-design-of","title":"InfoGain Wavelets: Furthering the Design of Diffusion Wavelets for Graph-Structured Data","date":"2025-04-08","arxiv_id":"2504.08802","repositories_listed":1,"syntology":null},{"url":"/paper/augward-augmentation-aware-representation","slug":"augward-augmentation-aware-representation","title":"AugWard: Augmentation-Aware Representation Learning for Accurate Graph Classification","date":"2025-03-27","arxiv_id":"2503.21105","repositories_listed":1,"syntology":null},{"url":"/paper/deterministic-certification-of-graph-neural","slug":"deterministic-certification-of-graph-neural","title":"Deterministic Certification of Graph Neural Networks against Graph Poisoning Attacks with Arbitrary Perturbations","date":"2025-03-24","arxiv_id":"2503.18503","repositories_listed":1,"syntology":null},{"url":"/paper/network-embedding-exploration-tool-neext","slug":"network-embedding-exploration-tool-neext","title":"Network Embedding Exploration Tool (NEExT)","date":"2025-03-20","arxiv_id":"2503.15853","repositories_listed":1,"syntology":null},{"url":"/paper/breaking-free-from-mmi-a-new-frontier-in","slug":"breaking-free-from-mmi-a-new-frontier-in","title":"Breaking Free from MMI: A New Frontier in Rationalization by Probing Input Utilization","date":"2025-03-08","arxiv_id":"2503.06202","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":1,"n_no_contract":3,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 1 honoured, 1 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/breaking-free-from-mmi-a-new-frontier-in#ran","syntology_url":"https://syntology.ai/paper/2503.06202","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2503.06202"}},"official":{"repos":["jugechengzi/Rationalization-N2R"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/structural-entropy-guided-unsupervised-graph","slug":"structural-entropy-guided-unsupervised-graph","title":"Structural Entropy Guided Unsupervised Graph Out-Of-Distribution Detection","date":"2025-03-05","arxiv_id":"2503.03241","repositories_listed":1,"syntology":null},{"url":"/paper/large-engagement-networks-for-classifying","slug":"large-engagement-networks-for-classifying","title":"Large Engagement Networks for Classifying Coordinated Campaigns and Organic Twitter Trends","date":"2025-03-01","arxiv_id":"2503.00599","repositories_listed":1,"syntology":null},{"url":"/paper/neural-network-graph-similarity-computation","slug":"neural-network-graph-similarity-computation","title":"Neural Network Graph Similarity Computation Based on Graph Fusion","date":"2025-02-25","arxiv_id":"2502.18291","repositories_listed":1,"syntology":null},{"url":"/paper/graph-self-supervised-learning-with-learnable","slug":"graph-self-supervised-learning-with-learnable","title":"Graph Self-Supervised Learning with Learnable Structural and Positional Encodings","date":"2025-02-22","arxiv_id":"2502.16233","repositories_listed":1,"syntology":null},{"url":"/paper/pre-training-graph-neural-networks-on","slug":"pre-training-graph-neural-networks-on","title":"Pre-training Graph Neural Networks on Molecules by Using Subgraph-Conditioned Graph Information Bottleneck","date":"2025-02-20","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/classification-of-temporal-graphs-using","slug":"classification-of-temporal-graphs-using","title":"Classification of Temporal Graphs using Persistent Homology","date":"2025-02-14","arxiv_id":"2502.10076","repositories_listed":1,"syntology":null},{"url":"/paper/unlocking-the-potential-of-classic-gnns-for","slug":"unlocking-the-potential-of-classic-gnns-for","title":"Unlocking the Potential of Classic GNNs for Graph-level Tasks: Simple Architectures Meet Excellence","date":"2025-02-13","arxiv_id":"2502.09263","repositories_listed":1,"syntology":{"n":12,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":3,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/unlocking-the-potential-of-classic-gnns-for#ran","syntology_url":"https://syntology.ai/paper/2502.09263","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2502.09263"}},"official":{"repos":["LUOyk1999/GNNPlus"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/dagprompt-pushing-the-limits-of-graph","slug":"dagprompt-pushing-the-limits-of-graph","title":"DAGPrompT: Pushing the Limits of Graph Prompting with a Distribution-aware Graph Prompt Tuning Approach","date":"2025-01-25","arxiv_id":"2501.15142","repositories_listed":1,"syntology":null},{"url":"/paper/a-unified-invariant-learning-framework-for","slug":"a-unified-invariant-learning-framework-for","title":"A Unified Invariant Learning Framework for Graph Classification","date":"2025-01-22","arxiv_id":"2501.12595","repositories_listed":1,"syntology":null},{"url":"/paper/catch-causal-signals-from-edges-for-label","slug":"catch-causal-signals-from-edges-for-label","title":"Catch Causal Signals from Edges for Label Imbalance in Graph Classification","date":"2025-01-03","arxiv_id":"2501.01707","repositories_listed":1,"syntology":null},{"url":"/paper/line-graph-vietoris-rips-persistence-diagram","slug":"line-graph-vietoris-rips-persistence-diagram","title":"Line Graph Vietoris-Rips Persistence Diagram for Topological Graph Representation Learning","date":"2024-12-23","arxiv_id":"2412.17468","repositories_listed":1,"syntology":null},{"url":"/paper/semi-implicit-neural-ordinary-differential","slug":"semi-implicit-neural-ordinary-differential","title":"Semi-Implicit Neural Ordinary Differential Equations","date":"2024-12-15","arxiv_id":"2412.11301","repositories_listed":1,"syntology":null},{"url":"/paper/training-mlps-on-graphs-without-supervision","slug":"training-mlps-on-graphs-without-supervision","title":"Training MLPs on Graphs without Supervision","date":"2024-12-05","arxiv_id":"2412.03864","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/training-mlps-on-graphs-without-supervision#ran","syntology_url":"https://syntology.ai/paper/2412.03864","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2412.03864"}},"official":{"repos":["zehong-wang/simmlp"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/grokformer-graph-fourier-kolmogorov-arnold","slug":"grokformer-graph-fourier-kolmogorov-arnold","title":"GrokFormer: Graph Fourier Kolmogorov-Arnold Transformers","date":"2024-11-26","arxiv_id":"2411.17296","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":3,"n_ran_checked":4,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":4,"phrase":"4 ran (of which 3 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/grokformer-graph-fourier-kolmogorov-arnold#ran","syntology_url":"https://syntology.ai/paper/2411.17296","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2411.17296"}},"official":{"repos":["GGA23/GrokFormer"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":3,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/self-supervised-conditional-distribution","slug":"self-supervised-conditional-distribution","title":"Conditional Distribution Learning on Graphs","date":"2024-11-20","arxiv_id":"2411.15206","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/self-supervised-conditional-distribution#ran","syntology_url":"https://syntology.ai/paper/2411.15206","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2411.15206"}},"official":{"repos":["chenjie20/SSCDL"],"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/the-geco-algorithm-for-graph-neural-networks","slug":"the-geco-algorithm-for-graph-neural-networks","title":"The GECo algorithm for Graph Neural Networks Explanation","date":"2024-11-18","arxiv_id":"2411.11391","repositories_listed":1,"syntology":null},{"url":"/paper/exploring-consistency-in-graph","slug":"exploring-consistency-in-graph","title":"Exploring Consistency in Graph Representations:from Graph Kernels to Graph Neural Networks","date":"2024-10-31","arxiv_id":"2410.23748","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":2,"phrase":"0 ran · 2 unverified","sample_list":"/paper/exploring-consistency-in-graph#ran","syntology_url":"https://syntology.ai/paper/2410.23748","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.23748"}},"official":{"repos":["graphminddartmouth/graph-consistency"],"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/ragraph-a-general-retrieval-augmented-graph","slug":"ragraph-a-general-retrieval-augmented-graph","title":"RAGraph: A General Retrieval-Augmented Graph Learning Framework","date":"2024-10-31","arxiv_id":"2410.23855","repositories_listed":1,"syntology":null},{"url":"/paper/towards-dynamic-message-passing-on-graphs","slug":"towards-dynamic-message-passing-on-graphs","title":"Towards Dynamic Message Passing on Graphs","date":"2024-10-31","arxiv_id":"2410.23686","repositories_listed":1,"syntology":{"n":4,"n_ran":2,"n_constructed":2,"n_ran_checked":2,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":4,"phrase":"2 ran (of which 2 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified; every one of the 2 samples that ran constructed an object rather than computing a result","sample_list":"/paper/towards-dynamic-message-passing-on-graphs#ran","syntology_url":"https://syntology.ai/paper/2410.23686","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.23686"}},"official":{"repos":["sunjss/N2"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":2,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/conditional-prediction-roc-bands-for-graph","slug":"conditional-prediction-roc-bands-for-graph","title":"Conditional Prediction ROC Bands for Graph Classification","date":"2024-10-20","arxiv_id":"2410.15239","repositories_listed":1,"syntology":null},{"url":"/paper/tensor-fused-multi-view-graph-contrastive","slug":"tensor-fused-multi-view-graph-contrastive","title":"Tensor-Fused Multi-View Graph Contrastive Learning","date":"2024-10-20","arxiv_id":"2410.15247","repositories_listed":1,"syntology":null},{"url":"/paper/faster-inference-time-for-gnns-using","slug":"faster-inference-time-for-gnns-using","title":"FIT-GNN: Faster Inference Time for GNNs Using Coarsening","date":"2024-10-19","arxiv_id":"2410.15001","repositories_listed":1,"syntology":null},{"url":"/paper/molecular-topological-profile-moltop-simple-1","slug":"molecular-topological-profile-moltop-simple-1","title":"Molecular Topological Profile (MOLTOP) - Simple and Strong Baseline for Molecular Graph Classification","date":"2024-10-17","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/explanation-preserving-augmentation-for-semi","slug":"explanation-preserving-augmentation-for-semi","title":"Explanation-Preserving Augmentation for Semi-Supervised Graph Representation Learning","date":"2024-10-16","arxiv_id":"2410.12657","repositories_listed":1,"syntology":null},{"url":"/paper/vector-icl-in-context-learning-with","slug":"vector-icl-in-context-learning-with","title":"Vector-ICL: In-context Learning with Continuous Vector Representations","date":"2024-10-08","arxiv_id":"2410.05629","repositories_listed":1,"syntology":null},{"url":"/paper/neuropath-a-neural-pathway-transformer-for","slug":"neuropath-a-neural-pathway-transformer-for","title":"NeuroPath: A Neural Pathway Transformer for Joining the Dots of Human Connectomes","date":"2024-09-26","arxiv_id":"2409.17510","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":1,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":1,"n_pointer_only":3,"phrase":"2 ran (of which 1 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/neuropath-a-neural-pathway-transformer-for#ran","syntology_url":"https://syntology.ai/paper/2409.17510","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2409.17510"}},"official":{"repos":["Chrisa142857/neuro_detour"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":1,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/higher-order-message-passing-for-glycan","slug":"higher-order-message-passing-for-glycan","title":"Higher-Order Message Passing for Glycan Representation Learning","date":"2024-09-20","arxiv_id":"2409.13467","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/higher-order-message-passing-for-glycan#ran","syntology_url":"https://syntology.ai/paper/2409.13467","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2409.13467"}},"official":{"repos":["bojarlab/gifflar"],"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/cliqueph-higher-order-information-for-graph","slug":"cliqueph-higher-order-information-for-graph","title":"CliquePH: Higher-Order Information for Graph Neural Networks through Persistent Homology on Clique Graphs","date":"2024-09-12","arxiv_id":"2409.08217","repositories_listed":1,"syntology":{"n":8,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":1,"n_no_contract":6,"n_pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 1 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/cliqueph-higher-order-information-for-graph#ran","syntology_url":"https://syntology.ai/paper/2409.08217","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2409.08217"}},"official":{"repos":["DavideBuffelli/CliquePH"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/gstam-efficient-graph-distillation-with","slug":"gstam-efficient-graph-distillation-with","title":"GSTAM: Efficient Graph Distillation with Structural Attention-Matching","date":"2024-08-29","arxiv_id":"2408.16871","repositories_listed":1,"syntology":null},{"url":"/paper/learning-tree-structured-composition-of-data","slug":"learning-tree-structured-composition-of-data","title":"Learning Tree-Structured Composition of Data Augmentation","date":"2024-08-26","arxiv_id":"2408.14381","repositories_listed":1,"syntology":null},{"url":"/paper/dynamic-neural-dowker-network-approximating","slug":"dynamic-neural-dowker-network-approximating","title":"Dynamic Neural Dowker Network: Approximating Persistent Homology in Dynamic Directed Graphs","date":"2024-08-17","arxiv_id":"2408.09123","repositories_listed":1,"syntology":null},{"url":"/paper/graph-classification-with-gnns-optimisation","slug":"graph-classification-with-gnns-optimisation","title":"Graph Classification with GNNs: Optimisation, Representation and Inductive Bias","date":"2024-08-17","arxiv_id":"2408.09266","repositories_listed":1,"syntology":null},{"url":"/paper/graph-triple-attention-network-a-decoupled","slug":"graph-triple-attention-network-a-decoupled","title":"Graph Triple Attention Network: A Decoupled Perspective","date":"2024-08-14","arxiv_id":"2408.07654","repositories_listed":1,"syntology":null},{"url":"/paper/2408-01697","slug":"2408-01697","title":"Invariant Graph Learning Meets Information Bottleneck for Out-of-Distribution Generalization","date":"2024-08-03","arxiv_id":"2408.01697","repositories_listed":1,"syntology":null},{"url":"/paper/autordf2gml-facilitating-rdf-integration-in","slug":"autordf2gml-facilitating-rdf-integration-in","title":"AutoRDF2GML: Facilitating RDF Integration in Graph Machine Learning","date":"2024-07-26","arxiv_id":"2407.18735","repositories_listed":1,"syntology":null},{"url":"/paper/disensemi-semi-supervised-graph","slug":"disensemi-semi-supervised-graph","title":"DisenSemi: Semi-supervised Graph Classification via Disentangled Representation Learning","date":"2024-07-19","arxiv_id":"2407.14081","repositories_listed":1,"syntology":null},{"url":"/paper/hyperaggregation-aggregating-over-graph-edges","slug":"hyperaggregation-aggregating-over-graph-edges","title":"HyperAggregation: Aggregating over Graph Edges with Hypernetworks","date":"2024-07-16","arxiv_id":"2407.11596","repositories_listed":1,"syntology":null},{"url":"/paper/molecular-topological-profile-moltop-simple","slug":"molecular-topological-profile-moltop-simple","title":"Molecular Topological Profile (MOLTOP) -- Simple and Strong Baseline for Molecular Graph Classification","date":"2024-07-16","arxiv_id":"2407.12136","repositories_listed":1,"syntology":null},{"url":"/paper/rethinking-the-effectiveness-of-graph","slug":"rethinking-the-effectiveness-of-graph","title":"Rethinking the Effectiveness of Graph Classification Datasets in Benchmarks for Assessing GNNs","date":"2024-07-06","arxiv_id":"2407.04999","repositories_listed":1,"syntology":{"n":14,"n_ran":11,"n_constructed":0,"n_ran_checked":9,"n_instrument":2,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":1,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 2 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/rethinking-the-effectiveness-of-graph#ran","syntology_url":"https://syntology.ai/paper/2407.04999","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.04999"}},"official":{"repos":["ICLab4DL/GNNBenchEffectiveness"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/unveiling-global-interactive-patterns-across","slug":"unveiling-global-interactive-patterns-across","title":"Unveiling Global Interactive Patterns across Graphs: Towards Interpretable Graph Neural Networks","date":"2024-07-02","arxiv_id":"2407.01979","repositories_listed":1,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/unveiling-global-interactive-patterns-across#ran","syntology_url":"https://syntology.ai/paper/2407.01979","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.01979"}},"official":{"repos":["Wangyuwen0627/GIP-Framework"],"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/mugsi-distilling-gnns-with-multi-granularity","slug":"mugsi-distilling-gnns-with-multi-granularity","title":"MuGSI: Distilling GNNs with Multi-Granularity Structural Information for Graph Classification","date":"2024-06-28","arxiv_id":"2406.19832","repositories_listed":1,"syntology":null},{"url":"/paper/kagnns-kolmogorov-arnold-networks-meet-graph","slug":"kagnns-kolmogorov-arnold-networks-meet-graph","title":"KAGNNs: Kolmogorov-Arnold Networks meet Graph Learning","date":"2024-06-26","arxiv_id":"2406.18380","repositories_listed":1,"syntology":{"n":8,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":8,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/kagnns-kolmogorov-arnold-networks-meet-graph#ran","syntology_url":"https://syntology.ai/paper/2406.18380","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.18380"}},"official":{"repos":["RomanBresson/KAGNN"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/topogcl-topological-graph-contrastive","slug":"topogcl-topological-graph-contrastive","title":"TopoGCL: Topological Graph Contrastive Learning","date":"2024-06-25","arxiv_id":"2406.17251","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":2,"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 2 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; every one of the 2 samples that ran constructed an object rather than computing a result","sample_list":"/paper/topogcl-topological-graph-contrastive#ran","syntology_url":"https://syntology.ai/paper/2406.17251","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.17251"}},"official":{"repos":["topogclaaai24/topogcl"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":2,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/fast-tree-field-integrators-from-low","slug":"fast-tree-field-integrators-from-low","title":"Fast Tree-Field Integrators: From Low Displacement Rank to Topological Transformers","date":"2024-06-22","arxiv_id":"2406.15881","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":0,"n_instrument":5,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":5,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 5 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/fast-tree-field-integrators-from-low#ran","syntology_url":"https://syntology.ai/paper/2406.15881","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.15881"}},"official":{"repos":["brcsomnath/fasttreeintegrator"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/next-level-message-passing-with-hierarchical","slug":"next-level-message-passing-with-hierarchical","title":"Next Level Message-Passing with Hierarchical Support Graphs","date":"2024-06-22","arxiv_id":"2406.15852","repositories_listed":1,"syntology":{"n":10,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":2,"n_no_contract":5,"n_pointer_only":6,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 2 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/next-level-message-passing-with-hierarchical#ran","syntology_url":"https://syntology.ai/paper/2406.15852","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.15852"}},"official":{"repos":["carlosinator/support-graphs"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/edge-classification-on-graphs-new-directions","slug":"edge-classification-on-graphs-new-directions","title":"Edge Classification on Graphs: New Directions in Topological Imbalance","date":"2024-06-17","arxiv_id":"2406.11685","repositories_listed":1,"syntology":null},{"url":"/paper/a-comprehensive-graph-pooling-benchmark","slug":"a-comprehensive-graph-pooling-benchmark","title":"A Comprehensive Graph Pooling Benchmark: Effectiveness, Robustness and Generalizability","date":"2024-06-13","arxiv_id":"2406.09031","repositories_listed":1,"syntology":{"n":11,"n_ran":10,"n_constructed":0,"n_ran_checked":8,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":11,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/a-comprehensive-graph-pooling-benchmark#ran","syntology_url":"https://syntology.ai/paper/2406.09031","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.09031"}},"official":{"repos":["goose315/graph_pooling_benchmark"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/motif-driven-subgraph-structure-learning-for","slug":"motif-driven-subgraph-structure-learning-for","title":"Motif-driven Subgraph Structure Learning for Graph Classification","date":"2024-06-13","arxiv_id":"2406.08897","repositories_listed":1,"syntology":null},{"url":"/paper/how-interpretable-are-interpretable-graph","slug":"how-interpretable-are-interpretable-graph","title":"How Interpretable Are Interpretable Graph Neural Networks?","date":"2024-06-12","arxiv_id":"2406.07955","repositories_listed":1,"syntology":null},{"url":"/paper/panda-expanded-width-aware-message-passing","slug":"panda-expanded-width-aware-message-passing","title":"PANDA: Expanded Width-Aware Message Passing Beyond Rewiring","date":"2024-06-06","arxiv_id":"2406.03671","repositories_listed":1,"syntology":{"n":9,"n_ran":7,"n_constructed":0,"n_ran_checked":5,"n_instrument":2,"n_unverified":2,"n_honours":1,"n_violates":0,"n_no_contract":4,"n_pointer_only":3,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 1 honoured, 0 violated, 4 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/panda-expanded-width-aware-message-passing#ran","syntology_url":"https://syntology.ai/paper/2406.03671","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.03671"}},"official":{"repos":["jeongwhanchoi/panda"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/learning-long-range-dependencies-on-graphs","slug":"learning-long-range-dependencies-on-graphs","title":"Learning Long Range Dependencies on Graphs via Random Walks","date":"2024-06-05","arxiv_id":"2406.03386","repositories_listed":1,"syntology":{"n":13,"n_ran":13,"n_constructed":0,"n_ran_checked":10,"n_instrument":3,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":9,"n_pointer_only":1,"phrase":"13 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 1 honoured, 0 violated, 9 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/learning-long-range-dependencies-on-graphs#ran","syntology_url":"https://syntology.ai/paper/2406.03386","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.03386"}},"official":{"repos":["borgwardtlab/neuralwalker"],"state":"official (archive's flag): 13 ran","n_ran":13,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/gefl-extended-filtration-learning-for-graph","slug":"gefl-extended-filtration-learning-for-graph","title":"GEFL: Extended Filtration Learning for Graph Classification","date":"2024-06-04","arxiv_id":"2406.02732","repositories_listed":1,"syntology":null},{"url":"/paper/towards-a-general-gnn-framework-for","slug":"towards-a-general-gnn-framework-for","title":"Towards a General Recipe for Combinatorial Optimization with Multi-Filter GNNs","date":"2024-05-31","arxiv_id":"2405.20543","repositories_listed":1,"syntology":{"n":13,"n_ran":10,"n_constructed":0,"n_ran_checked":10,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":10,"n_pointer_only":13,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 0 honoured, 0 violated, 10 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/towards-a-general-gnn-framework-for#ran","syntology_url":"https://syntology.ai/paper/2405.20543","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.20543"}},"official":{"repos":["wenkelf/copt"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/spatio-spectral-graph-neural-networks","slug":"spatio-spectral-graph-neural-networks","title":"Spatio-Spectral Graph Neural Networks","date":"2024-05-29","arxiv_id":"2405.19121","repositories_listed":1,"syntology":{"n":9,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":2,"n_honours":1,"n_violates":0,"n_no_contract":6,"n_pointer_only":2,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 1 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/spatio-spectral-graph-neural-networks#ran","syntology_url":"https://syntology.ai/paper/2405.19121","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.19121"}},"official":{"repos":["sigeisler/s2gnn"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/cross-context-backdoor-attacks-against-graph","slug":"cross-context-backdoor-attacks-against-graph","title":"Cross-Context Backdoor Attacks against Graph Prompt Learning","date":"2024-05-28","arxiv_id":"2405.17984","repositories_listed":1,"syntology":{"n":11,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":11,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/cross-context-backdoor-attacks-against-graph#ran","syntology_url":"https://syntology.ai/paper/2405.17984","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.17984"}},"official":{"repos":["xtLyu/CrossBA"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/structure-aware-semantic-node-identifiers-for","slug":"structure-aware-semantic-node-identifiers-for","title":"Node Identifiers: Compact, Discrete Representations for Efficient Graph Learning","date":"2024-05-26","arxiv_id":"2405.16435","repositories_listed":1,"syntology":{"n":13,"n_ran":10,"n_constructed":0,"n_ran_checked":9,"n_instrument":1,"n_unverified":3,"n_honours":0,"n_violates":2,"n_no_contract":7,"n_pointer_only":3,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 2 violated, 7 with no contract checked; 1 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/structure-aware-semantic-node-identifiers-for#ran","syntology_url":"https://syntology.ai/paper/2405.16435","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.16435"}},"official":{"repos":["LUOyk1999/NodeID"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/harnessing-collective-structure-knowledge-in","slug":"harnessing-collective-structure-knowledge-in","title":"Harnessing Collective Structure Knowledge in Data Augmentation for Graph Neural Networks","date":"2024-05-17","arxiv_id":"2405.10633","repositories_listed":1,"syntology":null},{"url":"/paper/perception-inspired-graph-convolution-for","slug":"perception-inspired-graph-convolution-for","title":"Perception-Inspired Graph Convolution for Music Understanding Tasks","date":"2024-05-15","arxiv_id":"2405.09224","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/perception-inspired-graph-convolution-for#ran","syntology_url":"https://syntology.ai/paper/2405.09224","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.09224"}},"official":{"repos":["manoskary/musgconv"],"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/dynamic-gnns-for-precise-seizure-detection","slug":"dynamic-gnns-for-precise-seizure-detection","title":"Dynamic GNNs for Precise Seizure Detection and Classification from EEG Data","date":"2024-05-08","arxiv_id":"2405.09568","repositories_listed":1,"syntology":null},{"url":"/paper/imbalanced-graph-classification-with-multi","slug":"imbalanced-graph-classification-with-multi","title":"Imbalanced Graph Classification with Multi-scale Oversampling Graph Neural Networks","date":"2024-05-08","arxiv_id":"2405.04903","repositories_listed":1,"syntology":null},{"url":"/paper/are-graph-embeddings-the-panacea-an-empirical","slug":"are-graph-embeddings-the-panacea-an-empirical","title":"Are Graph Embeddings the Panacea? An Empirical Survey from the Data Fitness Perspective","date":"2024-04-25","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/gradformer-graph-transformer-with-exponential","slug":"gradformer-graph-transformer-with-exponential","title":"Gradformer: Graph Transformer with Exponential Decay","date":"2024-04-24","arxiv_id":"2404.15729","repositories_listed":1,"syntology":{"n":9,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":9,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/gradformer-graph-transformer-with-exponential#ran","syntology_url":"https://syntology.ai/paper/2404.15729","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.15729"}},"official":{"repos":["liuchuang0059/gradformer"],"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/ckgconv-general-graph-convolution-with","slug":"ckgconv-general-graph-convolution-with","title":"CKGConv: General Graph Convolution with Continuous Kernels","date":"2024-04-21","arxiv_id":"2404.13604","repositories_listed":1,"syntology":{"n":11,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":11,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/ckgconv-general-graph-convolution-with#ran","syntology_url":"https://syntology.ai/paper/2404.13604","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.13604"}},"official":{"repos":["networkslab/ckgconv"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/improving-the-interpretability-of-gnn","slug":"improving-the-interpretability-of-gnn","title":"Improving the interpretability of GNN predictions through conformal-based graph sparsification","date":"2024-04-18","arxiv_id":"2404.12356","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/improving-the-interpretability-of-gnn#ran","syntology_url":"https://syntology.ai/paper/2404.12356","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2404.12356"}},"official":{"repos":["psanch21/cores"],"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/multi-view-graph-structural-representation","slug":"multi-view-graph-structural-representation","title":"An Efficient Loop and Clique Coarsening Algorithm for Graph Classification","date":"2024-04-18","arxiv_id":"2404.11869","repositories_listed":1,"syntology":null},{"url":"/paper/harnessing-the-power-of-large-language-model","slug":"harnessing-the-power-of-large-language-model","title":"Harnessing the Power of Large Language Model for Uncertainty Aware Graph Processing","date":"2024-03-31","arxiv_id":"2404.00589","repositories_listed":1,"syntology":null},{"url":"/paper/learning-the-mechanisms-of-network-growth","slug":"learning-the-mechanisms-of-network-growth","title":"Learning the mechanisms of network growth","date":"2024-03-31","arxiv_id":"2404.00793","repositories_listed":1,"syntology":null},{"url":"/paper/cooperative-classification-and","slug":"cooperative-classification-and","title":"Cooperative Classification and Rationalization for Graph Generalization","date":"2024-03-10","arxiv_id":"2403.06239","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":7,"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/cooperative-classification-and#ran","syntology_url":"https://syntology.ai/paper/2403.06239","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2403.06239"}},"official":{"repos":["yuelinan/codes-of-c2r"],"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/multi-hop-attention-based-graph-pooling-a","slug":"multi-hop-attention-based-graph-pooling-a","title":"Multi-hop Attention-based Graph Pooling: A Personalized PageRank Perspective","date":"2024-03-04","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/verifying-message-passing-neural-networks-via","slug":"verifying-message-passing-neural-networks-via","title":"Verifying message-passing neural networks via topology-based bounds tightening","date":"2024-02-21","arxiv_id":"2402.13937","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/verifying-message-passing-neural-networks-via#ran","syntology_url":"https://syntology.ai/paper/2402.13937","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.13937"}},"official":{"repos":["christopherhojny/SCIP-MPNN"],"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/masked-attention-is-all-you-need-for-graphs","slug":"masked-attention-is-all-you-need-for-graphs","title":"An end-to-end attention-based approach for learning on graphs","date":"2024-02-16","arxiv_id":"2402.10793","repositories_listed":1,"syntology":null},{"url":"/paper/graph-inference-acceleration-by-learning-mlps","slug":"graph-inference-acceleration-by-learning-mlps","title":"SimMLP: Training MLPs on Graphs without Supervision","date":"2024-02-14","arxiv_id":"2402.08918","repositories_listed":1,"syntology":null},{"url":"/paper/generalization-error-of-graph-neural-networks","slug":"generalization-error-of-graph-neural-networks","title":"Generalization Error of Graph Neural Networks in the Mean-field Regime","date":"2024-02-10","arxiv_id":"2402.07025","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/generalization-error-of-graph-neural-networks#ran","syntology_url":"https://syntology.ai/paper/2402.07025","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.07025"}},"official":{"repos":["sherylhyx/gnn_mf_ge"],"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/gaussian-process-regression-with-sliced","slug":"gaussian-process-regression-with-sliced","title":"Gaussian process regression with Sliced Wasserstein Weisfeiler-Lehman graph kernels","date":"2024-02-06","arxiv_id":"2402.03838","repositories_listed":1,"syntology":null},{"url":"/paper/a-graph-is-worth-k-words-euclideanizing-graph","slug":"a-graph-is-worth-k-words-euclideanizing-graph","title":"A Graph is Worth $K$ Words: Euclideanizing Graph using Pure Transformer","date":"2024-02-04","arxiv_id":"2402.02464","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":1,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/a-graph-is-worth-k-words-euclideanizing-graph#ran","syntology_url":"https://syntology.ai/paper/2402.02464","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.02464"}},"official":{"repos":["A4Bio/GraphsGPT"],"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/neural-scaling-laws-on-graphs","slug":"neural-scaling-laws-on-graphs","title":"Towards Neural Scaling Laws on Graphs","date":"2024-02-03","arxiv_id":"2402.02054","repositories_listed":1,"syntology":{"n":7,"n_ran":5,"n_constructed":0,"n_ran_checked":4,"n_instrument":1,"n_unverified":2,"n_honours":1,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 1 honoured, 0 violated, 3 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/neural-scaling-laws-on-graphs#ran","syntology_url":"https://syntology.ai/paper/2402.02054","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.02054"}},"official":{"repos":["liu-jingzhe/graph-scaling-laws"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/graph-contrastive-learning-with-cohesive","slug":"graph-contrastive-learning-with-cohesive","title":"Graph Contrastive Learning with Cohesive Subgraph Awareness","date":"2024-01-31","arxiv_id":"2401.17580","repositories_listed":1,"syntology":{"n":5,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/graph-contrastive-learning-with-cohesive#ran","syntology_url":"https://syntology.ai/paper/2401.17580","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2401.17580"}},"official":{"repos":["wuyucheng2002/ctaug"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/tensor-view-topological-graph-neural-network","slug":"tensor-view-topological-graph-neural-network","title":"Tensor-view Topological Graph Neural Network","date":"2024-01-22","arxiv_id":"2401.12007","repositories_listed":1,"syntology":null},{"url":"/paper/through-the-dual-prism-a-spectral-perspective","slug":"through-the-dual-prism-a-spectral-perspective","title":"Through the Dual-Prism: A Spectral Perspective on Graph Data Augmentation for Graph Classification","date":"2024-01-18","arxiv_id":"2401.09953","repositories_listed":1,"syntology":{"n":10,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":10,"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) · 2 unverified","sample_list":"/paper/through-the-dual-prism-a-spectral-perspective#ran","syntology_url":"https://syntology.ai/paper/2401.09953","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2401.09953"}},"official":{"repos":["yu-rp/dualprism"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/gnn-lofi-a-novel-graph-neural-network-through","slug":"gnn-lofi-a-novel-graph-neural-network-through","title":"GNN-LoFI: a Novel Graph Neural Network through Localized Feature-based Histogram Intersection","date":"2024-01-17","arxiv_id":"2401.09193","repositories_listed":1,"syntology":null},{"url":"/paper/on-the-power-of-graph-neural-networks-and","slug":"on-the-power-of-graph-neural-networks-and","title":"On the Power of Graph Neural Networks and Feature Augmentation Strategies to Classify Social Networks","date":"2024-01-11","arxiv_id":"2401.06048","repositories_listed":1,"syntology":null},{"url":"/paper/view-based-explanations-for-graph-neural","slug":"view-based-explanations-for-graph-neural","title":"View-based Explanations for Graph Neural Networks","date":"2024-01-04","arxiv_id":"2401.02086","repositories_listed":1,"syntology":null},{"url":"/paper/on-discprecncies-between-perturbation","slug":"on-discprecncies-between-perturbation","title":"On Discprecncies between Perturbation Evaluations of Graph Neural Network Attributions","date":"2024-01-01","arxiv_id":"2401.00633","repositories_listed":1,"syntology":null}],"record_sha256":"7bfa6f8aca2b4c44ea5d9cfd099e8719737d6b9c6c8f47dde601cc9ff73ddfb7","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}