{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:GA6R6RWHWCUFPELY4WMYD3XA6L","short_pith_number":"pith:GA6R6RWH","schema_version":"1.0","canonical_sha256":"303d1f46c7b0a8579178e59981eee0f2dca6eb3bfe72cab8831f85f6f9f43f3c","source":{"kind":"arxiv","id":"2607.13241","version":1},"attestation_state":"computed","paper":{"title":"EMAGN: Efficient Multi-Attention Graph Network via Learned Clustering for Scalable Traffic Forecasting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Chengqi Lu, Junwei You, Ke Liu, Lyuhao Chen, Mingxing Xu, Oliver Gao, Rakesh Chowdary Machineni, Xiangyu Li, Xi Cheng, Xin Hu","submitted_at":"2026-07-14T20:02:42Z","abstract_excerpt":"Traffic forecasting is highly challenging due to complex and nonlinear spatial and temporal dependencies. Self-attention mechanisms have been widely adopted to model dynamic and long-range dependencies, achieving state-of-the-art performance, but suffer from limited scalability due to quadratic computational and memory complexity. To address this, we propose an Efficient Multi-Attention Graph Network (EMAGN) that linearises the spatial attention mechanism itself, inspired by the theory of fast high-dimensional Gaussian filtering. Two learned clustering matrices C_k and C_v adaptively group key"},"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":"2607.13241","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-07-14T20:02:42Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"9c38064d4507861d0c28868b8f597d39ed271e84f636b8878065ae6fbc7b9068","abstract_canon_sha256":"fbb8a2c815dccbb0b0faf07b47d1127306cba6d387bd42e3e5414cc948653405"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-16T00:22:04.520473Z","signature_b64":"YZZN7Eo3qZ7vOJNb9TXjdOZLfxtjyLvU06Mvx/wrfZ0LH/GR8LEk+PvvzfW77drhJSPU8WuF/Mi87RSy/KXLBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"303d1f46c7b0a8579178e59981eee0f2dca6eb3bfe72cab8831f85f6f9f43f3c","last_reissued_at":"2026-07-16T00:22:04.517575Z","signature_status":"signed_v1","first_computed_at":"2026-07-16T00:22:04.517575Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"EMAGN: Efficient Multi-Attention Graph Network via Learned Clustering for Scalable Traffic Forecasting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Chengqi Lu, Junwei You, Ke Liu, Lyuhao Chen, Mingxing Xu, Oliver Gao, Rakesh Chowdary Machineni, Xiangyu Li, Xi Cheng, Xin Hu","submitted_at":"2026-07-14T20:02:42Z","abstract_excerpt":"Traffic forecasting is highly challenging due to complex and nonlinear spatial and temporal dependencies. Self-attention mechanisms have been widely adopted to model dynamic and long-range dependencies, achieving state-of-the-art performance, but suffer from limited scalability due to quadratic computational and memory complexity. To address this, we propose an Efficient Multi-Attention Graph Network (EMAGN) that linearises the spatial attention mechanism itself, inspired by the theory of fast high-dimensional Gaussian filtering. Two learned clustering matrices C_k and C_v adaptively group key"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.13241","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/2607.13241/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":"2607.13241","created_at":"2026-07-16T00:22:04.519993+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.13241v1","created_at":"2026-07-16T00:22:04.519993+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.13241","created_at":"2026-07-16T00:22:04.519993+00:00"},{"alias_kind":"pith_short_12","alias_value":"GA6R6RWHWCUF","created_at":"2026-07-16T00:22:04.519993+00:00"},{"alias_kind":"pith_short_16","alias_value":"GA6R6RWHWCUFPELY","created_at":"2026-07-16T00:22:04.519993+00:00"},{"alias_kind":"pith_short_8","alias_value":"GA6R6RWH","created_at":"2026-07-16T00:22:04.519993+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GA6R6RWHWCUFPELY4WMYD3XA6L","json":"https://pith.science/pith/GA6R6RWHWCUFPELY4WMYD3XA6L.json","graph_json":"https://pith.science/api/pith-number/GA6R6RWHWCUFPELY4WMYD3XA6L/graph.json","events_json":"https://pith.science/api/pith-number/GA6R6RWHWCUFPELY4WMYD3XA6L/events.json","paper":"https://pith.science/paper/GA6R6RWH"},"agent_actions":{"view_html":"https://pith.science/pith/GA6R6RWHWCUFPELY4WMYD3XA6L","download_json":"https://pith.science/pith/GA6R6RWHWCUFPELY4WMYD3XA6L.json","view_paper":"https://pith.science/paper/GA6R6RWH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.13241&json=true","fetch_graph":"https://pith.science/api/pith-number/GA6R6RWHWCUFPELY4WMYD3XA6L/graph.json","fetch_events":"https://pith.science/api/pith-number/GA6R6RWHWCUFPELY4WMYD3XA6L/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GA6R6RWHWCUFPELY4WMYD3XA6L/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GA6R6RWHWCUFPELY4WMYD3XA6L/action/storage_attestation","attest_author":"https://pith.science/pith/GA6R6RWHWCUFPELY4WMYD3XA6L/action/author_attestation","sign_citation":"https://pith.science/pith/GA6R6RWHWCUFPELY4WMYD3XA6L/action/citation_signature","submit_replication":"https://pith.science/pith/GA6R6RWHWCUFPELY4WMYD3XA6L/action/replication_record"}},"created_at":"2026-07-16T00:22:04.519993+00:00","updated_at":"2026-07-16T00:22:04.519993+00:00"}