{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:I7FRUQEQRFHZE4DXMO7FAXONRY","short_pith_number":"pith:I7FRUQEQ","canonical_record":{"source":{"id":"2607.27692","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2026-07-30T05:25:23Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"cce521f1fb3763583d2bb5b84503f05ef69ba25fa9f59deb708a83fd65b86f9d","abstract_canon_sha256":"1f351767b35c548f18e738307285fc9349894f89bd52b6a8047b73676654c61c"},"schema_version":"1.0"},"canonical_sha256":"47cb1a4090894f92707763be505dcd8e0b5c4e1c51439d216cfb3ddb64ed085a","source":{"kind":"arxiv","id":"2607.27692","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.27692","created_at":"2026-07-31T01:29:44Z"},{"alias_kind":"arxiv_version","alias_value":"2607.27692v1","created_at":"2026-07-31T01:29:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.27692","created_at":"2026-07-31T01:29:44Z"},{"alias_kind":"pith_short_12","alias_value":"I7FRUQEQRFHZ","created_at":"2026-07-31T01:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"I7FRUQEQRFHZE4DX","created_at":"2026-07-31T01:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"I7FRUQEQ","created_at":"2026-07-31T01:29:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:I7FRUQEQRFHZE4DXMO7FAXONRY","target":"record","payload":{"canonical_record":{"source":{"id":"2607.27692","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2026-07-30T05:25:23Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"cce521f1fb3763583d2bb5b84503f05ef69ba25fa9f59deb708a83fd65b86f9d","abstract_canon_sha256":"1f351767b35c548f18e738307285fc9349894f89bd52b6a8047b73676654c61c"},"schema_version":"1.0"},"canonical_sha256":"47cb1a4090894f92707763be505dcd8e0b5c4e1c51439d216cfb3ddb64ed085a","receipt":{"kind":"pith_receipt","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"47cb1a4090894f92707763be505dcd8e0b5c4e1c51439d216cfb3ddb64ed085a","last_reissued_at":"2026-07-31T01:29:44.891787Z","signature_status":"unsigned_v0","first_computed_at":"2026-07-31T01:29:44.891787Z"},"source_kind":"arxiv","source_id":"2607.27692","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-31T01:29:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1//JZdU5hZnIU4bvo/Z416QUP/Rr1RX9BgZ9UFS/87IpZw44v5r0MkEgy09fZuSblOZDpfGse9NUmgSObq8bAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T05:49:46.348105Z"},"content_sha256":"c0ceab414372c8a2369f15b45300d9a25d035916273dbd1acdd232331ee4ae54","schema_version":"1.0","event_id":"sha256:c0ceab414372c8a2369f15b45300d9a25d035916273dbd1acdd232331ee4ae54"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:I7FRUQEQRFHZE4DXMO7FAXONRY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Recall Before You Rank: Similarity-Guided Top-$K$ Reuse for Efficient Long-Context Attention","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CL","authors_text":"Hanyong Shao, Kechao Tang, Ru Huang, Wenshuai Yao, Wenyong Zhou, Yizhe Chen, Yuannuo Feng, Zhiyuan Ning","submitted_at":"2026-07-30T05:25:23Z","abstract_excerpt":"Top-$K$ sparse attention reduces the cost of Softmax and value aggregation by attending to only a small subset of key--value (KV) entries. However, identifying this subset still requires scoring the current query against the full KV cache and performing global Top-$K$ selection, leaving selector cost linear in context length and limiting the practical efficiency of sparse attention for long-context decoding. In this paper, we introduce ReTopK, a training-free method that accelerates dynamic Top-$K$ attention by reusing historical retrieval decisions. ReTopK builds on the observation that simil"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.27692","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.27692/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-31T01:29:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8m06NtTq2BDpEJxUAhIUBYcmKWTukSx9u6FGH2C0gt713h+3VlWOc9voj2njULDOObuwe8qnDT8xiQy0tNdLCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T05:49:46.348595Z"},"content_sha256":"112eafb623322702046ed3c466c675f0eafed2f3365ba8305e28d3a7e80347b1","schema_version":"1.0","event_id":"sha256:112eafb623322702046ed3c466c675f0eafed2f3365ba8305e28d3a7e80347b1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/I7FRUQEQRFHZE4DXMO7FAXONRY/bundle.json","state_url":"https://pith.science/pith/I7FRUQEQRFHZE4DXMO7FAXONRY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/I7FRUQEQRFHZE4DXMO7FAXONRY/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-09T05:49:46Z","links":{"resolver":"https://pith.science/pith/I7FRUQEQRFHZE4DXMO7FAXONRY","bundle":"https://pith.science/pith/I7FRUQEQRFHZE4DXMO7FAXONRY/bundle.json","state":"https://pith.science/pith/I7FRUQEQRFHZE4DXMO7FAXONRY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/I7FRUQEQRFHZE4DXMO7FAXONRY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:I7FRUQEQRFHZE4DXMO7FAXONRY","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":"1f351767b35c548f18e738307285fc9349894f89bd52b6a8047b73676654c61c","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2026-07-30T05:25:23Z","title_canon_sha256":"cce521f1fb3763583d2bb5b84503f05ef69ba25fa9f59deb708a83fd65b86f9d"},"schema_version":"1.0","source":{"id":"2607.27692","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.27692","created_at":"2026-07-31T01:29:44Z"},{"alias_kind":"arxiv_version","alias_value":"2607.27692v1","created_at":"2026-07-31T01:29:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.27692","created_at":"2026-07-31T01:29:44Z"},{"alias_kind":"pith_short_12","alias_value":"I7FRUQEQRFHZ","created_at":"2026-07-31T01:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"I7FRUQEQRFHZE4DX","created_at":"2026-07-31T01:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"I7FRUQEQ","created_at":"2026-07-31T01:29:44Z"}],"graph_snapshots":[{"event_id":"sha256:112eafb623322702046ed3c466c675f0eafed2f3365ba8305e28d3a7e80347b1","target":"graph","created_at":"2026-07-31T01:29:44Z","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/2607.27692/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Top-$K$ sparse attention reduces the cost of Softmax and value aggregation by attending to only a small subset of key--value (KV) entries. However, identifying this subset still requires scoring the current query against the full KV cache and performing global Top-$K$ selection, leaving selector cost linear in context length and limiting the practical efficiency of sparse attention for long-context decoding. In this paper, we introduce ReTopK, a training-free method that accelerates dynamic Top-$K$ attention by reusing historical retrieval decisions. ReTopK builds on the observation that simil","authors_text":"Hanyong Shao, Kechao Tang, Ru Huang, Wenshuai Yao, Wenyong Zhou, Yizhe Chen, Yuannuo Feng, Zhiyuan Ning","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2026-07-30T05:25:23Z","title":"Recall Before You Rank: Similarity-Guided Top-$K$ Reuse for Efficient Long-Context Attention"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.27692","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:c0ceab414372c8a2369f15b45300d9a25d035916273dbd1acdd232331ee4ae54","target":"record","created_at":"2026-07-31T01:29:44Z","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":"1f351767b35c548f18e738307285fc9349894f89bd52b6a8047b73676654c61c","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2026-07-30T05:25:23Z","title_canon_sha256":"cce521f1fb3763583d2bb5b84503f05ef69ba25fa9f59deb708a83fd65b86f9d"},"schema_version":"1.0","source":{"id":"2607.27692","kind":"arxiv","version":1}},"canonical_sha256":"47cb1a4090894f92707763be505dcd8e0b5c4e1c51439d216cfb3ddb64ed085a","receipt":{"builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"47cb1a4090894f92707763be505dcd8e0b5c4e1c51439d216cfb3ddb64ed085a","first_computed_at":"2026-07-31T01:29:44.891787Z","kind":"pith_receipt","last_reissued_at":"2026-07-31T01:29:44.891787Z","receipt_version":"0.3","signature_status":"unsigned_v0"},"source_id":"2607.27692","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c0ceab414372c8a2369f15b45300d9a25d035916273dbd1acdd232331ee4ae54","sha256:112eafb623322702046ed3c466c675f0eafed2f3365ba8305e28d3a7e80347b1"],"state_sha256":"f3504db50b137291385ef6ed4c9e4e92f3e61d28e8dab3c2023dcaf58198a197"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WmtG2hPVoLLJXKbrYRXUQ8NxxtodXeA9xg7U1d6+nRi6k1brDasFBWIU9q+8vs5/GMLt3xUhz1HBN5YiCgXVDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-09T05:49:46.352152Z","bundle_sha256":"357474997712301aa7fcebabb32c404c8de494f2f16c3794f5ee99f85af2a4d2"}}