{"as_of":"2026-08-17T16:52:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:9de7adad337968ab193f10916e8ffee686e7d8aea3b578202caf66b16e688118","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":20,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":20,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-17T06:30:58.91139+00:00","state":"measured"},{"denominator":20,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":20,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-12T20:23:10.631714Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":1,"source":"arxiv_reference","source_observed_at":"2026-08-05T02:28:24.338817Z","state":"measured"}],"external_citation_measurements":[{"count":149,"observed_at":"2026-08-05T02:28:24.338817Z","source":"arxiv_reference"}],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2008.07669","last_updated":"2020-10-23T02:48:03Z","snapshot_observed_at":"2026-08-17T08:01:12.025881Z","submitted_at":"2020-08-17T23:39:33Z","title":"HiPPO: Recurrent Memory with Optimal Polynomial Projections","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2008.07669","snapshot_observed_at":"2026-08-12T20:23:10.631714Z","title":"Hippo: Recurrent memory with optimal polynomial projections","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2411.09827","last_updated":"2024-11-14T22:24:59Z","snapshot_observed_at":"2026-08-16T03:34:04.121174Z","submitted_at":"2024-11-14T22:24:59Z","title":"The Good, The Efficient and the Inductive Biases: Exploring Efficiency in Deep Learning Through the Use of Inductive Biases","version":1},"reference_index":126,"source":"pdf_text","source_observed_at":"2026-08-12T20:23:10.631714Z"},"links":{"cited_paper":"/paper/2008.07669","citing_paper":"/paper/2411.09827"},"observation_digest":"sha256:b4ecf42be4c88eb1b8ffc0028a20297214d8529cc0cab7f884ae77b41432346d","observation_id":"6e0cd739-99f0-4ce6-830c-d6c214de45b9","resolution":{"observed_at":"2026-08-12T20:23:10.631714Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2008.07669","last_updated":"2020-10-23T02:48:03Z","snapshot_observed_at":"2026-08-17T08:01:12.025881Z","submitted_at":"2020-08-17T23:39:33Z","title":"HiPPO: Recurrent Memory with Optimal Polynomial Projections","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2008.07669","snapshot_observed_at":"2026-08-11T11:17:59.035271Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2412.15639","last_updated":"2024-12-24T06:05:22Z","snapshot_observed_at":"2026-08-13T15:10:16.393409Z","submitted_at":"2024-12-20T07:55:59Z","title":"Tacit Learning with Adaptive Information Selection for Cooperative Multi-Agent Reinforcement Learning","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-11T11:17:59.035271Z"},"links":{"cited_paper":"/paper/2008.07669","citing_paper":"/paper/2412.15639"},"observation_digest":"sha256:0b7dcd4c6ff399bde19630584bb0d3bac68f1368674c3bdf2fd5b865cedd330b","observation_id":"7b1f6267-0fe8-483c-8f0e-4c06485dc68a","resolution":{"observed_at":"2026-08-11T11:17:59.035271Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2008.07669","last_updated":"2020-10-23T02:48:03Z","snapshot_observed_at":"2026-08-17T08:01:12.025881Z","submitted_at":"2020-08-17T23:39:33Z","title":"HiPPO: Recurrent Memory with Optimal Polynomial Projections","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2008.07669","snapshot_observed_at":"2026-08-10T20:33:05.854636Z","title":"Hippo: Recurrent memory with optimal polynomial projections,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2501.08163","last_updated":"2025-03-31T13:41:34Z","snapshot_observed_at":"2026-08-14T03:11:01.027012Z","submitted_at":"2025-01-14T14:41:51Z","title":"DH-Mamba: Exploring Dual-domain Hierarchical State Space Models for MRI Reconstruction","version":3},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-10T20:33:05.854636Z"},"links":{"cited_paper":"/paper/2008.07669","citing_paper":"/paper/2501.08163"},"observation_digest":"sha256:c4dab03b7fba51df9a698fb37ef48cab02e6f0beb295af10cbcbec93ac1ce77d","observation_id":"16bd0b96-914d-4bc4-b077-b9de1d8e66ac","resolution":{"observed_at":"2026-08-10T20:33:05.854636Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2008.07669","last_updated":"2020-10-23T02:48:03Z","snapshot_observed_at":"2026-08-17T08:01:12.025881Z","submitted_at":"2020-08-17T23:39:33Z","title":"HiPPO: Recurrent Memory with Optimal Polynomial Projections","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2008.07669","snapshot_observed_at":"2026-08-08T20:54:10.536813Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2502.04958","last_updated":"2025-02-07T14:22:35Z","snapshot_observed_at":"2026-08-09T00:26:10.962856Z","submitted_at":"2025-02-07T14:22:35Z","title":"SSMLoRA: Enhancing Low-Rank Adaptation with State Space Model","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-08T20:54:10.536813Z"},"links":{"cited_paper":"/paper/2008.07669","citing_paper":"/paper/2502.04958"},"observation_digest":"sha256:718f568975fd0ebb2ad33beaaa567dcfae81ea9dd92e81a2ab779bc29b8d7b4c","observation_id":"67c75efd-5040-4c58-9678-0fa52a687682","resolution":{"observed_at":"2026-08-08T20:54:10.536813Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2008.07669","last_updated":"2020-10-23T02:48:03Z","snapshot_observed_at":"2026-08-17T08:01:12.025881Z","submitted_at":"2020-08-17T23:39:33Z","title":"HiPPO: Recurrent Memory with Optimal Polynomial Projections","version":2},"cited_work":{"arxiv_id":"2008.07669","doi":"10.48550/arxiv.2008.07669","metadata_source":"arxiv_reference","pith_arxiv_id":"2008.07669","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"HiPPO: Re- current Memory with Optimal Polynomial Projections","venue":"arXiv (Cornell University)","work_id":"338d5aac-242d-4f54-9def-14d303e8eda3","year":2020},"citing_paper":{"arxiv_id":"2503.23818","last_updated":"2026-04-29T16:51:43Z","snapshot_observed_at":"2026-08-15T04:34:56.197539Z","submitted_at":"2025-03-31T07:56:17Z","title":"L2RU: a Structured State Space Model with prescribed L2-bound","version":3},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-05-22T22:37:32.448805Z"},"links":{"cited_paper":"/paper/2008.07669","citing_paper":"/paper/2503.23818"},"observation_digest":"sha256:f158f70b5d3d3bcac2eae6fed6e5d325b43acde4f87d5501bdccc6305ec52a0b","observation_id":"98108ef0-7aec-423d-9556-1ac3ef6fe317","resolution":{"observed_at":"2026-05-22T22:42:13.731560Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2008.07669","last_updated":"2020-10-23T02:48:03Z","snapshot_observed_at":"2026-08-17T08:01:12.025881Z","submitted_at":"2020-08-17T23:39:33Z","title":"HiPPO: Recurrent Memory with Optimal Polynomial Projections","version":2},"cited_work":{"arxiv_id":"2008.07669","doi":"10.48550/arxiv.2008.07669","metadata_source":"arxiv_reference","pith_arxiv_id":"2008.07669","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"HiPPO: Re- current Memory with Optimal Polynomial Projections","venue":"arXiv (Cornell University)","work_id":"338d5aac-242d-4f54-9def-14d303e8eda3","year":2020},"citing_paper":{"arxiv_id":"2506.06374","last_updated":"2026-04-20T13:03:47Z","snapshot_observed_at":"2026-08-17T13:40:02.098748Z","submitted_at":"2025-06-04T13:54:02Z","title":"SiLIF: Structured State Space Model Dynamics and Parametrization for Spiking Neural Networks","version":4},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-05-19T11:05:05.783726Z"},"links":{"cited_paper":"/paper/2008.07669","citing_paper":"/paper/2506.06374"},"observation_digest":"sha256:18870515f93d9228600d1eda0b0faf264c1e4029a8b8442b81309a76b88b6a92","observation_id":"8e1ecb5b-9be5-4e74-bcef-d022088a453e","resolution":{"observed_at":"2026-05-19T11:07:15.300156Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2008.07669","last_updated":"2020-10-23T02:48:03Z","snapshot_observed_at":"2026-08-17T08:01:12.025881Z","submitted_at":"2020-08-17T23:39:33Z","title":"HiPPO: Recurrent Memory with Optimal Polynomial Projections","version":2},"cited_work":{"arxiv_id":"2008.07669","doi":"10.48550/arxiv.2008.07669","metadata_source":"arxiv_reference","pith_arxiv_id":"2008.07669","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"HiPPO: Re- current Memory with Optimal Polynomial Projections","venue":"arXiv (Cornell University)","work_id":"338d5aac-242d-4f54-9def-14d303e8eda3","year":2020},"citing_paper":{"arxiv_id":"2509.04154","last_updated":"2026-08-08T06:27:20Z","snapshot_observed_at":"2026-08-13T23:10:39.231939Z","submitted_at":"2025-09-04T12:29:14Z","title":"Robust Filter Attention: Self-Attention as Precision-Weighted State Estimation","version":5},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-05-18T18:56:48.722344Z"},"links":{"cited_paper":"/paper/2008.07669","citing_paper":"/paper/2509.04154"},"observation_digest":"sha256:e3e763639dbde18589b2743318e08f991dc21199e49b26b8a05fe6690edc0742","observation_id":"52b5ab0f-e6f7-428d-839b-0b2e180be31c","resolution":{"observed_at":"2026-05-18T19:01:46.128005Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2008.07669","last_updated":"2020-10-23T02:48:03Z","snapshot_observed_at":"2026-08-17T08:01:12.025881Z","submitted_at":"2020-08-17T23:39:33Z","title":"HiPPO: Recurrent Memory with Optimal Polynomial Projections","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2008.07669","snapshot_observed_at":"2026-08-05T10:25:17.073740Z","title":"Hippo: Recurrent memory with optimal polynomial projections, 2020","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2509.04154","last_updated":"2026-08-08T06:27:20Z","snapshot_observed_at":"2026-08-13T23:10:39.231939Z","submitted_at":"2025-09-04T12:29:14Z","title":"Robust Filter Attention: Self-Attention as Precision-Weighted State Estimation","version":9},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-05T10:25:17.073740Z"},"links":{"cited_paper":"/paper/2008.07669","citing_paper":"/paper/2509.04154"},"observation_digest":"sha256:584b2a482068ac45bab18ef630f608ee5b6c4b74759450adc7e3a251ef9a6f79","observation_id":"403a1d09-7ee4-4e89-b51d-c2a5864e3a6c","resolution":{"observed_at":"2026-08-05T10:25:17.073740Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2008.07669","last_updated":"2020-10-23T02:48:03Z","snapshot_observed_at":"2026-08-17T08:01:12.025881Z","submitted_at":"2020-08-17T23:39:33Z","title":"HiPPO: Recurrent Memory with Optimal Polynomial Projections","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2008.07669","snapshot_observed_at":"2026-08-05T05:29:21.322644Z","title":"Hippo: Recurrent memory with optimal polynomial projections","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2509.05282","last_updated":"2025-09-05T17:48:26Z","snapshot_observed_at":"2026-08-14T20:35:20.665795Z","submitted_at":"2025-09-05T17:48:26Z","title":"Elucidating the Design Space of Decay in Linear Attention","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-05T05:29:21.322644Z"},"links":{"cited_paper":"/paper/2008.07669","citing_paper":"/paper/2509.05282"},"observation_digest":"sha256:d66d9a8a065bcdb7f89871b895e3327c006f95b35ef755bc5e0ee69bfb3ee6b1","observation_id":"74f7fc5d-25a4-4afc-ac7f-e7c6cb9a87b6","resolution":{"observed_at":"2026-08-05T05:29:21.322644Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2008.07669","last_updated":"2020-10-23T02:48:03Z","snapshot_observed_at":"2026-08-17T08:01:12.025881Z","submitted_at":"2020-08-17T23:39:33Z","title":"HiPPO: Recurrent Memory with Optimal Polynomial Projections","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2008.07669","snapshot_observed_at":"2026-08-04T11:25:32.699566Z","title":"HiPPO: Recur- rent Memory with Optimal Polynomial Projections,","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2510.05255","last_updated":"2026-06-08T07:39:19Z","snapshot_observed_at":"2026-08-17T04:45:47.153338Z","submitted_at":"2025-10-06T18:17:29Z","title":"Rivaling Transformers: Multi-Scale Structured State-Space Mixtures for Agentic 6G O-RAN","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-04T11:25:32.699566Z"},"links":{"cited_paper":"/paper/2008.07669","citing_paper":"/paper/2510.05255"},"observation_digest":"sha256:5dd582fc657e49f7a6a206ed09f7715b19f40f5d4ae2c29c90691cd2b43e8cf2","observation_id":"7300835c-8941-4897-85f8-cfcc08646b0f","resolution":{"observed_at":"2026-08-04T11:25:32.699566Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2008.07669","last_updated":"2020-10-23T02:48:03Z","snapshot_observed_at":"2026-08-17T08:01:12.025881Z","submitted_at":"2020-08-17T23:39:33Z","title":"HiPPO: Recurrent Memory with Optimal Polynomial Projections","version":2},"cited_work":{"arxiv_id":"2008.07669","doi":"10.48550/arxiv.2008.07669","metadata_source":"arxiv_reference","pith_arxiv_id":"2008.07669","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"HiPPO: Re- current Memory with Optimal Polynomial Projections","venue":"arXiv (Cornell University)","work_id":"338d5aac-242d-4f54-9def-14d303e8eda3","year":2020},"citing_paper":{"arxiv_id":"2512.12602","last_updated":"2026-05-08T15:47:57Z","snapshot_observed_at":"2026-08-17T15:03:44.282877Z","submitted_at":"2025-12-14T08:51:02Z","title":"Exact Flow Linear Attention: Exact Solution from Continuous-Time Dynamics","version":4},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-05-16T23:06:27.535997Z"},"links":{"cited_paper":"/paper/2008.07669","citing_paper":"/paper/2512.12602"},"observation_digest":"sha256:70cd22ad1f28c2df84ba93fcf56ba4e4eac11dba0473d7a555075a9266cb6243","observation_id":"492a6964-4d84-4220-b35e-77d3ae9896ed","resolution":{"observed_at":"2026-05-16T23:08:39.716387Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2008.07669","last_updated":"2020-10-23T02:48:03Z","snapshot_observed_at":"2026-08-17T08:01:12.025881Z","submitted_at":"2020-08-17T23:39:33Z","title":"HiPPO: Recurrent Memory with Optimal Polynomial Projections","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2008.07669","snapshot_observed_at":"2026-08-03T14:57:00.500119Z","title":"and Dao, T","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2512.18965","last_updated":"2026-07-15T03:09:14Z","snapshot_observed_at":"2026-08-14T02:22:50.199895Z","submitted_at":"2025-12-22T02:25:26Z","title":"Lag Operator SSMs: A Geometric Framework for Structured State Space Modeling","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-03T14:57:00.500119Z"},"links":{"cited_paper":"/paper/2008.07669","citing_paper":"/paper/2512.18965"},"observation_digest":"sha256:8cb1eaceead756bd8f73d03364cbc5e92ba864c0719b75d556bdf5b5ab020e04","observation_id":"f31b671e-ac7c-45a9-bb29-bb256a90d11c","resolution":{"observed_at":"2026-08-03T14:57:00.500119Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2008.07669","last_updated":"2020-10-23T02:48:03Z","snapshot_observed_at":"2026-08-17T08:01:12.025881Z","submitted_at":"2020-08-17T23:39:33Z","title":"HiPPO: Recurrent Memory with Optimal Polynomial Projections","version":2},"cited_work":{"arxiv_id":"2008.07669","doi":"10.48550/arxiv.2008.07669","metadata_source":"arxiv_reference","pith_arxiv_id":"2008.07669","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"HiPPO: Re- current Memory with Optimal Polynomial Projections","venue":"arXiv (Cornell University)","work_id":"338d5aac-242d-4f54-9def-14d303e8eda3","year":2020},"citing_paper":{"arxiv_id":"2604.14191","last_updated":"2026-04-01T09:23:08Z","snapshot_observed_at":"2026-07-06T23:02:00.082783Z","submitted_at":"2026-04-01T09:23:08Z","title":"Attention to Mamba: A Recipe for Cross-Architecture Distillation","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-05-13T23:07:41.022051Z"},"links":{"cited_paper":"/paper/2008.07669","citing_paper":"/paper/2604.14191"},"observation_digest":"sha256:af9b2b6edc898ce0688a01239b71417fe2329877ba07d74ff87d5dc5ef524b55","observation_id":"24e31659-56de-425a-af0c-d5862dbca1b0","resolution":{"observed_at":"2026-05-13T23:08:24.944285Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2008.07669","last_updated":"2020-10-23T02:48:03Z","snapshot_observed_at":"2026-08-17T08:01:12.025881Z","submitted_at":"2020-08-17T23:39:33Z","title":"HiPPO: Recurrent Memory with Optimal Polynomial Projections","version":2},"cited_work":{"arxiv_id":"2008.07669","doi":"10.48550/arxiv.2008.07669","metadata_source":"arxiv_reference","pith_arxiv_id":"2008.07669","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"HiPPO: Re- current Memory with Optimal Polynomial Projections","venue":"arXiv (Cornell University)","work_id":"338d5aac-242d-4f54-9def-14d303e8eda3","year":2020},"citing_paper":{"arxiv_id":"2605.11287","last_updated":"2026-06-16T22:44:04Z","snapshot_observed_at":"2026-08-13T19:59:42.309025Z","submitted_at":"2026-05-11T22:13:53Z","title":"Beyond Similarity: Temporal Operator Attention for Time Series Analysis","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-13T02:46:08.480763Z"},"links":{"cited_paper":"/paper/2008.07669","citing_paper":"/paper/2605.11287"},"observation_digest":"sha256:e38936408a3c8750132e6000b694a16f06f1f5a88489ef41f233902e0c4a9b43","observation_id":"67961649-cc0d-4761-9dd6-c390dca817e9","resolution":{"observed_at":"2026-05-13T02:47:07.782789Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2008.07669","last_updated":"2020-10-23T02:48:03Z","snapshot_observed_at":"2026-08-17T08:01:12.025881Z","submitted_at":"2020-08-17T23:39:33Z","title":"HiPPO: Recurrent Memory with Optimal Polynomial Projections","version":2},"cited_work":{"arxiv_id":"2008.07669","doi":"10.48550/arxiv.2008.07669","metadata_source":"arxiv_reference","pith_arxiv_id":"2008.07669","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"HiPPO: Re- current Memory with Optimal Polynomial Projections","venue":"arXiv (Cornell University)","work_id":"338d5aac-242d-4f54-9def-14d303e8eda3","year":2020},"citing_paper":{"arxiv_id":"2605.11287","last_updated":"2026-06-16T22:44:04Z","snapshot_observed_at":"2026-08-13T19:59:42.309025Z","submitted_at":"2026-05-11T22:13:53Z","title":"Beyond Similarity: Temporal Operator Attention for Time Series Analysis","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-06-30T22:12:59.435414Z"},"links":{"cited_paper":"/paper/2008.07669","citing_paper":"/paper/2605.11287"},"observation_digest":"sha256:babb4bfa9368c9fc7c3448493d8534cd8ba9b14bfdfe025f2a55139c0582610b","observation_id":"8f5233d2-8627-4fbe-9273-4b8b26df12a7","resolution":{"observed_at":"2026-07-01T14:15:46.541360Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2008.07669","last_updated":"2020-10-23T02:48:03Z","snapshot_observed_at":"2026-08-17T08:01:12.025881Z","submitted_at":"2020-08-17T23:39:33Z","title":"HiPPO: Recurrent Memory with Optimal Polynomial Projections","version":2},"cited_work":{"arxiv_id":"2008.07669","doi":"10.48550/arxiv.2008.07669","metadata_source":"arxiv_reference","pith_arxiv_id":"2008.07669","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"HiPPO: Re- current Memory with Optimal Polynomial Projections","venue":"arXiv (Cornell University)","work_id":"338d5aac-242d-4f54-9def-14d303e8eda3","year":2020},"citing_paper":{"arxiv_id":"2605.13807","last_updated":"2026-05-13T17:36:32Z","snapshot_observed_at":"2026-08-14T21:41:01.034290Z","submitted_at":"2026-05-13T17:36:32Z","title":"Parallel Scan Recurrent Neural Quantum States for Scalable Variational Monte Carlo","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-05-14T17:39:47.634924Z"},"links":{"cited_paper":"/paper/2008.07669","citing_paper":"/paper/2605.13807"},"observation_digest":"sha256:28ecbba99ac198954a0a1ace1284b0b8472beb5b354fb79aa95b33d8278b98d0","observation_id":"096b554e-e4b5-4b1e-981f-607051339265","resolution":{"observed_at":"2026-05-14T17:42:32.385044Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2008.07669","last_updated":"2020-10-23T02:48:03Z","snapshot_observed_at":"2026-08-17T08:01:12.025881Z","submitted_at":"2020-08-17T23:39:33Z","title":"HiPPO: Recurrent Memory with Optimal Polynomial Projections","version":2},"cited_work":{"arxiv_id":"2008.07669","doi":"10.48550/arxiv.2008.07669","metadata_source":"arxiv_reference","pith_arxiv_id":"2008.07669","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"HiPPO: Re- current Memory with Optimal Polynomial Projections","venue":"arXiv (Cornell University)","work_id":"338d5aac-242d-4f54-9def-14d303e8eda3","year":2020},"citing_paper":{"arxiv_id":"2606.08804","last_updated":"2026-06-07T19:49:01Z","snapshot_observed_at":"2026-08-14T02:58:47.417024Z","submitted_at":"2026-06-07T19:49:01Z","title":"Q-Delta: Beyond Key-Value Associative State Evolution","version":1},"reference_index":62,"source":"arxiv_source","source_observed_at":"2026-06-27T18:30:51.523567Z"},"links":{"cited_paper":"/paper/2008.07669","citing_paper":"/paper/2606.08804"},"observation_digest":"sha256:2c018c8f46f3d3c33a44dbda272e6009e5ac6e15d960a1ff813328926c9b4453","observation_id":"f888e7a7-d11e-4cea-bda4-5c8bbcc54add","resolution":{"observed_at":"2026-07-02T23:07:26.562383Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2008.07669","last_updated":"2020-10-23T02:48:03Z","snapshot_observed_at":"2026-08-17T08:01:12.025881Z","submitted_at":"2020-08-17T23:39:33Z","title":"HiPPO: Recurrent Memory with Optimal Polynomial Projections","version":2},"cited_work":{"arxiv_id":"2008.07669","doi":"10.48550/arxiv.2008.07669","metadata_source":"arxiv_reference","pith_arxiv_id":"2008.07669","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"HiPPO: Re- current Memory with Optimal Polynomial Projections","venue":"arXiv (Cornell University)","work_id":"338d5aac-242d-4f54-9def-14d303e8eda3","year":2020},"citing_paper":{"arxiv_id":"2606.11049","last_updated":"2026-06-09T16:14:45Z","snapshot_observed_at":"2026-08-12T17:20:44.147127Z","submitted_at":"2026-06-09T16:14:45Z","title":"Free Parametrization of L_2-Bounded Structured State-Space Controllers for Nonlinear Control with Stability Guarantees","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-06-27T12:08:57.506333Z"},"links":{"cited_paper":"/paper/2008.07669","citing_paper":"/paper/2606.11049"},"observation_digest":"sha256:a2c4ea79f171308ded22f27b2e785324bf8ebeb36baa6b6010c4413a1748448d","observation_id":"794b212f-1f41-478a-8a2b-1c6f8c99e497","resolution":{"observed_at":"2026-06-27T12:10:53.806815Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2008.07669","last_updated":"2020-10-23T02:48:03Z","snapshot_observed_at":"2026-08-17T08:01:12.025881Z","submitted_at":"2020-08-17T23:39:33Z","title":"HiPPO: Recurrent Memory with Optimal Polynomial Projections","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2008.07669","snapshot_observed_at":"2026-07-13T00:11:14.270668Z","title":"Albert Gu, Tri Dao, and Christopher Ré","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2606.23690","last_updated":"2026-04-09T06:52:51Z","snapshot_observed_at":"2026-08-17T14:04:57.094109Z","submitted_at":"2026-04-09T06:52:51Z","title":"Beyond the Autoregressive Horizon: A Comprehensive Survey of Diffusion Models, World Modelling, and State Space Models for Code","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-07-13T00:11:14.270668Z"},"links":{"cited_paper":"/paper/2008.07669","citing_paper":"/paper/2606.23690"},"observation_digest":"sha256:f00c6eab1567eef982181a291563edcade742c1c7da860cec289b34014f0d612","observation_id":"b3902b15-2f18-41a4-886f-37b479f3e80b","resolution":{"observed_at":"2026-07-13T00:11:14.270668Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2008.07669","last_updated":"2020-10-23T02:48:03Z","snapshot_observed_at":"2026-08-17T08:01:12.025881Z","submitted_at":"2020-08-17T23:39:33Z","title":"HiPPO: Recurrent Memory with Optimal Polynomial Projections","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2008.07669","snapshot_observed_at":"2026-07-30T18:22:26.938158Z","title":"ArXiv abs/2008.07669 (2020)","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2607.23580","last_updated":"2026-07-26T10:05:23Z","snapshot_observed_at":"2026-08-16T03:46:46.276763Z","submitted_at":"2026-07-26T10:05:23Z","title":"SketchMamba: A Lightweight State-Space Model for Joint Progressive Sketch Classification and Stroke Auto-Completion","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-07-30T18:22:26.938158Z"},"links":{"cited_paper":"/paper/2008.07669","citing_paper":"/paper/2607.23580"},"observation_digest":"sha256:84135fb68e5053abb7daf35ad5bffbc5d912045d61d0e883e30f79eb265b75a7","observation_id":"70050b2c-4d05-46ee-8de7-e84f79e3eb93","resolution":{"observed_at":"2026-07-30T18:22:26.938158Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2008.07669/citation-record","integrity":"/paper/2008.07669/integrity","json":"/paper/2008.07669/citation-record.json","paper":"/paper/2008.07669"},"outbound":[],"paper":{"arxiv_id":"2008.07669","last_updated":"2020-10-23T02:48:03Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-17T08:01:12.025881Z","submitted_at":"2020-08-17T23:39:33Z","title":"HiPPO: Recurrent Memory with Optimal Polynomial Projections"},"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-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"thesis":"As of 17 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 20 inbound Pith citation observations for arXiv:2008.07669."}