{"as_of":"2026-08-18T13:50:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:5e9a4eab6e5e26eab2837cae6fb9695507cd9510f2cd93a01c97b0d72d3553d4","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":15,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":15,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-18T06:34:40.430872+00:00","state":"measured"},{"denominator":15,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":15,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T19:28:29.729282Z","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-04T16:09:56.603945Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2311.01927","last_updated":"2024-01-27T14:52:52Z","snapshot_observed_at":"2026-08-16T14:46:12.885151Z","submitted_at":"2023-11-03T14:08:39Z","title":"GateLoop: Fully Data-Controlled Linear Recurrence for Sequence Modeling","version":2},"cited_work":{"arxiv_id":"2311.01927","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2311.01927","snapshot_observed_at":"2026-07-04T16:09:56.603945Z","title":"arXiv preprint arXiv:2311.01927 , year=","venue":null,"work_id":"cdb0303e-f9ec-4458-b713-3f9cdb276f3d","year":2023},"citing_paper":{"arxiv_id":"2312.06635","last_updated":"2024-08-27T01:27:29Z","snapshot_observed_at":"2026-08-17T21:47:46.144942Z","submitted_at":"2023-12-11T18:51:59Z","title":"Gated Linear Attention Transformers with Hardware-Efficient Training","version":6},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-05-15T01:15:13.991219Z"},"links":{"cited_paper":"/paper/2311.01927","citing_paper":"/paper/2312.06635"},"observation_digest":"sha256:e4c1c55538049cd1ed6bca3192221b317094bad7bcc51560c7a506d7fb5dd3f9","observation_id":"a9d53376-924b-4d11-bbc1-a0f3f0255faf","resolution":{"observed_at":"2026-05-15T01:15:14.126508Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2311.01927","last_updated":"2024-01-27T14:52:52Z","snapshot_observed_at":"2026-08-16T14:46:12.885151Z","submitted_at":"2023-11-03T14:08:39Z","title":"GateLoop: Fully Data-Controlled Linear Recurrence for Sequence Modeling","version":2},"cited_work":{"arxiv_id":"2311.01927","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2311.01927","snapshot_observed_at":"2026-07-04T16:09:56.603945Z","title":"arXiv preprint arXiv:2311.01927 , year=","venue":null,"work_id":"cdb0303e-f9ec-4458-b713-3f9cdb276f3d","year":2023},"citing_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},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-05-15T06:58:17.370396Z"},"links":{"cited_paper":"/paper/2311.01927","citing_paper":"/paper/2402.19427"},"observation_digest":"sha256:0e663d94a3831aca17635773538872cc3ca1189ec3d19553e8a72208ef12dbb1","observation_id":"2e74e5b8-18d7-4c59-85a4-db39883f2d70","resolution":{"observed_at":"2026-05-15T06:58:17.539189Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2311.01927","last_updated":"2024-01-27T14:52:52Z","snapshot_observed_at":"2026-08-16T14:46:12.885151Z","submitted_at":"2023-11-03T14:08:39Z","title":"GateLoop: Fully Data-Controlled Linear Recurrence for Sequence Modeling","version":2},"cited_work":{"arxiv_id":"2311.01927","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2311.01927","snapshot_observed_at":"2026-07-04T16:09:56.603945Z","title":"arXiv preprint arXiv:2311.01927 , year=","venue":null,"work_id":"cdb0303e-f9ec-4458-b713-3f9cdb276f3d","year":2023},"citing_paper":{"arxiv_id":"2405.21060","last_updated":"2024-05-31T17:50:01Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2024-05-31T17:50:01Z","title":"Transformers are SSMs: Generalized Models and Efficient Algorithms Through Structured State Space Duality","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-05-11T12:16:25.390683Z"},"links":{"cited_paper":"/paper/2311.01927","citing_paper":"/paper/2405.21060"},"observation_digest":"sha256:76f89c7283ca92d063d6b00ce67cf46b6298aade8da7fdb5ebbeb848d3b08367","observation_id":"ec5bfb2f-a766-47ea-9df8-8b16718ec6a7","resolution":{"observed_at":"2026-05-11T12:16:25.801781Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2311.01927","last_updated":"2024-01-27T14:52:52Z","snapshot_observed_at":"2026-08-16T14:46:12.885151Z","submitted_at":"2023-11-03T14:08:39Z","title":"GateLoop: Fully Data-Controlled Linear Recurrence for Sequence Modeling","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2311.01927","snapshot_observed_at":"2026-08-12T19:28:29.729282Z","title":"Gateloop: Fully data-controlled linear recurrence for sequence modeling","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2411.10741","last_updated":"2024-11-16T08:47:32Z","snapshot_observed_at":"2026-08-12T23:32:43.891248Z","submitted_at":"2024-11-16T08:47:32Z","title":"MetaLA: Unified Optimal Linear Approximation to Softmax Attention Map","version":1},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-08-12T19:28:29.729282Z"},"links":{"cited_paper":"/paper/2311.01927","citing_paper":"/paper/2411.10741"},"observation_digest":"sha256:34efe3a7af072d97c1cd3523e7b1af02f62fd2bbaf0e5c5241440976d45a734d","observation_id":"161f766f-59aa-42d7-83b3-44d076c0b5f1","resolution":{"observed_at":"2026-08-12T19:28:29.729282Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2311.01927","last_updated":"2024-01-27T14:52:52Z","snapshot_observed_at":"2026-08-16T14:46:12.885151Z","submitted_at":"2023-11-03T14:08:39Z","title":"GateLoop: Fully Data-Controlled Linear Recurrence for Sequence Modeling","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2311.01927","snapshot_observed_at":"2026-08-12T17:12:32.714550Z","title":"Gateloop: Fully data-controlled linear recurrence for sequence modeling","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2411.12892","last_updated":"2024-11-19T22:17:18Z","snapshot_observed_at":"2026-08-13T12:26:07.656846Z","submitted_at":"2024-11-19T22:17:18Z","title":"Selective Attention: Enhancing Transformer through Principled Context Control","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-12T17:12:32.714550Z"},"links":{"cited_paper":"/paper/2311.01927","citing_paper":"/paper/2411.12892"},"observation_digest":"sha256:6ccf0b280c9ef9ad0e239e8639e8ca72aaed47b22d9a25871939bd6de93eb2dd","observation_id":"11150208-117f-4ebd-be29-2eb91f3af28d","resolution":{"observed_at":"2026-08-12T17:12:32.714550Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2311.01927","last_updated":"2024-01-27T14:52:52Z","snapshot_observed_at":"2026-08-16T14:46:12.885151Z","submitted_at":"2023-11-03T14:08:39Z","title":"GateLoop: Fully Data-Controlled Linear Recurrence for Sequence Modeling","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2311.01927","snapshot_observed_at":"2026-08-10T17:22:07.162271Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2501.12352","last_updated":"2025-05-02T02:07:05Z","snapshot_observed_at":"2026-08-16T08:25:55.350315Z","submitted_at":"2025-01-21T18:32:31Z","title":"Test-time regression: a unifying framework for designing sequence models with associative memory","version":3},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-10T17:22:07.162271Z"},"links":{"cited_paper":"/paper/2311.01927","citing_paper":"/paper/2501.12352"},"observation_digest":"sha256:3bc38190f00671976424e064a2e712bed4506b31ed8423efefff9a8b0ee6adca","observation_id":"b5f631c2-e4ad-4f5a-af33-f01f7ffea9a8","resolution":{"observed_at":"2026-08-10T17:22:07.162271Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2311.01927","last_updated":"2024-01-27T14:52:52Z","snapshot_observed_at":"2026-08-16T14:46:12.885151Z","submitted_at":"2023-11-03T14:08:39Z","title":"GateLoop: Fully Data-Controlled Linear Recurrence for Sequence Modeling","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2311.01927","snapshot_observed_at":"2026-08-10T16:26:51.236548Z","title":"Gateloop: Fully data-controlled linear recurrence for sequence modeling","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2501.13230","last_updated":"2025-04-09T19:05:31Z","snapshot_observed_at":"2026-08-16T12:27:08.648377Z","submitted_at":"2025-01-22T21:30:49Z","title":"Let SSMs be ConvNets: State-space Modeling with Optimal Tensor Contractions","version":2},"reference_index":2017,"source":"pdf_text","source_observed_at":"2026-08-10T16:26:51.236548Z"},"links":{"cited_paper":"/paper/2311.01927","citing_paper":"/paper/2501.13230"},"observation_digest":"sha256:e686a55679348e25fb7ac1228d98acba25d059e1a716cba256b26f785f212169","observation_id":"ed85b004-f9b5-44d2-9a19-9834dcfa2bba","resolution":{"observed_at":"2026-08-10T16:26:51.236548Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2311.01927","last_updated":"2024-01-27T14:52:52Z","snapshot_observed_at":"2026-08-16T14:46:12.885151Z","submitted_at":"2023-11-03T14:08:39Z","title":"GateLoop: Fully Data-Controlled Linear Recurrence for Sequence Modeling","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2311.01927","snapshot_observed_at":"2026-08-07T14:24:44.040741Z","title":"Gateloop: Fully data-controlled linear recurrence for sequence modeling.arXiv preprint arXiv:2311.01927,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2505.19105","last_updated":"2025-05-28T07:11:21Z","snapshot_observed_at":"2026-08-18T11:05:10.485105Z","submitted_at":"2025-05-25T11:51:31Z","title":"Latent Mamba Operator for Partial Differential Equations","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T14:24:44.040741Z"},"links":{"cited_paper":"/paper/2311.01927","citing_paper":"/paper/2505.19105"},"observation_digest":"sha256:e155429ceaa52a97f1204ebc16a0d77e0f80902fa29c1793731d5483cdbca0fd","observation_id":"daf0b013-ef49-4106-8281-d1cfdcf8b957","resolution":{"observed_at":"2026-08-07T14:24:44.040741Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2311.01927","last_updated":"2024-01-27T14:52:52Z","snapshot_observed_at":"2026-08-16T14:46:12.885151Z","submitted_at":"2023-11-03T14:08:39Z","title":"GateLoop: Fully Data-Controlled Linear Recurrence for Sequence Modeling","version":2},"cited_work":{"arxiv_id":"2311.01927","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2311.01927","snapshot_observed_at":"2026-07-04T16:09:56.603945Z","title":"arXiv preprint arXiv:2311.01927 , year=","venue":null,"work_id":"cdb0303e-f9ec-4458-b713-3f9cdb276f3d","year":2023},"citing_paper":{"arxiv_id":"2604.05030","last_updated":"2026-04-28T16:30:21Z","snapshot_observed_at":"2026-08-11T06:17:25.450178Z","submitted_at":"2026-04-06T18:00:03Z","title":"Phase-Associative Memory: Sequence Modeling in Complex Hilbert Space","version":2},"reference_index":98,"source":"pdf_text","source_observed_at":"2026-05-10T19:39:50.311059Z"},"links":{"cited_paper":"/paper/2311.01927","citing_paper":"/paper/2604.05030"},"observation_digest":"sha256:54482f631dbdbd3b73ea4430b1b2261404bbc847d3481572267de68f9dca61aa","observation_id":"5390f1c1-2d5c-41c8-826b-44725ebc0b97","resolution":{"observed_at":"2026-05-10T22:40:48.709906Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2311.01927","last_updated":"2024-01-27T14:52:52Z","snapshot_observed_at":"2026-08-16T14:46:12.885151Z","submitted_at":"2023-11-03T14:08:39Z","title":"GateLoop: Fully Data-Controlled Linear Recurrence for Sequence Modeling","version":2},"cited_work":{"arxiv_id":"2311.01927","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2311.01927","snapshot_observed_at":"2026-07-04T16:09:56.603945Z","title":"arXiv preprint arXiv:2311.01927 , year=","venue":null,"work_id":"cdb0303e-f9ec-4458-b713-3f9cdb276f3d","year":2023},"citing_paper":{"arxiv_id":"2604.10946","last_updated":"2026-04-13T03:37:08Z","snapshot_observed_at":"2026-08-15T16:01:11.378666Z","submitted_at":"2026-04-13T03:37:08Z","title":"Learning to Adapt: In-Context Learning Beyond Stationarity","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-05-10T16:30:36.771589Z"},"links":{"cited_paper":"/paper/2311.01927","citing_paper":"/paper/2604.10946"},"observation_digest":"sha256:f850113e37fb5e72013d1e2c182c9899b0c9c99c1cedc57de780d9bffaf3bfdc","observation_id":"de4870d6-2310-4d59-a2bd-ca5ec079978b","resolution":{"observed_at":"2026-05-11T08:45:59.388277Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2311.01927","last_updated":"2024-01-27T14:52:52Z","snapshot_observed_at":"2026-08-16T14:46:12.885151Z","submitted_at":"2023-11-03T14:08:39Z","title":"GateLoop: Fully Data-Controlled Linear Recurrence for Sequence Modeling","version":2},"cited_work":{"arxiv_id":"2311.01927","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2311.01927","snapshot_observed_at":"2026-07-04T16:09:56.603945Z","title":"arXiv preprint arXiv:2311.01927 , year=","venue":null,"work_id":"cdb0303e-f9ec-4458-b713-3f9cdb276f3d","year":2023},"citing_paper":{"arxiv_id":"2605.08587","last_updated":"2026-05-09T01:07:01Z","snapshot_observed_at":"2026-08-15T01:18:14.451523Z","submitted_at":"2026-05-09T01:07:01Z","title":"Kaczmarz Linear Attention","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-05-12T01:15:58.330766Z"},"links":{"cited_paper":"/paper/2311.01927","citing_paper":"/paper/2605.08587"},"observation_digest":"sha256:6253beeaa185f606c399682d48e95c499fc30cef9cb51fd97c17c61e3a49228a","observation_id":"ee756dc8-5df0-4f4b-8942-da09043d9b51","resolution":{"observed_at":"2026-05-12T08:06:37.006714Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2311.01927","last_updated":"2024-01-27T14:52:52Z","snapshot_observed_at":"2026-08-16T14:46:12.885151Z","submitted_at":"2023-11-03T14:08:39Z","title":"GateLoop: Fully Data-Controlled Linear Recurrence for Sequence Modeling","version":2},"cited_work":{"arxiv_id":"2311.01927","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2311.01927","snapshot_observed_at":"2026-07-04T16:09:56.603945Z","title":"arXiv preprint arXiv:2311.01927 , year=","venue":null,"work_id":"cdb0303e-f9ec-4458-b713-3f9cdb276f3d","year":2023},"citing_paper":{"arxiv_id":"2605.21070","last_updated":"2026-05-20T11:56:15Z","snapshot_observed_at":"2026-08-15T23:56:17.773250Z","submitted_at":"2026-05-20T11:56:15Z","title":"Towards Understanding Self-Pretraining for Sequence Classification","version":1},"reference_index":90,"source":"arxiv_source","source_observed_at":"2026-05-21T05:29:58.809024Z"},"links":{"cited_paper":"/paper/2311.01927","citing_paper":"/paper/2605.21070"},"observation_digest":"sha256:fcb207105b627bd143d4d8c9b627cfc806ef5e2866141b9145bbb888f42f3dee","observation_id":"46716332-0f16-412e-8099-76bdaec1c902","resolution":{"observed_at":"2026-05-21T05:33:58.924791Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2311.01927","last_updated":"2024-01-27T14:52:52Z","snapshot_observed_at":"2026-08-16T14:46:12.885151Z","submitted_at":"2023-11-03T14:08:39Z","title":"GateLoop: Fully Data-Controlled Linear Recurrence for Sequence Modeling","version":2},"cited_work":{"arxiv_id":"2311.01927","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2311.01927","snapshot_observed_at":"2026-07-04T16:09:56.603945Z","title":"arXiv preprint arXiv:2311.01927 , year=","venue":null,"work_id":"cdb0303e-f9ec-4458-b713-3f9cdb276f3d","year":2023},"citing_paper":{"arxiv_id":"2606.03825","last_updated":"2026-06-02T16:07:55Z","snapshot_observed_at":"2026-08-15T00:44:29.353819Z","submitted_at":"2026-06-02T16:07:55Z","title":"Dynamic Short Convolutions Improve Transformers","version":1},"reference_index":71,"source":"arxiv_source","source_observed_at":"2026-06-28T10:48:50.103004Z"},"links":{"cited_paper":"/paper/2311.01927","citing_paper":"/paper/2606.03825"},"observation_digest":"sha256:a38cd0250269b38249ea4263abe0aaa9cb77e28785f2c8df819a68d5fbb8a1b7","observation_id":"d64c0408-4e4b-48fd-b24e-08b6947db498","resolution":{"observed_at":"2026-07-02T02:36:27.034605Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2311.01927","last_updated":"2024-01-27T14:52:52Z","snapshot_observed_at":"2026-08-16T14:46:12.885151Z","submitted_at":"2023-11-03T14:08:39Z","title":"GateLoop: Fully Data-Controlled Linear Recurrence for Sequence Modeling","version":2},"cited_work":{"arxiv_id":"2311.01927","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2311.01927","snapshot_observed_at":"2026-07-04T16:09:56.603945Z","title":"arXiv preprint arXiv:2311.01927 , year=","venue":null,"work_id":"cdb0303e-f9ec-4458-b713-3f9cdb276f3d","year":2023},"citing_paper":{"arxiv_id":"2606.16533","last_updated":"2026-07-03T04:30:36Z","snapshot_observed_at":"2026-07-12T13:47:19.539499Z","submitted_at":"2026-06-15T10:37:42Z","title":"Kairos: A Regret-Aware Native World-Action Model Stack for Physical AI","version":2},"reference_index":186,"source":"pdf_text","source_observed_at":"2026-06-27T04:02:53.110012Z"},"links":{"cited_paper":"/paper/2311.01927","citing_paper":"/paper/2606.16533"},"observation_digest":"sha256:72668c933cef7d884cb7fc159823e4053e2d48cbed6db3fd2145036b490ec529","observation_id":"985a420d-a17f-4011-bf7e-bd3f43acfa15","resolution":{"observed_at":"2026-07-03T17:28:44.887107Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2311.01927","last_updated":"2024-01-27T14:52:52Z","snapshot_observed_at":"2026-08-16T14:46:12.885151Z","submitted_at":"2023-11-03T14:08:39Z","title":"GateLoop: Fully Data-Controlled Linear Recurrence for Sequence Modeling","version":2},"cited_work":{"arxiv_id":"2311.01927","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2311.01927","snapshot_observed_at":"2026-07-04T16:09:56.603945Z","title":"arXiv preprint arXiv:2311.01927 , year=","venue":null,"work_id":"cdb0303e-f9ec-4458-b713-3f9cdb276f3d","year":2023},"citing_paper":{"arxiv_id":"2606.24975","last_updated":"2026-06-23T12:08:30Z","snapshot_observed_at":"2026-08-13T12:19:21.763852Z","submitted_at":"2026-06-23T12:08:30Z","title":"Why Do Accumulated Transformations Extrapolate?","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-06-26T00:58:20.257832Z"},"links":{"cited_paper":"/paper/2311.01927","citing_paper":"/paper/2606.24975"},"observation_digest":"sha256:3004d8809c94de1f90396935c6614418f2312ba410c3418f54c75c7e3fdb8d2d","observation_id":"5241b57a-0434-4e4c-b86c-41795579cfae","resolution":{"observed_at":"2026-07-04T16:09:56.605708Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2311.01927/citation-record","integrity":"/paper/2311.01927/integrity","json":"/paper/2311.01927/citation-record.json","paper":"/paper/2311.01927"},"outbound":[],"paper":{"arxiv_id":"2311.01927","last_updated":"2024-01-27T14:52:52Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-16T14:46:12.885151Z","submitted_at":"2023-11-03T14:08:39Z","title":"GateLoop: Fully Data-Controlled Linear Recurrence for Sequence Modeling"},"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-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 15 inbound Pith citation observations for arXiv:2311.01927."}