{"as_of":"2026-08-09T15:10:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:47eefdf24ae049288c55bcbd06543cc2adfc85be036e09d5294817fd13686d66","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":7,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":7,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":7,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":7,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-08T12:25:42.721108Z","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-06-29T23:44:02.760568Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2406.16690","last_updated":"2024-06-24T14:51:31Z","snapshot_observed_at":"2026-08-05T15:41:30.684979Z","submitted_at":"2024-06-24T14:51:31Z","title":"Scaling Laws for Linear Complexity Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.16690","snapshot_observed_at":"2026-08-08T12:25:42.721108Z","title":"Scaling laws for linear complexity language models","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.07563","last_updated":"2025-02-11T14:01:39Z","snapshot_observed_at":"2026-08-08T12:15:35.512720Z","submitted_at":"2025-02-11T14:01:39Z","title":"LASP-2: Rethinking Sequence Parallelism for Linear Attention and Its Hybrid","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-08T12:25:42.721108Z"},"links":{"cited_paper":"/paper/2406.16690","citing_paper":"/paper/2502.07563"},"observation_digest":"sha256:3ff10deff0253edac0b60b69fb24272cc4894a91dc11a096d13c53a8cfe8d661","observation_id":"ee0d4a49-1b80-4720-9669-95881963ddff","resolution":{"observed_at":"2026-08-08T12:25:42.721108Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.16690","last_updated":"2024-06-24T14:51:31Z","snapshot_observed_at":"2026-08-05T15:41:30.684979Z","submitted_at":"2024-06-24T14:51:31Z","title":"Scaling Laws for Linear Complexity Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.16690","snapshot_observed_at":"2026-08-07T00:24:46.594918Z","title":"Scaling laws for linear complexity language models, 2024 a","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2506.14111","last_updated":"2025-06-19T19:02:41Z","snapshot_observed_at":"2026-08-07T00:16:03.841117Z","submitted_at":"2025-06-17T02:03:36Z","title":"Essential-Web v1.0: 24T tokens of organized web data","version":2},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-07T00:24:46.594918Z"},"links":{"cited_paper":"/paper/2406.16690","citing_paper":"/paper/2506.14111"},"observation_digest":"sha256:906c7c29bcb16f6120bcabc7224b9eb71228444ac5c63ab0bdc6ce9ad59a31ac","observation_id":"084effe9-d473-4cb3-a801-0e8d4de400f8","resolution":{"observed_at":"2026-08-07T00:24:46.594918Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.16690","last_updated":"2024-06-24T14:51:31Z","snapshot_observed_at":"2026-08-05T15:41:30.684979Z","submitted_at":"2024-06-24T14:51:31Z","title":"Scaling Laws for Linear Complexity Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.16690","snapshot_observed_at":"2026-08-06T20:53:49.345780Z","title":"Scaling laws for linear complexity language models.arXiv preprint arXiv:2406.16690, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.01652","last_updated":"2025-07-02T12:27:06Z","snapshot_observed_at":"2026-08-09T07:28:28.701691Z","submitted_at":"2025-07-02T12:27:06Z","title":"Autoregressive Image Generation with Linear Complexity: A Spatial-Aware Decay Perspective","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-06T20:53:49.345780Z"},"links":{"cited_paper":"/paper/2406.16690","citing_paper":"/paper/2507.01652"},"observation_digest":"sha256:7a44151fa89148804026d6a821dc714af0bb77c13e3859badf171be3a51035e3","observation_id":"432c101f-d92f-4887-b0d2-2eeb22130f23","resolution":{"observed_at":"2026-08-06T20:53:49.345780Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.16690","last_updated":"2024-06-24T14:51:31Z","snapshot_observed_at":"2026-08-05T15:41:30.684979Z","submitted_at":"2024-06-24T14:51:31Z","title":"Scaling Laws for Linear Complexity Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.16690","snapshot_observed_at":"2026-08-06T20:31:47.953763Z","title":"Scaling laws for linear complexity language models","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.02754","last_updated":"2025-07-03T16:16:34Z","snapshot_observed_at":"2026-08-06T20:19:29.715939Z","submitted_at":"2025-07-03T16:16:34Z","title":"Fast and Simplex: 2-Simplicial Attention in Triton","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-06T20:31:47.953763Z"},"links":{"cited_paper":"/paper/2406.16690","citing_paper":"/paper/2507.02754"},"observation_digest":"sha256:24acee3d7ebf98f1c692f6a128b1e37bddb0d08671e44aed1b778eae31cbc3e3","observation_id":"df7e133b-f805-4a35-81f7-064cee55d01d","resolution":{"observed_at":"2026-08-06T20:31:47.953763Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.16690","last_updated":"2024-06-24T14:51:31Z","snapshot_observed_at":"2026-08-05T15:41:30.684979Z","submitted_at":"2024-06-24T14:51:31Z","title":"Scaling Laws for Linear Complexity Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.16690","snapshot_observed_at":"2026-08-06T19:09:55.644630Z","title":"Scaling laws for linear complexity language models","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.06457","last_updated":"2026-06-24T00:07:31Z","snapshot_observed_at":"2026-08-06T19:01:34.447479Z","submitted_at":"2025-07-08T23:54:11Z","title":"A Systematic Analysis of Hybrid Linear Attention","version":2},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-06T19:09:55.644630Z"},"links":{"cited_paper":"/paper/2406.16690","citing_paper":"/paper/2507.06457"},"observation_digest":"sha256:a84fb708b15608a4d00285811a8693bafbf66e0dee599e5f789efce1bd5fcc64","observation_id":"481851f3-5918-4e4d-9d6f-66c7cea9ad12","resolution":{"observed_at":"2026-08-06T19:09:55.644630Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.16690","last_updated":"2024-06-24T14:51:31Z","snapshot_observed_at":"2026-08-05T15:41:30.684979Z","submitted_at":"2024-06-24T14:51:31Z","title":"Scaling Laws for Linear Complexity Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.16690","snapshot_observed_at":"2026-08-06T00:02:07.446572Z","title":"arXiv preprint arXiv:2406.16690 (2024)","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2508.04461","last_updated":"2025-08-06T14:01:05Z","snapshot_observed_at":"2026-08-08T17:12:12.523301Z","submitted_at":"2025-08-06T14:01:05Z","title":"Small transformer architectures for task switching","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-06T00:02:07.446572Z"},"links":{"cited_paper":"/paper/2406.16690","citing_paper":"/paper/2508.04461"},"observation_digest":"sha256:00c03db3e15a40aac2df5656fa3bbf57bbc0be7718190faccc5085585aa45f68","observation_id":"11ff954f-3fa7-4c90-b627-9b38406b55cd","resolution":{"observed_at":"2026-08-06T00:02:07.446572Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.16690","last_updated":"2024-06-24T14:51:31Z","snapshot_observed_at":"2026-08-05T15:41:30.684979Z","submitted_at":"2024-06-24T14:51:31Z","title":"Scaling Laws for Linear Complexity Language Models","version":1},"cited_work":{"arxiv_id":"2406.16690","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2406.16690","snapshot_observed_at":"2026-06-29T23:44:02.760568Z","title":"Scaling laws for linear complexity language models.arXiv preprint arXiv:2406.16690,","venue":null,"work_id":"22390b5f-3f6a-4a58-aa09-e94f76ef336c","year":null},"citing_paper":{"arxiv_id":"2605.26248","last_updated":"2026-05-25T18:15:27Z","snapshot_observed_at":"2026-08-05T12:04:21.559242Z","submitted_at":"2026-05-25T18:15:27Z","title":"Unified Neural Scaling Laws","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-06-29T22:56:43.393302Z"},"links":{"cited_paper":"/paper/2406.16690","citing_paper":"/paper/2605.26248"},"observation_digest":"sha256:fbd84298fb8de11c85641a09baee0ee7c04463b6c65a3605ecf3ba94ec1df0d2","observation_id":"20af7bd4-ff35-4eb5-8d5c-9b8d2dfd48a6","resolution":{"observed_at":"2026-06-29T23:44:02.762246Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2406.16690/citation-record","integrity":"/paper/2406.16690/integrity","json":"/paper/2406.16690/citation-record.json","paper":"/paper/2406.16690"},"outbound":[],"paper":{"arxiv_id":"2406.16690","last_updated":"2024-06-24T14:51:31Z","latest_version":1,"primary_category":"cs.CL","snapshot_observed_at":"2026-08-05T15:41:30.684979Z","submitted_at":"2024-06-24T14:51:31Z","title":"Scaling Laws for Linear Complexity Language Models"},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 7 inbound Pith citation observations for arXiv:2406.16690."}