{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:SPHBHSTURLT5IDHRIVR3XQFSRQ","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":"d7aae02bed5f6b245bba887f0ca7bc9af34b42087ca3d9c2c16f192c3335aa41","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-05-22T15:23:26Z","title_canon_sha256":"5edf548b6a21fae405762f6d20fd12b74600e1c8b1e0f19655b4ae4abd8cd8d3"},"schema_version":"1.0","source":{"id":"2605.23751","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.23751","created_at":"2026-05-25T02:02:30Z"},{"alias_kind":"arxiv_version","alias_value":"2605.23751v1","created_at":"2026-05-25T02:02:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.23751","created_at":"2026-05-25T02:02:30Z"},{"alias_kind":"pith_short_12","alias_value":"SPHBHSTURLT5","created_at":"2026-05-25T02:02:30Z"},{"alias_kind":"pith_short_16","alias_value":"SPHBHSTURLT5IDHR","created_at":"2026-05-25T02:02:30Z"},{"alias_kind":"pith_short_8","alias_value":"SPHBHSTU","created_at":"2026-05-25T02:02:30Z"}],"graph_snapshots":[{"event_id":"sha256:f3d280cd692b4fb477e34214cbfe48a5e9b6cc100c9fae110dfb564433e4cc77","target":"graph","created_at":"2026-05-25T02:02:30Z","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/2605.23751/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We revisit the I/O complexity of attention in large language models. Given query-key-value matrices $Q,K,V\\in\\mathbb{R}^{n\\times d}$, and a machine with fast memory size $M$, the goal is to compute the \"attention matrix\" $A=\\text{softmax}(Q K ^{\\top}/\\sqrt{d}) V$ with the minimal number of data transfers between fast and slow memory. Existing methods in the literature, most notably FlashAttention and its variants, incur an I/O cost that depends quadratically on $n$, while a trivial lower bound only requires $\\Omega(nd)$ I/O's to read the inputs and write the output. In this work, we present a ","authors_text":"Aleksandros Sobczyk, Anastasios Zouzias, P\\'al Andr\\'as Papp","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-05-22T15:23:26Z","title":"Approaching I/O-optimality for Approximate Attention"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.23751","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:19447ef60410ca67da8201e65ac82449bee3a13d4b2fba50222409cedd41bad6","target":"record","created_at":"2026-05-25T02:02:30Z","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":"d7aae02bed5f6b245bba887f0ca7bc9af34b42087ca3d9c2c16f192c3335aa41","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-05-22T15:23:26Z","title_canon_sha256":"5edf548b6a21fae405762f6d20fd12b74600e1c8b1e0f19655b4ae4abd8cd8d3"},"schema_version":"1.0","source":{"id":"2605.23751","kind":"arxiv","version":1}},"canonical_sha256":"93ce13ca748ae7d40cf14563bbc0b28c1772854475bfceba8b38b47cfed1ad46","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"93ce13ca748ae7d40cf14563bbc0b28c1772854475bfceba8b38b47cfed1ad46","first_computed_at":"2026-05-25T02:02:30.481563Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-25T02:02:30.481563Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9/fQh0Wf33jjZa2b6F6hEDdkcDD8h309Psnk7n8LELkKfNKL3nl3AW4e/9vA9vA+aHDTrpWsRqb1mlzKB+2gBQ==","signature_status":"signed_v1","signed_at":"2026-05-25T02:02:30.482377Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.23751","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:19447ef60410ca67da8201e65ac82449bee3a13d4b2fba50222409cedd41bad6","sha256:f3d280cd692b4fb477e34214cbfe48a5e9b6cc100c9fae110dfb564433e4cc77"],"state_sha256":"8f672e5569a3df14247791f59877c4f7b62ea72f0983763c8d709580239f4c11"}