{"as_of":"2026-08-23T11:12:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e20e1c1bab65a96c7e4e929f9495c8adbc4b9321bc9ab12189506d4477d69267","coverage":[{"denominator":52,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":52,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T21:56:07.732818Z","state":"measured"},{"denominator":53,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":53,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-23T06:30:58.430688+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-08T18:24:34.878784Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-09T06:30:40.703957Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2505.08982","last_updated":"2025-05-13T21:49:56Z","snapshot_observed_at":"2026-08-17T05:17:15.631259Z","submitted_at":"2025-05-13T21:49:56Z","title":"Model-free Online Learning for the Kalman Filter: Forgetting Factor and Logarithmic Regret","version":1},"cited_work":{"arxiv_id":"2505.08982","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2505.08982","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Model-free online learnin g for the Kalman filter: Forgetting factor and logarithmic regret","venue":null,"work_id":"76316acc-b292-413c-a6d9-ae0da101466e","year":2025},"citing_paper":{"arxiv_id":"2605.04364","last_updated":"2026-05-06T00:01:54Z","snapshot_observed_at":"2026-08-15T22:00:27.112832Z","submitted_at":"2026-05-06T00:01:54Z","title":"Online Nonstochastic Prediction: Logarithmic Regret via Predictive Online Least Squares","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-05-08T18:24:34.878784Z"},"links":{"cited_paper":"/paper/2505.08982","citing_paper":"/paper/2605.04364"},"observation_digest":"sha256:b53287db4a56374bda6ad8d46ebdf912a8da8141a9fc29a87c20293b3b267202","observation_id":"b90249b7-8524-476c-9759-082d8df77eba","resolution":{"observed_at":"2026-05-09T06:30:40.717024Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2505.08982/citation-record","integrity":"/paper/2505.08982/integrity","json":"/paper/2505.08982/citation-record.json","paper":"/paper/2505.08982"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:56:08.314752Z","title":null,"venue":null,"work_id":"ae4faa78-3cdc-468c-96d3-637421561d46","year":1960},"citing_paper":{"arxiv_id":"2505.08982","last_updated":"2025-05-13T21:49:56Z","snapshot_observed_at":"2026-08-17T05:17:15.631259Z","submitted_at":"2025-05-13T21:49:56Z","title":"Model-free Online Learning for the Kalman Filter: Forgetting Factor and Logarithmic Regret","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-15T21:56:07.553965Z"},"links":{"citing_paper":"/paper/2505.08982"},"observation_digest":"sha256:9b3e8ee262a2376b56626e33e40fdd744781768e52b2856e6b797329fdc488eb","observation_id":"d0086ed0-c8d8-408b-91b8-8370c68990ef","resolution":{"observed_at":"2026-08-15T21:56:08.317861Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-15T21:56:08.304585Z","title":null,"venue":null,"work_id":"8e142991-afd4-44ed-aa1d-32d80faa133a","year":1979},"citing_paper":{"arxiv_id":"2505.08982","last_updated":"2025-05-13T21:49:56Z","snapshot_observed_at":"2026-08-17T05:17:15.631259Z","submitted_at":"2025-05-13T21:49:56Z","title":"Model-free Online Learning for the Kalman Filter: Forgetting Factor and Logarithmic Regret","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-15T21:56:07.558255Z"},"links":{"citing_paper":"/paper/2505.08982"},"observation_digest":"sha256:40d26bb32ec8b904683759a433cd65fbca0e034e0a8eb93224c2c268a82f40f7","observation_id":"ded36794-60f2-4525-b55c-80785efba380","resolution":{"observed_at":"2026-08-15T21:56:08.308011Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-15T21:56:08.293685Z","title":"State estimation for robotics","venue":null,"work_id":"315a29ed-ac90-444c-9f25-8a671974f1c7","year":2024},"citing_paper":{"arxiv_id":"2505.08982","last_updated":"2025-05-13T21:49:56Z","snapshot_observed_at":"2026-08-17T05:17:15.631259Z","submitted_at":"2025-05-13T21:49:56Z","title":"Model-free Online Learning for the Kalman Filter: Forgetting Factor and Logarithmic Regret","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-15T21:56:07.561750Z"},"links":{"citing_paper":"/paper/2505.08982"},"observation_digest":"sha256:1b4ab8ec2b7c13755b61782779c5a921c83a955a39c42f453b2247d039016b80","observation_id":"b3916ed7-a388-4635-b293-f70dc1d80c18","resolution":{"observed_at":"2026-08-15T21:56:08.296860Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-15T21:56:08.283095Z","title":"A linear dynamical syste m model for text","venue":null,"work_id":"86772f2c-72ad-4668-ab1d-90eb2bea9146","year":2015},"citing_paper":{"arxiv_id":"2505.08982","last_updated":"2025-05-13T21:49:56Z","snapshot_observed_at":"2026-08-17T05:17:15.631259Z","submitted_at":"2025-05-13T21:49:56Z","title":"Model-free Online Learning for the Kalman Filter: Forgetting Factor and Logarithmic Regret","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-15T21:56:07.565479Z"},"links":{"citing_paper":"/paper/2505.08982"},"observation_digest":"sha256:9c02c165071e547bf8cc0c33b9319e05a4ebeccf46edb20a34d221c51fb84bea","observation_id":"0119a8bc-1f11-4b8b-92d6-ef300b26b74b","resolution":{"observed_at":"2026-08-15T21:56:08.286610Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-15T21:56:08.272502Z","title":"Long short-term memory Kalman filters: Recurrent neural estimat ors for pose regularization","venue":null,"work_id":"b355d3b9-6d5e-4500-98c4-541ee9d5a1a3","year":2017},"citing_paper":{"arxiv_id":"2505.08982","last_updated":"2025-05-13T21:49:56Z","snapshot_observed_at":"2026-08-17T05:17:15.631259Z","submitted_at":"2025-05-13T21:49:56Z","title":"Model-free Online Learning for the Kalman Filter: Forgetting Factor and Logarithmic Regret","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-15T21:56:07.569233Z"},"links":{"citing_paper":"/paper/2505.08982"},"observation_digest":"sha256:6e2b34c34a7b5522f693fc635e4a90a0e75a9107e0d84918b85fcedb4cd3a642","observation_id":"9d32456e-e0c8-4d8e-be4d-a545072008ed","resolution":{"observed_at":"2026-08-15T21:56:08.276125Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-15T21:56:08.262207Z","title":"Kalman and extended Kalman filters : Concept, derivation and proper- ties","venue":null,"work_id":"813e8aed-6655-400c-885e-88bca2793e4b","year":2004},"citing_paper":{"arxiv_id":"2505.08982","last_updated":"2025-05-13T21:49:56Z","snapshot_observed_at":"2026-08-17T05:17:15.631259Z","submitted_at":"2025-05-13T21:49:56Z","title":"Model-free Online Learning for the Kalman Filter: Forgetting Factor and Logarithmic Regret","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-15T21:56:07.572854Z"},"links":{"citing_paper":"/paper/2505.08982"},"observation_digest":"sha256:f1f1754c9367c65b7d378618fce32a98685329d2a830a440dc5207c7b6ac4ae6","observation_id":"d930a6bc-11af-427c-bea3-60f181128f54","resolution":{"observed_at":"2026-08-15T21:56:08.265863Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-15T21:56:08.249436Z","title":"Cubature Kalman filters","venue":null,"work_id":"dbd2d537-ab6b-4850-8085-e8808e721aae","year":2009},"citing_paper":{"arxiv_id":"2505.08982","last_updated":"2025-05-13T21:49:56Z","snapshot_observed_at":"2026-08-17T05:17:15.631259Z","submitted_at":"2025-05-13T21:49:56Z","title":"Model-free Online Learning for the Kalman Filter: Forgetting Factor and Logarithmic Regret","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-15T21:56:07.576652Z"},"links":{"citing_paper":"/paper/2505.08982"},"observation_digest":"sha256:65895b9f322bfc351a3f0a49bec480eb655d640e90b28e4f45e358ded53f59f5","observation_id":"425980b8-aa1a-45a7-b333-2bbc778eb854","resolution":{"observed_at":"2026-08-15T21:56:08.254489Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-15T21:56:08.239253Z","title":"System identification","venue":null,"work_id":"0bf4928b-685c-42fe-aaa9-c82263f18a46","year":1998},"citing_paper":{"arxiv_id":"2505.08982","last_updated":"2025-05-13T21:49:56Z","snapshot_observed_at":"2026-08-17T05:17:15.631259Z","submitted_at":"2025-05-13T21:49:56Z","title":"Model-free Online Learning for the Kalman Filter: Forgetting Factor and Logarithmic Regret","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-15T21:56:07.579988Z"},"links":{"citing_paper":"/paper/2505.08982"},"observation_digest":"sha256:a61cbc626f20e39fc8288d729f8f33e27efe103a1261cc8674a560459814dc2a","observation_id":"a6db91d1-f927-48c3-ad60-bb7d19310601","resolution":{"observed_at":"2026-08-15T21:56:08.242391Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-15T21:56:08.228407Z","title":"Fundamentals of adaptive filtering","venue":null,"work_id":"ae54e5d4-a294-43fc-a594-4c3613c15261","year":2003},"citing_paper":{"arxiv_id":"2505.08982","last_updated":"2025-05-13T21:49:56Z","snapshot_observed_at":"2026-08-17T05:17:15.631259Z","submitted_at":"2025-05-13T21:49:56Z","title":"Model-free Online Learning for the Kalman Filter: Forgetting Factor and Logarithmic Regret","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-15T21:56:07.583155Z"},"links":{"citing_paper":"/paper/2505.08982"},"observation_digest":"sha256:41fc3355f65be106b1e10aac6f09502d7ed7afefc7f6a52e26995d17e240458b","observation_id":"4f7a70bd-326c-47ad-884d-b582062e2763","resolution":{"observed_at":"2026-08-15T21:56:08.232364Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-15T21:56:08.216350Z","title":"Learning line ar dynamical systems via spectral filtering","venue":null,"work_id":"ee92340c-848e-43bf-b146-552a08c6841a","year":2017},"citing_paper":{"arxiv_id":"2505.08982","last_updated":"2025-05-13T21:49:56Z","snapshot_observed_at":"2026-08-17T05:17:15.631259Z","submitted_at":"2025-05-13T21:49:56Z","title":"Model-free Online Learning for the Kalman Filter: Forgetting Factor and Logarithmic Regret","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-15T21:56:07.586351Z"},"links":{"citing_paper":"/paper/2505.08982"},"observation_digest":"sha256:84881ac11d32c486ca6e6a2d10c3535ffea18b66ba2448f6d5f972db552ee2eb","observation_id":"a1c75025-f9fb-4943-a4fa-65f242910bdd","resolution":{"observed_at":"2026-08-15T21:56:08.220019Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-15T21:56:08.204528Z","title":"No-regret prediction in marginally stable systems","venue":null,"work_id":"714211ce-90a6-4b96-95ed-cada8af848d4","year":2020},"citing_paper":{"arxiv_id":"2505.08982","last_updated":"2025-05-13T21:49:56Z","snapshot_observed_at":"2026-08-17T05:17:15.631259Z","submitted_at":"2025-05-13T21:49:56Z","title":"Model-free Online Learning for the Kalman Filter: Forgetting Factor and Logarithmic Regret","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-15T21:56:07.589469Z"},"links":{"citing_paper":"/paper/2505.08982"},"observation_digest":"sha256:d45f55e4308a5f73e6b775143976a6bb15b7831dac56d5390f250e26d37d0d05","observation_id":"5a842c1c-1d60-44e0-aa52-0ca5b4b66ac9","resolution":{"observed_at":"2026-08-15T21:56:08.209123Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-15T21:56:08.193722Z","title":null,"venue":null,"work_id":"dfc5814c-1f41-441d-ad8c-e62c89dfc86b","year":2023},"citing_paper":{"arxiv_id":"2505.08982","last_updated":"2025-05-13T21:49:56Z","snapshot_observed_at":"2026-08-17T05:17:15.631259Z","submitted_at":"2025-05-13T21:49:56Z","title":"Model-free Online Learning for the Kalman Filter: Forgetting Factor and Logarithmic Regret","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-15T21:56:07.592914Z"},"links":{"citing_paper":"/paper/2505.08982"},"observation_digest":"sha256:c9a4b2fba0e24a225a4221a7de604d94645935d56e074b3f3fb4fc468e10c2a4","observation_id":"0e1b568b-3e38-41e5-9327-21f05c4d646c","resolution":{"observed_at":"2026-08-15T21:56:08.197374Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:56:07.596482Z","title":"Finite sample a nalysis of stochastic system iden- tification","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2505.08982","last_updated":"2025-05-13T21:49:56Z","snapshot_observed_at":"2026-08-17T05:17:15.631259Z","submitted_at":"2025-05-13T21:49:56Z","title":"Model-free Online Learning for the Kalman Filter: Forgetting Factor and Logarithmic Regret","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-15T21:56:07.596482Z"},"links":{"citing_paper":"/paper/2505.08982"},"observation_digest":"sha256:a3fc1717c39c81d8ed71de60450087d27c61d5c4e8ec103f086e545872309d81","observation_id":"27b65db7-ad81-4928-b99f-fcb4a3b5618c","resolution":{"observed_at":"2026-08-15T21:56:07.596482Z","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-15T21:56:08.175949Z","title":"Non-asymptotic identification of l inear dynamical systems using multiple trajectories","venue":null,"work_id":"36920833-b61d-474e-a017-64ffdcfc8f1d","year":2020},"citing_paper":{"arxiv_id":"2505.08982","last_updated":"2025-05-13T21:49:56Z","snapshot_observed_at":"2026-08-17T05:17:15.631259Z","submitted_at":"2025-05-13T21:49:56Z","title":"Model-free Online Learning for the Kalman Filter: Forgetting Factor and Logarithmic Regret","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-15T21:56:07.600442Z"},"links":{"citing_paper":"/paper/2505.08982"},"observation_digest":"sha256:2b695849b56a0930290cd80db3c994f7f3ba34e7277bccd9a7063e9b1bfda831","observation_id":"438f2f1d-c954-4bcf-8fd1-fc22e1d706f6","resolution":{"observed_at":"2026-08-15T21:56:08.179586Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-15T21:56:08.165401Z","title":"Improved rates for prediction and identific ation of partially observed linear dy- namical systems","venue":null,"work_id":"65f7d4e4-34cd-4117-a0a5-dfb336727302","year":2022},"citing_paper":{"arxiv_id":"2505.08982","last_updated":"2025-05-13T21:49:56Z","snapshot_observed_at":"2026-08-17T05:17:15.631259Z","submitted_at":"2025-05-13T21:49:56Z","title":"Model-free Online Learning for the Kalman Filter: Forgetting Factor and Logarithmic Regret","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-15T21:56:07.603478Z"},"links":{"citing_paper":"/paper/2505.08982"},"observation_digest":"sha256:462f8843337db6de888dc4b9b0fedc2496710e4f9da0607557a160ea36b39bbc","observation_id":"15fe31e0-cf24-4b7e-99b3-e1bbd32d5754","resolution":{"observed_at":"2026-08-15T21:56:08.169253Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-15T21:56:08.155129Z","title":"Gradient d escent learns linear dynamical systems","venue":null,"work_id":"36533c26-d9cd-4191-88da-3bd19f6f2928","year":2018},"citing_paper":{"arxiv_id":"2505.08982","last_updated":"2025-05-13T21:49:56Z","snapshot_observed_at":"2026-08-17T05:17:15.631259Z","submitted_at":"2025-05-13T21:49:56Z","title":"Model-free Online Learning for the Kalman Filter: Forgetting Factor and Logarithmic Regret","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-15T21:56:07.606305Z"},"links":{"citing_paper":"/paper/2505.08982"},"observation_digest":"sha256:f8c52c3c1e527cf332e270fce7db4abc9b585b278a1c99741231bfef4713dc88","observation_id":"67cef0fb-ebb7-4320-9aa8-3eddabee466d","resolution":{"observed_at":"2026-08-15T21:56:08.159384Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-15T21:56:08.144717Z","title":"Recursive identificati on and adaptive prediction in linear stochastic systems","venue":null,"work_id":"926c4abb-ec23-431a-8293-1d1b25d9da7b","year":1991},"citing_paper":{"arxiv_id":"2505.08982","last_updated":"2025-05-13T21:49:56Z","snapshot_observed_at":"2026-08-17T05:17:15.631259Z","submitted_at":"2025-05-13T21:49:56Z","title":"Model-free Online Learning for the Kalman Filter: Forgetting Factor and Logarithmic Regret","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-15T21:56:07.609436Z"},"links":{"citing_paper":"/paper/2505.08982"},"observation_digest":"sha256:9680c262e726ed7b85dedb67a64768f16a61d49e2f1d09833bc4a802224eaa5a","observation_id":"225c6cd0-1049-4b4a-a4bc-215e021deefd","resolution":{"observed_at":"2026-08-15T21:56:08.148288Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-15T21:56:08.133975Z","title":"On line learning for time series prediction","venue":null,"work_id":"79e80191-88b0-4e21-af00-0d6f08e674b8","year":2013},"citing_paper":{"arxiv_id":"2505.08982","last_updated":"2025-05-13T21:49:56Z","snapshot_observed_at":"2026-08-17T05:17:15.631259Z","submitted_at":"2025-05-13T21:49:56Z","title":"Model-free Online Learning for the Kalman Filter: Forgetting Factor and Logarithmic Regret","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-15T21:56:07.612549Z"},"links":{"citing_paper":"/paper/2505.08982"},"observation_digest":"sha256:9fd3cb4fe8ceec89a2ec398ec593f590dbe696adff5db57efb592f3ffa41866d","observation_id":"5abcc8ee-d06b-4962-a6a3-545fc2a2e6f0","resolution":{"observed_at":"2026-08-15T21:56:08.138068Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-15T21:56:08.122541Z","title":"On-line learning of linear dynamical systems: Exponential forgetting in Kalma n filters","venue":null,"work_id":"31302227-b4bb-48cd-9d39-561739516b07","year":2019},"citing_paper":{"arxiv_id":"2505.08982","last_updated":"2025-05-13T21:49:56Z","snapshot_observed_at":"2026-08-17T05:17:15.631259Z","submitted_at":"2025-05-13T21:49:56Z","title":"Model-free Online Learning for the Kalman Filter: Forgetting Factor and Logarithmic Regret","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-15T21:56:07.615592Z"},"links":{"citing_paper":"/paper/2505.08982"},"observation_digest":"sha256:e8ea5c935963db18723515936b5541e13d4523e11281716dfbb8a6e4dd345f38","observation_id":"ae90cabf-635e-40cb-9a1d-ecc01307ad2c","resolution":{"observed_at":"2026-08-15T21:56:08.127297Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-15T21:56:08.111773Z","title":"SLIP: Learning to predict in unknown dynamical systems with long-term memory","venue":null,"work_id":"a42889ac-18cf-48be-9b4b-18c95f58acf5","year":2020},"citing_paper":{"arxiv_id":"2505.08982","last_updated":"2025-05-13T21:49:56Z","snapshot_observed_at":"2026-08-17T05:17:15.631259Z","submitted_at":"2025-05-13T21:49:56Z","title":"Model-free Online Learning for the Kalman Filter: Forgetting Factor and Logarithmic Regret","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-15T21:56:07.619991Z"},"links":{"citing_paper":"/paper/2505.08982"},"observation_digest":"sha256:27f97b3b6350fb725a6c6201e2eeab744d301951ba47085f9f1cfcdb70a72ae6","observation_id":"48c5dfab-cac5-4af9-9d6d-6c255dd360b1","resolution":{"observed_at":"2026-08-15T21:56:08.115476Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2409.05390","last_updated":"2024-09-09T07:35:36Z","snapshot_observed_at":"2026-08-16T13:20:17.592008Z","submitted_at":"2024-09-09T07:35:36Z","title":"Regret Analysis with Almost Sure Convergence for OBF-ARX Filter","version":1},"cited_work":{"arxiv_id":"2409.05390","doi":null,"metadata_source":"pith","pith_arxiv_id":"2409.05390","snapshot_observed_at":"2026-08-15T21:56:07.790475Z","title":"Regret Analysis with Almost Sure Convergence for OBF-ARX Filter","venue":"math.OC","work_id":"6d81cd8d-0a6d-4706-b5c0-eb5ae2f7a4b2","year":2024},"citing_paper":{"arxiv_id":"2505.08982","last_updated":"2025-05-13T21:49:56Z","snapshot_observed_at":"2026-08-17T05:17:15.631259Z","submitted_at":"2025-05-13T21:49:56Z","title":"Model-free Online Learning for the Kalman Filter: Forgetting Factor and Logarithmic Regret","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-15T21:56:07.623160Z"},"links":{"cited_paper":"/paper/2409.05390","citing_paper":"/paper/2505.08982"},"observation_digest":"sha256:e00a52cc279d07cd5c0ce0f979a89accff77b11fa055c50c5eeb72cdd3be74fb","observation_id":"321da4d4-4092-4c05-ae72-2ae19b40dc53","resolution":{"observed_at":"2026-08-15T21:56:07.794369Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-15T21:56:08.100248Z","title":"Conc urrent learning adaptive control with directional forgetting","venue":null,"work_id":"088dd31a-89bb-4369-9955-fa3dfec52cff","year":2019},"citing_paper":{"arxiv_id":"2505.08982","last_updated":"2025-05-13T21:49:56Z","snapshot_observed_at":"2026-08-17T05:17:15.631259Z","submitted_at":"2025-05-13T21:49:56Z","title":"Model-free Online Learning for the Kalman Filter: Forgetting Factor and Logarithmic Regret","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-15T21:56:07.626613Z"},"links":{"citing_paper":"/paper/2505.08982"},"observation_digest":"sha256:1cf5efbb95872fcfa22524b847f2c4fc93460018075831dec03774ff8a472aa0","observation_id":"4f04a4c8-ba88-4936-b110-40ea6aeccfd6","resolution":{"observed_at":"2026-08-15T21:56:08.103863Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-15T21:56:08.088982Z","title":"Online convex programming and gener alized infinitesimal gradient ascent","venue":null,"work_id":"43ecfc83-794e-4be4-8388-1895b86d814a","year":2003},"citing_paper":{"arxiv_id":"2505.08982","last_updated":"2025-05-13T21:49:56Z","snapshot_observed_at":"2026-08-17T05:17:15.631259Z","submitted_at":"2025-05-13T21:49:56Z","title":"Model-free Online Learning for the Kalman Filter: Forgetting Factor and Logarithmic Regret","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-15T21:56:07.629784Z"},"links":{"citing_paper":"/paper/2505.08982"},"observation_digest":"sha256:35a16bee0c217f0ef345dd35d4835667bf26ae3a9544b547bb308b8f35fb0ecf","observation_id":"bb9f0e34-3803-474a-9cf5-e43cedd46961","resolution":{"observed_at":"2026-08-15T21:56:08.092669Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2405.19175","last_updated":"2024-05-29T15:17:53Z","snapshot_observed_at":"2026-08-16T13:48:08.637607Z","submitted_at":"2024-05-29T15:17:53Z","title":"Online Linear Regression in Dynamic Environments via Discounting","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.19175","snapshot_observed_at":"2026-08-15T21:56:07.633220Z","title":"Online linear regr ession in dynamic environments via discounting","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.08982","last_updated":"2025-05-13T21:49:56Z","snapshot_observed_at":"2026-08-17T05:17:15.631259Z","submitted_at":"2025-05-13T21:49:56Z","title":"Model-free Online Learning for the Kalman Filter: Forgetting Factor and Logarithmic Regret","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-15T21:56:07.633220Z"},"links":{"cited_paper":"/paper/2405.19175","citing_paper":"/paper/2505.08982"},"observation_digest":"sha256:70f9855477ad54daf5c7946aeb46018e1fd5d971e20c9e5d6ef43aa2b1e64908","observation_id":"3e437726-88af-439e-aa63-3e30ef5359f2","resolution":{"observed_at":"2026-08-15T21:56:07.633220Z","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-15T21:56:08.078430Z","title":"Exponential convergence of recursive least squares with ex ponential forgetting factor","venue":null,"work_id":"e23f0617-d895-43ac-8117-82ce5520c29d","year":1982},"citing_paper":{"arxiv_id":"2505.08982","last_updated":"2025-05-13T21:49:56Z","snapshot_observed_at":"2026-08-17T05:17:15.631259Z","submitted_at":"2025-05-13T21:49:56Z","title":"Model-free Online Learning for the Kalman Filter: Forgetting Factor and Logarithmic Regret","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-15T21:56:07.636919Z"},"links":{"citing_paper":"/paper/2505.08982"},"observation_digest":"sha256:7a18d97361b010bc3d576f191936a75443a45aac34f4151a0078255172cebbc3","observation_id":"e023c711-edef-45bb-9c76-e02bf4e7cffa","resolution":{"observed_at":"2026-08-15T21:56:08.082213Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-15T21:56:08.066843Z","title":"On the influence of the forgetting factor of the RLS adaptive filter i n system identification","venue":null,"work_id":"73504568-92b1-4069-99aa-9c171f73ba1e","year":2009},"citing_paper":{"arxiv_id":"2505.08982","last_updated":"2025-05-13T21:49:56Z","snapshot_observed_at":"2026-08-17T05:17:15.631259Z","submitted_at":"2025-05-13T21:49:56Z","title":"Model-free Online Learning for the Kalman Filter: Forgetting Factor and Logarithmic Regret","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-15T21:56:07.640258Z"},"links":{"citing_paper":"/paper/2505.08982"},"observation_digest":"sha256:6cd09700551bf58f22b4b805d25035a2b315d6aa636af8825c3c6a1fd4829d62","observation_id":"45328d91-f05b-4a8c-a67e-9dee7892c15a","resolution":{"observed_at":"2026-08-15T21:56:08.070938Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-15T21:56:08.055804Z","title":"Generalized forgetti ng recursive least squares: Stability and robustness guarantees","venue":null,"work_id":"63db61bb-8f70-47d8-bf2a-758ca57ede6f","year":2024},"citing_paper":{"arxiv_id":"2505.08982","last_updated":"2025-05-13T21:49:56Z","snapshot_observed_at":"2026-08-17T05:17:15.631259Z","submitted_at":"2025-05-13T21:49:56Z","title":"Model-free Online Learning for the Kalman Filter: Forgetting Factor and Logarithmic Regret","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-15T21:56:07.644150Z"},"links":{"citing_paper":"/paper/2505.08982"},"observation_digest":"sha256:3f4410e81965b196677232c269200b8b528e51c40474187147a436943b2e42b8","observation_id":"ac345af5-6448-4784-ba81-dc21938e029e","resolution":{"observed_at":"2026-08-15T21:56:08.059574Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-15T21:56:08.044821Z","title":"Algebraic Riccati Equations","venue":null,"work_id":"6a6b421b-4cd6-44b7-8db9-ce8790e33277","year":1995},"citing_paper":{"arxiv_id":"2505.08982","last_updated":"2025-05-13T21:49:56Z","snapshot_observed_at":"2026-08-17T05:17:15.631259Z","submitted_at":"2025-05-13T21:49:56Z","title":"Model-free Online Learning for the Kalman Filter: Forgetting Factor and Logarithmic Regret","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-15T21:56:07.647789Z"},"links":{"citing_paper":"/paper/2505.08982"},"observation_digest":"sha256:2e14b3f73532ed6ad315ac126111d9330395d503f7695e25cc371fe7a4c8244d","observation_id":"2657e229-5dfb-415a-a0c4-725f45cdc7a8","resolution":{"observed_at":"2026-08-15T21:56:08.048425Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-15T21:56:08.033991Z","title":"Consistency and asymptotic normal- ity of some subspace algorithms for systems without observe d inputs","venue":null,"work_id":"8f23b7f3-5434-47da-a6cb-50642e9f2176","year":1999},"citing_paper":{"arxiv_id":"2505.08982","last_updated":"2025-05-13T21:49:56Z","snapshot_observed_at":"2026-08-17T05:17:15.631259Z","submitted_at":"2025-05-13T21:49:56Z","title":"Model-free Online Learning for the Kalman Filter: Forgetting Factor and Logarithmic Regret","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-15T21:56:07.651037Z"},"links":{"citing_paper":"/paper/2505.08982"},"observation_digest":"sha256:485c08a433a7eabc84b845bb374955d291f60c150943035db2af968f02f7c863","observation_id":"45bd3f2f-7976-4f29-bf70-daa5959ad010","resolution":{"observed_at":"2026-08-15T21:56:08.037856Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-15T21:56:08.022823Z","title":"Applied regression analysis","venue":null,"work_id":"703b553b-f71a-418b-845f-0f0a0f988b0d","year":1998},"citing_paper":{"arxiv_id":"2505.08982","last_updated":"2025-05-13T21:49:56Z","snapshot_observed_at":"2026-08-17T05:17:15.631259Z","submitted_at":"2025-05-13T21:49:56Z","title":"Model-free Online Learning for the Kalman Filter: Forgetting Factor and Logarithmic Regret","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-15T21:56:07.654650Z"},"links":{"citing_paper":"/paper/2505.08982"},"observation_digest":"sha256:c30c0199a5ec21b11b2137b5adfeb872e40ea5adfd22435b0e54ca80c86ec55e","observation_id":"6e7b7255-6ebf-4ae4-b6e1-011ab90eb0db","resolution":{"observed_at":"2026-08-15T21:56:08.026224Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-15T21:56:08.012275Z","title":"Logistic regression: The importance of being improper","venue":null,"work_id":"b00bc754-b9e6-418a-aa7f-f635be4ded74","year":2018},"citing_paper":{"arxiv_id":"2505.08982","last_updated":"2025-05-13T21:49:56Z","snapshot_observed_at":"2026-08-17T05:17:15.631259Z","submitted_at":"2025-05-13T21:49:56Z","title":"Model-free Online Learning for the Kalman Filter: Forgetting Factor and Logarithmic Regret","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-15T21:56:07.658143Z"},"links":{"citing_paper":"/paper/2505.08982"},"observation_digest":"sha256:9422b28953c2e0311151c867c1fc0154f27b75c3afdbb6e52c45d1042b89ccc7","observation_id":"c6291094-473a-4520-8d7c-b16510330357","resolution":{"observed_at":"2026-08-15T21:56:08.015902Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:56:07.661355Z","title":"Prediction, learning, and games","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2505.08982","last_updated":"2025-05-13T21:49:56Z","snapshot_observed_at":"2026-08-17T05:17:15.631259Z","submitted_at":"2025-05-13T21:49:56Z","title":"Model-free Online Learning for the Kalman Filter: Forgetting Factor and Logarithmic Regret","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-15T21:56:07.661355Z"},"links":{"citing_paper":"/paper/2505.08982"},"observation_digest":"sha256:dedc361fb40c1b058db3e80430551074d2ef8077cde580c69c5bd2a161e2cca0","observation_id":"491b1f56-ecec-4322-9e3e-cb37c667862a","resolution":{"observed_at":"2026-08-15T21:56:07.661355Z","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-15T21:56:07.994981Z","title":"A robust variable forgetting factor recursive least-squares algorithm for system identificati on","venue":null,"work_id":"5a7be106-0ac3-452d-9611-34061a263a11","year":2008},"citing_paper":{"arxiv_id":"2505.08982","last_updated":"2025-05-13T21:49:56Z","snapshot_observed_at":"2026-08-17T05:17:15.631259Z","submitted_at":"2025-05-13T21:49:56Z","title":"Model-free Online Learning for the Kalman Filter: Forgetting Factor and Logarithmic Regret","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-15T21:56:07.664555Z"},"links":{"citing_paper":"/paper/2505.08982"},"observation_digest":"sha256:8ac5952e7dd263d8abcc8ea9edcea082fb6063c345ec64952bfc01646d5f4822","observation_id":"f0e7c3ae-ce0a-4b34-8e39-5cc086ee63bf","resolution":{"observed_at":"2026-08-15T21:56:07.998651Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-15T21:56:07.984693Z","title":"Discounted a daptive online learning: Towards better regularization","venue":null,"work_id":"915cbde3-7c7b-4bb0-be09-cbcdfc48bad1","year":2024},"citing_paper":{"arxiv_id":"2505.08982","last_updated":"2025-05-13T21:49:56Z","snapshot_observed_at":"2026-08-17T05:17:15.631259Z","submitted_at":"2025-05-13T21:49:56Z","title":"Model-free Online Learning for the Kalman Filter: Forgetting Factor and Logarithmic Regret","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-15T21:56:07.667815Z"},"links":{"citing_paper":"/paper/2505.08982"},"observation_digest":"sha256:4845904ed89b9247c4a95ceb83296dcb09424ad2d7588234375c8cfdaae0d6ee","observation_id":"6bb0bd51-db2a-448a-b7d5-57555026af55","resolution":{"observed_at":"2026-08-15T21:56:07.988406Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.10036","last_updated":"2024-06-13T13:04:41Z","snapshot_observed_at":"2026-08-16T14:18:16.401739Z","submitted_at":"2024-02-15T15:59:59Z","title":"Predictive Linear Online Tracking for Unknown Targets","version":3},"cited_work":{"arxiv_id":"2402.10036","doi":null,"metadata_source":"pith","pith_arxiv_id":"2402.10036","snapshot_observed_at":"2026-08-15T21:56:07.763189Z","title":"Predictive Linear Online Tracking for Unknown Targets","venue":"eess.SY","work_id":"ca1026e8-9c2f-4a20-9ace-0d568f86a9b1","year":2024},"citing_paper":{"arxiv_id":"2505.08982","last_updated":"2025-05-13T21:49:56Z","snapshot_observed_at":"2026-08-17T05:17:15.631259Z","submitted_at":"2025-05-13T21:49:56Z","title":"Model-free Online Learning for the Kalman Filter: Forgetting Factor and Logarithmic Regret","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-15T21:56:07.670904Z"},"links":{"cited_paper":"/paper/2402.10036","citing_paper":"/paper/2505.08982"},"observation_digest":"sha256:86d322d25058f4461c267bb63409e55797c216706d3ed4a4583f7e979982b58a","observation_id":"b62f2d3e-cf87-4d24-a8db-7f32bc3d5e02","resolution":{"observed_at":"2026-08-15T21:56:07.768945Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-15T21:56:07.974412Z","title":"Improved algorithms for linear stochastic bandits","venue":null,"work_id":"2cb52fc3-bb37-4cf4-be8f-b1c7184fb7ea","year":2011},"citing_paper":{"arxiv_id":"2505.08982","last_updated":"2025-05-13T21:49:56Z","snapshot_observed_at":"2026-08-17T05:17:15.631259Z","submitted_at":"2025-05-13T21:49:56Z","title":"Model-free Online Learning for the Kalman Filter: Forgetting Factor and Logarithmic Regret","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-15T21:56:07.675609Z"},"links":{"citing_paper":"/paper/2505.08982"},"observation_digest":"sha256:4a9547f8fb679e125035870a5fa11175de6ed2332d1df675120fd535050a2348","observation_id":"1c06ea74-afae-4bd6-bc9e-b49ed2329746","resolution":{"observed_at":"2026-08-15T21:56:07.977967Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-15T21:56:07.964007Z","title":"Ridge regression: B iased estimation for nonorthogonal problems","venue":null,"work_id":"b718528c-fe12-4513-9777-eff0f6e440ec","year":1970},"citing_paper":{"arxiv_id":"2505.08982","last_updated":"2025-05-13T21:49:56Z","snapshot_observed_at":"2026-08-17T05:17:15.631259Z","submitted_at":"2025-05-13T21:49:56Z","title":"Model-free Online Learning for the Kalman Filter: Forgetting Factor and Logarithmic Regret","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-15T21:56:07.679011Z"},"links":{"citing_paper":"/paper/2505.08982"},"observation_digest":"sha256:ffc5fe5fe57ae697e19fb096de73eb6050b314311f00ee8dacc2ce00dfd3ac65","observation_id":"2eae233a-b1f3-423d-9e7d-6a6d09034278","resolution":{"observed_at":"2026-08-15T21:56:07.967536Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-15T21:56:07.953895Z","title":"A bound on tail p robabilities for quadratic forms in independent random variables","venue":null,"work_id":"e4fad6f0-7a31-4cb9-9611-5771b761722f","year":1971},"citing_paper":{"arxiv_id":"2505.08982","last_updated":"2025-05-13T21:49:56Z","snapshot_observed_at":"2026-08-17T05:17:15.631259Z","submitted_at":"2025-05-13T21:49:56Z","title":"Model-free Online Learning for the Kalman Filter: Forgetting Factor and Logarithmic Regret","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-15T21:56:07.682062Z"},"links":{"citing_paper":"/paper/2505.08982"},"observation_digest":"sha256:bc5bba415695e55a2c1d06532aab9532778d6c36911beafe265a01716feb3b4a","observation_id":"b42849a4-788b-41f5-a60f-8e388f010398","resolution":{"observed_at":"2026-08-15T21:56:07.957508Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T21:56:07.685881Z","title":"High-dimensional probability: An introduction with appli cations in data science, volume 47","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2505.08982","last_updated":"2025-05-13T21:49:56Z","snapshot_observed_at":"2026-08-17T05:17:15.631259Z","submitted_at":"2025-05-13T21:49:56Z","title":"Model-free Online Learning for the Kalman Filter: Forgetting Factor and Logarithmic Regret","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-15T21:56:07.685881Z"},"links":{"citing_paper":"/paper/2505.08982"},"observation_digest":"sha256:7a0be1a71a90fc7ba8325d254ff3410082a1a9a3541185f9949f9a0db993d0d0","observation_id":"993828c2-2e14-45cc-8c22-48055fd9bbfd","resolution":{"observed_at":"2026-08-15T21:56:07.685881Z","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-15T21:56:07.937173Z","title":"Cattivelli and Ali H","venue":null,"work_id":"9043dc55-69ae-4311-83e9-02283aa619ea","year":2010},"citing_paper":{"arxiv_id":"2505.08982","last_updated":"2025-05-13T21:49:56Z","snapshot_observed_at":"2026-08-17T05:17:15.631259Z","submitted_at":"2025-05-13T21:49:56Z","title":"Model-free Online Learning for the Kalman Filter: Forgetting Factor and Logarithmic Regret","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-15T21:56:07.688981Z"},"links":{"citing_paper":"/paper/2505.08982"},"observation_digest":"sha256:5770b32991e98a238c7f67bd6cba83f38b248d02c1c508b68ba79edba4c2281b","observation_id":"0c5c9948-66de-4fac-a19d-5fd03f5b4a94","resolution":{"observed_at":"2026-08-15T21:56:07.940804Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-15T21:56:07.926395Z","title":"Willems’ funda mental lemma for nonlinear systems with koopman linear embedding","venue":null,"work_id":"52131dc3-009b-45f6-8b0a-e543a41e2739","year":2024},"citing_paper":{"arxiv_id":"2505.08982","last_updated":"2025-05-13T21:49:56Z","snapshot_observed_at":"2026-08-17T05:17:15.631259Z","submitted_at":"2025-05-13T21:49:56Z","title":"Model-free Online Learning for the Kalman Filter: Forgetting Factor and Logarithmic Regret","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-15T21:56:07.692107Z"},"links":{"citing_paper":"/paper/2505.08982"},"observation_digest":"sha256:44835c7eeb11b8909779f219da6fbad011d423344a1b75930baf321db5c4049f","observation_id":"ac840d8a-a7be-4c3d-84d3-bc6346d5357e","resolution":{"observed_at":"2026-08-15T21:56:07.929930Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-15T21:56:07.915344Z","title":"Adaptive estimat ion of a quadratic functional by model selection","venue":null,"work_id":"d6ed4f6e-4011-4e48-841c-23a12f97983c","year":2000},"citing_paper":{"arxiv_id":"2505.08982","last_updated":"2025-05-13T21:49:56Z","snapshot_observed_at":"2026-08-17T05:17:15.631259Z","submitted_at":"2025-05-13T21:49:56Z","title":"Model-free Online Learning for the Kalman Filter: Forgetting Factor and Logarithmic Regret","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-15T21:56:07.695832Z"},"links":{"citing_paper":"/paper/2505.08982"},"observation_digest":"sha256:1eece6c86613086f7f0961a8f5d1325483cc642de3d62695421d7ac20ffb4e09","observation_id":"1160d16b-5ada-4bc0-a7f3-c170adbe78c4","resolution":{"observed_at":"2026-08-15T21:56:07.919702Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-15T21:56:07.904128Z","title":"Sayed, and Babak Hassibi","venue":null,"work_id":"09a4951e-d10d-4c75-a1c6-38a4df998bbe","year":2000},"citing_paper":{"arxiv_id":"2505.08982","last_updated":"2025-05-13T21:49:56Z","snapshot_observed_at":"2026-08-17T05:17:15.631259Z","submitted_at":"2025-05-13T21:49:56Z","title":"Model-free Online Learning for the Kalman Filter: Forgetting Factor and Logarithmic Regret","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-15T21:56:07.698940Z"},"links":{"citing_paper":"/paper/2505.08982"},"observation_digest":"sha256:3e212670d739a9f6693bd009bf657859b8627b148d1451d3388d8224ca860fc3","observation_id":"1c2b5bf8-b582-4660-968c-c8cf8520e5ce","resolution":{"observed_at":"2026-08-15T21:56:07.907712Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-15T21:56:07.892535Z","title":"Stochastic processes, estimation, and control","venue":null,"work_id":"418c8314-fb8e-4db7-b791-bdcdd62298bf","year":2008},"citing_paper":{"arxiv_id":"2505.08982","last_updated":"2025-05-13T21:49:56Z","snapshot_observed_at":"2026-08-17T05:17:15.631259Z","submitted_at":"2025-05-13T21:49:56Z","title":"Model-free Online Learning for the Kalman Filter: Forgetting Factor and Logarithmic Regret","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-15T21:56:07.702336Z"},"links":{"citing_paper":"/paper/2505.08982"},"observation_digest":"sha256:deed4c4f8bdd7485300444bd387a49a5baa3104855d43b3854e1eee73b92297b","observation_id":"ff1a991f-77bb-4f9d-b0ca-1dd72cc9e8cc","resolution":{"observed_at":"2026-08-15T21:56:07.897048Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-15T21:56:07.880382Z","title":"The steady-state performance of the above recursion satisfie s the discrete-time algebraic Riccati equation P =APA T +Q −APC T( CPC T +R )−1 CPA T","venue":null,"work_id":"dce9bccf-fa77-4071-9a70-c135ddae723d","year":null},"citing_paper":{"arxiv_id":"2505.08982","last_updated":"2025-05-13T21:49:56Z","snapshot_observed_at":"2026-08-17T05:17:15.631259Z","submitted_at":"2025-05-13T21:49:56Z","title":"Model-free Online Learning for the Kalman Filter: Forgetting Factor and Logarithmic Regret","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-15T21:56:07.706256Z"},"links":{"citing_paper":"/paper/2505.08982"},"observation_digest":"sha256:697f3e48ea942bf2615922a09fdee197c557d8cf281f243292439eba5f84efe0","observation_id":"ea1100a3-c7e1-4351-ba05-7e1cd0fcfb15","resolution":{"observed_at":"2026-08-15T21:56:07.885246Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-15T21:56:07.870081Z","title":"Denoteek =yk − ˆyk as the prediction error, also called innovation, at time step k","venue":null,"work_id":"b66ab761-0f39-4f24-96b7-878a3715dfa0","year":null},"citing_paper":{"arxiv_id":"2505.08982","last_updated":"2025-05-13T21:49:56Z","snapshot_observed_at":"2026-08-17T05:17:15.631259Z","submitted_at":"2025-05-13T21:49:56Z","title":"Model-free Online Learning for the Kalman Filter: Forgetting Factor and Logarithmic Regret","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-15T21:56:07.710186Z"},"links":{"citing_paper":"/paper/2505.08982"},"observation_digest":"sha256:d46dff062b445b2fd8873006d380c7bec72e03363f880ae3db4db700bab1daa2","observation_id":"5ef6a52f-6f33-4c89-aa4e-f5e7ec8f989f","resolution":{"observed_at":"2026-08-15T21:56:07.873677Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-15T21:56:07.859538Z","title":null,"venue":null,"work_id":"e4adec48-d834-4529-923d-0817726434a2","year":null},"citing_paper":{"arxiv_id":"2505.08982","last_updated":"2025-05-13T21:49:56Z","snapshot_observed_at":"2026-08-17T05:17:15.631259Z","submitted_at":"2025-05-13T21:49:56Z","title":"Model-free Online Learning for the Kalman Filter: Forgetting Factor and Logarithmic Regret","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-15T21:56:07.714162Z"},"links":{"citing_paper":"/paper/2505.08982"},"observation_digest":"sha256:465976577416924556636a3ad8effa76b68e1e039aef222410a16e500040e881","observation_id":"58bab826-0927-4c26-949f-f89bd7e15d4a","resolution":{"observed_at":"2026-08-15T21:56:07.863359Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-15T21:56:07.847815Z","title":"While for the term det ˜Z22 = det   ˜V2Tl−2 − p′−1∑ k=p DpZk,pZ T k,pDp  , conditioned on the event EPE and EZ, we have ‖ ‖ ‖ ( ΓZ k,p )−1/2 Zk,p ‖ ‖ ‖ 2 ≤ √ mp + √ 2 log 4k δ1","venue":null,"work_id":"87f052eb-e243-42ce-b8d7-0c8502d8b7b8","year":null},"citing_paper":{"arxiv_id":"2505.08982","last_updated":"2025-05-13T21:49:56Z","snapshot_observed_at":"2026-08-17T05:17:15.631259Z","submitted_at":"2025-05-13T21:49:56Z","title":"Model-free Online Learning for the Kalman Filter: Forgetting Factor and Logarithmic Regret","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-15T21:56:07.717780Z"},"links":{"citing_paper":"/paper/2505.08982"},"observation_digest":"sha256:29a07edbddadae69bb3b1c86fc642c815f64494284b47dabc4889aed99ece1e5","observation_id":"30bec8aa-a323-47c3-a1b2-ac4be51d0f1e","resolution":{"observed_at":"2026-08-15T21:56:07.851683Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-15T21:56:07.836937Z","title":null,"venue":null,"work_id":"eee36454-601f-46d3-9435-08bab5b69b2d","year":null},"citing_paper":{"arxiv_id":"2505.08982","last_updated":"2025-05-13T21:49:56Z","snapshot_observed_at":"2026-08-17T05:17:15.631259Z","submitted_at":"2025-05-13T21:49:56Z","title":"Model-free Online Learning for the Kalman Filter: Forgetting Factor and Logarithmic Regret","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-15T21:56:07.721267Z"},"links":{"citing_paper":"/paper/2505.08982"},"observation_digest":"sha256:cf1202c67759c92f5762cab6d9fff9a404f32f4bf12681e5218acbcdc65f046b","observation_id":"81d17f54-88a4-467b-8f46-d81c06d73366","resolution":{"observed_at":"2026-08-15T21:56:07.840513Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-15T21:56:07.825598Z","title":null,"venue":null,"work_id":"21683c63-9806-4ce0-a13d-fb67637872ae","year":null},"citing_paper":{"arxiv_id":"2505.08982","last_updated":"2025-05-13T21:49:56Z","snapshot_observed_at":"2026-08-17T05:17:15.631259Z","submitted_at":"2025-05-13T21:49:56Z","title":"Model-free Online Learning for the Kalman Filter: Forgetting Factor and Logarithmic Regret","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-15T21:56:07.725376Z"},"links":{"citing_paper":"/paper/2505.08982"},"observation_digest":"sha256:9691df5eaaeeb9860ad0c44c3e9bb7c62496f0f4f9d67b0f5f096e11a808382b","observation_id":"955eec53-f2e0-4e03-bfdf-46fe468106dd","resolution":{"observed_at":"2026-08-15T21:56:07.829228Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-15T21:56:07.813138Z","title":null,"venue":null,"work_id":"e4d97d2d-93ca-45bc-acd9-081a09c440ff","year":null},"citing_paper":{"arxiv_id":"2505.08982","last_updated":"2025-05-13T21:49:56Z","snapshot_observed_at":"2026-08-17T05:17:15.631259Z","submitted_at":"2025-05-13T21:49:56Z","title":"Model-free Online Learning for the Kalman Filter: Forgetting Factor and Logarithmic Regret","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-15T21:56:07.729205Z"},"links":{"citing_paper":"/paper/2505.08982"},"observation_digest":"sha256:f229d379b77a412dcd5bd0b5fae9c3d60c6132ee550d21fb997b1694bf051ece","observation_id":"29df953d-9a9c-4bc1-beea-da66bc49cdec","resolution":{"observed_at":"2026-08-15T21:56:07.817701Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+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-15T21:56:07.801853Z","title":"Together with the cross-term bound, we have for probability at lea st 1 − ( 3 + 5π2 6 ) δ1, there is RN ≤ poly ( M,m,β, log 1 δ1 ,d, ‖a‖2 ) log3(N )","venue":null,"work_id":"f880b559-3ed9-4348-8a82-1210c05bc2d7","year":null},"citing_paper":{"arxiv_id":"2505.08982","last_updated":"2025-05-13T21:49:56Z","snapshot_observed_at":"2026-08-17T05:17:15.631259Z","submitted_at":"2025-05-13T21:49:56Z","title":"Model-free Online Learning for the Kalman Filter: Forgetting Factor and Logarithmic Regret","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-15T21:56:07.732818Z"},"links":{"citing_paper":"/paper/2505.08982"},"observation_digest":"sha256:67bdf90fe2a26e38a4f835c270208a354b3fac631fa9cf39ba4b7471167b9809","observation_id":"d45c72a5-d4c0-4e91-9af5-99e51d5df953","resolution":{"observed_at":"2026-08-15T21:56:07.805895Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2505.08982","last_updated":"2025-05-13T21:49:56Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-17T05:17:15.631259Z","submitted_at":"2025-05-13T21:49:56Z","title":"Model-free Online Learning for the Kalman Filter: Forgetting Factor and Logarithmic Regret"},"reference_resolution":{"displayed":52,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":11,"verified_exact":2,"verified_fuzzy":39},"total_outbound_references":52},"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-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"thesis":"As of 23 August 2026, this Paper Citation Record lists 52 of 52 outbound references and 1 inbound Pith citation observation for arXiv:2505.08982."}