{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:KNIAOORCOO3EMCZ53L6ZDCEXEU","short_pith_number":"pith:KNIAOORC","schema_version":"1.0","canonical_sha256":"5350073a2273b6460b3ddafd918897250a53f81504195d49fd58def3854f883f","source":{"kind":"arxiv","id":"2202.08455","version":1},"attestation_state":"computed","paper":{"title":"Transformer for Graphs: An Overview from Architecture Perspective","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Erxue Min, Junzhou Huang, Kangfei Zhao, Peilin Zhao, Runfa Chen, Sophia Ananiadou, Tingyang Xu, Wenbing Huang, Yatao Bian, Yu Rong","submitted_at":"2022-02-17T06:02:06Z","abstract_excerpt":"Recently, Transformer model, which has achieved great success in many artificial intelligence fields, has demonstrated its great potential in modeling graph-structured data. Till now, a great variety of Transformers has been proposed to adapt to the graph-structured data. However, a comprehensive literature review and systematical evaluation of these Transformer variants for graphs are still unavailable. It's imperative to sort out the existing Transformer models for graphs and systematically investigate their effectiveness on various graph tasks. In this survey, we provide a comprehensive rev"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2202.08455","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-02-17T06:02:06Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"c074d11566acf7c02520fb53997ec5a77a399236f1e4d073beb85856f862bcc3","abstract_canon_sha256":"efdc5137bd344d8a493486e8f92efc930f4cdf4f4bbe6cd21d53a6baf7b72dba"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:57:46.042640Z","signature_b64":"fcBxMdEEnVk/xBhHDSz5BRoKo6i6Zw1l/HkgaqIu3vghbd1gsj1n02gJZace2aefPLq5fqrlF7NPBcjnyLBaBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5350073a2273b6460b3ddafd918897250a53f81504195d49fd58def3854f883f","last_reissued_at":"2026-07-05T03:57:46.041905Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:57:46.041905Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Transformer for Graphs: An Overview from Architecture Perspective","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Erxue Min, Junzhou Huang, Kangfei Zhao, Peilin Zhao, Runfa Chen, Sophia Ananiadou, Tingyang Xu, Wenbing Huang, Yatao Bian, Yu Rong","submitted_at":"2022-02-17T06:02:06Z","abstract_excerpt":"Recently, Transformer model, which has achieved great success in many artificial intelligence fields, has demonstrated its great potential in modeling graph-structured data. Till now, a great variety of Transformers has been proposed to adapt to the graph-structured data. However, a comprehensive literature review and systematical evaluation of these Transformer variants for graphs are still unavailable. It's imperative to sort out the existing Transformer models for graphs and systematically investigate their effectiveness on various graph tasks. In this survey, we provide a comprehensive rev"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2202.08455","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2202.08455/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2202.08455","created_at":"2026-07-05T03:57:46.041986+00:00"},{"alias_kind":"arxiv_version","alias_value":"2202.08455v1","created_at":"2026-07-05T03:57:46.041986+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2202.08455","created_at":"2026-07-05T03:57:46.041986+00:00"},{"alias_kind":"pith_short_12","alias_value":"KNIAOORCOO3E","created_at":"2026-07-05T03:57:46.041986+00:00"},{"alias_kind":"pith_short_16","alias_value":"KNIAOORCOO3EMCZ5","created_at":"2026-07-05T03:57:46.041986+00:00"},{"alias_kind":"pith_short_8","alias_value":"KNIAOORC","created_at":"2026-07-05T03:57:46.041986+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":8,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.25293","citing_title":"Communicability-Inspired Positional Encoding (CIPE)","ref_index":24,"is_internal_anchor":false},{"citing_arxiv_id":"2606.17667","citing_title":"Handling Feature Heterogeneity with Learnable Graph Patches","ref_index":31,"is_internal_anchor":false},{"citing_arxiv_id":"2606.22429","citing_title":"Enhancing LLMs for Graph Tasks via Graph-aware LoRA Generation","ref_index":266,"is_internal_anchor":false},{"citing_arxiv_id":"2411.19517","citing_title":"RL-SPH: Learning to Achieve Feasible Solutions for Integer Linear Programs","ref_index":39,"is_internal_anchor":false},{"citing_arxiv_id":"2501.00309","citing_title":"Retrieval-Augmented Generation with Graphs (GraphRAG)","ref_index":296,"is_internal_anchor":false},{"citing_arxiv_id":"2605.12511","citing_title":"Real-World Challenges in Fake News Detection: Dealing with Posts by Cold Users","ref_index":8,"is_internal_anchor":false},{"citing_arxiv_id":"2605.08679","citing_title":"Attention-based graph neural networks: a survey","ref_index":185,"is_internal_anchor":false},{"citing_arxiv_id":"2604.06336","citing_title":"BiScale-GTR: Fragment-Aware Graph Transformers for Multi-Scale Molecular Representation Learning","ref_index":11,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KNIAOORCOO3EMCZ53L6ZDCEXEU","json":"https://pith.science/pith/KNIAOORCOO3EMCZ53L6ZDCEXEU.json","graph_json":"https://pith.science/api/pith-number/KNIAOORCOO3EMCZ53L6ZDCEXEU/graph.json","events_json":"https://pith.science/api/pith-number/KNIAOORCOO3EMCZ53L6ZDCEXEU/events.json","paper":"https://pith.science/paper/KNIAOORC"},"agent_actions":{"view_html":"https://pith.science/pith/KNIAOORCOO3EMCZ53L6ZDCEXEU","download_json":"https://pith.science/pith/KNIAOORCOO3EMCZ53L6ZDCEXEU.json","view_paper":"https://pith.science/paper/KNIAOORC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2202.08455&json=true","fetch_graph":"https://pith.science/api/pith-number/KNIAOORCOO3EMCZ53L6ZDCEXEU/graph.json","fetch_events":"https://pith.science/api/pith-number/KNIAOORCOO3EMCZ53L6ZDCEXEU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KNIAOORCOO3EMCZ53L6ZDCEXEU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KNIAOORCOO3EMCZ53L6ZDCEXEU/action/storage_attestation","attest_author":"https://pith.science/pith/KNIAOORCOO3EMCZ53L6ZDCEXEU/action/author_attestation","sign_citation":"https://pith.science/pith/KNIAOORCOO3EMCZ53L6ZDCEXEU/action/citation_signature","submit_replication":"https://pith.science/pith/KNIAOORCOO3EMCZ53L6ZDCEXEU/action/replication_record"}},"created_at":"2026-07-05T03:57:46.041986+00:00","updated_at":"2026-07-05T03:57:46.041986+00:00"}