{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:WJLR6S43UQI6POXUYSDIRZECTW","short_pith_number":"pith:WJLR6S43","schema_version":"1.0","canonical_sha256":"b2571f4b9ba411e7baf4c48688e4829db1b8c9bdc8af4b5462d217ab006e9112","source":{"kind":"arxiv","id":"2607.11976","version":1},"attestation_state":"computed","paper":{"title":"LiteTopK: Exploiting the Curse of Dimensionality for a Fused Indexer-TopK Kernel in Long-Context Sparse Attention","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Gao Cong, Jiangneng Li, Jianyang Gao, Peiqi Yin, Ziqi Yin","submitted_at":"2026-07-13T03:53:56Z","abstract_excerpt":"Indexer-TopK, the operation to compute the scores and select the top-k candidates, is widely used by sparse attention kernels in large language models and vector retrieval in recommendation systems and vector databases. However, existing GPU-based Indexer-TopK kernels like DeepSeek Sparse Attention (DSA) remain inefficient due to excessive global memory traffic, costly synchronization, and prohibitive memory overhead. In this work, we exploit the curse of dimensionality in high-dimensional spaces, where distances between high-dimensional vectors tend to concentrate within a narrow range, to de"},"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":"2607.11976","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-07-13T03:53:56Z","cross_cats_sorted":[],"title_canon_sha256":"f33ea90912e47c96d69104aa611208986fff713fbe5b9a8b9f3ca43d3ed1a2e1","abstract_canon_sha256":"b59e90bb7e7a1e336d69f26cd7d5986a4610613aba802d22db7af18875d8eceb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-15T00:21:25.683044Z","signature_b64":"oE8I1PaOUAipggrzqqs8QTHqphki5PvFnnpRAbQ0iCj6xsSmHtucChYv131I/3NDXyj+3xxoSPHgx4shPYFQAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b2571f4b9ba411e7baf4c48688e4829db1b8c9bdc8af4b5462d217ab006e9112","last_reissued_at":"2026-07-15T00:21:25.682257Z","signature_status":"signed_v1","first_computed_at":"2026-07-15T00:21:25.682257Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"LiteTopK: Exploiting the Curse of Dimensionality for a Fused Indexer-TopK Kernel in Long-Context Sparse Attention","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Gao Cong, Jiangneng Li, Jianyang Gao, Peiqi Yin, Ziqi Yin","submitted_at":"2026-07-13T03:53:56Z","abstract_excerpt":"Indexer-TopK, the operation to compute the scores and select the top-k candidates, is widely used by sparse attention kernels in large language models and vector retrieval in recommendation systems and vector databases. However, existing GPU-based Indexer-TopK kernels like DeepSeek Sparse Attention (DSA) remain inefficient due to excessive global memory traffic, costly synchronization, and prohibitive memory overhead. In this work, we exploit the curse of dimensionality in high-dimensional spaces, where distances between high-dimensional vectors tend to concentrate within a narrow range, to de"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.11976","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.11976/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":"2607.11976","created_at":"2026-07-15T00:21:25.682669+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.11976v1","created_at":"2026-07-15T00:21:25.682669+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.11976","created_at":"2026-07-15T00:21:25.682669+00:00"},{"alias_kind":"pith_short_12","alias_value":"WJLR6S43UQI6","created_at":"2026-07-15T00:21:25.682669+00:00"},{"alias_kind":"pith_short_16","alias_value":"WJLR6S43UQI6POXU","created_at":"2026-07-15T00:21:25.682669+00:00"},{"alias_kind":"pith_short_8","alias_value":"WJLR6S43","created_at":"2026-07-15T00:21:25.682669+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WJLR6S43UQI6POXUYSDIRZECTW","json":"https://pith.science/pith/WJLR6S43UQI6POXUYSDIRZECTW.json","graph_json":"https://pith.science/api/pith-number/WJLR6S43UQI6POXUYSDIRZECTW/graph.json","events_json":"https://pith.science/api/pith-number/WJLR6S43UQI6POXUYSDIRZECTW/events.json","paper":"https://pith.science/paper/WJLR6S43"},"agent_actions":{"view_html":"https://pith.science/pith/WJLR6S43UQI6POXUYSDIRZECTW","download_json":"https://pith.science/pith/WJLR6S43UQI6POXUYSDIRZECTW.json","view_paper":"https://pith.science/paper/WJLR6S43","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.11976&json=true","fetch_graph":"https://pith.science/api/pith-number/WJLR6S43UQI6POXUYSDIRZECTW/graph.json","fetch_events":"https://pith.science/api/pith-number/WJLR6S43UQI6POXUYSDIRZECTW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WJLR6S43UQI6POXUYSDIRZECTW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WJLR6S43UQI6POXUYSDIRZECTW/action/storage_attestation","attest_author":"https://pith.science/pith/WJLR6S43UQI6POXUYSDIRZECTW/action/author_attestation","sign_citation":"https://pith.science/pith/WJLR6S43UQI6POXUYSDIRZECTW/action/citation_signature","submit_replication":"https://pith.science/pith/WJLR6S43UQI6POXUYSDIRZECTW/action/replication_record"}},"created_at":"2026-07-15T00:21:25.682669+00:00","updated_at":"2026-07-15T00:21:25.682669+00:00"}