{"as_of":"2026-08-10T12:34:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:064e34035c5bcc93c18e86cdbba7d12c8e6adbeef43aba1db02528d042034503","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-03T22:05:05.627076Z","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-10T06:31:04.303077+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/2511.21702/citation-record","integrity":"/paper/2511.21702/integrity","json":"/paper/2511.21702/citation-record.json","paper":"/paper/2511.21702"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-03T22:05:05.591222Z","title":"Attention is all you need,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2511.21702","last_updated":"2026-07-26T00:30:31Z","snapshot_observed_at":"2026-08-09T05:09:14.396920Z","submitted_at":"2025-11-16T14:02:41Z","title":"CSV-Decode: Certifiable Sub-Vocabulary Decoding for Efficient Large Language Model Inference","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-03T22:05:05.591222Z"},"links":{"citing_paper":"/paper/2511.21702"},"observation_digest":"sha256:83fc3f47fd61639356fe8ebcf405186f3db739f53c390a4e56842ee3965fea07","observation_id":"f4a3b168-a307-498c-ab29-7cdf42eea5df","resolution":{"observed_at":"2026-08-03T22:05:05.591222Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2307.09288","last_updated":"2023-07-19T17:08:59Z","snapshot_observed_at":"2026-08-07T12:56:43.323460Z","submitted_at":"2023-07-18T14:31:57Z","title":"Llama 2: Open Foundation and Fine-Tuned Chat Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2307.09288","snapshot_observed_at":"2026-08-03T22:05:05.594492Z","title":"Llama 2: Open foundation and fine-tuned chat models,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2511.21702","last_updated":"2026-07-26T00:30:31Z","snapshot_observed_at":"2026-08-09T05:09:14.396920Z","submitted_at":"2025-11-16T14:02:41Z","title":"CSV-Decode: Certifiable Sub-Vocabulary Decoding for Efficient Large Language Model Inference","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-03T22:05:05.594492Z"},"links":{"cited_paper":"/paper/2307.09288","citing_paper":"/paper/2511.21702"},"observation_digest":"sha256:7d2c4674397cabbf86b1780e8e6611e51ab149a2e748ae5677b06ebe302139c4","observation_id":"e40bd281-0255-4eca-9c3c-add394adf813","resolution":{"observed_at":"2026-08-03T22:05:05.594492Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2310.06825","last_updated":"2023-10-10T17:54:58Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-10-10T17:54:58Z","title":"Mistral 7B","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2310.06825","snapshot_observed_at":"2026-08-03T22:05:05.597494Z","title":"Mistral 7b,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2511.21702","last_updated":"2026-07-26T00:30:31Z","snapshot_observed_at":"2026-08-09T05:09:14.396920Z","submitted_at":"2025-11-16T14:02:41Z","title":"CSV-Decode: Certifiable Sub-Vocabulary Decoding for Efficient Large Language Model Inference","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-03T22:05:05.597494Z"},"links":{"cited_paper":"/paper/2310.06825","citing_paper":"/paper/2511.21702"},"observation_digest":"sha256:580db32966b02052b722632f65aa1f2d0bb7a87bbe50f0ed89d8b1021ce679ce","observation_id":"9da969fa-b914-4b1e-b3d8-fcd03967ae2e","resolution":{"observed_at":"2026-08-03T22:05:05.597494Z","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-03T22:05:05.600504Z","title":"Efficient softmax ap- proximation for gpus,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2511.21702","last_updated":"2026-07-26T00:30:31Z","snapshot_observed_at":"2026-08-09T05:09:14.396920Z","submitted_at":"2025-11-16T14:02:41Z","title":"CSV-Decode: Certifiable Sub-Vocabulary Decoding for Efficient Large Language Model Inference","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-03T22:05:05.600504Z"},"links":{"citing_paper":"/paper/2511.21702"},"observation_digest":"sha256:ff97024ab592e9320a388fcf27ad7aac4fe54c909ed4604e41df0b57294be52f","observation_id":"53c1ac62-143c-47c2-88b2-471c4cb9174c","resolution":{"observed_at":"2026-08-03T22:05:05.600504Z","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-03T22:05:05.603392Z","title":"Efficient estimation of word representations in vector space,","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2511.21702","last_updated":"2026-07-26T00:30:31Z","snapshot_observed_at":"2026-08-09T05:09:14.396920Z","submitted_at":"2025-11-16T14:02:41Z","title":"CSV-Decode: Certifiable Sub-Vocabulary Decoding for Efficient Large Language Model Inference","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-03T22:05:05.603392Z"},"links":{"citing_paper":"/paper/2511.21702"},"observation_digest":"sha256:6e7a81f5b78892cb9a42e524aa628b48897553ae93825e9b7c05f18ab9d6fbe0","observation_id":"72ab3e34-582a-4c24-b05c-45f3ee453e17","resolution":{"observed_at":"2026-08-03T22:05:05.603392Z","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-03T22:05:05.606140Z","title":"Sparse convolutional neural networks,","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2511.21702","last_updated":"2026-07-26T00:30:31Z","snapshot_observed_at":"2026-08-09T05:09:14.396920Z","submitted_at":"2025-11-16T14:02:41Z","title":"CSV-Decode: Certifiable Sub-Vocabulary Decoding for Efficient Large Language Model Inference","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-03T22:05:05.606140Z"},"links":{"citing_paper":"/paper/2511.21702"},"observation_digest":"sha256:64feb9443759038b7bd0cf0d003ba3600c706c3f77801cc0d860c9259447ca48","observation_id":"357b694e-a262-45b9-8bd0-84ddad0d6793","resolution":{"observed_at":"2026-08-03T22:05:05.606140Z","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-03T22:05:05.609010Z","title":"Reducing transformer depth on demand with structured dropout,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2511.21702","last_updated":"2026-07-26T00:30:31Z","snapshot_observed_at":"2026-08-09T05:09:14.396920Z","submitted_at":"2025-11-16T14:02:41Z","title":"CSV-Decode: Certifiable Sub-Vocabulary Decoding for Efficient Large Language Model Inference","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-03T22:05:05.609010Z"},"links":{"citing_paper":"/paper/2511.21702"},"observation_digest":"sha256:ac0adb5f2200e22f3696af32a1f3d697fe6d83ddb38612a0c3ef1334a4163a75","observation_id":"f341e3fd-4c5f-44c2-8424-18c99136736d","resolution":{"observed_at":"2026-08-03T22:05:05.609010Z","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-03T22:05:05.611417Z","title":"Fast inference from trans- formers via speculative decoding,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2511.21702","last_updated":"2026-07-26T00:30:31Z","snapshot_observed_at":"2026-08-09T05:09:14.396920Z","submitted_at":"2025-11-16T14:02:41Z","title":"CSV-Decode: Certifiable Sub-Vocabulary Decoding for Efficient Large Language Model Inference","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-03T22:05:05.611417Z"},"links":{"citing_paper":"/paper/2511.21702"},"observation_digest":"sha256:d3553cc27c249e51eb97c0f6fce4dfa12f1c611e78276df8fddeb6bb12f49e8e","observation_id":"994039a7-02ed-4334-82c2-5372deded919","resolution":{"observed_at":"2026-08-03T22:05:05.611417Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2409.01990","last_updated":"2025-04-14T07:09:15Z","snapshot_observed_at":"2026-08-09T16:07:31.365117Z","submitted_at":"2024-09-03T15:35:01Z","title":"Designing Large Foundation Models for Efficient Training and Inference: A Survey","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2409.01990","snapshot_observed_at":"2026-08-03T22:05:05.613847Z","title":"Designing large foundation models for efficient training and inference: A survey,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2511.21702","last_updated":"2026-07-26T00:30:31Z","snapshot_observed_at":"2026-08-09T05:09:14.396920Z","submitted_at":"2025-11-16T14:02:41Z","title":"CSV-Decode: Certifiable Sub-Vocabulary Decoding for Efficient Large Language Model Inference","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-03T22:05:05.613847Z"},"links":{"cited_paper":"/paper/2409.01990","citing_paper":"/paper/2511.21702"},"observation_digest":"sha256:2fd7ef54118958e9dc7c74f1519551c8a4a20f4d9c0214c2e32baa59b4cc8cdd","observation_id":"18f5aabe-e6a3-4ec4-98fe-390be31f5dde","resolution":{"observed_at":"2026-08-03T22:05:05.613847Z","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-03T22:05:05.616895Z","title":"MKA: Memory-keyed attention for efficient long-context reasoning,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2511.21702","last_updated":"2026-07-26T00:30:31Z","snapshot_observed_at":"2026-08-09T05:09:14.396920Z","submitted_at":"2025-11-16T14:02:41Z","title":"CSV-Decode: Certifiable Sub-Vocabulary Decoding for Efficient Large Language Model Inference","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-03T22:05:05.616895Z"},"links":{"citing_paper":"/paper/2511.21702"},"observation_digest":"sha256:0a89255f44f1c1a0a12c33d2f6b475ee330b4c4e7336197f47f7040c314b9592","observation_id":"81613c19-4385-4880-919b-d612802bda55","resolution":{"observed_at":"2026-08-03T22:05:05.616895Z","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-03T22:05:05.619389Z","title":"Tinyserve: Query-aware cache selection for efficient llm serving,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2511.21702","last_updated":"2026-07-26T00:30:31Z","snapshot_observed_at":"2026-08-09T05:09:14.396920Z","submitted_at":"2025-11-16T14:02:41Z","title":"CSV-Decode: Certifiable Sub-Vocabulary Decoding for Efficient Large Language Model Inference","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-03T22:05:05.619389Z"},"links":{"citing_paper":"/paper/2511.21702"},"observation_digest":"sha256:f21c35a2e1c2cbdcb1c33b11e44ba74220e722030b1001c67bff11b54970cf45","observation_id":"9fb5c40e-6a18-41c8-b9e5-9d213d7c4ba3","resolution":{"observed_at":"2026-08-03T22:05:05.619389Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2508.06526","last_updated":"2026-05-19T16:34:08Z","snapshot_observed_at":"2026-07-06T22:10:11.873662Z","submitted_at":"2025-08-02T03:50:14Z","title":"PiKV: KV Cache Management System for Mixture of Experts","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2508.06526","snapshot_observed_at":"2026-08-03T22:05:05.621861Z","title":"Pikv: Parallel distributed key-value cache for efficient llm inference,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2511.21702","last_updated":"2026-07-26T00:30:31Z","snapshot_observed_at":"2026-08-09T05:09:14.396920Z","submitted_at":"2025-11-16T14:02:41Z","title":"CSV-Decode: Certifiable Sub-Vocabulary Decoding for Efficient Large Language Model Inference","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-03T22:05:05.621861Z"},"links":{"cited_paper":"/paper/2508.06526","citing_paper":"/paper/2511.21702"},"observation_digest":"sha256:07cb608d5bd74e0aec24f239878e88a00bde5b7b455b3a1f18eddfeb66c66f70","observation_id":"b9d4f2f3-e95f-4ce3-a933-9f1762b992c7","resolution":{"observed_at":"2026-08-03T22:05:05.621861Z","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-03T22:05:05.624658Z","title":"Llmeasyquant: Scalable quantization for parallel and distributed llm inference,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2511.21702","last_updated":"2026-07-26T00:30:31Z","snapshot_observed_at":"2026-08-09T05:09:14.396920Z","submitted_at":"2025-11-16T14:02:41Z","title":"CSV-Decode: Certifiable Sub-Vocabulary Decoding for Efficient Large Language Model Inference","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-03T22:05:05.624658Z"},"links":{"citing_paper":"/paper/2511.21702"},"observation_digest":"sha256:4c52fa72f43dabffc19cdee20bcce0bb3c9c7a5937c82ac370fe13c4d8a564f4","observation_id":"4f9a152f-3f27-4956-b755-346cfcb69f41","resolution":{"observed_at":"2026-08-03T22:05:05.624658Z","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-03T22:05:05.627076Z","title":"Flashattention- 2: Faster attention with better parallelism and work partitioning,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2511.21702","last_updated":"2026-07-26T00:30:31Z","snapshot_observed_at":"2026-08-09T05:09:14.396920Z","submitted_at":"2025-11-16T14:02:41Z","title":"CSV-Decode: Certifiable Sub-Vocabulary Decoding for Efficient Large Language Model Inference","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-03T22:05:05.627076Z"},"links":{"citing_paper":"/paper/2511.21702"},"observation_digest":"sha256:cae80d0cc58678a71168a50c41f6add31b941b6d5343fb59124c999a897af56d","observation_id":"9036fda3-d7e0-4d49-8dd1-24fd1d3ae901","resolution":{"observed_at":"2026-08-03T22:05:05.627076Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2511.21702","last_updated":"2026-07-26T00:30:31Z","latest_version":2,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-09T05:09:14.396920Z","submitted_at":"2025-11-16T14:02:41Z","title":"CSV-Decode: Certifiable Sub-Vocabulary Decoding for Efficient Large Language Model Inference"},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 14 of 14 outbound references and 0 inbound Pith citation observations for arXiv:2511.21702."}