{"as_of":"2026-08-09T02:24:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:7bae9fd6d65fee0ae0c48e3d1a2b12e7447c27f0fbaf59d15a6ae1ade68e3d91","coverage":[{"denominator":14,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":14,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-02T07:07:40.303218Z","state":"measured"},{"denominator":14,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":14,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2607.11976/citation-record","integrity":"/paper/2607.11976/integrity","json":"/paper/2607.11976/citation-record.json","paper":"/paper/2607.11976"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2512.02556","last_updated":"2025-12-02T09:25:14Z","snapshot_observed_at":"2026-07-31T23:49:25.878472Z","submitted_at":"2025-12-02T09:25:14Z","title":"DeepSeek-V3.2: Pushing the Frontier of Open Large Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2512.02556","snapshot_observed_at":"2026-08-02T07:07:39.527812Z","title":"Deepseek-v3","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.11976","last_updated":"2026-07-26T04:17:22Z","snapshot_observed_at":"2026-08-09T00:36:09.452998Z","submitted_at":"2026-07-13T03:53:56Z","title":"LiteTopK: Exploiting the Curse of Dimensionality for a Fused Indexer-TopK Kernel in Long-Context Sparse Attention","version":3},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-02T07:07:39.527812Z"},"links":{"cited_paper":"/paper/2512.02556","citing_paper":"/paper/2607.11976"},"observation_digest":"sha256:c9ffac2147e3cab2e0f5ceefaba8ced23c626fcbf6ef18e109beb5a8a4c6e9aa","observation_id":"86726c55-354b-407b-8e45-4699393a5fb8","resolution":{"observed_at":"2026-08-02T07:07:39.527812Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T07:07:39.696358Z","title":"The sparse frontier: Sparse attention trade-offs in transformer llms","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.11976","last_updated":"2026-07-26T04:17:22Z","snapshot_observed_at":"2026-08-09T00:36:09.452998Z","submitted_at":"2026-07-13T03:53:56Z","title":"LiteTopK: Exploiting the Curse of Dimensionality for a Fused Indexer-TopK Kernel in Long-Context Sparse Attention","version":3},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-02T07:07:39.696358Z"},"links":{"citing_paper":"/paper/2607.11976"},"observation_digest":"sha256:f7e3d819d6c8924a012316e066d41ee5d6ca20d0ed6f9c5fc63f9f868c0cf3c9","observation_id":"227c71dd-034c-4618-9371-d768c477edb6","resolution":{"observed_at":"2026-08-02T07:07:39.696358Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T07:07:39.782276Z","title":"Sparq attention: Bandwidth-efficient LLM inference","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.11976","last_updated":"2026-07-26T04:17:22Z","snapshot_observed_at":"2026-08-09T00:36:09.452998Z","submitted_at":"2026-07-13T03:53:56Z","title":"LiteTopK: Exploiting the Curse of Dimensionality for a Fused Indexer-TopK Kernel in Long-Context Sparse Attention","version":3},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-02T07:07:39.782276Z"},"links":{"citing_paper":"/paper/2607.11976"},"observation_digest":"sha256:31bd120571e0081730e5e9c787ec3caae2ed06a147a42e2ac3659d5a96e60e26","observation_id":"d6e0843e-0a13-4661-bc96-c07069e3fccb","resolution":{"observed_at":"2026-08-02T07:07:39.782276Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2502.06766","last_updated":"2025-02-12T15:55:37Z","snapshot_observed_at":"2026-08-09T00:35:37.697981Z","submitted_at":"2025-02-10T18:47:04Z","title":"Exploiting Sparsity for Long Context Inference: Million Token Contexts on Commodity GPUs","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2502.06766","snapshot_observed_at":"2026-08-02T07:07:39.861302Z","title":"Exploiting sparsity for long context inference: Million token contexts on commodity gpus.arXiv preprint arXiv:2502.06766,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.11976","last_updated":"2026-07-26T04:17:22Z","snapshot_observed_at":"2026-08-09T00:36:09.452998Z","submitted_at":"2026-07-13T03:53:56Z","title":"LiteTopK: Exploiting the Curse of Dimensionality for a Fused Indexer-TopK Kernel in Long-Context Sparse Attention","version":3},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-02T07:07:39.861302Z"},"links":{"cited_paper":"/paper/2502.06766","citing_paper":"/paper/2607.11976"},"observation_digest":"sha256:bf3e596057d4b505d8d7c2cb19ae652858e6e11880a3349ac6925386c580e3ba","observation_id":"dff7b74b-a10c-4dba-bbb3-fdc41ad26aed","resolution":{"observed_at":"2026-08-02T07:07:39.861302Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T07:07:40.060269Z","title":"A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2607.11976","last_updated":"2026-07-26T04:17:22Z","snapshot_observed_at":"2026-08-09T00:36:09.452998Z","submitted_at":"2026-07-13T03:53:56Z","title":"LiteTopK: Exploiting the Curse of Dimensionality for a Fused Indexer-TopK Kernel in Long-Context Sparse Attention","version":3},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-02T07:07:40.060269Z"},"links":{"citing_paper":"/paper/2607.11976"},"observation_digest":"sha256:6daf07b98ab72c74fd9956ed27995f5591216d08b6454fe4705aa315b9f1d144","observation_id":"33deba7c-a93c-4370-bc62-0018a9ab0905","resolution":{"observed_at":"2026-08-02T07:07:40.060269Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2508.07101","last_updated":"2026-04-27T18:22:21Z","snapshot_observed_at":"2026-08-02T15:36:16.082771Z","submitted_at":"2025-08-09T21:10:33Z","title":"Less Is More: Fast and Accurate Reasoning with Cross-Head Unified Sparse Attention","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2508.07101","snapshot_observed_at":"2026-08-02T07:07:40.145757Z","title":"Tidaldecode: Fast and accurate LLM decoding with position persistent sparse attention","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.11976","last_updated":"2026-07-26T04:17:22Z","snapshot_observed_at":"2026-08-09T00:36:09.452998Z","submitted_at":"2026-07-13T03:53:56Z","title":"LiteTopK: Exploiting the Curse of Dimensionality for a Fused Indexer-TopK Kernel in Long-Context Sparse Attention","version":3},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-02T07:07:40.145757Z"},"links":{"cited_paper":"/paper/2508.07101","citing_paper":"/paper/2607.11976"},"observation_digest":"sha256:2afe9c3acb654315bbe397a16f226c8bc70e97ca7ad44f7a7ef7b0bf1cce7745","observation_id":"74f291bc-e6d6-43cb-8e82-2be7d455b3b8","resolution":{"observed_at":"2026-08-02T07:07:40.145757Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2604.01960","last_updated":"2026-06-02T03:45:45Z","snapshot_observed_at":"2026-07-13T14:06:07.705156Z","submitted_at":"2026-04-02T12:22:38Z","title":"BBC: Improving Large-k Approximate Nearest Neighbor Search with a Bucket-based Result Collector","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2604.01960","snapshot_observed_at":"2026-08-02T07:07:40.303218Z","title":"Bbc: Improving large-k approximate nearest neighbor search with a bucket-based result collector.arXiv preprint arXiv:2604.01960,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.11976","last_updated":"2026-07-26T04:17:22Z","snapshot_observed_at":"2026-08-09T00:36:09.452998Z","submitted_at":"2026-07-13T03:53:56Z","title":"LiteTopK: Exploiting the Curse of Dimensionality for a Fused Indexer-TopK Kernel in Long-Context Sparse Attention","version":3},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-02T07:07:40.303218Z"},"links":{"cited_paper":"/paper/2604.01960","citing_paper":"/paper/2607.11976"},"observation_digest":"sha256:7d483d673695773bca48a6d78599f4cd041ba6be5fee82cd08a35d6c5a239374","observation_id":"1207151b-9498-458e-a7bb-bd7907e1cb0d","resolution":{"observed_at":"2026-08-02T07:07:40.303218Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T07:07:39.327612Z","title":"Interactrank: Personalized web-scale search pre-ranking with cross interaction features","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.11976","last_updated":"2026-07-26T04:17:22Z","snapshot_observed_at":"2026-08-09T00:36:09.452998Z","submitted_at":"2026-07-13T03:53:56Z","title":"LiteTopK: Exploiting the Curse of Dimensionality for a Fused Indexer-TopK Kernel in Long-Context Sparse Attention","version":3},"reference_index":1998,"source":"pdf_text","source_observed_at":"2026-08-02T07:07:39.327612Z"},"links":{"citing_paper":"/paper/2607.11976"},"observation_digest":"sha256:ff7317b1410398ddb9618fd57e3d36be9b5f25c3613c9e2120df6115b582827d","observation_id":"20f69d09-6432-4557-ab2c-eaebc22858c5","resolution":{"observed_at":"2026-08-02T07:07:39.327612Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T07:07:39.131375Z","title":"Index- cache: Accelerating sparse attention via cross-layer index reuse.arXiv preprint arXiv:2603.12201,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.11976","last_updated":"2026-07-26T04:17:22Z","snapshot_observed_at":"2026-08-09T00:36:09.452998Z","submitted_at":"2026-07-13T03:53:56Z","title":"LiteTopK: Exploiting the Curse of Dimensionality for a Fused Indexer-TopK Kernel in Long-Context Sparse Attention","version":3},"reference_index":2012,"source":"pdf_text","source_observed_at":"2026-08-02T07:07:39.131375Z"},"links":{"citing_paper":"/paper/2607.11976"},"observation_digest":"sha256:80404cd72f14f8508c851016bc3cd6d0117167c956b3459a34b54c5a7e352d11","observation_id":"302aad19-635e-4975-a7a2-e76717c12b7a","resolution":{"observed_at":"2026-08-02T07:07:39.131375Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.18887","last_updated":"2024-07-26T17:36:40Z","snapshot_observed_at":"2026-08-08T08:05:00.477139Z","submitted_at":"2024-07-26T17:36:40Z","title":"Embedding And Clustering Your Data Can Improve Contrastive Pretraining","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.18887","snapshot_observed_at":"2026-08-02T07:07:39.617592Z","title":"Embedding and clustering your data can improve contrastive pretraining.arXiv preprint arXiv:2407.18887,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.11976","last_updated":"2026-07-26T04:17:22Z","snapshot_observed_at":"2026-08-09T00:36:09.452998Z","submitted_at":"2026-07-13T03:53:56Z","title":"LiteTopK: Exploiting the Curse of Dimensionality for a Fused Indexer-TopK Kernel in Long-Context Sparse Attention","version":3},"reference_index":2016,"source":"pdf_text","source_observed_at":"2026-08-02T07:07:39.617592Z"},"links":{"cited_paper":"/paper/2407.18887","citing_paper":"/paper/2607.11976"},"observation_digest":"sha256:623cd17c8b1a8b7d7115b596643da3b72818bfdfb3f857812a552dbc2a090f6b","observation_id":"9bdda9c0-075b-4a34-9df4-f87ba0108bcd","resolution":{"observed_at":"2026-08-02T07:07:39.617592Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2606.13392","last_updated":"2026-06-11T14:23:41Z","snapshot_observed_at":"2026-08-06T06:40:14.278655Z","submitted_at":"2026-06-11T14:23:41Z","title":"MiniMax Sparse Attention","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2606.13392","snapshot_observed_at":"2026-08-02T07:07:39.402568Z","title":"Minimax sparse attention.arXiv preprint arXiv:2606.13392,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.11976","last_updated":"2026-07-26T04:17:22Z","snapshot_observed_at":"2026-08-09T00:36:09.452998Z","submitted_at":"2026-07-13T03:53:56Z","title":"LiteTopK: Exploiting the Curse of Dimensionality for a Fused Indexer-TopK Kernel in Long-Context Sparse Attention","version":3},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-02T07:07:39.402568Z"},"links":{"cited_paper":"/paper/2606.13392","citing_paper":"/paper/2607.11976"},"observation_digest":"sha256:a0865664bdaf68016939faf1e1b2e788979668e2d6b2866e319ae7739f2100b2","observation_id":"48eb18f1-d0aa-420c-bb1e-07e3a387dcbf","resolution":{"observed_at":"2026-08-02T07:07:39.402568Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T07:07:39.259346Z","title":"Approximate nearest neighbors: Towards removing the curse of dimensionality","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2607.11976","last_updated":"2026-07-26T04:17:22Z","snapshot_observed_at":"2026-08-09T00:36:09.452998Z","submitted_at":"2026-07-13T03:53:56Z","title":"LiteTopK: Exploiting the Curse of Dimensionality for a Fused Indexer-TopK Kernel in Long-Context Sparse Attention","version":3},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-02T07:07:39.259346Z"},"links":{"citing_paper":"/paper/2607.11976"},"observation_digest":"sha256:ae8c728d2bb9ce6156e3367c13c558cb86068d61f470a1f031eaf5bfc2a69b93","observation_id":"5f6d1ad0-55a4-41c8-8a7e-2c7507b1584d","resolution":{"observed_at":"2026-08-02T07:07:39.259346Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.10774","last_updated":"2024-08-26T21:01:02Z","snapshot_observed_at":"2026-07-06T18:31:36.504766Z","submitted_at":"2024-06-16T01:33:02Z","title":"Quest: Query-Aware Sparsity for Efficient Long-Context LLM Inference","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.10774","snapshot_observed_at":"2026-08-02T07:07:39.938460Z","title":"Quest: Query-aware sparsity for efficient long-context llm inference.arXiv preprint arXiv:2406.10774,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.11976","last_updated":"2026-07-26T04:17:22Z","snapshot_observed_at":"2026-08-09T00:36:09.452998Z","submitted_at":"2026-07-13T03:53:56Z","title":"LiteTopK: Exploiting the Curse of Dimensionality for a Fused Indexer-TopK Kernel in Long-Context Sparse Attention","version":3},"reference_index":2025,"source":"pdf_text","source_observed_at":"2026-08-02T07:07:39.938460Z"},"links":{"cited_paper":"/paper/2406.10774","citing_paper":"/paper/2607.11976"},"observation_digest":"sha256:f69919efd023c4a487048a242e3cf0163160e77c8d78ef5bd025e3cc693f836b","observation_id":"47653db3-2490-44eb-8acc-25f645a41c6c","resolution":{"observed_at":"2026-08-02T07:07:39.938460Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2602.15763","last_updated":"2026-02-24T10:44:44Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-02-17T17:50:56Z","title":"GLM-5: from Vibe Coding to Agentic Engineering","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2602.15763","snapshot_observed_at":"2026-08-02T07:07:39.192711Z","title":"Ankit Gupta, Guy Dar, Shaya Goodman, David Ciprut, and Jonathan Berant","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.11976","last_updated":"2026-07-26T04:17:22Z","snapshot_observed_at":"2026-08-09T00:36:09.452998Z","submitted_at":"2026-07-13T03:53:56Z","title":"LiteTopK: Exploiting the Curse of Dimensionality for a Fused Indexer-TopK Kernel in Long-Context Sparse Attention","version":3},"reference_index":2026,"source":"pdf_text","source_observed_at":"2026-08-02T07:07:39.192711Z"},"links":{"cited_paper":"/paper/2602.15763","citing_paper":"/paper/2607.11976"},"observation_digest":"sha256:bc9936572635157e945203eb4f41274df80f68c4a4cabd463df56eea6c50c493","observation_id":"15795971-8add-4a91-a9f1-a2279e2b9839","resolution":{"observed_at":"2026-08-02T07:07:39.192711Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.11976","last_updated":"2026-07-26T04:17:22Z","latest_version":3,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-09T00:36:09.452998Z","submitted_at":"2026-07-13T03:53:56Z","title":"LiteTopK: Exploiting the Curse of Dimensionality for a Fused Indexer-TopK Kernel in Long-Context Sparse Attention"},"reference_resolution":{"displayed":14,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":14,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":14},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 14 of 14 outbound references and 0 inbound Pith citation observations for arXiv:2607.11976."}