{"as_of":"2026-08-09T02:53:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:f0d0f1530215696dc4fd949b6477491c91dda5ce1919e7bab13081ee88f088ae","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":4,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":4,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":4,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":4,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T13:32:30.813413Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-07-04T07:59:40.313053Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2503.05840","last_updated":"2025-06-03T03:04:10Z","snapshot_observed_at":"2026-08-07T17:23:12.871500Z","submitted_at":"2025-03-07T01:44:52Z","title":"Slim attention: cut your context memory in half without loss -- K-cache is all you need for MHA","version":2},"cited_work":{"arxiv_id":"2503.05840","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2503.05840","snapshot_observed_at":"2026-07-04T07:59:40.313053Z","title":"Slim attention: cut your context memory in half without loss of accuracy – K-cache is all you need for MHA","venue":null,"work_id":"5f807e55-4632-48cb-b7b4-976fce2a096a","year":2025},"citing_paper":{"arxiv_id":"2407.09577","last_updated":"2026-04-24T18:51:15Z","snapshot_observed_at":"2026-08-06T16:48:59.204095Z","submitted_at":"2024-07-12T00:37:55Z","title":"FlashNorm: Fast Normalization for Transformers","version":5},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-05-23T23:17:35.130499Z"},"links":{"cited_paper":"/paper/2503.05840","citing_paper":"/paper/2407.09577"},"observation_digest":"sha256:55087ccaa052db3fb1e9957ff16b222366771d1822b0e2476bf09693ef4f055b","observation_id":"3cee1aee-cc4c-4cd4-a1ef-19e68ceb08d9","resolution":{"observed_at":"2026-05-23T23:18:36.138934Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2503.05840","last_updated":"2025-06-03T03:04:10Z","snapshot_observed_at":"2026-08-07T17:23:12.871500Z","submitted_at":"2025-03-07T01:44:52Z","title":"Slim attention: cut your context memory in half without loss -- K-cache is all you need for MHA","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.05840","snapshot_observed_at":"2026-08-07T13:32:30.813413Z","title":"Slim attention: cut your context memory in half without loss of accuracy -- k-cache is all you need for mha, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.21487","last_updated":"2025-05-27T17:54:07Z","snapshot_observed_at":"2026-08-07T13:24:37.243429Z","submitted_at":"2025-05-27T17:54:07Z","title":"Hardware-Efficient Attention for Fast Decoding","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-07T13:32:30.813413Z"},"links":{"cited_paper":"/paper/2503.05840","citing_paper":"/paper/2505.21487"},"observation_digest":"sha256:ef0656c9328513805cc6fcb8b0a8cb21ad22f79f1d892581348c85391b49715a","observation_id":"d741e4a5-9158-4ac3-a163-4c04e4e0f317","resolution":{"observed_at":"2026-08-07T13:32:30.813413Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2503.05840","last_updated":"2025-06-03T03:04:10Z","snapshot_observed_at":"2026-08-07T17:23:12.871500Z","submitted_at":"2025-03-07T01:44:52Z","title":"Slim attention: cut your context memory in half without loss -- K-cache is all you need for MHA","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.05840","snapshot_observed_at":"2026-08-05T20:37:12.575486Z","title":"Slim attention: cut your context memory in half without loss–k-cache is all you need for mha","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2508.10395","last_updated":"2025-08-14T06:52:38Z","snapshot_observed_at":"2026-08-08T07:14:54.239021Z","submitted_at":"2025-08-14T06:52:38Z","title":"XQuant: Breaking the Memory Wall for LLM Inference with KV Cache Rematerialization","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-05T20:37:12.575486Z"},"links":{"cited_paper":"/paper/2503.05840","citing_paper":"/paper/2508.10395"},"observation_digest":"sha256:7a613c010878c2391b224c594e2d580323afbcae7d297c037bb73fa6a90b9f44","observation_id":"e5e2d711-c226-46b9-899b-1bb84e4f5ea4","resolution":{"observed_at":"2026-08-05T20:37:12.575486Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2503.05840","last_updated":"2025-06-03T03:04:10Z","snapshot_observed_at":"2026-08-07T17:23:12.871500Z","submitted_at":"2025-03-07T01:44:52Z","title":"Slim attention: cut your context memory in half without loss -- K-cache is all you need for MHA","version":2},"cited_work":{"arxiv_id":"2503.05840","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2503.05840","snapshot_observed_at":"2026-07-04T07:59:40.313053Z","title":"Slim attention: cut your context memory in half without loss of accuracy – K-cache is all you need for MHA","venue":null,"work_id":"5f807e55-4632-48cb-b7b4-976fce2a096a","year":2025},"citing_paper":{"arxiv_id":"2606.21848","last_updated":"2026-07-31T19:30:57Z","snapshot_observed_at":"2026-08-06T23:11:21.421315Z","submitted_at":"2026-06-20T03:12:30Z","title":"Keyless Attention: Value-Space Routing and Value-Only Caching for Efficient Transformers","version":1},"reference_index":92,"source":"arxiv_source","source_observed_at":"2026-06-26T12:20:42.292943Z"},"links":{"cited_paper":"/paper/2503.05840","citing_paper":"/paper/2606.21848"},"observation_digest":"sha256:66346599300a337073421cf249a2915188369c87fdf07635d8a4b8e73b648569","observation_id":"80b8b8bc-1559-41f1-9961-3370db5ac08d","resolution":{"observed_at":"2026-07-04T07:59:40.314292Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2503.05840/citation-record","integrity":"/paper/2503.05840/integrity","json":"/paper/2503.05840/citation-record.json","paper":"/paper/2503.05840"},"outbound":[],"paper":{"arxiv_id":"2503.05840","last_updated":"2025-06-03T03:04:10Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-07T17:23:12.871500Z","submitted_at":"2025-03-07T01:44:52Z","title":"Slim attention: cut your context memory in half without loss -- K-cache is all you need for MHA"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"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 0 of 0 outbound references and 4 inbound Pith citation observations for arXiv:2503.05840."}