{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:6C4D4L7PNX22I6CFM5VTLI2CWK","short_pith_number":"pith:6C4D4L7P","schema_version":"1.0","canonical_sha256":"f0b83e2fef6df5a47845676b35a342b2ab844384100bb6f846a1085d8c62a9db","source":{"kind":"arxiv","id":"2504.16922","version":1},"attestation_state":"computed","paper":{"title":"Generalized Neighborhood Attention: Multi-dimensional Sparse Attention at the Speed of Light","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.CV","authors_text":"Aditya Kane, Ali Hassani, Bing Xu, Chieh-Yun Chen, Fengzhe Zhou, Haicheng Wu, Humphrey Shi, Jiannan Huang, Markus Hoehnerbach, Michael Isaev, Ming-Yu Liu, Min Shi, Qinsheng Zhang, Steven Walton, Vijay Thakkar, Wen-Mei Hwu","submitted_at":"2025-04-23T17:49:53Z","abstract_excerpt":"Many sparse attention mechanisms such as Neighborhood Attention have typically failed to consistently deliver speedup over the self attention baseline. This is largely due to the level of complexity in attention infrastructure, and the rapid evolution of AI hardware architecture. At the same time, many state-of-the-art foundational models, particularly in computer vision, are heavily bound by attention, and need reliable sparsity to escape the O(n^2) complexity. In this paper, we study a class of promising sparse attention mechanisms that focus on locality, and aim to develop a better analytic"},"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":"2504.16922","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2025-04-23T17:49:53Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"90856b0f8fa80239591a3f9e925f18b604c66f855e6bc5c2141f88b11e2d0255","abstract_canon_sha256":"ec30b206cca785a8caf67a96445f8987061cfbb4ef0cfc7a41ee3de3a22c17d1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:53:06.472263Z","signature_b64":"ji8qoX9bPXBIbPoLGPyK6KdMJlysiY9sLwj9g0A46Il5ppZWaEolkr/HDjGYw/s9jUPYS1twi1TChf+J4IGmDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f0b83e2fef6df5a47845676b35a342b2ab844384100bb6f846a1085d8c62a9db","last_reissued_at":"2026-07-05T10:53:06.471762Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:53:06.471762Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Generalized Neighborhood Attention: Multi-dimensional Sparse Attention at the Speed of Light","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.CV","authors_text":"Aditya Kane, Ali Hassani, Bing Xu, Chieh-Yun Chen, Fengzhe Zhou, Haicheng Wu, Humphrey Shi, Jiannan Huang, Markus Hoehnerbach, Michael Isaev, Ming-Yu Liu, Min Shi, Qinsheng Zhang, Steven Walton, Vijay Thakkar, Wen-Mei Hwu","submitted_at":"2025-04-23T17:49:53Z","abstract_excerpt":"Many sparse attention mechanisms such as Neighborhood Attention have typically failed to consistently deliver speedup over the self attention baseline. This is largely due to the level of complexity in attention infrastructure, and the rapid evolution of AI hardware architecture. At the same time, many state-of-the-art foundational models, particularly in computer vision, are heavily bound by attention, and need reliable sparsity to escape the O(n^2) complexity. In this paper, we study a class of promising sparse attention mechanisms that focus on locality, and aim to develop a better analytic"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.16922","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/2504.16922/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":"2504.16922","created_at":"2026-07-05T10:53:06.471827+00:00"},{"alias_kind":"arxiv_version","alias_value":"2504.16922v1","created_at":"2026-07-05T10:53:06.471827+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.16922","created_at":"2026-07-05T10:53:06.471827+00:00"},{"alias_kind":"pith_short_12","alias_value":"6C4D4L7PNX22","created_at":"2026-07-05T10:53:06.471827+00:00"},{"alias_kind":"pith_short_16","alias_value":"6C4D4L7PNX22I6CF","created_at":"2026-07-05T10:53:06.471827+00:00"},{"alias_kind":"pith_short_8","alias_value":"6C4D4L7P","created_at":"2026-07-05T10:53:06.471827+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.31577","citing_title":"SurGe: Improved Surface Geometry in Point Maps","ref_index":17,"is_internal_anchor":false},{"citing_arxiv_id":"2601.16171","citing_title":"Multi-User Non-Linearly Separable Distributed Computing","ref_index":29,"is_internal_anchor":false},{"citing_arxiv_id":"2511.00062","citing_title":"World Simulation with Video Foundation Models for Physical AI","ref_index":30,"is_internal_anchor":false},{"citing_arxiv_id":"2604.15911","citing_title":"Efficient Video Diffusion Models: Advancements and Challenges","ref_index":287,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6C4D4L7PNX22I6CFM5VTLI2CWK","json":"https://pith.science/pith/6C4D4L7PNX22I6CFM5VTLI2CWK.json","graph_json":"https://pith.science/api/pith-number/6C4D4L7PNX22I6CFM5VTLI2CWK/graph.json","events_json":"https://pith.science/api/pith-number/6C4D4L7PNX22I6CFM5VTLI2CWK/events.json","paper":"https://pith.science/paper/6C4D4L7P"},"agent_actions":{"view_html":"https://pith.science/pith/6C4D4L7PNX22I6CFM5VTLI2CWK","download_json":"https://pith.science/pith/6C4D4L7PNX22I6CFM5VTLI2CWK.json","view_paper":"https://pith.science/paper/6C4D4L7P","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2504.16922&json=true","fetch_graph":"https://pith.science/api/pith-number/6C4D4L7PNX22I6CFM5VTLI2CWK/graph.json","fetch_events":"https://pith.science/api/pith-number/6C4D4L7PNX22I6CFM5VTLI2CWK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6C4D4L7PNX22I6CFM5VTLI2CWK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6C4D4L7PNX22I6CFM5VTLI2CWK/action/storage_attestation","attest_author":"https://pith.science/pith/6C4D4L7PNX22I6CFM5VTLI2CWK/action/author_attestation","sign_citation":"https://pith.science/pith/6C4D4L7PNX22I6CFM5VTLI2CWK/action/citation_signature","submit_replication":"https://pith.science/pith/6C4D4L7PNX22I6CFM5VTLI2CWK/action/replication_record"}},"created_at":"2026-07-05T10:53:06.471827+00:00","updated_at":"2026-07-05T10:53:06.471827+00:00"}