{"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":"/method/lapeigen","slug":"lapeigen","name":"LapEigen","full_name":"Laplacian EigenMap","full_name_withheld":false,"description_markdown":null,"description_state":"absent","introduced_year":null,"introduced_by":{"title":"Laplacian Eigenmaps and Spectral Techniques for Embedding and Clustering","paper":"/paper/laplacian-eigenmaps-and-spectral-techniques","first_author":"Mikhail Belkin and Partha Niyogi","n_authors":1,"url_abs":null,"archive_paper_url":"https://paperswithcode.com/paper/laplacian-eigenmaps-and-spectral-techniques"},"source":{"url":"https://ieeexplore.ieee.org/abstract/document/6789755","title":"Laplacian Eigenmaps and Spectral Techniques for Embedding and Clustering","url_on_a_paper_host":true},"code_snippet_url":null,"code_snippet_url_on_a_code_host":false,"categories":[{"area":"Graphs","area_id":"graphs","collection":"Graph Embeddings","url":"/methods/category/graph-embeddings","pwc_aliases":[]}],"n_papers_tagged":297,"archive_num_papers":297,"papers_newest_first":[{"paper":null,"slug":"2506-08298","title":"H$^2$GFM: Towards unifying Homogeneity and Heterogeneity on Text-Attributed Graphs","date":"2025-06-10","arxiv_id":"2506.08298","n_code_links":0,"syntology":null},{"paper":null,"slug":"hgformer-a-hierarchical-graph-transformer","title":"HGFormer: A Hierarchical Graph Transformer Framework for Two-Stage Colonel Blotto Games via Reinforcement Learning","date":"2025-06-10","arxiv_id":"2506.08580","n_code_links":0,"syntology":null},{"paper":null,"slug":"quantum-graph-transformer-for-nlp-sentiment","title":"Quantum Graph Transformer for NLP Sentiment Classification","date":"2025-06-09","arxiv_id":"2506.07937","n_code_links":0,"syntology":null},{"paper":"/paper/opengt-a-comprehensive-benchmark-for-graph","slug":"opengt-a-comprehensive-benchmark-for-graph","title":"OpenGT: A Comprehensive Benchmark For Graph Transformers","date":"2025-06-05","arxiv_id":"2506.04765","n_code_links":1,"syntology":null},{"paper":"/paper/learning-pyramid-structured-long-range-1","slug":"learning-pyramid-structured-long-range-1","title":"Learning Pyramid-structured Long-range Dependencies for 3D Human Pose Estimation","date":"2025-06-03","arxiv_id":"2506.02853","n_code_links":1,"syntology":null},{"paper":"/paper/2505-10960","slug":"2505-10960","title":"Relational Graph Transformer","date":"2025-05-16","arxiv_id":"2505.10960","n_code_links":1,"syntology":{"ran":3,"of":4,"n_ran_checked":3,"n_instrument":0,"unverified":1,"pointer_only":0,"phrase":"3 ran (of which 1 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","official":{"repos":["snap-stanford/relgt"],"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":["found_in_text","official"]}}},{"paper":null,"slug":"all-you-need-is-synthetic-task-augmentation","title":"All You Need Is Synthetic Task Augmentation","date":"2025-05-15","arxiv_id":"2505.10120","n_code_links":0,"syntology":null},{"paper":null,"slug":"sar-gtr-attributed-scattering-information","title":"SAR-GTR: Attributed Scattering Information Guided SAR Graph Transformer Recognition Algorithm","date":"2025-05-13","arxiv_id":"2505.08547","n_code_links":0,"syntology":null},{"paper":"/paper/structural-temporal-coupling-anomaly","slug":"structural-temporal-coupling-anomaly","title":"Structural-Temporal Coupling Anomaly Detection with Dynamic Graph Transformer","date":"2025-05-13","arxiv_id":"2505.08330","n_code_links":1,"syntology":null},{"paper":"/paper/fused3s-fast-sparse-attention-on-tensor-cores","slug":"fused3s-fast-sparse-attention-on-tensor-cores","title":"Fused3S: Fast Sparse Attention on Tensor Cores","date":"2025-05-12","arxiv_id":"2505.08098","n_code_links":1,"syntology":null},{"paper":"/paper/mitigating-degree-bias-in-graph","slug":"mitigating-degree-bias-in-graph","title":"Mitigating Degree Bias in Graph Representation Learning with Learnable Structural Augmentation and Structural Self-Attention","date":"2025-04-21","arxiv_id":"2504.15075","n_code_links":1,"syntology":null},{"paper":null,"slug":"haeccity-open-vocabulary-scene-understanding","title":"HAECcity: Open-Vocabulary Scene Understanding of City-Scale Point Clouds with Superpoint Graph Clustering","date":"2025-04-18","arxiv_id":"2504.13590","n_code_links":0,"syntology":null},{"paper":"/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","n_code_links":1,"syntology":null},{"paper":null,"slug":"towards-a-universal-graph-structural-encoder","title":"Towards A Universal Graph Structural Encoder","date":"2025-04-15","arxiv_id":"2504.10917","n_code_links":0,"syntology":null},{"paper":null,"slug":"ensemble-enhanced-graph-autoencoder-with-gat","title":"Ensemble-Enhanced Graph Autoencoder with GAT and Transformer-Based Encoders for Robust Fault Diagnosis","date":"2025-04-13","arxiv_id":"2504.09427","n_code_links":0,"syntology":null},{"paper":"/paper/nettag-a-multimodal-rtl-and-layout-aligned","slug":"nettag-a-multimodal-rtl-and-layout-aligned","title":"NetTAG: A Multimodal RTL-and-Layout-Aligned Netlist Foundation Model via Text-Attributed Graph","date":"2025-04-12","arxiv_id":"2504.09260","n_code_links":1,"syntology":null},{"paper":null,"slug":"leveraging-auto-distillation-and-generative","title":"Leveraging Auto-Distillation and Generative Self-Supervised Learning in Residual Graph Transformers for Enhanced Recommender Systems","date":"2025-04-08","arxiv_id":"2504.10500","n_code_links":0,"syntology":null},{"paper":null,"slug":"graphs-are-everywhere-psst-in-music","title":"Graphs are everywhere -- Psst! In Music Recommendation too","date":"2025-04-03","arxiv_id":"2504.02598","n_code_links":0,"syntology":null},{"paper":null,"slug":"graph-transformer-based-flood-susceptibility","title":"Graph Transformer-Based Flood Susceptibility Mapping: Application to the French Riviera and Railway Infrastructure Under Climate Change","date":"2025-03-31","arxiv_id":"2504.03727","n_code_links":0,"syntology":null},{"paper":null,"slug":"tacticexpert-spatial-temporal-graph-language","title":"TacticExpert: Spatial-Temporal Graph Language Model for Basketball Tactics","date":"2025-03-13","arxiv_id":"2503.10722","n_code_links":0,"syntology":null},{"paper":null,"slug":"fmchs-advancing-traditional-chinese-medicine","title":"FMCHS: Advancing Traditional Chinese Medicine Herb Recommendation with Fusion of Multiscale Correlations of Herbs and Symptoms","date":"2025-03-07","arxiv_id":"2503.05167","n_code_links":0,"syntology":null},{"paper":"/paper/graph-transformer-with-disease-subgraph","slug":"graph-transformer-with-disease-subgraph","title":"Graph Transformer with Disease Subgraph Positional Encoding for Improved Comorbidity Prediction","date":"2025-03-04","arxiv_id":"2503.03046","n_code_links":1,"syntology":null},{"paper":"/paper/co-mtp-a-cooperative-trajectory-prediction","slug":"co-mtp-a-cooperative-trajectory-prediction","title":"Co-MTP: A Cooperative Trajectory Prediction Framework with Multi-Temporal Fusion for Autonomous Driving","date":"2025-02-23","arxiv_id":"2502.16589","n_code_links":1,"syntology":null},{"paper":"/paper/lightweight-yet-efficient-an-external","slug":"lightweight-yet-efficient-an-external","title":"Lightweight yet Efficient: An External Attentive Graph Convolutional Network with Positional Prompts for Sequential Recommendation","date":"2025-02-21","arxiv_id":"2502.15331","n_code_links":1,"syntology":null},{"paper":null,"slug":"capturing-rich-behavior-representations-a","title":"Capturing Rich Behavior Representations: A Dynamic Action Semantic-Aware Graph Transformer for Video Captioning","date":"2025-02-19","arxiv_id":"2502.13754","n_code_links":0,"syntology":null},{"paper":null,"slug":"gltw-joint-improved-graph-transformer-and-llm","title":"GLTW: Joint Improved Graph Transformer and LLM via Three-Word Language for Knowledge Graph Completion","date":"2025-02-17","arxiv_id":"2502.11471","n_code_links":0,"syntology":null},{"paper":"/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","n_code_links":1,"syntology":null},{"paper":"/paper/biologically-plausible-brain-graph","slug":"biologically-plausible-brain-graph","title":"Biologically Plausible Brain Graph Transformer","date":"2025-02-13","arxiv_id":"2502.08958","n_code_links":1,"syntology":{"ran":3,"of":8,"n_ran_checked":1,"n_instrument":2,"unverified":5,"pointer_only":8,"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) · 5 unverified","official":{"repos":["pcyyyy/BioBGT"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":5,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"deep-semantic-graph-learning-via-llm-based","title":"Deep Semantic Graph Learning via LLM based Node Enhancement","date":"2025-02-11","arxiv_id":"2502.07982","n_code_links":0,"syntology":null},{"paper":"/paper/medgnn-towards-multi-resolution","slug":"medgnn-towards-multi-resolution","title":"MedGNN: Towards Multi-resolution Spatiotemporal Graph Learning for Medical Time Series Classification","date":"2025-02-06","arxiv_id":"2502.04515","n_code_links":1,"syntology":null},{"paper":null,"slug":"can-message-passing-gnn-approximate","title":"Message-Passing GNNs Fail to Approximate Sparse Triangular Factorizations","date":"2025-02-03","arxiv_id":"2502.01397","n_code_links":0,"syntology":null},{"paper":"/paper/deepgate4-efficient-and-effective","slug":"deepgate4-efficient-and-effective","title":"DeepGate4: Efficient and Effective Representation Learning for Circuit Design at Scale","date":"2025-02-02","arxiv_id":"2502.01681","n_code_links":1,"syntology":{"ran":1,"of":1,"n_ran_checked":0,"n_instrument":1,"unverified":0,"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","official":{"repos":["zyzheng17/DeepGate4-ICLR-25"],"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"]}}},{"paper":null,"slug":"graph-transformers-for-inverse-physics","title":"Graph Transformers for inverse physics: reconstructing flows around arbitrary 2D airfoils","date":"2025-01-28","arxiv_id":"2501.17081","n_code_links":0,"syntology":null},{"paper":"/paper/an-efficient-diffusion-based-non","slug":"an-efficient-diffusion-based-non","title":"An Efficient Diffusion-based Non-Autoregressive Solver for Traveling Salesman Problem","date":"2025-01-23","arxiv_id":"2501.13767","n_code_links":1,"syntology":{"ran":6,"of":6,"n_ran_checked":6,"n_instrument":0,"unverified":0,"pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","official":{"repos":["deitsp/deitsp"],"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"]}}},{"paper":null,"slug":"self-clustering-graph-transformer-approach-to","title":"Self-Clustering Graph Transformer Approach to Model Resting-State Functional Brain Activity","date":"2025-01-17","arxiv_id":"2501.16345","n_code_links":0,"syntology":null},{"paper":null,"slug":"multimodal-fake-news-video-explanation","title":"Multimodal Fake News Video Explanation: Dataset, Analysis and Evaluation","date":"2025-01-15","arxiv_id":"2501.08514","n_code_links":0,"syntology":null},{"paper":null,"slug":"chat-beyond-contrastive-graph-transformer-for","title":"CHAT: Beyond Contrastive Graph Transformer for Link Prediction in Heterogeneous Networks","date":"2025-01-06","arxiv_id":"2501.02760","n_code_links":0,"syntology":null},{"paper":"/paper/mixture-of-experts-graph-transformers-for","slug":"mixture-of-experts-graph-transformers-for","title":"Mixture-of-Experts Graph Transformers for Interpretable Particle Collision Detection","date":"2025-01-06","arxiv_id":"2501.03432","n_code_links":1,"syntology":null},{"paper":"/paper/long-range-brain-graph-transformer","slug":"long-range-brain-graph-transformer","title":"Long-range Brain Graph Transformer","date":"2025-01-02","arxiv_id":"2501.01100","n_code_links":1,"syntology":{"ran":2,"of":2,"n_ran_checked":0,"n_instrument":2,"unverified":0,"pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","official":{"repos":["yushuowiki/alter"],"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"]}}},{"paper":null,"slug":"innovative-silicosis-and-pneumonia","title":"Innovative Silicosis and Pneumonia Classification: Leveraging Graph Transformer Post-hoc Modeling and Ensemble Techniques","date":"2024-12-31","arxiv_id":"2501.00520","n_code_links":0,"syntology":null},{"paper":null,"slug":"position-aware-graph-transformer-for","title":"Position-aware Graph Transformer for Recommendation","date":"2024-12-25","arxiv_id":"2412.18731","n_code_links":0,"syntology":null},{"paper":"/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","n_code_links":1,"syntology":null},{"paper":"/paper/fairgp-a-scalable-and-fair-graph-transformer","slug":"fairgp-a-scalable-and-fair-graph-transformer","title":"FairGP: A Scalable and Fair Graph Transformer Using Graph Partitioning","date":"2024-12-14","arxiv_id":"2412.10669","n_code_links":1,"syntology":null},{"paper":"/paper/heterogeneous-graph-transformer-for-multiple","slug":"heterogeneous-graph-transformer-for-multiple","title":"Heterogeneous Graph Transformer for Multiple Tiny Object Tracking in RGB-T Videos","date":"2024-12-14","arxiv_id":"2412.10861","n_code_links":1,"syntology":null},{"paper":null,"slug":"foundation-models-and-adaptive-feature","title":"Foundation Models and Adaptive Feature Selection: A Synergistic Approach to Video Question Answering","date":"2024-12-12","arxiv_id":"2412.09230","n_code_links":0,"syntology":null},{"paper":"/paper/motif-guided-graph-transformer-with","slug":"motif-guided-graph-transformer-with","title":"Motif Guided Graph Transformer with Combinatorial Skeleton Prototype Learning for Skeleton-Based Person Re-Identification","date":"2024-12-12","arxiv_id":"2412.09044","n_code_links":1,"syntology":null},{"paper":"/paper/ringformer-a-ring-enhanced-graph-transformer","slug":"ringformer-a-ring-enhanced-graph-transformer","title":"RingFormer: A Ring-Enhanced Graph Transformer for Organic Solar Cell Property Prediction","date":"2024-12-12","arxiv_id":"2412.09030","n_code_links":1,"syntology":null},{"paper":null,"slug":"dhil-gt-scalable-graph-transformer-with","title":"DHIL-GT: Scalable Graph Transformer with Decoupled Hierarchy Labeling","date":"2024-12-06","arxiv_id":"2412.04738","n_code_links":0,"syntology":null},{"paper":null,"slug":"rehub-linear-complexity-graph-transformers","title":"ReHub: Linear Complexity Graph Transformers with Adaptive Hub-Spoke Reassignment","date":"2024-12-02","arxiv_id":"2412.01519","n_code_links":0,"syntology":null},{"paper":"/paper/tgtod-a-global-temporal-graph-transformer-for","slug":"tgtod-a-global-temporal-graph-transformer-for","title":"TGTOD: A Global Temporal Graph Transformer for Outlier Detection at Scale","date":"2024-12-01","arxiv_id":"2412.00984","n_code_links":1,"syntology":null},{"paper":"/paper/graph-neural-networks-for-heart-failure","slug":"graph-neural-networks-for-heart-failure","title":"Graph Neural Networks for Heart Failure Prediction on an EHR-Based Patient Similarity Graph","date":"2024-11-29","arxiv_id":"2411.19742","n_code_links":1,"syntology":null},{"paper":null,"slug":"t2sg-traffic-topology-scene-graph-for","title":"T2SG: Traffic Topology Scene Graph for Topology Reasoning in Autonomous Driving","date":"2024-11-28","arxiv_id":"2411.18894","n_code_links":0,"syntology":null},{"paper":"/paper/df-gnn-dynamic-fusion-framework-for-attention","slug":"df-gnn-dynamic-fusion-framework-for-attention","title":"DF-GNN: Dynamic Fusion Framework for Attention Graph Neural Networks on GPUs","date":"2024-11-25","arxiv_id":"2411.16127","n_code_links":1,"syntology":null},{"paper":"/paper/tangnn-a-concise-scalable-and-effective-graph","slug":"tangnn-a-concise-scalable-and-effective-graph","title":"TANGNN: a Concise, Scalable and Effective Graph Neural Networks with Top-m Attention Mechanism for Graph Representation Learning","date":"2024-11-23","arxiv_id":"2411.15458","n_code_links":1,"syntology":null},{"paper":null,"slug":"sad-time-a-spatiotemporal-fused-network-for","title":"SAD-TIME: a Spatiotemporal-fused network for depression detection with Automated multi-scale Depth-wise and TIME-interval-related common feature extractor","date":"2024-11-13","arxiv_id":"2411.08521","n_code_links":0,"syntology":null},{"paper":null,"slug":"improving-molecular-graph-generation-with","title":"Improving Molecular Graph Generation with Flow Matching and Optimal Transport","date":"2024-11-08","arxiv_id":"2411.05676","n_code_links":0,"syntology":null},{"paper":"/paper/graphxform-graph-transformer-for-computer","slug":"graphxform-graph-transformer-for-computer","title":"GraphXForm: Graph transformer for computer-aided molecular design","date":"2024-11-03","arxiv_id":"2411.01667","n_code_links":1,"syntology":null},{"paper":"/paper/pretraining-graph-transformers-with-atom-in-a","slug":"pretraining-graph-transformers-with-atom-in-a","title":"Pretraining Graph Transformers with Atom-in-a-Molecule Quantum Properties for Improved ADMET Modeling","date":"2024-10-10","arxiv_id":"2410.08024","n_code_links":1,"syntology":null},{"paper":"/paper/cluster-wise-graph-transformer-with-dual","slug":"cluster-wise-graph-transformer-with-dual","title":"Cluster-wise Graph Transformer with Dual-granularity Kernelized Attention","date":"2024-10-09","arxiv_id":"2410.06746","n_code_links":1,"syntology":{"ran":13,"of":14,"n_ran_checked":6,"n_instrument":7,"unverified":1,"pointer_only":14,"phrase":"13 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 2 honoured, 0 violated, 4 with no contract checked; 7 where Syntology's instrument failed) · 1 unverified","official":{"repos":["lumia-group/cluster-wise-graph-transformer"],"state":"official (archive's flag): 13 ran","n_ran":13,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"netdiff-deep-graph-denoising-diffusion-for-ad","title":"NetDiff: Deep Graph Denoising Diffusion for Ad Hoc Network Topology Generation","date":"2024-10-09","arxiv_id":"2410.08238","n_code_links":0,"syntology":null},{"paper":"/paper/defog-discrete-flow-matching-for-graph","slug":"defog-discrete-flow-matching-for-graph","title":"DeFoG: Discrete Flow Matching for Graph Generation","date":"2024-10-05","arxiv_id":"2410.04263","n_code_links":1,"syntology":{"ran":12,"of":15,"n_ran_checked":5,"n_instrument":7,"unverified":3,"pointer_only":1,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 1 honoured, 3 violated, 1 with no contract checked; 7 where Syntology's instrument failed) · 3 unverified","official":{"repos":["manuelmlmadeira/DeFoG"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":3,"ran_from_kinds":["official"]}}},{"paper":"/paper/deepprotein-deep-learning-library-and","slug":"deepprotein-deep-learning-library-and","title":"DeepProtein: Deep Learning Library and Benchmark for Protein Sequence Learning","date":"2024-10-02","arxiv_id":"2410.02023","n_code_links":1,"syntology":null},{"paper":"/paper/stgformer-efficient-spatiotemporal-graph","slug":"stgformer-efficient-spatiotemporal-graph","title":"STGformer: Efficient Spatiotemporal Graph Transformer for Traffic Forecasting","date":"2024-10-01","arxiv_id":"2410.00385","n_code_links":1,"syntology":null},{"paper":null,"slug":"kriformer-a-novel-spatiotemporal-kriging","title":"Kriformer: A Novel Spatiotemporal Kriging Approach Based on Graph Transformers","date":"2024-09-23","arxiv_id":"2409.14906","n_code_links":0,"syntology":null},{"paper":null,"slug":"recurrent-graph-transformer-network-for","title":"Recurrent Graph Transformer Network for Multiple Fault Localization in Naval Shipboard Systems","date":"2024-09-16","arxiv_id":"2409.10792","n_code_links":0,"syntology":null},{"paper":null,"slug":"predicting-building-types-and-functions-at","title":"Predicting building types and functions at transnational scale","date":"2024-09-15","arxiv_id":"2409.09692","n_code_links":0,"syntology":null},{"paper":"/paper/characterizing-massive-activations-of","slug":"characterizing-massive-activations-of","title":"Characterizing Massive Activations of Attention Mechanism in Graph Neural Networks","date":"2024-09-05","arxiv_id":"2409.03463","n_code_links":1,"syntology":null},{"paper":null,"slug":"zeoformer-coarse-grained-periodic-graph","title":"PDDFormer: Pairwise Distance Distribution Graph Transformer for Crystal Material Property Prediction","date":"2024-08-23","arxiv_id":"2408.12984","n_code_links":0,"syntology":null},{"paper":"/paper/navigating-spatio-temporal-heterogeneity-a","slug":"navigating-spatio-temporal-heterogeneity-a","title":"Navigating Spatio-Temporal Heterogeneity: A Graph Transformer Approach for Traffic Forecasting","date":"2024-08-20","arxiv_id":"2408.10822","n_code_links":1,"syntology":null},{"paper":"/paper/se-sgformer-a-self-explainable-signed-graph","slug":"se-sgformer-a-self-explainable-signed-graph","title":"Self-Explainable Graph Transformer for Link Sign Prediction","date":"2024-08-16","arxiv_id":"2408.08754","n_code_links":1,"syntology":{"ran":3,"of":9,"n_ran_checked":0,"n_instrument":3,"unverified":6,"pointer_only":9,"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) · 6 unverified","official":{"repos":["liule66/SE-SGformer"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":6,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"modeling-multi-step-scientific-processes-with","title":"Modeling Multi-Step Scientific Processes with Graph Transformer Networks","date":"2024-08-10","arxiv_id":"2408.05425","n_code_links":0,"syntology":null},{"paper":"/paper/handdagt-a-denoising-adaptive-graph","slug":"handdagt-a-denoising-adaptive-graph","title":"HandDAGT: A Denoising Adaptive Graph Transformer for 3D Hand Pose Estimation","date":"2024-07-30","arxiv_id":"2407.20542","n_code_links":1,"syntology":null},{"paper":"/paper/what-are-good-positional-encodings-for","slug":"what-are-good-positional-encodings-for","title":"What Are Good Positional Encodings for Directed Graphs?","date":"2024-07-30","arxiv_id":"2407.20912","n_code_links":1,"syntology":{"ran":6,"of":6,"n_ran_checked":3,"n_instrument":3,"unverified":0,"pointer_only":6,"phrase":"6 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; 3 where Syntology's instrument failed) · 0 unverified","official":{"repos":["graph-com/multi-q-maglap"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"a-unified-graph-transformer-for-overcoming","title":"A Unified Graph Transformer for Overcoming Isolations in Multi-modal Recommendation","date":"2024-07-29","arxiv_id":"2407.19886","n_code_links":0,"syntology":null},{"paper":"/paper/dynamic-graph-transformer-with-correlated","slug":"dynamic-graph-transformer-with-correlated","title":"Dynamic Graph Transformer with Correlated Spatial-Temporal Positional Encoding","date":"2024-07-24","arxiv_id":"2407.16959","n_code_links":1,"syntology":null},{"paper":"/paper/polyformer-scalable-node-wise-filters-via","slug":"polyformer-scalable-node-wise-filters-via","title":"PolyFormer: Scalable Node-wise Filters via Polynomial Graph Transformer","date":"2024-07-19","arxiv_id":"2407.14459","n_code_links":1,"syntology":{"ran":10,"of":14,"n_ran_checked":3,"n_instrument":7,"unverified":4,"pointer_only":14,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 1 honoured, 0 violated, 2 with no contract checked; 7 where Syntology's instrument failed) · 4 unverified","official":{"repos":["air029/polyformer"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":4,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"torchgt-a-holistic-system-for-large-scale","title":"TorchGT: A Holistic System for Large-scale Graph Transformer Training","date":"2024-07-19","arxiv_id":"2407.14106","n_code_links":0,"syntology":null},{"paper":null,"slug":"hhgt-hierarchical-heterogeneous-graph","title":"HHGT: Hierarchical Heterogeneous Graph Transformer for Heterogeneous Graph Representation Learning","date":"2024-07-18","arxiv_id":"2407.13158","n_code_links":0,"syntology":null},{"paper":"/paper/video-language-alignment-pre-training-via","slug":"video-language-alignment-pre-training-via","title":"Video-Language Alignment via Spatio-Temporal Graph Transformer","date":"2024-07-16","arxiv_id":"2407.11677","n_code_links":1,"syntology":null},{"paper":"/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","n_code_links":1,"syntology":null},{"paper":null,"slug":"graph-transformers-a-survey","title":"Graph Transformers: A Survey","date":"2024-07-13","arxiv_id":"2407.09777","n_code_links":0,"syntology":null},{"paper":"/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","n_code_links":1,"syntology":null},{"paper":null,"slug":"the-heterophilic-graph-learning-handbook","title":"The Heterophilic Graph Learning Handbook: Benchmarks, Models, Theoretical Analysis, Applications and Challenges","date":"2024-07-12","arxiv_id":"2407.09618","n_code_links":0,"syntology":null},{"paper":null,"slug":"generalizing-graph-transformers-across","title":"Generalizing Graph Transformers Across Diverse Graphs and Tasks via Pre-Training on Industrial-Scale Data","date":"2024-07-04","arxiv_id":"2407.03953","n_code_links":0,"syntology":null},{"paper":null,"slug":"mvgt-a-multi-view-graph-transformer-based-on","title":"MVGT: A Multi-view Graph Transformer Based on Spatial Relations for EEG Emotion Recognition","date":"2024-07-03","arxiv_id":"2407.03131","n_code_links":0,"syntology":null},{"paper":"/paper/towards-universal-mesh-movement-networks","slug":"towards-universal-mesh-movement-networks","title":"Towards Universal Mesh Movement Networks","date":"2024-06-29","arxiv_id":"2407.00382","n_code_links":1,"syntology":{"ran":3,"of":7,"n_ran_checked":1,"n_instrument":2,"unverified":4,"pointer_only":0,"phrase":"3 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 2 where Syntology's instrument failed) · 4 unverified","official":{"repos":["mesh-adaptation/um2n"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":4,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"enhancing-video-language-representations-with","title":"Enhancing Video-Language Representations with Structural Spatio-Temporal Alignment","date":"2024-06-27","arxiv_id":"2406.19255","n_code_links":0,"syntology":null},{"paper":null,"slug":"leveraging-contrastive-learning-for-enhanced","title":"Leveraging Contrastive Learning for Enhanced Node Representations in Tokenized Graph Transformers","date":"2024-06-27","arxiv_id":"2406.19258","n_code_links":0,"syntology":null},{"paper":null,"slug":"ntformer-a-composite-node-tokenized-graph","title":"NTFormer: A Composite Node Tokenized Graph Transformer for Node Classification","date":"2024-06-27","arxiv_id":"2406.19249","n_code_links":0,"syntology":null},{"paper":null,"slug":"inferring-pluggable-types-with-machine","title":"Inferring Pluggable Types with Machine Learning","date":"2024-06-21","arxiv_id":"2406.15676","n_code_links":0,"syntology":null},{"paper":"/paper/mm-gtunets-unified-multi-modal-graph-deep","slug":"mm-gtunets-unified-multi-modal-graph-deep","title":"MM-GTUNets: Unified Multi-Modal Graph Deep Learning for Brain Disorders Prediction","date":"2024-06-20","arxiv_id":"2406.14455","n_code_links":1,"syntology":null},{"paper":"/paper/efficient-sharpness-aware-minimization-for-2","slug":"efficient-sharpness-aware-minimization-for-2","title":"Efficient Sharpness-Aware Minimization for Molecular Graph Transformer Models","date":"2024-06-19","arxiv_id":"2406.13137","n_code_links":1,"syntology":{"ran":7,"of":7,"n_ran_checked":1,"n_instrument":6,"unverified":0,"pointer_only":7,"phrase":"7 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; 6 where Syntology's instrument failed) · 0 unverified","official":{"repos":["YL-wang/GraphSAM"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"sefraud-graph-based-self-explainable-fraud","title":"SEFraud: Graph-based Self-Explainable Fraud Detection via Interpretative Mask Learning","date":"2024-06-17","arxiv_id":"2406.11389","n_code_links":0,"syntology":null},{"paper":"/paper/evolving-self-assembling-neural-networks-from","slug":"evolving-self-assembling-neural-networks-from","title":"Evolving Self-Assembling Neural Networks: From Spontaneous Activity to Experience-Dependent Learning","date":"2024-06-14","arxiv_id":"2406.09787","n_code_links":1,"syntology":null},{"paper":null,"slug":"scoreformer-a-surrogate-model-for-large-scale","title":"Scoreformer: A Surrogate Model For Large-Scale Prediction of Docking Scores","date":"2024-06-13","arxiv_id":"2406.09346","n_code_links":0,"syntology":null},{"paper":"/paper/aligning-transformers-with-weisfeiler-leman","slug":"aligning-transformers-with-weisfeiler-leman","title":"Aligning Transformers with Weisfeiler-Leman","date":"2024-06-05","arxiv_id":"2406.03148","n_code_links":1,"syntology":{"ran":3,"of":4,"n_ran_checked":1,"n_instrument":2,"unverified":1,"pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","official":{"repos":["luis-mueller/wl-transformers"],"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":["found_in_text","official"]}}},{"paper":null,"slug":"what-improves-the-generalization-of-graph","title":"What Improves the Generalization of Graph Transformers? A Theoretical Dive into the Self-attention and Positional Encoding","date":"2024-06-04","arxiv_id":"2406.01977","n_code_links":0,"syntology":null},{"paper":null,"slug":"cyclo-cyclic-graph-transformer-approach-to","title":"CYCLO: Cyclic Graph Transformer Approach to Multi-Object Relationship Modeling in Aerial Videos","date":"2024-06-03","arxiv_id":"2406.01029","n_code_links":0,"syntology":null},{"paper":null,"slug":"gladformer-a-mixed-perspective-for-graph","title":"GLADformer: A Mixed Perspective for Graph-level Anomaly Detection","date":"2024-06-02","arxiv_id":"2406.00734","n_code_links":0,"syntology":null},{"paper":"/paper/knowledge-enhanced-multi-intent-transformer","slug":"knowledge-enhanced-multi-intent-transformer","title":"Knowledge Enhanced Multi-intent Transformer Network for Recommendation","date":"2024-05-31","arxiv_id":"2405.20565","n_code_links":1,"syntology":null}],"papers_shown":100,"papers_order":"date (newest first), then slug","paper_counts":{"archive_papers_tagged":297,"with_a_code_link":155,"where_syntology_ran_a_sample":52,"not_listed_spam_title":0,"listed":297,"listed_where_code_ran":52,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":44,"every_run_a_failure_of_syntologys_instrument":8,"listed_with_a_run_with_no_instrument_failure":44,"listed_every_run_a_failure_of_syntologys_instrument":8,"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"},"papers_where_code_ran":52,"papers_where_code_ran_first_page":"/method/lapeigen/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not isolate this method inside it.","pages":[{"order":"archive","page":2,"of":3,"url":"/method/lapeigen/papers/2","json":"/method/lapeigen/papers/2.json","rows":100},{"order":"archive","page":3,"of":3,"url":"/method/lapeigen/papers/3","json":"/method/lapeigen/papers/3.json","rows":97},{"order":"ran","page":1,"of":1,"url":"/method/lapeigen/papers/ran/1","json":"/method/lapeigen/papers/ran/1.json","rows":52}],"tasks":[{"task":"/task/representation-learning","name":"Representation Learning","papers":54},{"task":"/task/graph-learning","name":"Graph Learning","papers":37},{"task":"/task/node-classification","name":"Node Classification","papers":37},{"task":"/task/graph-representation-learning","name":"Graph Representation Learning","papers":27},{"task":"/task/graph-neural-network","name":"Graph Neural Network","papers":24},{"task":"/task/prediction","name":"Prediction","papers":18},{"task":"/task/link-prediction","name":"Link Prediction","papers":17},{"task":"/task/graph-classification","name":"Graph Classification","papers":16},{"task":"/task/graph-regression","name":"Graph Regression","papers":16},{"task":"/task/contrastive-learning","name":"Contrastive Learning","papers":12},{"task":"/task/drug-discovery","name":"Drug Discovery","papers":12},{"task":"/task/graph-attention","name":"Graph Attention","papers":12},{"task":"/task/graph-generation","name":"Graph Generation","papers":12},{"task":"/task/molecular-property-prediction","name":"Molecular Property Prediction","papers":12},{"task":"/task/property-prediction","name":"Property Prediction","papers":12},{"task":"/task/recommendation-systems","name":"Recommendation Systems","papers":11},{"task":"/task/denoising","name":"Denoising","papers":10},{"task":"/task/decoder","name":"Decoder","papers":9},{"task":"/task/self-supervised-learning","name":"Self-Supervised Learning","papers":9},{"task":"/task/language-modelling","name":"Language Modelling","papers":8}],"tasks_shown":20,"n_tasks":276,"usage_by_year":[{"year":"2019","papers":1},{"year":"2020","papers":3},{"year":"2021","papers":26},{"year":"2022","papers":44},{"year":"2023","papers":85},{"year":"2024","papers":99},{"year":"2025","papers":39}],"row_source":"methods_table","archive":{"source":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","archive_url":"https://paperswithcode.com/method/lapeigen"},"syntology_read_at":"2026-10-05T00:36:11+00:00","syntology":{"source":"Syntology's have check for this name (the free coverage lookup), read from Syntology's graph","have_url":"https://syntology.ai/api/graph/have?x=LapEigen","read_at":"2026-10-05T00:58:23+00:00","query":"LapEigen","kind":"method","have":"unknown_name","tier":null,"verified_implementation":null,"level":null,"level_meaning":"the served verification level, per answer; never summed across methods","resolved_to":null,"resolution":null,"resolved_name_differs":false,"absence_asserted":false,"absence_unchecked":null,"no_code_is_about_this_method":false,"subject":null,"archive_paper_arxiv_id":null,"repositories":null,"retrieve_with":null,"name_competition":{"verdict":"none","may_be_wrong_sense":false,"bearers_found":0,"served":null,"leading_other_bearer":null,"n_other_bearers_listed":0,"note":"Nothing in this corpus is named 'LapEigen' -- no method node, no paper announcing it in its title, no expanded form declaring it as an acronym."},"name_competition_text":null,"near_matches":[],"code_nearby":[],"code_nearby_caption":null,"origin_paper":null,"line":"name not resolved (unknown_name). The lookup matched no method, paper or venue by this name; that asserts nothing about whether code exists.","level_legend":null},"syntology_have_state":"loaded","record_sha256":"b8c740792ed89c2b3e97df6498b2531dfa5e928e3f34cc6d967a2a2aa42b2880","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}