{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:W5TDVVF5L4MBIWDG7Z7A5J5GQI","short_pith_number":"pith:W5TDVVF5","schema_version":"1.0","canonical_sha256":"b7663ad4bd5f18145866fe7e0ea7a6822eedac0c5787463c870454057f8b1d52","source":{"kind":"arxiv","id":"2502.12352","version":2},"attestation_state":"computed","paper":{"title":"Towards Mechanistic Interpretability of Graph Transformers via Attention Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Batu El, Chaitanya K. Joshi, Deepro Choudhury, Pietro Li\\`o","submitted_at":"2025-02-17T22:35:16Z","abstract_excerpt":"We introduce Attention Graphs, a new tool for mechanistic interpretability of Graph Neural Networks (GNNs) and Graph Transformers based on the mathematical equivalence between message passing in GNNs and the self-attention mechanism in Transformers. Attention Graphs aggregate attention matrices across Transformer layers and heads to describe how information flows among input nodes. Through experiments on homophilous and heterophilous node classification tasks, we analyze Attention Graphs from a network science perspective and find that: (1) When Graph Transformers are allowed to learn the opti"},"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":"2502.12352","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-02-17T22:35:16Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"11f167027b3ef364902e67bae98795049c14fbaf42d2e4d65fcf60a50862b23d","abstract_canon_sha256":"f727180fc35d86046ddd66afd8a47405a4681f738756cf0883dab71c16116b88"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:19:39.405446Z","signature_b64":"FmXvSgvK4HjTk7sC8DlS3Qi6CkN4+n7ui1sWahuXsT4NvpTpBtoQh5iRY8jFrPozZlU68xBOlQdwrKBfBJNhBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b7663ad4bd5f18145866fe7e0ea7a6822eedac0c5787463c870454057f8b1d52","last_reissued_at":"2026-07-05T10:19:39.404939Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:19:39.404939Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Towards Mechanistic Interpretability of Graph Transformers via Attention Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Batu El, Chaitanya K. Joshi, Deepro Choudhury, Pietro Li\\`o","submitted_at":"2025-02-17T22:35:16Z","abstract_excerpt":"We introduce Attention Graphs, a new tool for mechanistic interpretability of Graph Neural Networks (GNNs) and Graph Transformers based on the mathematical equivalence between message passing in GNNs and the self-attention mechanism in Transformers. Attention Graphs aggregate attention matrices across Transformer layers and heads to describe how information flows among input nodes. Through experiments on homophilous and heterophilous node classification tasks, we analyze Attention Graphs from a network science perspective and find that: (1) When Graph Transformers are allowed to learn the opti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.12352","kind":"arxiv","version":2},"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/2502.12352/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":"2502.12352","created_at":"2026-07-05T10:19:39.404998+00:00"},{"alias_kind":"arxiv_version","alias_value":"2502.12352v2","created_at":"2026-07-05T10:19:39.404998+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.12352","created_at":"2026-07-05T10:19:39.404998+00:00"},{"alias_kind":"pith_short_12","alias_value":"W5TDVVF5L4MB","created_at":"2026-07-05T10:19:39.404998+00:00"},{"alias_kind":"pith_short_16","alias_value":"W5TDVVF5L4MBIWDG","created_at":"2026-07-05T10:19:39.404998+00:00"},{"alias_kind":"pith_short_8","alias_value":"W5TDVVF5","created_at":"2026-07-05T10:19:39.404998+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":5,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.10503","citing_title":"SLASH the Sink: Sharpening Structural Attention Inside LLMs","ref_index":35,"is_internal_anchor":false},{"citing_arxiv_id":"2508.05463","citing_title":"Task complexity shapes internal representations and robustness in neural networks","ref_index":19,"is_internal_anchor":false},{"citing_arxiv_id":"2601.03846","citing_title":"When Numbers Start Talking: Implicit Numerical Coordination Among LLM-Based Agents","ref_index":11,"is_internal_anchor":false},{"citing_arxiv_id":"2605.10503","citing_title":"SLASH the Sink: Sharpening Structural Attention Inside LLMs","ref_index":35,"is_internal_anchor":false},{"citing_arxiv_id":"2605.10503","citing_title":"SLASH the Sink: Sharpening Structural Attention Inside LLMs","ref_index":35,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/W5TDVVF5L4MBIWDG7Z7A5J5GQI","json":"https://pith.science/pith/W5TDVVF5L4MBIWDG7Z7A5J5GQI.json","graph_json":"https://pith.science/api/pith-number/W5TDVVF5L4MBIWDG7Z7A5J5GQI/graph.json","events_json":"https://pith.science/api/pith-number/W5TDVVF5L4MBIWDG7Z7A5J5GQI/events.json","paper":"https://pith.science/paper/W5TDVVF5"},"agent_actions":{"view_html":"https://pith.science/pith/W5TDVVF5L4MBIWDG7Z7A5J5GQI","download_json":"https://pith.science/pith/W5TDVVF5L4MBIWDG7Z7A5J5GQI.json","view_paper":"https://pith.science/paper/W5TDVVF5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2502.12352&json=true","fetch_graph":"https://pith.science/api/pith-number/W5TDVVF5L4MBIWDG7Z7A5J5GQI/graph.json","fetch_events":"https://pith.science/api/pith-number/W5TDVVF5L4MBIWDG7Z7A5J5GQI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/W5TDVVF5L4MBIWDG7Z7A5J5GQI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/W5TDVVF5L4MBIWDG7Z7A5J5GQI/action/storage_attestation","attest_author":"https://pith.science/pith/W5TDVVF5L4MBIWDG7Z7A5J5GQI/action/author_attestation","sign_citation":"https://pith.science/pith/W5TDVVF5L4MBIWDG7Z7A5J5GQI/action/citation_signature","submit_replication":"https://pith.science/pith/W5TDVVF5L4MBIWDG7Z7A5J5GQI/action/replication_record"}},"created_at":"2026-07-05T10:19:39.404998+00:00","updated_at":"2026-07-05T10:19:39.404998+00:00"}