{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:FEIDO233DGX4TYELJ7CRIHF3Z6","short_pith_number":"pith:FEIDO233","canonical_record":{"source":{"id":"2509.09001","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-09-10T20:59:44Z","cross_cats_sorted":[],"title_canon_sha256":"533aca3bc1ac5594d6fedf5ca32ce9641fa3d50484de75675b4c2ea7ff124053","abstract_canon_sha256":"2be338ba7df92afcdadafcd574a91716a5053fd2a627ab8d5b663cad56693e88"},"schema_version":"1.0"},"canonical_sha256":"2910376b7b19afc9e08b4fc5141cbbcfbe747baa2f8ffb24d46951264a65f6fb","source":{"kind":"arxiv","id":"2509.09001","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2509.09001","created_at":"2026-07-05T12:09:27Z"},{"alias_kind":"arxiv_version","alias_value":"2509.09001v1","created_at":"2026-07-05T12:09:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.09001","created_at":"2026-07-05T12:09:27Z"},{"alias_kind":"pith_short_12","alias_value":"FEIDO233DGX4","created_at":"2026-07-05T12:09:27Z"},{"alias_kind":"pith_short_16","alias_value":"FEIDO233DGX4TYEL","created_at":"2026-07-05T12:09:27Z"},{"alias_kind":"pith_short_8","alias_value":"FEIDO233","created_at":"2026-07-05T12:09:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:FEIDO233DGX4TYELJ7CRIHF3Z6","target":"record","payload":{"canonical_record":{"source":{"id":"2509.09001","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-09-10T20:59:44Z","cross_cats_sorted":[],"title_canon_sha256":"533aca3bc1ac5594d6fedf5ca32ce9641fa3d50484de75675b4c2ea7ff124053","abstract_canon_sha256":"2be338ba7df92afcdadafcd574a91716a5053fd2a627ab8d5b663cad56693e88"},"schema_version":"1.0"},"canonical_sha256":"2910376b7b19afc9e08b4fc5141cbbcfbe747baa2f8ffb24d46951264a65f6fb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:09:27.384594Z","signature_b64":"2HB6vCvVIgw/LoLT5epuK9XCOS9GUUFKlxlVA5TbJILElibteRBBy5WnW1FKtkbjW6XZH3dcjsHMmTYT3s0+Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2910376b7b19afc9e08b4fc5141cbbcfbe747baa2f8ffb24d46951264a65f6fb","last_reissued_at":"2026-07-05T12:09:27.383972Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:09:27.383972Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2509.09001","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T12:09:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+MZpRfoNQa5BOB/+PRPvIKPGpBuglgBfazikZYM2Ju8WEhLOjgjpB2Ei4ccNoegUUcVmiqRV7kpRhV+VRA+3CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T17:42:25.909055Z"},"content_sha256":"e2fac9ba78de71afb1232eb890d4462967ea9cfd5924f8b5c9f5470b5b2a2119","schema_version":"1.0","event_id":"sha256:e2fac9ba78de71afb1232eb890d4462967ea9cfd5924f8b5c9f5470b5b2a2119"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:FEIDO233DGX4TYELJ7CRIHF3Z6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast attention mechanisms: a tale of parallelism","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Alexandr Andoni, Clayton Sanford, Daniel Hsu, Hantao Yu, Jingwen Liu","submitted_at":"2025-09-10T20:59:44Z","abstract_excerpt":"Transformers have the representational capacity to simulate Massively Parallel Computation (MPC) algorithms, but they suffer from quadratic time complexity, which severely limits their scalability. We introduce an efficient attention mechanism called Approximate Nearest Neighbor Attention (ANNA) with sub-quadratic time complexity. We prove that ANNA-transformers (1) retain the expressive power previously established for standard attention in terms of matching the capabilities of MPC algorithms, and (2) can solve key reasoning tasks such as Match2 and $k$-hop with near-optimal depth. Using the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.09001","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/2509.09001/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T12:09:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gAVLbQ21RNEGA3/YGKVZ/1VqAmCK5KS20FsVXStUFELfqcNmaOS0ejUtDEwSFOd9mVHDhKX33vm3iYkb/hvPDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T17:42:25.909436Z"},"content_sha256":"fe4d0b1c98665db4f18564ab0d50da24d4cb0367b7f69a6b6e926630a257977c","schema_version":"1.0","event_id":"sha256:fe4d0b1c98665db4f18564ab0d50da24d4cb0367b7f69a6b6e926630a257977c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FEIDO233DGX4TYELJ7CRIHF3Z6/bundle.json","state_url":"https://pith.science/pith/FEIDO233DGX4TYELJ7CRIHF3Z6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FEIDO233DGX4TYELJ7CRIHF3Z6/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-05T17:42:25Z","links":{"resolver":"https://pith.science/pith/FEIDO233DGX4TYELJ7CRIHF3Z6","bundle":"https://pith.science/pith/FEIDO233DGX4TYELJ7CRIHF3Z6/bundle.json","state":"https://pith.science/pith/FEIDO233DGX4TYELJ7CRIHF3Z6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FEIDO233DGX4TYELJ7CRIHF3Z6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:FEIDO233DGX4TYELJ7CRIHF3Z6","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"2be338ba7df92afcdadafcd574a91716a5053fd2a627ab8d5b663cad56693e88","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-09-10T20:59:44Z","title_canon_sha256":"533aca3bc1ac5594d6fedf5ca32ce9641fa3d50484de75675b4c2ea7ff124053"},"schema_version":"1.0","source":{"id":"2509.09001","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2509.09001","created_at":"2026-07-05T12:09:27Z"},{"alias_kind":"arxiv_version","alias_value":"2509.09001v1","created_at":"2026-07-05T12:09:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.09001","created_at":"2026-07-05T12:09:27Z"},{"alias_kind":"pith_short_12","alias_value":"FEIDO233DGX4","created_at":"2026-07-05T12:09:27Z"},{"alias_kind":"pith_short_16","alias_value":"FEIDO233DGX4TYEL","created_at":"2026-07-05T12:09:27Z"},{"alias_kind":"pith_short_8","alias_value":"FEIDO233","created_at":"2026-07-05T12:09:27Z"}],"graph_snapshots":[{"event_id":"sha256:fe4d0b1c98665db4f18564ab0d50da24d4cb0367b7f69a6b6e926630a257977c","target":"graph","created_at":"2026-07-05T12:09:27Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2509.09001/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Transformers have the representational capacity to simulate Massively Parallel Computation (MPC) algorithms, but they suffer from quadratic time complexity, which severely limits their scalability. We introduce an efficient attention mechanism called Approximate Nearest Neighbor Attention (ANNA) with sub-quadratic time complexity. We prove that ANNA-transformers (1) retain the expressive power previously established for standard attention in terms of matching the capabilities of MPC algorithms, and (2) can solve key reasoning tasks such as Match2 and $k$-hop with near-optimal depth. Using the ","authors_text":"Alexandr Andoni, Clayton Sanford, Daniel Hsu, Hantao Yu, Jingwen Liu","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-09-10T20:59:44Z","title":"Fast attention mechanisms: a tale of parallelism"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.09001","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:e2fac9ba78de71afb1232eb890d4462967ea9cfd5924f8b5c9f5470b5b2a2119","target":"record","created_at":"2026-07-05T12:09:27Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"2be338ba7df92afcdadafcd574a91716a5053fd2a627ab8d5b663cad56693e88","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-09-10T20:59:44Z","title_canon_sha256":"533aca3bc1ac5594d6fedf5ca32ce9641fa3d50484de75675b4c2ea7ff124053"},"schema_version":"1.0","source":{"id":"2509.09001","kind":"arxiv","version":1}},"canonical_sha256":"2910376b7b19afc9e08b4fc5141cbbcfbe747baa2f8ffb24d46951264a65f6fb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2910376b7b19afc9e08b4fc5141cbbcfbe747baa2f8ffb24d46951264a65f6fb","first_computed_at":"2026-07-05T12:09:27.383972Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T12:09:27.383972Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2HB6vCvVIgw/LoLT5epuK9XCOS9GUUFKlxlVA5TbJILElibteRBBy5WnW1FKtkbjW6XZH3dcjsHMmTYT3s0+Dg==","signature_status":"signed_v1","signed_at":"2026-07-05T12:09:27.384594Z","signed_message":"canonical_sha256_bytes"},"source_id":"2509.09001","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e2fac9ba78de71afb1232eb890d4462967ea9cfd5924f8b5c9f5470b5b2a2119","sha256:fe4d0b1c98665db4f18564ab0d50da24d4cb0367b7f69a6b6e926630a257977c"],"state_sha256":"1c8391e040de255cec1e4959cb2538cca10c59cd5c6e9ddc88144b37a7296149"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EkZLF4tr8CvaJGOIs1mktl3oSNwLBYS2oWBauc2PAXOO9NFmXsqbTV7npK83Heq9HBvzQR4X1Lv0nfN/i4ZYCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T17:42:25.911856Z","bundle_sha256":"bdc72287818a3f4478414230a46c3808277948fd552bd78f1f795f346d54f575"}}