{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:XARKISWTWL77GOF3REB7SEHZXM","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":"7ae9a3ee0b125d2213d63e83abef7aacf5a01522096f9c596bd9658a473937a5","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2026-05-16T06:47:41Z","title_canon_sha256":"737bfbe36fe943f6268813677dd619f9410ed42f63c6c0a7ea40ef1f71ee028d"},"schema_version":"1.0","source":{"id":"2605.16839","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.16839","created_at":"2026-05-20T00:03:25Z"},{"alias_kind":"arxiv_version","alias_value":"2605.16839v1","created_at":"2026-05-20T00:03:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.16839","created_at":"2026-05-20T00:03:25Z"},{"alias_kind":"pith_short_12","alias_value":"XARKISWTWL77","created_at":"2026-05-20T00:03:25Z"},{"alias_kind":"pith_short_16","alias_value":"XARKISWTWL77GOF3","created_at":"2026-05-20T00:03:25Z"},{"alias_kind":"pith_short_8","alias_value":"XARKISWT","created_at":"2026-05-20T00:03:25Z"}],"graph_snapshots":[{"event_id":"sha256:4af4ec9c95a95697d9074ba9b1691de39b990f73090f3990162b193ca546a847","target":"graph","created_at":"2026-05-20T00:03:25Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"On LLaMA-3.1-8B-Instruct, CompactAttention maintains accuracy close to dense attention on the RULER benchmark while delivering up to 2.72× attention speedup at 128K context length under chunked prefill."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The construction of GQA-aware per-group KV block tables via Q-block union and intra-group union produces the minimal tables that preserve all KV blocks selected by the input masks under paged execution constraints without missing query-specific entries."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"CompactAttention accelerates chunked-prefill attention via Block-Union KV Selection, delivering up to 2.72x speedup at 128K context on LLaMA-3.1-8B while matching dense accuracy on RULER."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Block-union KV selection builds minimal tables so chunked prefill attention runs up to 2.72 times faster while staying close to dense accuracy."}],"snapshot_sha256":"2076819c7affe5a6e61cdc4bfb3bb202c05ee3a9d9a7879c895920213ea15900"},"formal_canon":{"evidence_count":1,"snapshot_sha256":"13fb3fec9d7324a45aef6c07420d0047a3ef2724a78ed97d2733c55fc98a9517"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"doi_title_agreement","ran_at":"2026-05-19T21:31:19.236773Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T21:20:56.776000Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"claim_evidence","ran_at":"2026-05-19T18:41:56.323268Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-19T18:33:26.395742Z","status":"skipped","version":"1.0.0"}],"endpoint":"/pith/2605.16839/integrity.json","findings":[],"snapshot_sha256":"c456aa911eb1598e933d3ef7f12087df499110ce49fe6daf90c19f3d98342b88","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Chunked prefill has become a widely adopted serving strategy for long-context large language models, but efficient attention computation in this regime remains challenging. Existing sparse attention methods are primarily designed for one-shot prefill and do not translate efficiently to chunked prefill: block-sparse kernels lose efficiency when the query length is limited by the chunk size, while fine-grained pattern search becomes costly when repeated over the accumulated KV cache at every chunk. QUOKA, a recent method that directly targets chunked prefill, avoids sparse-kernel overhead but re","authors_text":"Beomseok Kang, Dongwon Jo, Jae-Joon Kim, Jiwon Song","cross_cats":[],"headline":"Block-union KV selection builds minimal tables so chunked prefill attention runs up to 2.72 times faster while staying close to dense accuracy.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2026-05-16T06:47:41Z","title":"CompactAttention: Accelerating Chunked Prefill with Block-Union KV Selection"},"references":{"count":28,"internal_anchors":9,"resolved_work":28,"sample":[{"cited_arxiv_id":"2601.03267","doi":"","is_internal_anchor":true,"ref_index":1,"title":"OpenAI GPT-5 System Card","work_id":"ca87689a-0d29-4476-b504-b65dbbb08af4","year":2025},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"System card: Claude Opus 4.6","work_id":"d72a2098-05b3-4aae-ad94-f93a8fc5576d","year":2026},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"Gemini 3 Pro model card","work_id":"267390f5-3359-44fc-855f-79a2c06c7d30","year":2025},{"cited_arxiv_id":"2602.02276","doi":"","is_internal_anchor":true,"ref_index":4,"title":"Kimi K2.5: Visual Agentic Intelligence","work_id":"d690be8f-5d53-49b0-b1e7-79668eb8fcdb","year":2026},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"Deepseek-v4: Towards highly efficient million-token context intelligence","work_id":"b5a5843d-47c0-432e-88d5-c9eaac555a7f","year":2026}],"snapshot_sha256":"1e70316cabd47fd7bd15ab7a67cabec1e4f42f290186508b9ff28f8cd85a2a26"},"source":{"id":"2605.16839","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-19T21:15:41.130579Z","id":"52526f39-cdc7-4f46-b6e5-98baadde51ba","model_set":{"reader":"grok-4.3"},"one_line_summary":"CompactAttention accelerates chunked-prefill attention via Block-Union KV Selection, delivering up to 2.72x speedup at 128K context on LLaMA-3.1-8B while matching dense accuracy on RULER.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Block-union KV selection builds minimal tables so chunked prefill attention runs up to 2.72 times faster while staying close to dense accuracy.","strongest_claim":"On LLaMA-3.1-8B-Instruct, CompactAttention maintains accuracy close to dense attention on the RULER benchmark while delivering up to 2.72× attention speedup at 128K context length under chunked prefill.","weakest_assumption":"The construction of GQA-aware per-group KV block tables via Q-block union and intra-group union produces the minimal tables that preserve all KV blocks selected by the input masks under paged execution constraints without missing query-specific entries."}},"verdict_id":"52526f39-cdc7-4f46-b6e5-98baadde51ba"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:d8b7603b2e84b57ca6a9e3e2f6c75d6fbbb0e1509441bc5aadf5bbe2d18cbc1b","target":"record","created_at":"2026-05-20T00:03:25Z","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":"7ae9a3ee0b125d2213d63e83abef7aacf5a01522096f9c596bd9658a473937a5","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CL","submitted_at":"2026-05-16T06:47:41Z","title_canon_sha256":"737bfbe36fe943f6268813677dd619f9410ed42f63c6c0a7ea40ef1f71ee028d"},"schema_version":"1.0","source":{"id":"2605.16839","kind":"arxiv","version":1}},"canonical_sha256":"b822a44ad3b2fff338bb8903f910f9bb14f361a79e1e056d6778f43b63fabd8f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b822a44ad3b2fff338bb8903f910f9bb14f361a79e1e056d6778f43b63fabd8f","first_computed_at":"2026-05-20T00:03:25.502780Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:03:25.502780Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AXKepVN9FRh32ycW0CskLdVtQWa8BoG7OKVUUOM79G2lixRA760v4f34rKPQQFhwyt/fw9sCXQOqAr4JjGeiAw==","signature_status":"signed_v1","signed_at":"2026-05-20T00:03:25.503597Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.16839","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d8b7603b2e84b57ca6a9e3e2f6c75d6fbbb0e1509441bc5aadf5bbe2d18cbc1b","sha256:4af4ec9c95a95697d9074ba9b1691de39b990f73090f3990162b193ca546a847"],"state_sha256":"d5605fd5f53404c396ce9421d23022be02456f8dae0cec437f127879db30fee5"}