{"as_of":"2026-08-10T23:15:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:ff99a880c84866f9579e4cd58299715f6aea7e95ac46025e722afbf4844e7a0a","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":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-09T15:48:57.300444Z","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-05-11T20:11:12.491036Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2412.04358","last_updated":"2024-12-05T17:17:28Z","snapshot_observed_at":"2026-08-04T04:08:02.841152Z","submitted_at":"2024-12-05T17:17:28Z","title":"Approximate Top-$k$ for Increased Parallelism","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.04358","snapshot_observed_at":"2026-08-09T15:48:57.300444Z","title":"Approximate top-k for increased parallelism","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.01330","last_updated":"2025-08-13T09:51:20Z","snapshot_observed_at":"2026-08-10T02:47:39.101614Z","submitted_at":"2025-02-03T13:09:21Z","title":"Accelerating Linear Recurrent Neural Networks for the Edge with Unstructured Sparsity","version":2},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-09T15:48:57.300444Z"},"links":{"cited_paper":"/paper/2412.04358","citing_paper":"/paper/2502.01330"},"observation_digest":"sha256:04f0e29a82a1eb0aaf90b58dd2f3cde260f0832626867cd7dc8c547b30b95d27","observation_id":"0495ef66-ac52-4368-8bcb-20f2bbfd8e87","resolution":{"observed_at":"2026-08-09T15:48:57.300444Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.04358","last_updated":"2024-12-05T17:17:28Z","snapshot_observed_at":"2026-08-04T04:08:02.841152Z","submitted_at":"2024-12-05T17:17:28Z","title":"Approximate Top-$k$ for Increased Parallelism","version":1},"cited_work":{"arxiv_id":"2412.04358","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2412.04358","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Oscar Key, Luka Ribar, Alberto Cattaneo, Luke Hudlass-Galley, and Douglas Orr","venue":null,"work_id":"80f352c2-3bdf-4a68-89e5-e967071a6d34","year":null},"citing_paper":{"arxiv_id":"2604.22312","last_updated":"2026-04-24T07:46:25Z","snapshot_observed_at":"2026-07-06T23:08:42.301487Z","submitted_at":"2026-04-24T07:46:25Z","title":"Guess-Verify-Refine: Data-Aware Top-K for Sparse-Attention Decoding on Blackwell via Temporal Correlation","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-05-08T09:58:45.903396Z"},"links":{"cited_paper":"/paper/2412.04358","citing_paper":"/paper/2604.22312"},"observation_digest":"sha256:1d9d6d4a3417cd744c81a5bbdc43c3d712461575dbb5f1d7f806e8df549b6122","observation_id":"e03806d8-a926-47eb-b431-376e960302b8","resolution":{"observed_at":"2026-05-11T20:11:12.494204Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2412.04358/citation-record","integrity":"/paper/2412.04358/integrity","json":"/paper/2412.04358/citation-record.json","paper":"/paper/2412.04358"},"outbound":[],"paper":{"arxiv_id":"2412.04358","last_updated":"2024-12-05T17:17:28Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-04T04:08:02.841152Z","submitted_at":"2024-12-05T17:17:28Z","title":"Approximate Top-$k$ for Increased Parallelism"},"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-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 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2412.04358."}