{"as_of":"2026-08-08T20:00:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:c9a09e9e5a5d2cd8bfcec9812564860d84d5e5e6a6d7d27f97603b2bdc3186aa","coverage":[{"denominator":19,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":19,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T22:10:15.970118Z","state":"measured"},{"denominator":19,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":19,"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/2502.09287/citation-record","integrity":"/paper/2502.09287/integrity","json":"/paper/2502.09287/citation-record.json","paper":"/paper/2502.09287"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2403.01590","last_updated":"2024-03-31T14:31:14Z","snapshot_observed_at":"2026-07-06T17:38:51.653737Z","submitted_at":"2024-03-03T18:58:21Z","title":"The Hidden Attention of Mamba Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.01590","snapshot_observed_at":"2026-08-07T22:10:15.869684Z","title":"The hidden attention of Mamba models","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.09287","last_updated":"2025-02-13T13:01:46Z","snapshot_observed_at":"2026-08-07T21:59:15.838366Z","submitted_at":"2025-02-13T13:01:46Z","title":"An Uncertainty Principle for Linear Recurrent Neural Networks","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T22:10:15.869684Z"},"links":{"cited_paper":"/paper/2403.01590","citing_paper":"/paper/2502.09287"},"observation_digest":"sha256:bc9104d4b76391306bc8227116f4048884d230bf7bccdc2232c44939f6f21d27","observation_id":"91035583-e0b6-425c-8a0c-e8edfb12ee08","resolution":{"observed_at":"2026-08-07T22:10:15.869684Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T22:10:16.299333Z","title":"We have the following equality: +∞X L=0 L|wl|2 = i 2π Z 2π 0 dW (ω) dω W (ω)dω","venue":null,"work_id":"52ef4715-c775-481a-93c5-9e14d040d56e","year":2017},"citing_paper":{"arxiv_id":"2502.09287","last_updated":"2025-02-13T13:01:46Z","snapshot_observed_at":"2026-08-07T21:59:15.838366Z","submitted_at":"2025-02-13T13:01:46Z","title":"An Uncertainty Principle for Linear Recurrent Neural Networks","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T22:10:15.952729Z"},"links":{"citing_paper":"/paper/2502.09287"},"observation_digest":"sha256:fc4caac2f5475c94098b43ed5e4fb757305b0dac41a9db9a7e689351dcd84fdf","observation_id":"b5827925-3971-442c-9a96-390106c0129b","resolution":{"observed_at":"2026-08-07T22:10:16.303931Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T22:10:16.283389Z","title":"The loss Ltime(c, d) writes Ltime(c, d) = 1 + +∞X k=0 |ck|2 − 2Re +∞X k=0 ckdk , where ck = PS s=1 ak s bs","venue":null,"work_id":"c0979fbf-64c7-42c1-a0da-2fcbc32d450a","year":2003},"citing_paper":{"arxiv_id":"2502.09287","last_updated":"2025-02-13T13:01:46Z","snapshot_observed_at":"2026-08-07T21:59:15.838366Z","submitted_at":"2025-02-13T13:01:46Z","title":"An Uncertainty Principle for Linear Recurrent Neural Networks","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T22:10:15.958930Z"},"links":{"citing_paper":"/paper/2502.09287"},"observation_digest":"sha256:736ad313de0ee932874d64c256a4c6404cdb9167b05516e55ace1a2ba8cab994","observation_id":"7b14b8a1-92bd-41d2-b506-46f67cb8ad53","resolution":{"observed_at":"2026-08-07T22:10:16.288327Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"2209.11895","last_updated":"2022-09-24T00:43:19Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2022-09-24T00:43:19Z","title":"In-context Learning and Induction Heads","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2209.11895","snapshot_observed_at":"2026-08-07T22:10:15.893978Z","title":"In-context learning and induction heads","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.09287","last_updated":"2025-02-13T13:01:46Z","snapshot_observed_at":"2026-08-07T21:59:15.838366Z","submitted_at":"2025-02-13T13:01:46Z","title":"An Uncertainty Principle for Linear Recurrent Neural Networks","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T22:10:15.893978Z"},"links":{"cited_paper":"/paper/2209.11895","citing_paper":"/paper/2502.09287"},"observation_digest":"sha256:5834a128dfb604250b90765057240935568251169b47c28347654f093067deed","observation_id":"a7cf5b77-e311-41f3-a804-2e779bb25e57","resolution":{"observed_at":"2026-08-07T22:10:15.893978Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2412.09871","last_updated":"2024-12-13T05:33:32Z","snapshot_observed_at":"2026-08-06T17:12:17.931581Z","submitted_at":"2024-12-13T05:33:32Z","title":"Byte Latent Transformer: Patches Scale Better Than Tokens","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.09871","snapshot_observed_at":"2026-08-07T22:10:15.898992Z","title":"Byte latent transformer: Patches scale better than tokens","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.09287","last_updated":"2025-02-13T13:01:46Z","snapshot_observed_at":"2026-08-07T21:59:15.838366Z","submitted_at":"2025-02-13T13:01:46Z","title":"An Uncertainty Principle for Linear Recurrent Neural Networks","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T22:10:15.898992Z"},"links":{"cited_paper":"/paper/2412.09871","citing_paper":"/paper/2502.09287"},"observation_digest":"sha256:dda529e35de190881eb442de680a9fcb625bd0237331f7624a46956c27ca9b06","observation_id":"21f1b5c5-f89a-4c3c-a615-48294aef94ca","resolution":{"observed_at":"2026-08-07T22:10:15.898992Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2404.07904","last_updated":"2024-08-19T17:16:55Z","snapshot_observed_at":"2026-08-01T18:05:06.274262Z","submitted_at":"2024-04-11T16:43:03Z","title":"HGRN2: Gated Linear RNNs with State Expansion","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.07904","snapshot_observed_at":"2026-08-07T22:10:15.909661Z","title":"HGRN2: Gated linear RNNs with state expansion","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.09287","last_updated":"2025-02-13T13:01:46Z","snapshot_observed_at":"2026-08-07T21:59:15.838366Z","submitted_at":"2025-02-13T13:01:46Z","title":"An Uncertainty Principle for Linear Recurrent Neural Networks","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T22:10:15.909661Z"},"links":{"cited_paper":"/paper/2404.07904","citing_paper":"/paper/2502.09287"},"observation_digest":"sha256:ca1a7ba23e1e53bd73fb6ec0f9d73d0d85a04b57139726c35afdfc4f1f67d760","observation_id":"1bd148f1-0b79-4d3e-b370-2b16168f3bca","resolution":{"observed_at":"2026-08-07T22:10:15.909661Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.14067","last_updated":"2024-10-31T10:38:47Z","snapshot_observed_at":"2026-08-05T00:35:14.386695Z","submitted_at":"2024-10-17T22:35:50Z","title":"Provable Benefits of Complex Parameterizations for Structured State Space Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.14067","snapshot_observed_at":"2026-08-07T22:10:15.914320Z","title":"Provable benefits of complex parameterizations for structured state space models","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.09287","last_updated":"2025-02-13T13:01:46Z","snapshot_observed_at":"2026-08-07T21:59:15.838366Z","submitted_at":"2025-02-13T13:01:46Z","title":"An Uncertainty Principle for Linear Recurrent Neural Networks","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T22:10:15.914320Z"},"links":{"cited_paper":"/paper/2410.14067","citing_paper":"/paper/2502.09287"},"observation_digest":"sha256:e5354af7b424b2060a5547f1a8b7bed12996f7aaaeb182941cb91e0661e5bf61","observation_id":"8a1729de-bea0-4ad2-b717-173cf24fcef0","resolution":{"observed_at":"2026-08-07T22:10:15.914320Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2410.11135","last_updated":"2024-10-14T23:17:46Z","snapshot_observed_at":"2026-07-06T19:33:30.263638Z","submitted_at":"2024-10-14T23:17:46Z","title":"Mimetic Initialization Helps State Space Models Learn to Recall","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2410.11135","snapshot_observed_at":"2026-08-07T22:10:15.924424Z","title":"Mimetic initialization helps state space models learn to recall.arXiv preprint arXiv:2410.11135,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.09287","last_updated":"2025-02-13T13:01:46Z","snapshot_observed_at":"2026-08-07T21:59:15.838366Z","submitted_at":"2025-02-13T13:01:46Z","title":"An Uncertainty Principle for Linear Recurrent Neural Networks","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T22:10:15.924424Z"},"links":{"cited_paper":"/paper/2410.11135","citing_paper":"/paper/2502.09287"},"observation_digest":"sha256:e55c4085c70028c184c2f09988df11faaf56a9b1ff2d8bbc4bc38216f0ba392e","observation_id":"4cd7186e-8082-4322-a602-6b3ba074244d","resolution":{"observed_at":"2026-08-07T22:10:15.924424Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2006.04768","last_updated":"2020-06-14T08:15:54Z","snapshot_observed_at":"2026-07-06T09:27:03.809621Z","submitted_at":"2020-06-08T17:37:52Z","title":"Linformer: Self-Attention with Linear Complexity","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2006.04768","snapshot_observed_at":"2026-08-07T22:10:15.936398Z","title":"Li, Madian Khabsa, Han Fang, and Hao Ma","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2502.09287","last_updated":"2025-02-13T13:01:46Z","snapshot_observed_at":"2026-08-07T21:59:15.838366Z","submitted_at":"2025-02-13T13:01:46Z","title":"An Uncertainty Principle for Linear Recurrent Neural Networks","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T22:10:15.936398Z"},"links":{"cited_paper":"/paper/2006.04768","citing_paper":"/paper/2502.09287"},"observation_digest":"sha256:56dde1eefd4bb9c6dfe07ca642e0a75daadd36f2243b12c839bd1b4253dab9a4","observation_id":"aada7242-859b-493d-97dc-367f16401d11","resolution":{"observed_at":"2026-08-07T22:10:15.936398Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.06484","last_updated":"2025-01-15T10:41:40Z","snapshot_observed_at":"2026-08-06T05:53:13.494942Z","submitted_at":"2024-06-10T17:24:42Z","title":"Parallelizing Linear Transformers with the Delta Rule over Sequence Length","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.06484","snapshot_observed_at":"2026-08-07T22:10:15.942223Z","title":"Gated linear at- tention transformers with hardware-efficient training","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.09287","last_updated":"2025-02-13T13:01:46Z","snapshot_observed_at":"2026-08-07T21:59:15.838366Z","submitted_at":"2025-02-13T13:01:46Z","title":"An Uncertainty Principle for Linear Recurrent Neural Networks","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T22:10:15.942223Z"},"links":{"cited_paper":"/paper/2406.06484","citing_paper":"/paper/2502.09287"},"observation_digest":"sha256:72c45947ab0d41f5f36db9f4eaba49dc8111630d5a8b2303ff52fc7950625358","observation_id":"d4861c86-2a08-49fc-a7d7-aec6e08425eb","resolution":{"observed_at":"2026-08-07T22:10:15.942223Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T22:10:16.314439Z","title":"In particular it fully describes a linear time-invariant system","venue":null,"work_id":"ef7f4b4c-e6a2-4fe6-8768-29da8bff1dbc","year":1996},"citing_paper":{"arxiv_id":"2502.09287","last_updated":"2025-02-13T13:01:46Z","snapshot_observed_at":"2026-08-07T21:59:15.838366Z","submitted_at":"2025-02-13T13:01:46Z","title":"An Uncertainty Principle for Linear Recurrent Neural Networks","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T22:10:15.947554Z"},"links":{"citing_paper":"/paper/2502.09287"},"observation_digest":"sha256:974f16887d19194bb634b94f2771f7b14c7d301e5844dfacf3f05d9f6a6f1c06","observation_id":"4c146fea-16db-43d5-8311-454c600a4fe0","resolution":{"observed_at":"2026-08-07T22:10:16.318990Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T22:10:16.266346Z","title":null,"venue":null,"work_id":"e01b2838-b2b0-4c7b-a555-d1647dce868b","year":2006},"citing_paper":{"arxiv_id":"2502.09287","last_updated":"2025-02-13T13:01:46Z","snapshot_observed_at":"2026-08-07T21:59:15.838366Z","submitted_at":"2025-02-13T13:01:46Z","title":"An Uncertainty Principle for Linear Recurrent Neural Networks","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-07T22:10:15.964420Z"},"links":{"citing_paper":"/paper/2502.09287"},"observation_digest":"sha256:5e7071effb661203a9f1e4528249f0e16c226f6d479dbe06020641210c16670d","observation_id":"bcd3a544-33af-4ab6-94df-9183db172ee6","resolution":{"observed_at":"2026-08-07T22:10:16.271485Z","resolver_source":"raw_fallback","status":"unresolved"},"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":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T22:10:16.246287Z","title":"bu = e−α(e2α−e−2α) 2Kinit × (−1)u bu = e−α(e2α−e−2α) 2Kinit × (−1)u α 1 1 Kinit 1300 1300 Number epochs 60 60 Table E.1: Experimental details for Figure 4 (left)","venue":null,"work_id":"7f90912b-1a59-4af0-94b2-25bc3a577111","year":2000},"citing_paper":{"arxiv_id":"2502.09287","last_updated":"2025-02-13T13:01:46Z","snapshot_observed_at":"2026-08-07T21:59:15.838366Z","submitted_at":"2025-02-13T13:01:46Z","title":"An Uncertainty Principle for Linear Recurrent Neural Networks","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T22:10:15.970118Z"},"links":{"citing_paper":"/paper/2502.09287"},"observation_digest":"sha256:8b9bfca5f0b01cce5074a1a57742ec35f920f77a27010e253e77fece790cbdac","observation_id":"69e8d9a6-0ab4-484e-816b-6a80ff987558","resolution":{"observed_at":"2026-08-07T22:10:16.253661Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"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":"1604.06174","last_updated":"2016-04-22T19:21:36Z","snapshot_observed_at":"2026-08-08T09:03:25.135475Z","submitted_at":"2016-04-21T04:15:27Z","title":"Training Deep Nets with Sublinear Memory Cost","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1604.06174","snapshot_observed_at":"2026-08-07T22:10:15.875426Z","title":"Training deep nets with sublinear memory cost","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.09287","last_updated":"2025-02-13T13:01:46Z","snapshot_observed_at":"2026-08-07T21:59:15.838366Z","submitted_at":"2025-02-13T13:01:46Z","title":"An Uncertainty Principle for Linear Recurrent Neural Networks","version":1},"reference_index":1996,"source":"pdf_text","source_observed_at":"2026-08-07T22:10:15.875426Z"},"links":{"cited_paper":"/paper/1604.06174","citing_paper":"/paper/2502.09287"},"observation_digest":"sha256:6ac805b44371fb2fd33e2fe997a72e07ab99788e1db17240abd407eef88a7a9d","observation_id":"0a45fa97-2ece-42ec-b781-1eed4021434c","resolution":{"observed_at":"2026-08-07T22:10:15.875426Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2404.05892","last_updated":"2024-09-26T22:39:08Z","snapshot_observed_at":"2026-08-06T19:53:21.536135Z","submitted_at":"2024-04-08T22:20:59Z","title":"Eagle and Finch: RWKV with Matrix-Valued States and Dynamic Recurrence","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.05892","snapshot_observed_at":"2026-08-07T22:10:15.904632Z","title":"Eagle and Finch: RWKV with matrix-valued states and dynamic recurrence","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.09287","last_updated":"2025-02-13T13:01:46Z","snapshot_observed_at":"2026-08-07T21:59:15.838366Z","submitted_at":"2025-02-13T13:01:46Z","title":"An Uncertainty Principle for Linear Recurrent Neural Networks","version":1},"reference_index":2013,"source":"pdf_text","source_observed_at":"2026-08-07T22:10:15.904632Z"},"links":{"cited_paper":"/paper/2404.05892","citing_paper":"/paper/2502.09287"},"observation_digest":"sha256:6e4bc91d8ed0b396fde99b2c6e72c25fca1fddba77ed59b4d500d4dc37b509fa","observation_id":"009fcbbb-28da-403e-80c2-4625f72bce77","resolution":{"observed_at":"2026-08-07T22:10:15.904632Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.07887","last_updated":"2024-06-12T05:25:15Z","snapshot_observed_at":"2026-07-06T18:29:21.709395Z","submitted_at":"2024-06-12T05:25:15Z","title":"An Empirical Study of Mamba-based Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2406.07887","snapshot_observed_at":"2026-08-07T22:10:15.930676Z","title":"An empirical study of Mamba-based language models","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.09287","last_updated":"2025-02-13T13:01:46Z","snapshot_observed_at":"2026-08-07T21:59:15.838366Z","submitted_at":"2025-02-13T13:01:46Z","title":"An Uncertainty Principle for Linear Recurrent Neural Networks","version":1},"reference_index":2017,"source":"pdf_text","source_observed_at":"2026-08-07T22:10:15.930676Z"},"links":{"cited_paper":"/paper/2406.07887","citing_paper":"/paper/2502.09287"},"observation_digest":"sha256:7c2fd7ea66eb68752abc269ecd94f62a9040c100a324a9f8919d5a98f4e235a4","observation_id":"d35879dc-01b4-4d26-ab0a-002583bd32b3","resolution":{"observed_at":"2026-08-07T22:10:15.930676Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2403.05530","last_updated":"2024-12-16T17:39:39Z","snapshot_observed_at":"2026-07-06T17:41:42.995949Z","submitted_at":"2024-03-08T18:54:20Z","title":"Gemini 1.5: Unlocking multimodal understanding across millions of tokens of context","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2403.05530","snapshot_observed_at":"2026-08-07T22:10:15.919445Z","title":"Gemini 1.5: Unlocking multimodal understanding across millions of tokens of context","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.09287","last_updated":"2025-02-13T13:01:46Z","snapshot_observed_at":"2026-08-07T21:59:15.838366Z","submitted_at":"2025-02-13T13:01:46Z","title":"An Uncertainty Principle for Linear Recurrent Neural Networks","version":1},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-07T22:10:15.919445Z"},"links":{"cited_paper":"/paper/2403.05530","citing_paper":"/paper/2502.09287"},"observation_digest":"sha256:0167de99c83f8b2bfa0cc8db9924f7173034df7163a4c7a86a4f4ed5ad68f7e3","observation_id":"236f1407-e774-4ba7-8909-4d3f38801392","resolution":{"observed_at":"2026-08-07T22:10:15.919445Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2402.19427","last_updated":"2024-02-29T18:24:46Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-02-29T18:24:46Z","title":"Griffin: Mixing Gated Linear Recurrences with Local Attention for Efficient Language Models","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2402.19427","snapshot_observed_at":"2026-08-07T22:10:15.888345Z","title":"Smith, Anushan Fernando, Aleksandar Botev, George Cristian-Muraru, Albert Gu, Ruba Haroun, Leonard Berrada, Yutian Chen, Srivatsan Srinivasan, et al","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.09287","last_updated":"2025-02-13T13:01:46Z","snapshot_observed_at":"2026-08-07T21:59:15.838366Z","submitted_at":"2025-02-13T13:01:46Z","title":"An Uncertainty Principle for Linear Recurrent Neural Networks","version":1},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-07T22:10:15.888345Z"},"links":{"cited_paper":"/paper/2402.19427","citing_paper":"/paper/2502.09287"},"observation_digest":"sha256:699e1e7822d54fdd68ef7574ee41b5eaf909d363c496a35461f3e33089877924","observation_id":"b16394b4-5d9a-4a44-8eae-af6350b2a513","resolution":{"observed_at":"2026-08-07T22:10:15.888345Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2307.08691","last_updated":"2023-07-17T17:50:36Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2023-07-17T17:50:36Z","title":"FlashAttention-2: Faster Attention with Better Parallelism and Work Partitioning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2307.08691","snapshot_observed_at":"2026-08-07T22:10:15.881607Z","title":"Flashattention-2: Faster attention with better parallelism and work partitioning","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.09287","last_updated":"2025-02-13T13:01:46Z","snapshot_observed_at":"2026-08-07T21:59:15.838366Z","submitted_at":"2025-02-13T13:01:46Z","title":"An Uncertainty Principle for Linear Recurrent Neural Networks","version":1},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-07T22:10:15.881607Z"},"links":{"cited_paper":"/paper/2307.08691","citing_paper":"/paper/2502.09287"},"observation_digest":"sha256:4c22fdfd86dc28501db012e4daffe6a69ecd0c8d3a53fb3f77b7ae18f3be6a12","observation_id":"3631dce4-a96e-4364-9fea-7e859e6418f1","resolution":{"observed_at":"2026-08-07T22:10:15.881607Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2502.09287","last_updated":"2025-02-13T13:01:46Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-07T21:59:15.838366Z","submitted_at":"2025-02-13T13:01:46Z","title":"An Uncertainty Principle for Linear Recurrent Neural Networks"},"reference_resolution":{"displayed":19,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":15,"verified_exact":0,"verified_fuzzy":4},"total_outbound_references":19},"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 8 August 2026, this Paper Citation Record lists 19 of 19 outbound references and 0 inbound Pith citation observations for arXiv:2502.09287."}