{"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/6","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":6,"pages_in_order":10,"rows_per_page":100,"rows":[501,600],"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/5","next":"/task/graph-classification/papers/7","papers":[{"url":null,"slug":"multi-view-fuzzy-graph-attention-networks-for","title":"Multi-view Fuzzy Graph Attention Networks for Enhanced Graph Learning","date":"2024-12-23","arxiv_id":"2412.17271","repositories_listed":0,"syntology":null},{"url":null,"slug":"cluster-guided-contrastive-class-imbalanced","title":"Cluster-guided Contrastive Class-imbalanced Graph Classification","date":"2024-12-17","arxiv_id":"2412.12984","repositories_listed":0,"syntology":null},{"url":null,"slug":"robustness-of-graph-classification-failure","title":"Robustness of Graph Classification: failure modes, causes, and noise-resistant loss in Graph Neural Networks","date":"2024-12-11","arxiv_id":"2412.08419","repositories_listed":0,"syntology":null},{"url":null,"slug":"gqwformer-a-quantum-based-transformer-for","title":"GQWformer: A Quantum-based Transformer for Graph Representation Learning","date":"2024-12-03","arxiv_id":"2412.02285","repositories_listed":0,"syntology":null},{"url":null,"slug":"gradient-inversion-attack-on-graph-neural","title":"Gradient Inversion Attack on Graph Neural Networks","date":"2024-11-29","arxiv_id":"2411.19440","repositories_listed":0,"syntology":null},{"url":null,"slug":"from-graph-diffusion-to-graph-classification","title":"From Graph Diffusion to Graph Classification","date":"2024-11-26","arxiv_id":"2411.17236","repositories_listed":0,"syntology":null},{"url":null,"slug":"made-graph-backdoor-defense-with-masked","title":"MADE: Graph Backdoor Defense with Masked Unlearning","date":"2024-11-26","arxiv_id":"2411.18648","repositories_listed":0,"syntology":null},{"url":null,"slug":"efficient-and-robust-continual-graph-learning","title":"Efficient and Robust Continual Graph Learning for Graph Classification in Biology","date":"2024-11-18","arxiv_id":"2411.11668","repositories_listed":0,"syntology":null},{"url":null,"slug":"boolean-aware-boolean-circuit-classification","title":"Boolean-aware Boolean Circuit Classification: A Comprehensive Study on Graph Neural Network","date":"2024-11-13","arxiv_id":"2411.10481","repositories_listed":0,"syntology":null},{"url":null,"slug":"gaussian-mixture-models-based-augmentation","title":"Graph Neural Network Generalization with Gaussian Mixture Model Based Augmentation","date":"2024-11-13","arxiv_id":"2411.08638","repositories_listed":0,"syntology":null},{"url":null,"slug":"mbexplainer-multilevel-bandit-based","title":"MBExplainer: Multilevel bandit-based explanations for downstream models with augmented graph embeddings","date":"2024-11-01","arxiv_id":"2411.00287","repositories_listed":0,"syntology":null},{"url":null,"slug":"reducing-oversmoothing-through-informed","title":"Reducing Oversmoothing through Informed Weight Initialization in Graph Neural Networks","date":"2024-10-31","arxiv_id":"2410.23830","repositories_listed":0,"syntology":null},{"url":null,"slug":"uncovering-capabilities-of-model-pruning-in","title":"Uncovering Capabilities of Model Pruning in Graph Contrastive Learning","date":"2024-10-27","arxiv_id":"2410.20356","repositories_listed":0,"syntology":null},{"url":null,"slug":"conditional-uncertainty-quantification-for","title":"Conditional Uncertainty Quantification for Tensorized Topological Neural Networks","date":"2024-10-20","arxiv_id":"2410.15241","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-classification-gaussian-processes-via-1","title":"Graph Classification Gaussian Processes via Hodgelet Spectral Features","date":"2024-10-14","arxiv_id":"2410.10546","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-neural-alchemist-an-innovative-fully","title":"Graph Neural Alchemist: An innovative fully modular architecture for time series-to-graph classification","date":"2024-10-12","arxiv_id":"2410.09307","repositories_listed":0,"syntology":null},{"url":null,"slug":"degree-distribution-based-spiking-graph","title":"Degree-Conscious Spiking Graph for Cross-Domain Adaptation","date":"2024-10-09","arxiv_id":"2410.06883","repositories_listed":0,"syntology":null},{"url":null,"slug":"defense-as-a-service-black-box-shielding","title":"Defense-as-a-Service: Black-box Shielding against Backdoored Graph Models","date":"2024-10-07","arxiv_id":"2410.04916","repositories_listed":0,"syntology":null},{"url":null,"slug":"diagnosis-and-pathogenic-analysis-of-autism","title":"Diagnosis and Pathogenic Analysis of Autism Spectrum Disorder Using Fused Brain Connection Graph","date":"2024-09-22","arxiv_id":"2410.07138","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-property-encoder-for-graph-neural-networks","title":"PropEnc: A Property Encoder for Graph Neural Networks","date":"2024-09-17","arxiv_id":"2409.11554","repositories_listed":0,"syntology":null},{"url":null,"slug":"hierarchical-graph-pooling-based-on-minimum","title":"MDL-Pool: Adaptive Multilevel Graph Pooling Based on Minimum Description Length","date":"2024-09-16","arxiv_id":"2409.10263","repositories_listed":0,"syntology":null},{"url":null,"slug":"mtlso-a-multi-task-learning-approach-for","title":"MTLSO: A Multi-Task Learning Approach for Logic Synthesis Optimization","date":"2024-09-09","arxiv_id":"2409.06077","repositories_listed":0,"syntology":null},{"url":null,"slug":"gspect-spectral-filtering-for-cross-scale","title":"GSpect: Spectral Filtering for Cross-Scale Graph Classification","date":"2024-08-31","arxiv_id":"2409.00338","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-classification-via-reference","title":"Graph Classification via Reference Distribution Learning: Theory and Practice","date":"2024-08-21","arxiv_id":"2408.11370","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-structural-feature-based-approach-for","title":"A Structural Feature-Based Approach for Comprehensive Graph Classification","date":"2024-08-10","arxiv_id":"2408.05474","repositories_listed":0,"syntology":null},{"url":null,"slug":"beyond-the-eye-a-relational-model-for-early","title":"Beyond the Eye: A Relational Model for Early Dementia Detection Using Retinal OCTA Images","date":"2024-08-09","arxiv_id":"2408.05117","repositories_listed":0,"syntology":null},{"url":null,"slug":"dive-subgraph-disagreement-for-graph-out-of","title":"DIVE: Subgraph Disagreement for Graph Out-of-Distribution Generalization","date":"2024-08-08","arxiv_id":"2408.04400","repositories_listed":0,"syntology":null},{"url":null,"slug":"knowledge-probing-for-graph-representation","title":"Knowledge Probing for Graph Representation Learning","date":"2024-08-07","arxiv_id":"2408.03877","repositories_listed":0,"syntology":null},{"url":null,"slug":"data-augmentation-in-graph-neural-networks","title":"Data Augmentation in Graph Neural Networks: The Role of Generated Synthetic Graphs","date":"2024-07-20","arxiv_id":"2407.14765","repositories_listed":0,"syntology":null},{"url":null,"slug":"enhancing-high-energy-particle-physics","title":"Enhancing High-Energy Particle Physics Collision Analysis through Graph Data Attribution Techniques","date":"2024-07-20","arxiv_id":"2407.14859","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-structure-prompt-learning-a-novel","title":"Graph Structure Prompt Learning: A Novel Methodology to Improve Performance of Graph Neural Networks","date":"2024-07-16","arxiv_id":"2407.11361","repositories_listed":0,"syntology":null},{"url":"/paper/relaxing-graph-transformers-for-adversarial","slug":"relaxing-graph-transformers-for-adversarial","title":"Relaxing Graph Transformers for Adversarial Attacks","date":"2024-07-16","arxiv_id":"2407.11764","repositories_listed":0,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/relaxing-graph-transformers-for-adversarial#ran","syntology_url":"https://syntology.ai/paper/2407.11764","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.11764"}},"official":null}},{"url":null,"slug":"tackling-oversmoothing-in-gnn-via-graph","title":"Tackling Oversmoothing in GNN via Graph Sparsification: A Truss-based Approach","date":"2024-07-16","arxiv_id":"2407.11928","repositories_listed":0,"syntology":null},{"url":null,"slug":"core-knowledge-learning-framework-for-graph","title":"Core Knowledge Learning Framework for Graph Adaptation and Scalability Learning","date":"2024-07-02","arxiv_id":"2407.01886","repositories_listed":0,"syntology":null},{"url":null,"slug":"kolmogorov-arnold-graph-neural-networks","title":"Kolmogorov-Arnold Graph Neural Networks","date":"2024-06-26","arxiv_id":"2406.18354","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-gnn-explanability-with-activation-rules","title":"On GNN explanability with activation rules","date":"2024-06-17","arxiv_id":"2406.11594","repositories_listed":0,"syntology":null},{"url":"/paper/robustness-inspired-defense-against-backdoor","slug":"robustness-inspired-defense-against-backdoor","title":"Robustness Inspired Graph Backdoor Defense","date":"2024-06-14","arxiv_id":"2406.09836","repositories_listed":0,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/robustness-inspired-defense-against-backdoor#ran","syntology_url":"https://syntology.ai/paper/2406.09836","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.09836"}},"official":null}},{"url":null,"slug":"rethinking-the-impact-of-noisy-labels-in","title":"Rethinking the impact of noisy labels in graph classification: A utility and privacy perspective","date":"2024-06-11","arxiv_id":"2406.07314","repositories_listed":0,"syntology":null},{"url":null,"slug":"genie-watermarking-graph-neural-networks-for","title":"GENIE: Watermarking Graph Neural Networks for Link Prediction","date":"2024-06-07","arxiv_id":"2406.04805","repositories_listed":0,"syntology":null},{"url":null,"slug":"gnnanatomy-systematic-generation-and","title":"GNNAnatomy: Rethinking Model-Level Explanations for Graph Neural Networks","date":"2024-06-06","arxiv_id":"2406.04548","repositories_listed":0,"syntology":null},{"url":null,"slug":"equivariant-machine-learning-on-graphs-with","title":"Equivariant Machine Learning on Graphs with Nonlinear Spectral Filters","date":"2024-06-03","arxiv_id":"2406.01249","repositories_listed":0,"syntology":null},{"url":null,"slug":"ciliagraph-enabling-expression-enhanced-hyper","title":"CiliaGraph: Enabling Expression-enhanced Hyper-Dimensional Computation in Ultra-Lightweight and One-Shot Graph Classification on Edge","date":"2024-05-29","arxiv_id":"2405.19033","repositories_listed":0,"syntology":null},{"url":null,"slug":"hc-gae-the-hierarchical-cluster-based-graph","title":"HC-GAE: The Hierarchical Cluster-based Graph Auto-Encoder for Graph Representation Learning","date":"2024-05-23","arxiv_id":"2405.14742","repositories_listed":0,"syntology":null},{"url":null,"slug":"enadpool-the-edge-node-attention-based","title":"ENADPool: The Edge-Node Attention-based Differentiable Pooling for Graph Neural Networks","date":"2024-05-16","arxiv_id":"2405.10218","repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-subgraph-isomorphism-counting-with","title":"Towards Subgraph Isomorphism Counting with Graph Kernels","date":"2024-05-13","arxiv_id":"2405.07497","repositories_listed":0,"syntology":null},{"url":null,"slug":"conditional-local-feature-encoding-for-graph","title":"Conditional Local Feature Encoding for Graph Neural Networks","date":"2024-05-08","arxiv_id":"2405.04755","repositories_listed":0,"syntology":null},{"url":null,"slug":"hypergraph-enhanced-dual-semi-supervised","title":"Hypergraph-enhanced Dual Semi-supervised Graph Classification","date":"2024-05-08","arxiv_id":"2405.04773","repositories_listed":0,"syntology":null},{"url":null,"slug":"transductive-spiking-graph-neural-networks","title":"Transductive Spiking Graph Neural Networks for Loihi","date":"2024-04-25","arxiv_id":"2404.17048","repositories_listed":0,"syntology":null},{"url":null,"slug":"one-subgraph-for-all-efficient-reasoning-on","title":"One Subgraph for All: Efficient Reasoning on Opening Subgraphs for Inductive Knowledge Graph Completion","date":"2024-04-24","arxiv_id":"2404.15807","repositories_listed":0,"syntology":null},{"url":null,"slug":"spgnn-recognizing-salient-subgraph-patterns","title":"SPGNN: Recognizing Salient Subgraph Patterns via Enhanced Graph Convolution and Pooling","date":"2024-04-21","arxiv_id":"2404.13655","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-clean-graph-backdoor-attack-against-graph","title":"A Clean-graph Backdoor Attack against Graph Convolutional Networks with Poisoned Label Only","date":"2024-04-19","arxiv_id":"2404.12704","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-data-augmentation-with-gromow","title":"Graph data augmentation with Gromow-Wasserstein Barycenters","date":"2024-04-12","arxiv_id":"2404.08376","repositories_listed":0,"syntology":null},{"url":null,"slug":"akbr-learning-adaptive-kernel-based","title":"AKBR: Learning Adaptive Kernel-based Representations for Graph Classification","date":"2024-03-24","arxiv_id":"2403.16130","repositories_listed":0,"syntology":null},{"url":null,"slug":"sshpool-the-separated-subgraph-based","title":"SSHPool: The Separated Subgraph-based Hierarchical Pooling","date":"2024-03-24","arxiv_id":"2403.16133","repositories_listed":0,"syntology":null},{"url":null,"slug":"gtagcn-generalized-topology-adaptive-graph","title":"GTAGCN: Generalized Topology Adaptive Graph Convolutional Networks","date":"2024-03-22","arxiv_id":"2403.15077","repositories_listed":0,"syntology":null},{"url":null,"slug":"molecular-classification-using","title":"Molecular Classification Using Hyperdimensional Graph Classification","date":"2024-03-18","arxiv_id":"2403.12307","repositories_listed":0,"syntology":null},{"url":null,"slug":"generation-is-better-than-modification","title":"Generation is better than Modification: Combating High Class Homophily Variance in Graph Anomaly Detection","date":"2024-03-15","arxiv_id":"2403.10339","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-differential-geometric-view-and","title":"A Differential Geometric View and Explainability of GNN on Evolving Graphs","date":"2024-03-11","arxiv_id":"2403.06425","repositories_listed":0,"syntology":null},{"url":null,"slug":"hdreason-algorithm-hardware-codesign-for","title":"HDReason: Algorithm-Hardware Codesign for Hyperdimensional Knowledge Graph Reasoning","date":"2024-03-09","arxiv_id":"2403.05763","repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-scale-subgraph-contrastive-learning","title":"Multi-Scale Subgraph Contrastive Learning","date":"2024-03-05","arxiv_id":"2403.02719","repositories_listed":0,"syntology":null},{"url":null,"slug":"inductive-graph-alignment-prompt-bridging-the","title":"Inductive Graph Alignment Prompt: Bridging the Gap between Graph Pre-training and Inductive Fine-tuning From Spectral Perspective","date":"2024-02-21","arxiv_id":"2402.13556","repositories_listed":0,"syntology":null},{"url":null,"slug":"graphcbal-class-balanced-active-learning-for","title":"Class-Balanced and Reinforced Active Learning on Graphs","date":"2024-02-15","arxiv_id":"2402.10074","repositories_listed":0,"syntology":null},{"url":null,"slug":"ising-on-the-graph-task-specific-graph","title":"Ising on the Graph: Task-specific Graph Subsampling via the Ising Model","date":"2024-02-15","arxiv_id":"2402.10206","repositories_listed":0,"syntology":null},{"url":null,"slug":"message-detouring-a-simple-yet-effective","title":"Message Detouring: A Simple Yet Effective Cycle Representation for Expressive Graph Learning","date":"2024-02-12","arxiv_id":"2402.08085","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-attributed-graphlets-predictive","title":"Learning Attributed Graphlets: Predictive Graph Mining by Graphlets with Trainable Attribute","date":"2024-02-10","arxiv_id":"2402.06932","repositories_listed":0,"syntology":null},{"url":null,"slug":"flexible-infinite-width-graph-convolutional","title":"Flexible infinite-width graph convolutional networks and the importance of representation learning","date":"2024-02-09","arxiv_id":"2402.06525","repositories_listed":0,"syntology":null},{"url":"/paper/graph-transformers-without-positional","slug":"graph-transformers-without-positional","title":"Graph Transformers without Positional Encodings","date":"2024-01-31","arxiv_id":"2401.17791","repositories_listed":0,"syntology":null},{"url":null,"slug":"gps-graph-contrastive-learning-via-multi","title":"GPS: Graph Contrastive Learning via Multi-scale Augmented Views from Adversarial Pooling","date":"2024-01-29","arxiv_id":"2401.16011","repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-causal-classification-a-comprehensive","title":"Towards Causal Classification: A Comprehensive Study on Graph Neural Networks","date":"2024-01-27","arxiv_id":"2401.15444","repositories_listed":0,"syntology":null},{"url":null,"slug":"emp-effective-multidimensional-persistence","title":"EMP: Effective Multidimensional Persistence for Graph Representation Learning","date":"2024-01-24","arxiv_id":"2401.13713","repositories_listed":0,"syntology":null},{"url":null,"slug":"contrastive-learning-with-negative-sampling","title":"Contrastive Learning with Negative Sampling Correction","date":"2024-01-13","arxiv_id":"2401.08690","repositories_listed":0,"syntology":null},{"url":null,"slug":"accurate-and-scalable-estimation-of-epistemic-1","title":"Accurate and Scalable Estimation of Epistemic Uncertainty for Graph Neural Networks","date":"2024-01-07","arxiv_id":"2401.03350","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-backdoor-attack-against-link-prediction","title":"Effective backdoor attack on graph neural networks in link prediction tasks","date":"2024-01-05","arxiv_id":"2401.02663","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-expressive-power-of-graph-neural","title":"On the Expressive Power of Graph Neural Networks","date":"2024-01-03","arxiv_id":"2401.01626","repositories_listed":0,"syntology":null},{"url":null,"slug":"saliency-aware-regularized-graph-neural","title":"Saliency-Aware Regularized Graph Neural Network","date":"2024-01-01","arxiv_id":"2401.00755","repositories_listed":0,"syntology":null},{"url":null,"slug":"domain-adaptive-graph-classification","title":"Domain Adaptive Graph Classification","date":"2023-12-21","arxiv_id":"2312.13536","repositories_listed":0,"syntology":null},{"url":null,"slug":"model-stealing-attack-against-graph","title":"Model Stealing Attack against Graph Classification with Authenticity, Uncertainty and Diversity","date":"2023-12-18","arxiv_id":"2312.10943","repositories_listed":0,"syntology":null},{"url":null,"slug":"isomorphic-consistent-variational-graph-auto","title":"Isomorphic-Consistent Variational Graph Auto-Encoders for Multi-Level Graph Representation Learning","date":"2023-12-09","arxiv_id":"2312.05519","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-adversarial-robustness-of-graph","title":"On the Adversarial Robustness of Graph Contrastive Learning Methods","date":"2023-11-29","arxiv_id":"2311.17853","repositories_listed":0,"syntology":null},{"url":null,"slug":"disentangling-the-spectral-properties-of-the","title":"Disentangling the Spectral Properties of the Hodge Laplacian: Not All Small Eigenvalues Are Equal","date":"2023-11-24","arxiv_id":"2311.14427","repositories_listed":0,"syntology":null},{"url":null,"slug":"benchmarking-toxic-molecule-classification","title":"Benchmarking Toxic Molecule Classification using Graph Neural Networks and Few Shot Learning","date":"2023-11-22","arxiv_id":"2311.13490","repositories_listed":0,"syntology":null},{"url":null,"slug":"exploring-graph-classification-techniques","title":"Exploring Graph Classification Techniques Under Low Data Constraints: A Comprehensive Study","date":"2023-11-21","arxiv_id":"2311.12737","repositories_listed":0,"syntology":null},{"url":"/paper/going-beyond-persistent-homology-using","slug":"going-beyond-persistent-homology-using","title":"Going beyond persistent homology using persistent homology","date":"2023-11-10","arxiv_id":"2311.06152","repositories_listed":0,"syntology":{"n":4,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":4,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/going-beyond-persistent-homology-using#ran","syntology_url":"https://syntology.ai/paper/2311.06152","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2311.06152"}},"official":null}},{"url":null,"slug":"interpretable-graph-anomaly-detection-using","title":"GRAM: An Interpretable Approach for Graph Anomaly Detection using Gradient Attention Maps","date":"2023-11-10","arxiv_id":"2311.06153","repositories_listed":0,"syntology":null},{"url":null,"slug":"diversified-node-sampling-based-hierarchical","title":"Diversified Node Sampling based Hierarchical Transformer Pooling for Graph Representation Learning","date":"2023-10-31","arxiv_id":"2310.20250","repositories_listed":0,"syntology":null},{"url":null,"slug":"blis-net-classifying-and-analyzing-signals-on","title":"BLIS-Net: Classifying and Analyzing Signals on Graphs","date":"2023-10-26","arxiv_id":"2310.17579","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-causal-disentangled-multi-granularity-graph","title":"A Causal Disentangled Multi-Granularity Graph Classification Method","date":"2023-10-25","arxiv_id":"2310.16256","repositories_listed":0,"syntology":null},{"url":null,"slug":"generative-and-contrastive-paradigms-are","title":"Generative and Contrastive Paradigms Are Complementary for Graph Self-Supervised Learning","date":"2023-10-24","arxiv_id":"2310.15523","repositories_listed":0,"syntology":null},{"url":null,"slug":"self-supervision-meets-kernel-graph-neural","title":"Self-supervision meets kernel graph neural models: From architecture to augmentations","date":"2023-10-17","arxiv_id":"2310.11281","repositories_listed":0,"syntology":null},{"url":null,"slug":"taking-the-human-out-of-decomposition-based-1","title":"Taking the human out of decomposition-based optimization via artificial intelligence: Part I. Learning when to decompose","date":"2023-10-10","arxiv_id":"2310.07068","repositories_listed":0,"syntology":null},{"url":null,"slug":"gdm-dual-mixup-for-graph-classification-with","title":"GDM: Dual Mixup for Graph Classification with Limited Supervision","date":"2023-09-18","arxiv_id":"2309.10134","repositories_listed":0,"syntology":null},{"url":null,"slug":"recovering-missing-node-features-with-local","title":"Recovering Missing Node Features with Local Structure-based Embeddings","date":"2023-09-16","arxiv_id":"2309.09068","repositories_listed":0,"syntology":null},{"url":null,"slug":"mqenet-a-mesh-quality-evaluation-neural","title":"MQENet: A Mesh Quality Evaluation Neural Network Based on Dynamic Graph Attention","date":"2023-09-03","arxiv_id":"2309.01067","repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-long-tailed-recognition-for-graph","title":"Towards Long-Tailed Recognition for Graph Classification via Collaborative Experts","date":"2023-08-31","arxiv_id":"2308.16609","repositories_listed":0,"syntology":null},{"url":null,"slug":"spatial-graph-coarsening-weather-and-weekday","title":"Spatial Graph Coarsening: Weather and Weekday Prediction with London's Bike-Sharing Service using GNN","date":"2023-08-30","arxiv_id":"2308.16122","repositories_listed":0,"syntology":null},{"url":null,"slug":"universal-graph-continual-learning","title":"Universal Graph Continual Learning","date":"2023-08-27","arxiv_id":"2308.13982","repositories_listed":0,"syntology":null},{"url":null,"slug":"cached-operator-reordering-a-unified-view-for","title":"Cached Operator Reordering: A Unified View for Fast GNN Training","date":"2023-08-23","arxiv_id":"2308.12093","repositories_listed":0,"syntology":null},{"url":"/paper/functional-graph-contrastive-learning-of","slug":"functional-graph-contrastive-learning-of","title":"Functional Graph Contrastive Learning of Hyperscanning EEG Reveals Emotional Contagion Evoked by Stereotype-Based Stressors","date":"2023-08-22","arxiv_id":"2308.13546","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-out-of-distribution-generalization-with","title":"Graph Out-of-Distribution Generalization with Controllable Data Augmentation","date":"2023-08-16","arxiv_id":"2308.08344","repositories_listed":0,"syntology":null},{"url":"/paper/generalizing-topological-graph-neural","slug":"generalizing-topological-graph-neural","title":"Weisfeiler and Lehman Go Paths: Learning Topological Features via Path Complexes","date":"2023-08-13","arxiv_id":"2308.06838","repositories_listed":0,"syntology":null}],"record_sha256":"174f70cb1d2c0d1bd678bd304adef582d677a5903c1ad34aeae0b02fd2110ffc","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}