{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/task/node-classification/papers/3","list_of":"/task/node-classification","task":"Node Classification","archive":{"snapshot":"2025-07-28"},"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"syntology_read_at":"2026-09-28T10:30:06+00:00","order":"archive","order_definition":"repositories listed in the archive (most first), then date (newest first), then slug","page":3,"pages_in_order":19,"rows_per_page":100,"rows":[201,300],"of":1860,"counts":{"archive_papers_tagged":1860,"with_a_code_link":991,"where_syntology_ran_a_sample":305,"not_listed_spam_title":0,"listed":1860,"listed_where_code_ran":305,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":256,"every_run_a_failure_of_syntologys_instrument":49,"listed_with_a_run_with_no_instrument_failure":256,"listed_every_run_a_failure_of_syntologys_instrument":49,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"first_page":"/task/node-classification","prev":"/task/node-classification/papers/2","next":"/task/node-classification/papers/4","papers":[{"url":"/paper/gt-svq-a-linear-time-graph-transformer-for","slug":"gt-svq-a-linear-time-graph-transformer-for","title":"GT-SVQ: A Linear-Time Graph Transformer for Node Classification Using Spiking Vector Quantization","date":"2025-04-16","arxiv_id":"2504.11840","repositories_listed":1,"syntology":null},{"url":"/paper/integrating-structural-and-semantic-signals","slug":"integrating-structural-and-semantic-signals","title":"Integrating Structural and Semantic Signals in Text-Attributed Graphs with BiGTex","date":"2025-04-16","arxiv_id":"2504.12474","repositories_listed":1,"syntology":null},{"url":"/paper/trajectory-encoding-temporal-graph-networks","slug":"trajectory-encoding-temporal-graph-networks","title":"Trajectory Encoding Temporal Graph Networks","date":"2025-04-15","arxiv_id":"2504.11386","repositories_listed":1,"syntology":null},{"url":"/paper/gotham-graph-class-incremental-learning","slug":"gotham-graph-class-incremental-learning","title":"GOTHAM: Graph Class Incremental Learning Framework under Weak Supervision","date":"2025-04-07","arxiv_id":"2504.04954","repositories_listed":1,"syntology":null},{"url":"/paper/graph-attention-for-heterogeneous-graphs-with","slug":"graph-attention-for-heterogeneous-graphs-with","title":"Graph Attention for Heterogeneous Graphs with Positional Encoding","date":"2025-04-03","arxiv_id":"2504.02938","repositories_listed":1,"syntology":null},{"url":"/paper/efficient-and-privacy-preserved-link","slug":"efficient-and-privacy-preserved-link","title":"Efficient and Privacy-Preserved Link Prediction via Condensed Graphs","date":"2025-03-15","arxiv_id":"2503.12156","repositories_listed":1,"syntology":null},{"url":"/paper/weighted-graph-structure-learning-with","slug":"weighted-graph-structure-learning-with","title":"Weighted Graph Structure Learning with Attention Denoising for Node Classification","date":"2025-03-15","arxiv_id":"2503.12157","repositories_listed":1,"syntology":null},{"url":"/paper/towards-quantifying-long-range-interactions","slug":"towards-quantifying-long-range-interactions","title":"Towards Quantifying Long-Range Interactions in Graph Machine Learning: a Large Graph Dataset and a Measurement","date":"2025-03-12","arxiv_id":"2503.09008","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/towards-quantifying-long-range-interactions#ran","syntology_url":"https://syntology.ai/paper/2503.09008","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2503.09008"}},"official":{"repos":["leonresearch/city-networks"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/adversarial-network-embedding-with","slug":"adversarial-network-embedding-with","title":"Adversarial network embedding with bootstrapped representations for sparse networks","date":"2025-03-03","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/how-low-can-you-go-searching-for-the","slug":"how-low-can-you-go-searching-for-the","title":"How Low Can You Go? Searching for the Intrinsic Dimensionality of Complex Networks using Metric Node Embeddings","date":"2025-03-03","arxiv_id":"2503.01723","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/how-low-can-you-go-searching-for-the#ran","syntology_url":"https://syntology.ai/paper/2503.01723","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2503.01723"}},"official":{"repos":["AndreasLF/HowLowCanYouGo"],"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/hierarchical-graph-sampling-based-minibatch","slug":"hierarchical-graph-sampling-based-minibatch","title":"Hierarchical graph sampling based minibatch learning with chain preservation and variance reduction","date":"2025-03-02","arxiv_id":"2503.00860","repositories_listed":1,"syntology":null},{"url":"/paper/exploring-graph-tasks-with-pure-llms-a","slug":"exploring-graph-tasks-with-pure-llms-a","title":"Exploring Graph Tasks with Pure LLMs: A Comprehensive Benchmark and Investigation","date":"2025-02-26","arxiv_id":"2502.18771","repositories_listed":1,"syntology":{"n":12,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":0,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/exploring-graph-tasks-with-pure-llms-a#ran","syntology_url":"https://syntology.ai/paper/2502.18771","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2502.18771"}},"official":{"repos":["myflashbarry/LLM-benchmarking"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/towards-mechanistic-interpretability-of-graph","slug":"towards-mechanistic-interpretability-of-graph","title":"Towards Mechanistic Interpretability of Graph Transformers via Attention Graphs","date":"2025-02-17","arxiv_id":"2502.12352","repositories_listed":1,"syntology":null},{"url":"/paper/lisa-leveraging-link-recommender-to-attack","slug":"lisa-leveraging-link-recommender-to-attack","title":"LiSA: Leveraging Link Recommender to Attack Graph Neural Networks via Subgraph Injection","date":"2025-02-13","arxiv_id":"2502.09271","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/gnns-getting-comfy-community-and-feature","slug":"gnns-getting-comfy-community-and-feature","title":"GNNs Getting ComFy: Community and Feature Similarity Guided Rewiring","date":"2025-02-07","arxiv_id":"2502.04891","repositories_listed":1,"syntology":{"n":11,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":7,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 7 unverified","sample_list":"/paper/gnns-getting-comfy-community-and-feature#ran","syntology_url":"https://syntology.ai/paper/2502.04891","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2502.04891"}},"official":{"repos":["RelationalML/ComFy"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":7,"ran_from_kinds":["official"]}}},{"url":"/paper/a-comprehensive-analysis-on-llm-based-node","slug":"a-comprehensive-analysis-on-llm-based-node","title":"When Do LLMs Help With Node Classification? A Comprehensive Analysis","date":"2025-02-02","arxiv_id":"2502.00829","repositories_listed":1,"syntology":null},{"url":"/paper/leveraging-joint-predictive-embedding-and","slug":"leveraging-joint-predictive-embedding-and","title":"Leveraging Joint Predictive Embedding and Bayesian Inference in Graph Self Supervised Learning","date":"2025-02-02","arxiv_id":"2502.01684","repositories_listed":1,"syntology":null},{"url":"/paper/random-walk-guided-hyperbolic-graph","slug":"random-walk-guided-hyperbolic-graph","title":"Random Walk Guided Hyperbolic Graph Distillation","date":"2025-01-26","arxiv_id":"2501.15696","repositories_listed":1,"syntology":null},{"url":"/paper/adaptive-spatiotemporal-augmentation-for","slug":"adaptive-spatiotemporal-augmentation-for","title":"Adaptive Spatiotemporal Augmentation for Improving Dynamic Graph Learning","date":"2025-01-17","arxiv_id":"2501.10010","repositories_listed":1,"syntology":null},{"url":"/paper/enhancing-graph-representation-learning-with-1","slug":"enhancing-graph-representation-learning-with-1","title":"Enhancing Graph Representation Learning with Localized Topological Features","date":"2025-01-15","arxiv_id":"2501.09178","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/enhancing-graph-representation-learning-with-1#ran","syntology_url":"https://syntology.ai/paper/2501.09178","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2501.09178"}},"official":{"repos":["pkuyzy/TLC-GNN"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/normalize-then-propagate-efficient","slug":"normalize-then-propagate-efficient","title":"Normalize Then Propagate: Efficient Homophilous Regularization for Few-shot Semi-Supervised Node Classification","date":"2025-01-15","arxiv_id":"2501.08581","repositories_listed":1,"syntology":{"n":3,"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/normalize-then-propagate-efficient#ran","syntology_url":"https://syntology.ai/paper/2501.08581","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2501.08581"}},"official":{"repos":["pallaksch/normprop"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/deltagnn-graph-neural-network-with","slug":"deltagnn-graph-neural-network-with","title":"DeltaGNN: Graph Neural Network with Information Flow Control","date":"2025-01-10","arxiv_id":"2501.06002","repositories_listed":1,"syntology":null},{"url":"/paper/graph-based-multimodal-and-multi-view","slug":"graph-based-multimodal-and-multi-view","title":"Graph-Based Multimodal and Multi-view Alignment for Keystep Recognition","date":"2025-01-07","arxiv_id":"2501.04121","repositories_listed":1,"syntology":null},{"url":"/paper/enhancing-trustworthiness-of-graph-neural","slug":"enhancing-trustworthiness-of-graph-neural","title":"Enhancing Trustworthiness of Graph Neural Networks with Rank-Based Conformal Training","date":"2025-01-06","arxiv_id":"2501.02767","repositories_listed":1,"syntology":null},{"url":"/paper/diffgraph-heterogeneous-graph-diffusion-model","slug":"diffgraph-heterogeneous-graph-diffusion-model","title":"DiffGraph: Heterogeneous Graph Diffusion Model","date":"2025-01-04","arxiv_id":"2501.02313","repositories_listed":1,"syntology":null},{"url":"/paper/a-probabilistic-model-for-node-classification","slug":"a-probabilistic-model-for-node-classification","title":"A Probabilistic Model for Node Classification in Directed Graphs","date":"2025-01-03","arxiv_id":"2501.01630","repositories_listed":1,"syntology":null},{"url":"/paper/attention-driven-metapath-encoding-in","slug":"attention-driven-metapath-encoding-in","title":"Attention-Driven Metapath Encoding in Heterogeneous Graphs","date":"2024-12-30","arxiv_id":"2412.20678","repositories_listed":1,"syntology":null},{"url":"/paper/data-driven-self-supervised-graph","slug":"data-driven-self-supervised-graph","title":"Data-Driven Self-Supervised Graph Representation Learning","date":"2024-12-24","arxiv_id":"2412.18316","repositories_listed":1,"syntology":null},{"url":"/paper/lase-learned-adjacency-spectral-embeddings","slug":"lase-learned-adjacency-spectral-embeddings","title":"LASE: Learned Adjacency Spectral Embeddings","date":"2024-12-23","arxiv_id":"2412.17734","repositories_listed":1,"syntology":null},{"url":"/paper/understanding-when-and-why-graph-attention","slug":"understanding-when-and-why-graph-attention","title":"Graph Attention is Not Always Beneficial: A Theoretical Analysis of Graph Attention Mechanisms via Contextual Stochastic Block Models","date":"2024-12-20","arxiv_id":"2412.15496","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/understanding-when-and-why-graph-attention#ran","syntology_url":"https://syntology.ai/paper/2412.15496","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2412.15496"}},"official":{"repos":["mztmzt/gat_csbm"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/tokenphormer-structure-aware-multi-token","slug":"tokenphormer-structure-aware-multi-token","title":"Tokenphormer: Structure-aware Multi-token Graph Transformer for Node Classification","date":"2024-12-19","arxiv_id":"2412.15302","repositories_listed":1,"syntology":null},{"url":"/paper/cost-effective-label-free-node-classification","slug":"cost-effective-label-free-node-classification","title":"Leveraging Large Language Models for Effective Label-free Node Classification in Text-Attributed Graphs","date":"2024-12-16","arxiv_id":"2412.11983","repositories_listed":1,"syntology":null},{"url":"/paper/agmixup-adaptive-graph-mixup-for-semi","slug":"agmixup-adaptive-graph-mixup-for-semi","title":"AGMixup: Adaptive Graph Mixup for Semi-supervised Node Classification","date":"2024-12-11","arxiv_id":"2412.08144","repositories_listed":1,"syntology":null},{"url":"/paper/edge-splitting-mlp-node-classification-on","slug":"edge-splitting-mlp-node-classification-on","title":"Edge-Splitting MLP: Node Classification on Homophilic and Heterophilic Graphs without Message Passing","date":"2024-12-11","arxiv_id":"2412.08310","repositories_listed":1,"syntology":null},{"url":"/paper/mixture-of-experts-meets-decoupled-message","slug":"mixture-of-experts-meets-decoupled-message","title":"Mixture of Experts Meets Decoupled Message Passing: Towards General and Adaptive Node Classification","date":"2024-12-11","arxiv_id":"2412.08193","repositories_listed":1,"syntology":null},{"url":"/paper/a-novel-robust-integrating-method-by-high","slug":"a-novel-robust-integrating-method-by-high","title":"A novel robust integrating method by high-order proximity for self-supervised attribute network embedding","date":"2024-12-10","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/hyperedge-anomaly-detection-with-hypergraph","slug":"hyperedge-anomaly-detection-with-hypergraph","title":"Hyperedge Anomaly Detection with Hypergraph Neural Network","date":"2024-12-07","arxiv_id":"2412.05641","repositories_listed":1,"syntology":null},{"url":"/paper/graph-neural-networks-need-cluster-normalize","slug":"graph-neural-networks-need-cluster-normalize","title":"Graph Neural Networks Need Cluster-Normalize-Activate Modules","date":"2024-12-05","arxiv_id":"2412.04064","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/graph-neural-networks-need-cluster-normalize#ran","syntology_url":"https://syntology.ai/paper/2412.04064","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2412.04064"}},"official":{"repos":["ml-research/cna_modules"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/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/sa-gnas-seed-architecture-expansion-for","slug":"sa-gnas-seed-architecture-expansion-for","title":"SA-GNAS: Seed Architecture Expansion for Efficient Large-scale Graph Neural Architecture Search","date":"2024-12-03","arxiv_id":"2412.02196","repositories_listed":1,"syntology":null},{"url":"/paper/from-chebnet-to-chebgibbsnet-1","slug":"from-chebnet-to-chebgibbsnet-1","title":"From ChebNet to ChebGibbsNet","date":"2024-12-02","arxiv_id":"2412.01789","repositories_listed":1,"syntology":null},{"url":"/paper/exact-certification-of-graph-neural-networks","slug":"exact-certification-of-graph-neural-networks","title":"Exact Certification of (Graph) Neural Networks Against Label Poisoning","date":"2024-11-30","arxiv_id":"2412.00537","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/exact-certification-of-graph-neural-networks#ran","syntology_url":"https://syntology.ai/paper/2412.00537","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2412.00537"}},"official":{"repos":["saper0/qpcert"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/scale-invariance-of-graph-neural-networks","slug":"scale-invariance-of-graph-neural-networks","title":"Scale Invariance of Graph Neural Networks","date":"2024-11-28","arxiv_id":"2411.19392","repositories_listed":1,"syntology":null},{"url":"/paper/correlation-aware-graph-convolutional","slug":"correlation-aware-graph-convolutional","title":"Correlation-Aware Graph Convolutional Networks for Multi-Label Node Classification","date":"2024-11-26","arxiv_id":"2411.17350","repositories_listed":1,"syntology":null},{"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/contrast-similarity-aware-dual-pathway-mamba","slug":"contrast-similarity-aware-dual-pathway-mamba","title":"Contrast Similarity-Aware Dual-Pathway Mamba for Multivariate Time Series Node Classification","date":"2024-11-19","arxiv_id":"2411.12222","repositories_listed":1,"syntology":null},{"url":"/paper/graph-as-a-feature-improving-node","slug":"graph-as-a-feature-improving-node","title":"Graph as a feature: improving node classification with non-neural graph-aware logistic regression","date":"2024-11-19","arxiv_id":"2411.12330","repositories_listed":1,"syntology":null},{"url":"/paper/from-primes-to-paths-enabling-fast-multi","slug":"from-primes-to-paths-enabling-fast-multi","title":"From Primes to Paths: Enabling Fast Multi-Relational Graph Analysis","date":"2024-11-17","arxiv_id":"2411.11149","repositories_listed":1,"syntology":null},{"url":"/paper/training-a-label-noise-resistant-gnn-with","slug":"training-a-label-noise-resistant-gnn-with","title":"Training a Label-Noise-Resistant GNN with Reduced Complexity","date":"2024-11-17","arxiv_id":"2411.11020","repositories_listed":1,"syntology":null},{"url":"/paper/scalenet-scale-invariance-learning-in","slug":"scalenet-scale-invariance-learning-in","title":"ScaleNet: Scale Invariance Learning in Directed Graphs","date":"2024-11-13","arxiv_id":"2411.08758","repositories_listed":1,"syntology":null},{"url":"/paper/an-efficient-memory-module-for-graph-few-shot","slug":"an-efficient-memory-module-for-graph-few-shot","title":"An Efficient Memory Module for Graph Few-Shot Class-Incremental Learning","date":"2024-11-11","arxiv_id":"2411.06659","repositories_listed":1,"syntology":null},{"url":"/paper/higher-order-gnns-meet-efficiency-sparse","slug":"higher-order-gnns-meet-efficiency-sparse","title":"Higher-Order GNNs Meet Efficiency: Sparse Sobolev Graph Neural Networks","date":"2024-11-07","arxiv_id":"2411.04570","repositories_listed":1,"syntology":null},{"url":"/paper/enhancing-the-expressivity-of-temporal-graph","slug":"enhancing-the-expressivity-of-temporal-graph","title":"Enhancing the Expressivity of Temporal Graph Networks through Source-Target Identification","date":"2024-11-06","arxiv_id":"2411.03596","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":2,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/enhancing-the-expressivity-of-temporal-graph#ran","syntology_url":"https://syntology.ai/paper/2411.03596","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2411.03596"}},"official":{"repos":["batjandra/TGNv2-NeurReps"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/high-pass-graph-convolutional-network-for","slug":"high-pass-graph-convolutional-network-for","title":"High-Pass Graph Convolutional Network for Enhanced Anomaly Detection: A Novel Approach","date":"2024-11-04","arxiv_id":"2411.01817","repositories_listed":1,"syntology":null},{"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/fast-graph-sharpness-aware-minimization-for","slug":"fast-graph-sharpness-aware-minimization-for","title":"Fast Graph Sharpness-Aware Minimization for Enhancing and Accelerating Few-Shot Node Classification","date":"2024-10-22","arxiv_id":"2410.16845","repositories_listed":1,"syntology":{"n":5,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":5,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/fast-graph-sharpness-aware-minimization-for#ran","syntology_url":"https://syntology.ai/paper/2410.16845","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.16845"}},"official":{"repos":["draym28/fgsam_neurips24"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/lego-learn-label-efficient-graph-open-set","slug":"lego-learn-label-efficient-graph-open-set","title":"LEGO-Learn: Label-Efficient Graph Open-Set Learning","date":"2024-10-21","arxiv_id":"2410.16386","repositories_listed":1,"syntology":null},{"url":"/paper/lex-gnn-label-exploring-graph-neural-network","slug":"lex-gnn-label-exploring-graph-neural-network","title":"LEX-GNN: Label-Exploring Graph Neural Network for Accurate Fraud Detection","date":"2024-10-21","arxiv_id":null,"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/improving-graph-neural-networks-by-learning","slug":"improving-graph-neural-networks-by-learning","title":"Improving Graph Neural Networks by Learning Continuous Edge Directions","date":"2024-10-18","arxiv_id":"2410.14109","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/replay-and-forget-free-graph-class","slug":"replay-and-forget-free-graph-class","title":"Replay-and-Forget-Free Graph Class-Incremental Learning: A Task Profiling and Prompting Approach","date":"2024-10-14","arxiv_id":"2410.10341","repositories_listed":1,"syntology":{"n":4,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":1,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/replay-and-forget-free-graph-class#ran","syntology_url":"https://syntology.ai/paper/2410.10341","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.10341"}},"official":{"repos":["mala-lab/tpp"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/dynamic-and-textual-graph-generation-via","slug":"dynamic-and-textual-graph-generation-via","title":"LLM-Based Multi-Agent Systems are Scalable Graph Generative Models","date":"2024-10-13","arxiv_id":"2410.09824","repositories_listed":1,"syntology":null},{"url":"/paper/diffusing-to-the-top-boost-graph-neural","slug":"diffusing-to-the-top-boost-graph-neural","title":"Diffusing to the Top: Boost Graph Neural Networks with Minimal Hyperparameter Tuning","date":"2024-10-08","arxiv_id":"2410.05697","repositories_listed":1,"syntology":null},{"url":"/paper/fedgraph-a-research-library-and-benchmark-for","slug":"fedgraph-a-research-library-and-benchmark-for","title":"FedGraph: A Research Library and Benchmark for Federated Graph Learning","date":"2024-10-08","arxiv_id":"2410.06340","repositories_listed":1,"syntology":null},{"url":"/paper/duognn-topology-aware-graph-neural-network","slug":"duognn-topology-aware-graph-neural-network","title":"DuoGNN: Topology-aware Graph Neural Network with Homophily and Heterophily Interaction-Decoupling","date":"2024-09-29","arxiv_id":"2409.19616","repositories_listed":1,"syntology":null},{"url":"/paper/benchmarking-graph-conformal-prediction","slug":"benchmarking-graph-conformal-prediction","title":"Conformal Prediction: A Theoretical Note and Benchmarking Transductive Node Classification in Graphs","date":"2024-09-26","arxiv_id":"2409.18332","repositories_listed":1,"syntology":null},{"url":"/paper/preventing-representational-rank-collapse-in","slug":"preventing-representational-rank-collapse-in","title":"Preventing Representational Rank Collapse in MPNNs by Splitting the Computational Graph","date":"2024-09-17","arxiv_id":"2409.11504","repositories_listed":1,"syntology":null},{"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/information-extraction-from-visually-rich-1","slug":"information-extraction-from-visually-rich-1","title":"Information Extraction from Visually Rich Documents Using Directed Weighted Graph Neural Network","date":"2024-09-11","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/learning-personalized-scoping-for-graph","slug":"learning-personalized-scoping-for-graph","title":"Mixture of Scope Experts at Test: Generalizing Deeper Graph Neural Networks with Shallow Variants","date":"2024-09-11","arxiv_id":"2409.06998","repositories_listed":1,"syntology":{"n":10,"n_ran":10,"n_constructed":0,"n_ran_checked":6,"n_instrument":4,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":10,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 4 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/learning-personalized-scoping-for-graph#ran","syntology_url":"https://syntology.ai/paper/2409.06998","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2409.06998"}},"official":{"repos":["hydrapse/moscat"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/generalized-learning-of-coefficients-in","slug":"generalized-learning-of-coefficients-in","title":"Generalized Learning of Coefficients in Spectral Graph Convolutional Networks","date":"2024-09-07","arxiv_id":"2409.04813","repositories_listed":1,"syntology":null},{"url":"/paper/cuq-gnn-committee-based-graph-uncertainty","slug":"cuq-gnn-committee-based-graph-uncertainty","title":"CUQ-GNN: Committee-based Graph Uncertainty Quantification using Posterior Networks","date":"2024-09-06","arxiv_id":"2409.04159","repositories_listed":1,"syntology":null},{"url":"/paper/reproducibility-study-of-learning-fair-graph","slug":"reproducibility-study-of-learning-fair-graph","title":"Reproducibility Study Of Learning Fair Graph Representations Via Automated Data Augmentations","date":"2024-08-31","arxiv_id":"2409.00421","repositories_listed":1,"syntology":null},{"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/sympgnns-symplectic-graph-neural-networks-for","slug":"sympgnns-symplectic-graph-neural-networks-for","title":"SympGNNs: Symplectic Graph Neural Networks for identifiying high-dimensional Hamiltonian systems and node classification","date":"2024-08-29","arxiv_id":"2408.16698","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/sympgnns-symplectic-graph-neural-networks-for#ran","syntology_url":"https://syntology.ai/paper/2408.16698","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2408.16698"}},"official":{"repos":["alanjohnvarghese/la-sympgnn"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/federated-graph-learning-with-structure-proxy","slug":"federated-graph-learning-with-structure-proxy","title":"Federated Graph Learning with Structure Proxy Alignment","date":"2024-08-18","arxiv_id":"2408.09393","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/joint-graph-rewiring-and-feature-denoising","slug":"joint-graph-rewiring-and-feature-denoising","title":"Joint Graph Rewiring and Feature Denoising via Spectral Resonance","date":"2024-08-13","arxiv_id":"2408.07191","repositories_listed":1,"syntology":{"n":9,"n_ran":7,"n_constructed":0,"n_ran_checked":2,"n_instrument":5,"n_unverified":2,"n_honours":0,"n_violates":2,"n_no_contract":0,"n_pointer_only":9,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 2 violated, 0 with no contract checked; 5 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/joint-graph-rewiring-and-feature-denoising#ran","syntology_url":"https://syntology.ai/paper/2408.07191","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2408.07191"}},"official":{"repos":["jlinki/JDR"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/bootstrap-latents-of-nodes-and-neighbors-for","slug":"bootstrap-latents-of-nodes-and-neighbors-for","title":"Bootstrap Latents of Nodes and Neighbors for Graph Self-Supervised Learning","date":"2024-08-09","arxiv_id":"2408.05087","repositories_listed":1,"syntology":{"n":11,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":1,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/bootstrap-latents-of-nodes-and-neighbors-for#ran","syntology_url":"https://syntology.ai/paper/2408.05087","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2408.05087"}},"official":{"repos":["cloudy1225/blnn"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/wav2graph-a-framework-for-supervised-learning","slug":"wav2graph-a-framework-for-supervised-learning","title":"wav2graph: A Framework for Supervised Learning Knowledge Graph from Speech","date":"2024-08-08","arxiv_id":"2408.04174","repositories_listed":1,"syntology":null},{"url":"/paper/deep-generative-models-for-subgraph","slug":"deep-generative-models-for-subgraph","title":"Deep Generative Models for Subgraph Prediction","date":"2024-08-07","arxiv_id":"2408.04053","repositories_listed":1,"syntology":null},{"url":"/paper/derivation-of-back-propagation-for-graph","slug":"derivation-of-back-propagation-for-graph","title":"Derivation of Back-propagation for Graph Convolutional Networks using Matrix Calculus and its Application to Explainable Artificial Intelligence","date":"2024-08-02","arxiv_id":"2408.01408","repositories_listed":1,"syntology":null},{"url":"/paper/a-scalable-tool-for-analyzing-genomic","slug":"a-scalable-tool-for-analyzing-genomic","title":"A Scalable Tool For Analyzing Genomic Variants Of Humans Using Knowledge Graphs and Machine Learning","date":"2024-07-30","arxiv_id":"2407.20879","repositories_listed":1,"syntology":null},{"url":"/paper/unigap-a-universal-and-adaptive-graph","slug":"unigap-a-universal-and-adaptive-graph","title":"UniGAP: A Universal and Adaptive Graph Upsampling Approach to Mitigate Over-Smoothing in Node Classification Tasks","date":"2024-07-28","arxiv_id":"2407.19420","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/nc-ncd-novel-class-discovery-for-node","slug":"nc-ncd-novel-class-discovery-for-node","title":"NC-NCD: Novel Class Discovery for Node Classification","date":"2024-07-25","arxiv_id":"2407.17816","repositories_listed":1,"syntology":null},{"url":"/paper/meta-gps-enhancing-graph-meta-learning-with","slug":"meta-gps-enhancing-graph-meta-learning-with","title":"Meta-GPS++: Enhancing Graph Meta-Learning with Contrastive Learning and Self-Training","date":"2024-07-20","arxiv_id":"2407.14732","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/geomix-towards-geometry-aware-data","slug":"geomix-towards-geometry-aware-data","title":"GeoMix: Towards Geometry-Aware Data Augmentation","date":"2024-07-15","arxiv_id":"2407.10681","repositories_listed":1,"syntology":null},{"url":"/paper/when-heterophily-meets-heterogeneity-new","slug":"when-heterophily-meets-heterogeneity-new","title":"When Heterophily Meets Heterogeneity: Challenges and a New Large-Scale Graph Benchmark","date":"2024-07-15","arxiv_id":"2407.10916","repositories_listed":1,"syntology":null},{"url":"/paper/learning-a-mini-batch-graph-transformer-via","slug":"learning-a-mini-batch-graph-transformer-via","title":"Learning a Mini-batch Graph Transformer via Two-stage Interaction Augmentation","date":"2024-07-13","arxiv_id":"2407.09904","repositories_listed":1,"syntology":null},{"url":"/paper/slidegcd-slide-based-graph-collaborative","slug":"slidegcd-slide-based-graph-collaborative","title":"SlideGCD: Slide-based Graph Collaborative Training with Knowledge Distillation for Whole Slide Image Classification","date":"2024-07-12","arxiv_id":"2407.08968","repositories_listed":1,"syntology":null},{"url":"/paper/unsupervised-graph-representation-learning","slug":"unsupervised-graph-representation-learning","title":"Unsupervised Graph Representation Learning with Inductive Shallow Node Embedding","date":"2024-07-12","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/stage-simplified-text-attributed-graph","slug":"stage-simplified-text-attributed-graph","title":"STAGE: Simplified Text-Attributed Graph Embeddings Using Pre-trained LLMs","date":"2024-07-10","arxiv_id":"2407.12860","repositories_listed":1,"syntology":null},{"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/next-level-message-passing-with-hierarchical","slug":"next-level-message-passing-with-hierarchical","title":"Next Level Message-Passing with Hierarchical Support Graphs","date":"2024-06-22","arxiv_id":"2406.15852","repositories_listed":1,"syntology":{"n":10,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":2,"n_no_contract":5,"n_pointer_only":6,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 2 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/next-level-message-passing-with-hierarchical#ran","syntology_url":"https://syntology.ai/paper/2406.15852","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.15852"}},"official":{"repos":["carlosinator/support-graphs"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/taglas-an-atlas-of-text-attributed-graph","slug":"taglas-an-atlas-of-text-attributed-graph","title":"TAGLAS: An atlas of text-attributed graph datasets in the era of large graph and language models","date":"2024-06-20","arxiv_id":"2406.14683","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/taglas-an-atlas-of-text-attributed-graph#ran","syntology_url":"https://syntology.ai/paper/2406.14683","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.14683"}},"official":{"repos":["jiaruifeng/taglas"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}}],"record_sha256":"e02939f64edcbf3d97c55f257b5a4cd0fa386c73eff5d61ed4dd0db4645338ea","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}