{"as_of":"2026-08-21T01:42:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:0bf0977bfb46227548f1fc4bb268206545add2103c0d83346bab8751c882ebff","coverage":[{"denominator":164,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":100,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-15T22:28:27.626716Z","state":"measured"},{"denominator":100,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":100,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-20T06:33:59.587034+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2505.07267/citation-record","integrity":"/paper/2505.07267/integrity","json":"/paper/2505.07267/citation-record.json","paper":"/paper/2505.07267"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T22:28:25.719616Z","title":"Adaptive time series forecasting with markovian variance switching, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.07267","last_updated":"2025-05-12T06:40:29Z","snapshot_observed_at":"2026-08-19T18:18:23.117951Z","submitted_at":"2025-05-12T06:40:29Z","title":"Adaptive, Robust and Scalable Bayesian Filtering for Online Learning","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-15T22:28:25.719616Z"},"links":{"citing_paper":"/paper/2505.07267"},"observation_digest":"sha256:4305e3a59202926be0d7911ba992acff1f9495f53de98f3148dbdb1c80dee4cd","observation_id":"bad6562d-57b5-46bf-8f01-f1eff79b93e2","resolution":{"observed_at":"2026-08-15T22:28:25.719616Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T22:28:25.798297Z","title":null,"venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2505.07267","last_updated":"2025-05-12T06:40:29Z","snapshot_observed_at":"2026-08-19T18:18:23.117951Z","submitted_at":"2025-05-12T06:40:29Z","title":"Adaptive, Robust and Scalable Bayesian Filtering for Online Learning","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-15T22:28:25.798297Z"},"links":{"citing_paper":"/paper/2505.07267"},"observation_digest":"sha256:8d21e9249eca4299915df079a2615feb25823d3035450dab70a6712828f3e3b6","observation_id":"9679bbc3-f6f9-4b89-afcf-e0fa70d9089a","resolution":{"observed_at":"2026-08-15T22:28:25.798297Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T22:28:25.802226Z","title":"Approximate inference in state-space models with heavy-tailed noise","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2505.07267","last_updated":"2025-05-12T06:40:29Z","snapshot_observed_at":"2026-08-19T18:18:23.117951Z","submitted_at":"2025-05-12T06:40:29Z","title":"Adaptive, Robust and Scalable Bayesian Filtering for Online Learning","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-15T22:28:25.802226Z"},"links":{"citing_paper":"/paper/2505.07267"},"observation_digest":"sha256:f6f17b8099d7ca010962ea7873ff2840093c2cb5f0bd7d4660b67fabc263de44","observation_id":"1bd5d5d3-3c7b-4fd5-b474-8cd91c31b7e9","resolution":{"observed_at":"2026-08-15T22:28:25.802226Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T22:28:25.806375Z","title":"Bayesian online prediction of change points","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2505.07267","last_updated":"2025-05-12T06:40:29Z","snapshot_observed_at":"2026-08-19T18:18:23.117951Z","submitted_at":"2025-05-12T06:40:29Z","title":"Adaptive, Robust and Scalable Bayesian Filtering for Online Learning","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-15T22:28:25.806375Z"},"links":{"citing_paper":"/paper/2505.07267"},"observation_digest":"sha256:63723ef7ede088dcee9f0a256900610d52d7ac2ee175e3386f416a12b2dfe3be","observation_id":"9ae93113-bd1a-42fb-8388-ad0cacd53b19","resolution":{"observed_at":"2026-08-15T22:28:25.806375Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T22:28:25.810015Z","title":"Bayesian change-point detection for bandit feedback in non-stationary environments","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.07267","last_updated":"2025-05-12T06:40:29Z","snapshot_observed_at":"2026-08-19T18:18:23.117951Z","submitted_at":"2025-05-12T06:40:29Z","title":"Adaptive, Robust and Scalable Bayesian Filtering for Online Learning","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-15T22:28:25.810015Z"},"links":{"citing_paper":"/paper/2505.07267"},"observation_digest":"sha256:93260ac48eb49c749e42ce391b84240ea7afa8df238f7bbaad315e4ea9414081","observation_id":"76ceb251-c765-40df-9f60-8678fbd1af2a","resolution":{"observed_at":"2026-08-15T22:28:25.810015Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T22:28:25.813448Z","title":"Restarted bayesian online change-point detector achieves optimal detection delay","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2505.07267","last_updated":"2025-05-12T06:40:29Z","snapshot_observed_at":"2026-08-19T18:18:23.117951Z","submitted_at":"2025-05-12T06:40:29Z","title":"Adaptive, Robust and Scalable Bayesian Filtering for Online Learning","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-15T22:28:25.813448Z"},"links":{"citing_paper":"/paper/2505.07267"},"observation_digest":"sha256:1a7dc82b65712b62c77417d90bf9fe75be636082fc431d4d86ab833f15163655","observation_id":"ccc5d721-137c-4e45-8212-b32237b6eca8","resolution":{"observed_at":"2026-08-15T22:28:25.813448Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T22:28:25.817649Z","title":"Concentration of tempered posteriors and of their variational approximations","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2505.07267","last_updated":"2025-05-12T06:40:29Z","snapshot_observed_at":"2026-08-19T18:18:23.117951Z","submitted_at":"2025-05-12T06:40:29Z","title":"Adaptive, Robust and Scalable Bayesian Filtering for Online Learning","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-15T22:28:25.817649Z"},"links":{"citing_paper":"/paper/2505.07267"},"observation_digest":"sha256:2fccb54ad2c0e3c7b05b6660595ebbf3646e79a5d52e215da5b827f90669d7b4","observation_id":"cab4eb8e-364a-48f6-90da-4a1f2d7646f6","resolution":{"observed_at":"2026-08-15T22:28:25.817649Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T22:28:25.821454Z","title":"Robust and scalable B ayesian online changepoint detection","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.07267","last_updated":"2025-05-12T06:40:29Z","snapshot_observed_at":"2026-08-19T18:18:23.117951Z","submitted_at":"2025-05-12T06:40:29Z","title":"Adaptive, Robust and Scalable Bayesian Filtering for Online Learning","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-15T22:28:25.821454Z"},"links":{"citing_paper":"/paper/2505.07267"},"observation_digest":"sha256:20ac130b313289436280e8a4b10f70adfe997bf492e67e6dc9103195f222d12d","observation_id":"02179b4c-dd9a-4fd4-90b3-49020197fd34","resolution":{"observed_at":"2026-08-15T22:28:25.821454Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2311.00463","last_updated":"2024-06-03T10:07:13Z","snapshot_observed_at":"2026-08-16T14:46:53.862165Z","submitted_at":"2023-11-01T11:57:43Z","title":"Robust and Conjugate Gaussian Process Regression","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2311.00463","snapshot_observed_at":"2026-08-15T22:28:25.824456Z","title":"Robust and conjugate G aussian process regression","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.07267","last_updated":"2025-05-12T06:40:29Z","snapshot_observed_at":"2026-08-19T18:18:23.117951Z","submitted_at":"2025-05-12T06:40:29Z","title":"Adaptive, Robust and Scalable Bayesian Filtering for Online Learning","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-15T22:28:25.824456Z"},"links":{"cited_paper":"/paper/2311.00463","citing_paper":"/paper/2505.07267"},"observation_digest":"sha256:3bed3d380f42c718534502bdf173eb1e66f2d6272343cc19ea18ac18c4a000b5","observation_id":"835f2eec-336f-4662-9742-8e14acf68ac2","resolution":{"observed_at":"2026-08-15T22:28:25.824456Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T22:28:25.828316Z","title":"Robust and scalable bayesian online changepoint detection, 2023 c","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.07267","last_updated":"2025-05-12T06:40:29Z","snapshot_observed_at":"2026-08-19T18:18:23.117951Z","submitted_at":"2025-05-12T06:40:29Z","title":"Adaptive, Robust and Scalable Bayesian Filtering for Online Learning","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-15T22:28:25.828316Z"},"links":{"citing_paper":"/paper/2505.07267"},"observation_digest":"sha256:0cbd5dcc07fdc2b344e6ac5c15c48c2d5a3f09ae0d5eb85ff9fcaf192e5a1177","observation_id":"a283e8a5-f80a-4cd0-a71d-ec9398d14dd2","resolution":{"observed_at":"2026-08-15T22:28:25.828316Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T22:28:25.891894Z","title":"A survey of methods for time series change point detection","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2505.07267","last_updated":"2025-05-12T06:40:29Z","snapshot_observed_at":"2026-08-19T18:18:23.117951Z","submitted_at":"2025-05-12T06:40:29Z","title":"Adaptive, Robust and Scalable Bayesian Filtering for Online Learning","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-15T22:28:25.891894Z"},"links":{"citing_paper":"/paper/2505.07267"},"observation_digest":"sha256:8094461c725d6755c3623d58b885b553d8fac0f3a017d643ae0f3feeb7dcb8af","observation_id":"3243351f-c928-4a66-88c0-c5ca6dbffbfa","resolution":{"observed_at":"2026-08-15T22:28:25.891894Z","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":"2412.20847","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T22:28:29.395888Z","title":"Strategic learning and trading in broker-mediated markets, 2024","venue":null,"work_id":"cca6947b-2003-481d-8539-a25f2a64f8de","year":2024},"citing_paper":{"arxiv_id":"2505.07267","last_updated":"2025-05-12T06:40:29Z","snapshot_observed_at":"2026-08-19T18:18:23.117951Z","submitted_at":"2025-05-12T06:40:29Z","title":"Adaptive, Robust and Scalable Bayesian Filtering for Online Learning","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-15T22:28:25.934456Z"},"links":{"citing_paper":"/paper/2505.07267"},"observation_digest":"sha256:cb5bae47ae5bf324b9cd431962cf22659c821fb531c93fb1efc0ca246df210fe","observation_id":"0db64bc2-b13c-4bf5-afea-c13fe4aead3a","resolution":{"observed_at":"2026-08-15T22:28:29.403714Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-15T22:28:25.938467Z","title":"Dynamic portfolio cuts: A spectral approach to graph-theoretic diversification","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.07267","last_updated":"2025-05-12T06:40:29Z","snapshot_observed_at":"2026-08-19T18:18:23.117951Z","submitted_at":"2025-05-12T06:40:29Z","title":"Adaptive, Robust and Scalable Bayesian Filtering for Online Learning","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-15T22:28:25.938467Z"},"links":{"citing_paper":"/paper/2505.07267"},"observation_digest":"sha256:3458087e9884bec6b77f106ec79278ec8dc25fdfdaeb3bf714ac16f169ad18e6","observation_id":"aaf0b15d-9283-4d2c-9683-a33d0f40025b","resolution":{"observed_at":"2026-08-15T22:28:25.938467Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T22:28:25.941978Z","title":"Deep attentive survival analysis in limit order books: Estimating fill probabilities with convolutional-transformers","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.07267","last_updated":"2025-05-12T06:40:29Z","snapshot_observed_at":"2026-08-19T18:18:23.117951Z","submitted_at":"2025-05-12T06:40:29Z","title":"Adaptive, Robust and Scalable Bayesian Filtering for Online Learning","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-15T22:28:25.941978Z"},"links":{"citing_paper":"/paper/2505.07267"},"observation_digest":"sha256:b18222353242e3a59b6271c1bfd7a27bd537faa186d7e47559be59fc7e31c50c","observation_id":"5d3003e5-9ac1-4017-9ce3-33ff904caae8","resolution":{"observed_at":"2026-08-15T22:28:25.941978Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T22:28:25.944766Z","title":"On vanishing gradients, over-smoothing, and over-squashing in gnns: Bridging recurrent and graph learning","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.07267","last_updated":"2025-05-12T06:40:29Z","snapshot_observed_at":"2026-08-19T18:18:23.117951Z","submitted_at":"2025-05-12T06:40:29Z","title":"Adaptive, Robust and Scalable Bayesian Filtering for Online Learning","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-15T22:28:25.944766Z"},"links":{"citing_paper":"/paper/2505.07267"},"observation_digest":"sha256:8eac45347260f7a8635a199cb09d8aade5baea2f4fbddadc654145ef78487715","observation_id":"2e7f7e5f-607a-4658-9e5e-0155ff3049f3","resolution":{"observed_at":"2026-08-15T22:28:25.944766Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T22:28:25.947734Z","title":"Td convergence: An optimization perspective","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.07267","last_updated":"2025-05-12T06:40:29Z","snapshot_observed_at":"2026-08-19T18:18:23.117951Z","submitted_at":"2025-05-12T06:40:29Z","title":"Adaptive, Robust and Scalable Bayesian Filtering for Online Learning","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-15T22:28:25.947734Z"},"links":{"citing_paper":"/paper/2505.07267"},"observation_digest":"sha256:d843071cdec119fc8015b1ac488a1e26de635a53c5e6781ed3dd7203ca56c6d1","observation_id":"fc878e40-6166-434e-94e1-82758389fca3","resolution":{"observed_at":"2026-08-15T22:28:25.947734Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1910.08475","last_updated":"2020-12-31T07:58:30Z","snapshot_observed_at":"2026-08-15T16:40:31.612351Z","submitted_at":"2019-10-18T15:35:59Z","title":"On Warm-Starting Neural Network Training","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1910.08475","snapshot_observed_at":"2026-08-15T22:28:25.950975Z","title":"On warm-starting neural network training","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2505.07267","last_updated":"2025-05-12T06:40:29Z","snapshot_observed_at":"2026-08-19T18:18:23.117951Z","submitted_at":"2025-05-12T06:40:29Z","title":"Adaptive, Robust and Scalable Bayesian Filtering for Online Learning","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-15T22:28:25.950975Z"},"links":{"cited_paper":"/paper/1910.08475","citing_paper":"/paper/2505.07267"},"observation_digest":"sha256:01a023ff83d82101082711ca7e0bc98693cff73d02e4202a1ae994ea43903ab3","observation_id":"0b1706d3-009c-4e62-abda-4dbecd8a5a75","resolution":{"observed_at":"2026-08-15T22:28:25.950975Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T22:28:25.954464Z","title":"Monte carlo methods, volume 35","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2505.07267","last_updated":"2025-05-12T06:40:29Z","snapshot_observed_at":"2026-08-19T18:18:23.117951Z","submitted_at":"2025-05-12T06:40:29Z","title":"Adaptive, Robust and Scalable Bayesian Filtering for Online Learning","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-15T22:28:25.954464Z"},"links":{"citing_paper":"/paper/2505.07267"},"observation_digest":"sha256:d823598d4a53a3fd42f01cf761c38f16a8eca5af29c371fe35e14b98fbe1be87","observation_id":"75eadce0-b9dd-46b8-bed4-dba24405a72b","resolution":{"observed_at":"2026-08-15T22:28:25.954464Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T22:28:25.957415Z","title":"Barp, F.-X","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2505.07267","last_updated":"2025-05-12T06:40:29Z","snapshot_observed_at":"2026-08-19T18:18:23.117951Z","submitted_at":"2025-05-12T06:40:29Z","title":"Adaptive, Robust and Scalable Bayesian Filtering for Online Learning","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-15T22:28:25.957415Z"},"links":{"citing_paper":"/paper/2505.07267"},"observation_digest":"sha256:23ee124a220ae78fda25810eb5c4d4a66306cdb90b6f47c3e9d46c21f7d867aa","observation_id":"39b29aee-6389-473d-a294-67dd7b921653","resolution":{"observed_at":"2026-08-15T22:28:25.957415Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T22:28:25.960333Z","title":"Product partition models for change point problems","venue":null,"work_id":null,"year":1992},"citing_paper":{"arxiv_id":"2505.07267","last_updated":"2025-05-12T06:40:29Z","snapshot_observed_at":"2026-08-19T18:18:23.117951Z","submitted_at":"2025-05-12T06:40:29Z","title":"Adaptive, Robust and Scalable Bayesian Filtering for Online Learning","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-15T22:28:25.960333Z"},"links":{"citing_paper":"/paper/2505.07267"},"observation_digest":"sha256:aa188c88752b4afdc6a9e65b90572c2c4bc207a397ef7abb5d819e581cc25fed","observation_id":"cf531109-125e-4835-823d-f8bc3719b045","resolution":{"observed_at":"2026-08-15T22:28:25.960333Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T22:28:26.041234Z","title":"Detection of abrupt changes: theory and application, volume 104","venue":null,"work_id":null,"year":1993},"citing_paper":{"arxiv_id":"2505.07267","last_updated":"2025-05-12T06:40:29Z","snapshot_observed_at":"2026-08-19T18:18:23.117951Z","submitted_at":"2025-05-12T06:40:29Z","title":"Adaptive, Robust and Scalable Bayesian Filtering for Online Learning","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-15T22:28:26.041234Z"},"links":{"citing_paper":"/paper/2505.07267"},"observation_digest":"sha256:bf4f8e97f560107a8b5f289e28234fbb1398250e2f960e2abdf54be61f428577","observation_id":"f71bae5d-eb93-4313-82c1-68c096bfc122","resolution":{"observed_at":"2026-08-15T22:28:26.041234Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T22:28:26.103036Z","title":"Space guidance evolution-a personal narrative","venue":null,"work_id":null,"year":1982},"citing_paper":{"arxiv_id":"2505.07267","last_updated":"2025-05-12T06:40:29Z","snapshot_observed_at":"2026-08-19T18:18:23.117951Z","submitted_at":"2025-05-12T06:40:29Z","title":"Adaptive, Robust and Scalable Bayesian Filtering for Online Learning","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-15T22:28:26.103036Z"},"links":{"citing_paper":"/paper/2505.07267"},"observation_digest":"sha256:b43efa55f193fb7ed116cdb87811861b00308228b3526498ca303c4ed6533a00","observation_id":"551047a8-d0ee-4ef7-b346-e116573216a5","resolution":{"observed_at":"2026-08-15T22:28:26.103036Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T22:28:26.214994Z","title":"The infinite hidden markov model","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2505.07267","last_updated":"2025-05-12T06:40:29Z","snapshot_observed_at":"2026-08-19T18:18:23.117951Z","submitted_at":"2025-05-12T06:40:29Z","title":"Adaptive, Robust and Scalable Bayesian Filtering for Online Learning","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-15T22:28:26.214994Z"},"links":{"citing_paper":"/paper/2505.07267"},"observation_digest":"sha256:7885254742758aef51a052e2abfc0cfdc5e6e956af15f549946928b6d403f287","observation_id":"fa9b0932-b72c-4d1b-b900-582ea08deda4","resolution":{"observed_at":"2026-08-15T22:28:26.214994Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2311.10580","last_updated":"2023-11-17T15:30:44Z","snapshot_observed_at":"2026-08-20T03:13:57.827806Z","submitted_at":"2023-11-17T15:30:44Z","title":"Implicit Maximum a Posteriori Filtering via Adaptive Optimization","version":1},"cited_work":{"arxiv_id":"2311.10580","doi":null,"metadata_source":"pith","pith_arxiv_id":"2311.10580","snapshot_observed_at":"2026-08-15T22:28:29.131090Z","title":"Implicit Maximum a Posteriori Filtering via Adaptive Optimization","venue":"cs.LG","work_id":"bde79caf-d81d-4718-80f6-dd30b5179f84","year":2023},"citing_paper":{"arxiv_id":"2505.07267","last_updated":"2025-05-12T06:40:29Z","snapshot_observed_at":"2026-08-19T18:18:23.117951Z","submitted_at":"2025-05-12T06:40:29Z","title":"Adaptive, Robust and Scalable Bayesian Filtering for Online Learning","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-15T22:28:26.219363Z"},"links":{"cited_paper":"/paper/2311.10580","citing_paper":"/paper/2505.07267"},"observation_digest":"sha256:d038f3e8c9ea22fc080014ec5cca57f144bf2cfc29b68b03ea0d37fc0d7b52d0","observation_id":"281610d0-a99a-4f34-ad83-ff38122eb28b","resolution":{"observed_at":"2026-08-15T22:28:29.184895Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-15T22:28:26.222898Z","title":"A mean field game between informed traders and a broker","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.07267","last_updated":"2025-05-12T06:40:29Z","snapshot_observed_at":"2026-08-19T18:18:23.117951Z","submitted_at":"2025-05-12T06:40:29Z","title":"Adaptive, Robust and Scalable Bayesian Filtering for Online Learning","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-15T22:28:26.222898Z"},"links":{"citing_paper":"/paper/2505.07267"},"observation_digest":"sha256:6634c300f7b93836ca842f986a13d35a725818e0230580c631e4c52506b79ba4","observation_id":"1ae9a35e-6641-416b-a803-4323e82845b7","resolution":{"observed_at":"2026-08-15T22:28:26.222898Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T22:28:26.226782Z","title":"Bernardo and A","venue":null,"work_id":null,"year":1994},"citing_paper":{"arxiv_id":"2505.07267","last_updated":"2025-05-12T06:40:29Z","snapshot_observed_at":"2026-08-19T18:18:23.117951Z","submitted_at":"2025-05-12T06:40:29Z","title":"Adaptive, Robust and Scalable Bayesian Filtering for Online Learning","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-15T22:28:26.226782Z"},"links":{"citing_paper":"/paper/2505.07267"},"observation_digest":"sha256:69cdc158a6e1253b75a63dfa1b9db760660b482288ecaa390a1e9f3ae5ad4e7d","observation_id":"ef3a6b50-7346-40cb-8698-d744c9bfe01c","resolution":{"observed_at":"2026-08-15T22:28:26.226782Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T22:28:26.230156Z","title":"Bayesian fractional posteriors","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2505.07267","last_updated":"2025-05-12T06:40:29Z","snapshot_observed_at":"2026-08-19T18:18:23.117951Z","submitted_at":"2025-05-12T06:40:29Z","title":"Adaptive, Robust and Scalable Bayesian Filtering for Online Learning","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-15T22:28:26.230156Z"},"links":{"citing_paper":"/paper/2505.07267"},"observation_digest":"sha256:b412e1857ee2394f4f5286c91e6a18b909f6d5004fe5010385ea359ce9a4328b","observation_id":"288cc83d-2adb-481b-a844-f3148e0d623a","resolution":{"observed_at":"2026-08-15T22:28:26.230156Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T22:28:26.233158Z","title":"A general framework for updating belief distributions","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2505.07267","last_updated":"2025-05-12T06:40:29Z","snapshot_observed_at":"2026-08-19T18:18:23.117951Z","submitted_at":"2025-05-12T06:40:29Z","title":"Adaptive, Robust and Scalable Bayesian Filtering for Online Learning","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-15T22:28:26.233158Z"},"links":{"citing_paper":"/paper/2505.07267"},"observation_digest":"sha256:ebff5b199c3089119bf0104c73a9d6f6204ee8ba43e4afd00229fcc0af95e602","observation_id":"3dda2f23-8ac7-43b9-946d-e8ace99c475d","resolution":{"observed_at":"2026-08-15T22:28:26.233158Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T22:28:26.236142Z","title":"Weight uncertainty in neural network","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2505.07267","last_updated":"2025-05-12T06:40:29Z","snapshot_observed_at":"2026-08-19T18:18:23.117951Z","submitted_at":"2025-05-12T06:40:29Z","title":"Adaptive, Robust and Scalable Bayesian Filtering for Online Learning","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-15T22:28:26.236142Z"},"links":{"citing_paper":"/paper/2505.07267"},"observation_digest":"sha256:c950494a19e0eae1d1ab2acb407e7ffb286ddedf3d6f24793a76e7f79f641b56","observation_id":"4dcb4719-b490-41fe-885c-39e0cf98e93e","resolution":{"observed_at":"2026-08-15T22:28:26.236142Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T22:28:26.239092Z","title":"Generalised B ayesian filtering via sequential monte carlo","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2505.07267","last_updated":"2025-05-12T06:40:29Z","snapshot_observed_at":"2026-08-19T18:18:23.117951Z","submitted_at":"2025-05-12T06:40:29Z","title":"Adaptive, Robust and Scalable Bayesian Filtering for Online Learning","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-15T22:28:26.239092Z"},"links":{"citing_paper":"/paper/2505.07267"},"observation_digest":"sha256:6137bbafee060875c2a3eaf786e935d8d56c4a4b587dadf425574bd556ae9994","observation_id":"36a04a14-bf2f-4e33-a401-3712e03c7199","resolution":{"observed_at":"2026-08-15T22:28:26.239092Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T22:28:26.241784Z","title":"JAX : composable transformations of P ython+ N um P y programs, 2018","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2505.07267","last_updated":"2025-05-12T06:40:29Z","snapshot_observed_at":"2026-08-19T18:18:23.117951Z","submitted_at":"2025-05-12T06:40:29Z","title":"Adaptive, Robust and Scalable Bayesian Filtering for Online Learning","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-15T22:28:26.241784Z"},"links":{"citing_paper":"/paper/2505.07267"},"observation_digest":"sha256:2fa192b26c96065ec98bf2ec08d4ebec9a2f067036335dc74cc8ffd865178280","observation_id":"ba0380a8-13a1-4e7a-b3b2-091d8b533c22","resolution":{"observed_at":"2026-08-15T22:28:26.241784Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T22:28:26.245346Z","title":"Statistical modeling: The two cultures (with comments and a rejoinder by the author)","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2505.07267","last_updated":"2025-05-12T06:40:29Z","snapshot_observed_at":"2026-08-19T18:18:23.117951Z","submitted_at":"2025-05-12T06:40:29Z","title":"Adaptive, Robust and Scalable Bayesian Filtering for Online Learning","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-15T22:28:26.245346Z"},"links":{"citing_paper":"/paper/2505.07267"},"observation_digest":"sha256:1234d060c4a5cdaf3cc57b963ea4e10e601bef03593b6c58350c3efab7fdfd20","observation_id":"3932111f-b4cc-46e0-8392-71c013ad476b","resolution":{"observed_at":"2026-08-15T22:28:26.245346Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T22:28:26.248857Z","title":"Online continual learning with natural distribution shifts: An empirical study with visual data","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.07267","last_updated":"2025-05-12T06:40:29Z","snapshot_observed_at":"2026-08-19T18:18:23.117951Z","submitted_at":"2025-05-12T06:40:29Z","title":"Adaptive, Robust and Scalable Bayesian Filtering for Online Learning","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-15T22:28:26.248857Z"},"links":{"citing_paper":"/paper/2505.07267"},"observation_digest":"sha256:8c2b0fb371a7ce6de9ca85246c2b8ea6a908d19099d79b3937cb722029b21efd","observation_id":"92f44908-67e2-41c0-aa90-e81a535018d8","resolution":{"observed_at":"2026-08-15T22:28:26.248857Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T22:28:26.252367Z","title":"Nonlinear bayesian filtering with natural gradient gaussian approximation","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.07267","last_updated":"2025-05-12T06:40:29Z","snapshot_observed_at":"2026-08-19T18:18:23.117951Z","submitted_at":"2025-05-12T06:40:29Z","title":"Adaptive, Robust and Scalable Bayesian Filtering for Online Learning","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-15T22:28:26.252367Z"},"links":{"citing_paper":"/paper/2505.07267"},"observation_digest":"sha256:d2ecc1e71a2348076bd19f04e88ff7a80d2732ccff030319d50587f90362d536","observation_id":"1ae6fed7-33e2-48b6-abc6-21d0db4b2ea1","resolution":{"observed_at":"2026-08-15T22:28:26.252367Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T22:28:26.255545Z","title":"Cartea and L","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.07267","last_updated":"2025-05-12T06:40:29Z","snapshot_observed_at":"2026-08-19T18:18:23.117951Z","submitted_at":"2025-05-12T06:40:29Z","title":"Adaptive, Robust and Scalable Bayesian Filtering for Online Learning","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-15T22:28:26.255545Z"},"links":{"citing_paper":"/paper/2505.07267"},"observation_digest":"sha256:d14e85d2f3e3d116c6a72d6b5ffea95d205a1acf700da4834d3e83fb2d8a3c69","observation_id":"24f8ee8d-7f5d-4b8f-ba92-ee2a8232b99f","resolution":{"observed_at":"2026-08-15T22:28:26.255545Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T22:28:26.258724Z","title":"Optimal execution with stochastic delay","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.07267","last_updated":"2025-05-12T06:40:29Z","snapshot_observed_at":"2026-08-19T18:18:23.117951Z","submitted_at":"2025-05-12T06:40:29Z","title":"Adaptive, Robust and Scalable Bayesian Filtering for Online Learning","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-15T22:28:26.258724Z"},"links":{"citing_paper":"/paper/2505.07267"},"observation_digest":"sha256:e7390081f99df0f7662cd34d484367e79182574f29d67805b4a2fc2e15c5f71a","observation_id":"108bc652-cdbb-460a-ae6b-920b10da30c6","resolution":{"observed_at":"2026-08-15T22:28:26.258724Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T22:28:26.261959Z","title":"Bandits for algorithmic trading with signals","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.07267","last_updated":"2025-05-12T06:40:29Z","snapshot_observed_at":"2026-08-19T18:18:23.117951Z","submitted_at":"2025-05-12T06:40:29Z","title":"Adaptive, Robust and Scalable Bayesian Filtering for Online Learning","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-15T22:28:26.261959Z"},"links":{"citing_paper":"/paper/2505.07267"},"observation_digest":"sha256:68204a5d5652fa4c6ec554b99f121c3ad0ea64125ef4e12b590b5736f77708fd","observation_id":"c473ec97-1c70-4e97-8a48-870e4fe6884f","resolution":{"observed_at":"2026-08-15T22:28:26.261959Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T22:28:26.312166Z","title":"Decentralized finance and automated market making: Predictable loss and optimal liquidity provision","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.07267","last_updated":"2025-05-12T06:40:29Z","snapshot_observed_at":"2026-08-19T18:18:23.117951Z","submitted_at":"2025-05-12T06:40:29Z","title":"Adaptive, Robust and Scalable Bayesian Filtering for Online Learning","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-15T22:28:26.312166Z"},"links":{"citing_paper":"/paper/2505.07267"},"observation_digest":"sha256:84f940072d770c2de1b64e6c260a12fc74e0c78a4e9452268c7a18c26a8797d9","observation_id":"8bbd16be-29cf-4e7f-9cef-90ed20a87150","resolution":{"observed_at":"2026-08-15T22:28:26.312166Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.10561","last_updated":"2025-07-22T17:35:52Z","snapshot_observed_at":"2026-08-16T13:34:13.545175Z","submitted_at":"2024-07-15T09:23:05Z","title":"Nash Equilibrium between Brokers and Traders","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.10561","snapshot_observed_at":"2026-08-15T22:28:26.430497Z","title":"Nash equilibrium between brokers and traders","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.07267","last_updated":"2025-05-12T06:40:29Z","snapshot_observed_at":"2026-08-19T18:18:23.117951Z","submitted_at":"2025-05-12T06:40:29Z","title":"Adaptive, Robust and Scalable Bayesian Filtering for Online Learning","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-15T22:28:26.430497Z"},"links":{"cited_paper":"/paper/2407.10561","citing_paper":"/paper/2505.07267"},"observation_digest":"sha256:a4e5fa1941876bf63ef7bbf6e4ca334978895b22292cf3ac4b15ad7363f70825","observation_id":"10863d5b-4bd0-43f6-b2b3-a8b8a842a723","resolution":{"observed_at":"2026-08-15T22:28:26.430497Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T22:28:26.460056Z","title":"Detecting toxic flow, 2023 b","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.07267","last_updated":"2025-05-12T06:40:29Z","snapshot_observed_at":"2026-08-19T18:18:23.117951Z","submitted_at":"2025-05-12T06:40:29Z","title":"Adaptive, Robust and Scalable Bayesian Filtering for Online Learning","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-15T22:28:26.460056Z"},"links":{"citing_paper":"/paper/2505.07267"},"observation_digest":"sha256:42108bea3c5a86c4a6b4b3c80d45adb68d0cd01f713d782565b6a5f9321154f8","observation_id":"c5a2ebb5-14e4-42f8-8658-20220908b63e","resolution":{"observed_at":"2026-08-15T22:28:26.460056Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T22:28:26.463230Z","title":"A mixture-of-experts framework for adaptive kalman filtering","venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2505.07267","last_updated":"2025-05-12T06:40:29Z","snapshot_observed_at":"2026-08-19T18:18:23.117951Z","submitted_at":"2025-05-12T06:40:29Z","title":"Adaptive, Robust and Scalable Bayesian Filtering for Online Learning","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-15T22:28:26.463230Z"},"links":{"citing_paper":"/paper/2505.07267"},"observation_digest":"sha256:a39d9b2ba7728c41688744c00162d1123f204324f37a141437ca5d64acf61786","observation_id":"d5f50f82-72c7-4104-aaa9-cff1cf66ede3","resolution":{"observed_at":"2026-08-15T22:28:26.463230Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T22:28:26.466373Z","title":"State estimation for discrete systems with switching parameters","venue":null,"work_id":null,"year":1978},"citing_paper":{"arxiv_id":"2505.07267","last_updated":"2025-05-12T06:40:29Z","snapshot_observed_at":"2026-08-19T18:18:23.117951Z","submitted_at":"2025-05-12T06:40:29Z","title":"Adaptive, Robust and Scalable Bayesian Filtering for Online Learning","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-15T22:28:26.466373Z"},"links":{"citing_paper":"/paper/2505.07267"},"observation_digest":"sha256:b31be2ffd9f0b37fb37abc35793ee2d7abb4ec291e91bb63e01305fff31dc7c8","observation_id":"1074af5a-1d53-4822-b8e7-4859041b399e","resolution":{"observed_at":"2026-08-15T22:28:26.466373Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T22:28:26.469479Z","title":"On diagonal approximations to the extended kalman filter for online training of bayesian neural networks","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.07267","last_updated":"2025-05-12T06:40:29Z","snapshot_observed_at":"2026-08-19T18:18:23.117951Z","submitted_at":"2025-05-12T06:40:29Z","title":"Adaptive, Robust and Scalable Bayesian Filtering for Online Learning","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-15T22:28:26.469479Z"},"links":{"citing_paper":"/paper/2505.07267"},"observation_digest":"sha256:37f2f033ededf77c4529da79e1bd7404f55f077a8862ed2697cc8f916c039758","observation_id":"0d840cd4-0ae6-42ca-a3d2-2d1465d0012e","resolution":{"observed_at":"2026-08-15T22:28:26.469479Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T22:28:26.472495Z","title":"Low-rank extended kalman filtering for online learning of neural networks from streaming data","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.07267","last_updated":"2025-05-12T06:40:29Z","snapshot_observed_at":"2026-08-19T18:18:23.117951Z","submitted_at":"2025-05-12T06:40:29Z","title":"Adaptive, Robust and Scalable Bayesian Filtering for Online Learning","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-15T22:28:26.472495Z"},"links":{"citing_paper":"/paper/2505.07267"},"observation_digest":"sha256:1fb64688c4a76ef4f9c57983a8a4e67dd5fc9b037551f852a4ab75cdb31c7858","observation_id":"2eb153f7-e0ea-463e-9fbf-39864321c1c0","resolution":{"observed_at":"2026-08-15T22:28:26.472495Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T22:28:26.475524Z","title":"S tein point m arkov chain M onte C arlo","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2505.07267","last_updated":"2025-05-12T06:40:29Z","snapshot_observed_at":"2026-08-19T18:18:23.117951Z","submitted_at":"2025-05-12T06:40:29Z","title":"Adaptive, Robust and Scalable Bayesian Filtering for Online Learning","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-15T22:28:26.475524Z"},"links":{"citing_paper":"/paper/2505.07267"},"observation_digest":"sha256:d80b68697bf255d59cc03ea4f07ca9a3d34e7e22963038e24c61576e4defccd6","observation_id":"30b84c7c-3119-441c-8ad6-241922a79933","resolution":{"observed_at":"2026-08-15T22:28:26.475524Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T22:28:26.478580Z","title":"Autodifferentiable ensemble kalman filters","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.07267","last_updated":"2025-05-12T06:40:29Z","snapshot_observed_at":"2026-08-19T18:18:23.117951Z","submitted_at":"2025-05-12T06:40:29Z","title":"Adaptive, Robust and Scalable Bayesian Filtering for Online Learning","version":1},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-15T22:28:26.478580Z"},"links":{"citing_paper":"/paper/2505.07267"},"observation_digest":"sha256:4e6baa8d4c5a968a050a89ebb19676e67a7ac3e4f8587209af6d4bcc43511935","observation_id":"4e101540-0929-4260-9661-1071e120e6ea","resolution":{"observed_at":"2026-08-15T22:28:26.478580Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T22:28:26.481305Z","title":"Bayesian filtering: From kalman filters to particle filters, and beyond","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2505.07267","last_updated":"2025-05-12T06:40:29Z","snapshot_observed_at":"2026-08-19T18:18:23.117951Z","submitted_at":"2025-05-12T06:40:29Z","title":"Adaptive, Robust and Scalable Bayesian Filtering for Online Learning","version":1},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-15T22:28:26.481305Z"},"links":{"citing_paper":"/paper/2505.07267"},"observation_digest":"sha256:09743edd3c03f3a678b23130b431b53b6c262912a7cbe0520a241a2fc509d292","observation_id":"11610f3a-291d-41de-accf-d5ce4edcff26","resolution":{"observed_at":"2026-08-15T22:28:26.481305Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T22:28:26.484305Z","title":"Inequalities of rayleigh quotients and bounds on the spectral radius of nonnegative symmetric matrices","venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2505.07267","last_updated":"2025-05-12T06:40:29Z","snapshot_observed_at":"2026-08-19T18:18:23.117951Z","submitted_at":"2025-05-12T06:40:29Z","title":"Adaptive, Robust and Scalable Bayesian Filtering for Online Learning","version":1},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-15T22:28:26.484305Z"},"links":{"citing_paper":"/paper/2505.07267"},"observation_digest":"sha256:02c009a550270a25ce81e955ffd492b41c0a6dc30ad25321091d96855323cbb0","observation_id":"c2a4660a-a94e-4f67-9451-aa8517fb4e38","resolution":{"observed_at":"2026-08-15T22:28:26.484305Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T22:28:26.487793Z","title":"Gee, and Arnaud Doucet","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2505.07267","last_updated":"2025-05-12T06:40:29Z","snapshot_observed_at":"2026-08-19T18:18:23.117951Z","submitted_at":"2025-05-12T06:40:29Z","title":"Adaptive, Robust and Scalable Bayesian Filtering for Online Learning","version":1},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-15T22:28:26.487793Z"},"links":{"citing_paper":"/paper/2505.07267"},"observation_digest":"sha256:d97a3a936e3d88f7063edf84e785178b41c11618b0add9550289441b8faed012","observation_id":"f948ffd5-5357-4e27-8662-3c94cbf44ec1","resolution":{"observed_at":"2026-08-15T22:28:26.487793Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T22:28:26.491312Z","title":"A S tein variational newton method","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2505.07267","last_updated":"2025-05-12T06:40:29Z","snapshot_observed_at":"2026-08-19T18:18:23.117951Z","submitted_at":"2025-05-12T06:40:29Z","title":"Adaptive, Robust and Scalable Bayesian Filtering for Online Learning","version":1},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-08-15T22:28:26.491312Z"},"links":{"citing_paper":"/paper/2505.07267"},"observation_digest":"sha256:35a65900f6ec77d9738c258f725004a28ada6e40d926444a05fa3305427814e0","observation_id":"ec3ba65c-faec-415e-8b8a-6669cea40a53","resolution":{"observed_at":"2026-08-15T22:28:26.491312Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2303.10525","last_updated":"2024-09-10T21:02:36Z","snapshot_observed_at":"2026-08-19T18:17:45.561230Z","submitted_at":"2023-03-19T00:50:39Z","title":"Robustifying likelihoods by optimistically re-weighting data","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2303.10525","snapshot_observed_at":"2026-08-15T22:28:26.494435Z","title":"Robustifying likelihoods by optimistically re-weighting data","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.07267","last_updated":"2025-05-12T06:40:29Z","snapshot_observed_at":"2026-08-19T18:18:23.117951Z","submitted_at":"2025-05-12T06:40:29Z","title":"Adaptive, Robust and Scalable Bayesian Filtering for Online Learning","version":1},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-08-15T22:28:26.494435Z"},"links":{"cited_paper":"/paper/2303.10525","citing_paper":"/paper/2505.07267"},"observation_digest":"sha256:3dad411b82c780b17f1c0b064192f1502b4f92ed2b00e313d39ff83be8cd9e27","observation_id":"cd009da8-57f4-4140-927e-be870528060e","resolution":{"observed_at":"2026-08-15T22:28:26.494435Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T22:28:26.498415Z","title":"Loss of plasticity in deep continual learning","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.07267","last_updated":"2025-05-12T06:40:29Z","snapshot_observed_at":"2026-08-19T18:18:23.117951Z","submitted_at":"2025-05-12T06:40:29Z","title":"Adaptive, Robust and Scalable Bayesian Filtering for Online Learning","version":1},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-08-15T22:28:26.498415Z"},"links":{"citing_paper":"/paper/2505.07267"},"observation_digest":"sha256:69af2490f6625c2c73c0ccbf2d82e5184a6deb86c4dea5c2969d17f26e8dc500","observation_id":"74f2322a-f8c7-4936-95c1-00b59519da0e","resolution":{"observed_at":"2026-08-15T22:28:26.498415Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1301.3853","last_updated":"2013-01-16T15:50:01Z","snapshot_observed_at":"2026-08-15T00:32:24.880260Z","submitted_at":"2013-01-16T15:50:01Z","title":"Rao-Blackwellised Particle Filtering for Dynamic Bayesian Networks","version":1},"cited_work":{"arxiv_id":"1301.3853","doi":null,"metadata_source":"pith","pith_arxiv_id":"1301.3853","snapshot_observed_at":"2026-08-15T22:28:29.047653Z","title":"Rao-Blackwellised Particle Filtering for Dynamic Bayesian Networks","venue":"cs.LG","work_id":"e0ab938c-37b5-48e2-b0d2-2de2efcdb2d0","year":2013},"citing_paper":{"arxiv_id":"2505.07267","last_updated":"2025-05-12T06:40:29Z","snapshot_observed_at":"2026-08-19T18:18:23.117951Z","submitted_at":"2025-05-12T06:40:29Z","title":"Adaptive, Robust and Scalable Bayesian Filtering for Online Learning","version":1},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-08-15T22:28:26.571069Z"},"links":{"cited_paper":"/paper/1301.3853","citing_paper":"/paper/2505.07267"},"observation_digest":"sha256:9ea751c23988c053e8a227ecc32d81840d880e9775b04adfedcaca28d93c116b","observation_id":"47f27551-d558-4f51-a105-024c9e55a22d","resolution":{"observed_at":"2026-08-15T22:28:29.054165Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+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-15T22:28:26.655491Z","title":"A tutorial on particle filtering and smoothing: Fifteen years later","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2505.07267","last_updated":"2025-05-12T06:40:29Z","snapshot_observed_at":"2026-08-19T18:18:23.117951Z","submitted_at":"2025-05-12T06:40:29Z","title":"Adaptive, Robust and Scalable Bayesian Filtering for Online Learning","version":1},"reference_index":54,"source":"arxiv_source","source_observed_at":"2026-08-15T22:28:26.655491Z"},"links":{"citing_paper":"/paper/2505.07267"},"observation_digest":"sha256:2d391068120f3f794a349d3b8262c0da3f7d0793fc8ab718aae11875a617b373","observation_id":"ea756edc-5246-436b-8d5d-a34063c13d57","resolution":{"observed_at":"2026-08-15T22:28:26.655491Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T22:28:26.702653Z","title":"Solvability of differential riccati equations and applications to algorithmic trading with signals","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.07267","last_updated":"2025-05-12T06:40:29Z","snapshot_observed_at":"2026-08-19T18:18:23.117951Z","submitted_at":"2025-05-12T06:40:29Z","title":"Adaptive, Robust and Scalable Bayesian Filtering for Online Learning","version":1},"reference_index":55,"source":"arxiv_source","source_observed_at":"2026-08-15T22:28:26.702653Z"},"links":{"citing_paper":"/paper/2505.07267"},"observation_digest":"sha256:79e1c8d8eda1de58451790456b78ee6f519e77dfa9884c13856cfe851aa776ff","observation_id":"624fc1da-aa66-4bb8-a8ce-c9fd8dd7225d","resolution":{"observed_at":"2026-08-15T22:28:26.702653Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T22:28:26.708217Z","title":"Efficient online bayesian inference for neural bandits","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.07267","last_updated":"2025-05-12T06:40:29Z","snapshot_observed_at":"2026-08-19T18:18:23.117951Z","submitted_at":"2025-05-12T06:40:29Z","title":"Adaptive, Robust and Scalable Bayesian Filtering for Online Learning","version":1},"reference_index":56,"source":"arxiv_source","source_observed_at":"2026-08-15T22:28:26.708217Z"},"links":{"citing_paper":"/paper/2505.07267"},"observation_digest":"sha256:5eb741fa08ef6f63b3f1a47760b70d2254b90100b4c5a4afdb772e0f277724ba","observation_id":"2471530d-5951-4416-8ddc-8fe794d8b053","resolution":{"observed_at":"2026-08-15T22:28:26.708217Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T22:28:26.711747Z","title":"Shestpaloff, Leandro S \\'a nchez-Betancourt, Jeremias Knoblauch, Matt Jones, Briol Fran c ois-Xavier, and Kevin P","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.07267","last_updated":"2025-05-12T06:40:29Z","snapshot_observed_at":"2026-08-19T18:18:23.117951Z","submitted_at":"2025-05-12T06:40:29Z","title":"Adaptive, Robust and Scalable Bayesian Filtering for Online Learning","version":1},"reference_index":57,"source":"arxiv_source","source_observed_at":"2026-08-15T22:28:26.711747Z"},"links":{"citing_paper":"/paper/2505.07267"},"observation_digest":"sha256:f6c53869355a81367bff66e2ed384e5a5eb75b005e911eca84be8c761f350042","observation_id":"3a505238-4c1d-4a53-9bf6-798c1da5a5b4","resolution":{"observed_at":"2026-08-15T22:28:26.711747Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T22:28:26.715602Z","title":"A unifying framework for generalised bayesian online learning in non-stationary environments","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2505.07267","last_updated":"2025-05-12T06:40:29Z","snapshot_observed_at":"2026-08-19T18:18:23.117951Z","submitted_at":"2025-05-12T06:40:29Z","title":"Adaptive, Robust and Scalable Bayesian Filtering for Online Learning","version":1},"reference_index":58,"source":"arxiv_source","source_observed_at":"2026-08-15T22:28:26.715602Z"},"links":{"citing_paper":"/paper/2505.07267"},"observation_digest":"sha256:8598c3afc17a23f1db0343e2f524c4d1b93fa7e0522988dbe1249fbe8f870171","observation_id":"2e57cc63-b2f1-4b73-b59b-e4c337e7babd","resolution":{"observed_at":"2026-08-15T22:28:26.715602Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T22:28:26.719101Z","title":"A Kalman filter primer","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2505.07267","last_updated":"2025-05-12T06:40:29Z","snapshot_observed_at":"2026-08-19T18:18:23.117951Z","submitted_at":"2025-05-12T06:40:29Z","title":"Adaptive, Robust and Scalable Bayesian Filtering for Online Learning","version":1},"reference_index":59,"source":"arxiv_source","source_observed_at":"2026-08-15T22:28:26.719101Z"},"links":{"citing_paper":"/paper/2505.07267"},"observation_digest":"sha256:296730353a71891aa2edb68bf7f832b56fefc27aa22d5e635a3fd9e75f85182c","observation_id":"0d16c9b8-5b11-4b8b-82a2-ebef6f197d72","resolution":{"observed_at":"2026-08-15T22:28:26.719101Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T22:28:26.722800Z","title":"Sequential data assimilation with a nonlinear quasi-geostrophic model using monte carlo methods to forecast error statistics","venue":null,"work_id":null,"year":1994},"citing_paper":{"arxiv_id":"2505.07267","last_updated":"2025-05-12T06:40:29Z","snapshot_observed_at":"2026-08-19T18:18:23.117951Z","submitted_at":"2025-05-12T06:40:29Z","title":"Adaptive, Robust and Scalable Bayesian Filtering for Online Learning","version":1},"reference_index":60,"source":"arxiv_source","source_observed_at":"2026-08-15T22:28:26.722800Z"},"links":{"citing_paper":"/paper/2505.07267"},"observation_digest":"sha256:f7173baae2c32773b5fe8b301ed5735b7f8860e7c3de1e90edf324f7fab1adb5","observation_id":"35270199-99e4-47eb-8404-6fbb5d165043","resolution":{"observed_at":"2026-08-15T22:28:26.722800Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T22:28:26.726411Z","title":"The ensemble kalman filter: Theoretical formulation and practical implementation","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2505.07267","last_updated":"2025-05-12T06:40:29Z","snapshot_observed_at":"2026-08-19T18:18:23.117951Z","submitted_at":"2025-05-12T06:40:29Z","title":"Adaptive, Robust and Scalable Bayesian Filtering for Online Learning","version":1},"reference_index":61,"source":"arxiv_source","source_observed_at":"2026-08-15T22:28:26.726411Z"},"links":{"citing_paper":"/paper/2505.07267"},"observation_digest":"sha256:63e41add7c1b6d16330df5e6956fe0535d33c6f7c7378d8c8cc850ed4f565678","observation_id":"94ce95f0-38ec-4c6f-9f0e-1c53a88090b9","resolution":{"observed_at":"2026-08-15T22:28:26.726411Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T22:28:26.729679Z","title":"Day-ahead electricity demand forecasting competition: Post-covid paradigm","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.07267","last_updated":"2025-05-12T06:40:29Z","snapshot_observed_at":"2026-08-19T18:18:23.117951Z","submitted_at":"2025-05-12T06:40:29Z","title":"Adaptive, Robust and Scalable Bayesian Filtering for Online Learning","version":1},"reference_index":62,"source":"arxiv_source","source_observed_at":"2026-08-15T22:28:26.729679Z"},"links":{"citing_paper":"/paper/2505.07267"},"observation_digest":"sha256:4c9505103e348dc4535d7a39f3ab837fc7a6ce9c2e282f47ce76345c1a9ebc8f","observation_id":"99c59350-8948-4670-b027-2d9dc9ebe045","resolution":{"observed_at":"2026-08-15T22:28:26.729679Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T22:28:26.732705Z","title":"On-line inference for multiple changepoint problems","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2505.07267","last_updated":"2025-05-12T06:40:29Z","snapshot_observed_at":"2026-08-19T18:18:23.117951Z","submitted_at":"2025-05-12T06:40:29Z","title":"Adaptive, Robust and Scalable Bayesian Filtering for Online Learning","version":1},"reference_index":63,"source":"arxiv_source","source_observed_at":"2026-08-15T22:28:26.732705Z"},"links":{"citing_paper":"/paper/2505.07267"},"observation_digest":"sha256:cc7cd78153ead05e13aad407eb7ccd691e2358149aef118c2f4cd6bf45269744","observation_id":"6aee6e50-0ce6-412c-ba77-45a528a85dec","resolution":{"observed_at":"2026-08-15T22:28:26.732705Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T22:28:26.735328Z","title":"Efficient bayesian analysis of multiple changepoint models with dependence across segments","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2505.07267","last_updated":"2025-05-12T06:40:29Z","snapshot_observed_at":"2026-08-19T18:18:23.117951Z","submitted_at":"2025-05-12T06:40:29Z","title":"Adaptive, Robust and Scalable Bayesian Filtering for Online Learning","version":1},"reference_index":64,"source":"arxiv_source","source_observed_at":"2026-08-15T22:28:26.735328Z"},"links":{"citing_paper":"/paper/2505.07267"},"observation_digest":"sha256:975724d4e176074f8c899024b752840548d5f1f215c1003a42eb2dde42005548","observation_id":"95bd70d7-666d-4ff2-9a98-f486d7e101ae","resolution":{"observed_at":"2026-08-15T22:28:26.735328Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T22:28:26.738953Z","title":"Changepoint detection in the presence of outliers","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2505.07267","last_updated":"2025-05-12T06:40:29Z","snapshot_observed_at":"2026-08-19T18:18:23.117951Z","submitted_at":"2025-05-12T06:40:29Z","title":"Adaptive, Robust and Scalable Bayesian Filtering for Online Learning","version":1},"reference_index":65,"source":"arxiv_source","source_observed_at":"2026-08-15T22:28:26.738953Z"},"links":{"citing_paper":"/paper/2505.07267"},"observation_digest":"sha256:5e2151ef1e3a22b3b2e9c233a112d6b7ffcb517510efbef39e99e1c411c30a0e","observation_id":"30c3757e-8f5a-462c-a721-8045e0a23074","resolution":{"observed_at":"2026-08-15T22:28:26.738953Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T22:28:26.742620Z","title":"The sticky hdp-hmm: Bayesian nonparametric hidden markov models with persistent states","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2505.07267","last_updated":"2025-05-12T06:40:29Z","snapshot_observed_at":"2026-08-19T18:18:23.117951Z","submitted_at":"2025-05-12T06:40:29Z","title":"Adaptive, Robust and Scalable Bayesian Filtering for Online Learning","version":1},"reference_index":66,"source":"arxiv_source","source_observed_at":"2026-08-15T22:28:26.742620Z"},"links":{"citing_paper":"/paper/2505.07267"},"observation_digest":"sha256:279974335969d272657213c75e7e20e69c3dec5e28decd26f1303d8c14a3a315","observation_id":"4d755c50-8e02-4030-ba36-a205acc4ec95","resolution":{"observed_at":"2026-08-15T22:28:26.742620Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T22:28:26.795744Z","title":"The Lottery Ticket Hypothesis: On Sparse, Trainable Neural Networks","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.07267","last_updated":"2025-05-12T06:40:29Z","snapshot_observed_at":"2026-08-19T18:18:23.117951Z","submitted_at":"2025-05-12T06:40:29Z","title":"Adaptive, Robust and Scalable Bayesian Filtering for Online Learning","version":1},"reference_index":67,"source":"arxiv_source","source_observed_at":"2026-08-15T22:28:26.795744Z"},"links":{"citing_paper":"/paper/2505.07267"},"observation_digest":"sha256:6667058885735f2f93c5cba4c746ccda20cd86beac2fa1477ba8d91854f280b6","observation_id":"7819cb37-ca88-472c-8e78-699c18caabc1","resolution":{"observed_at":"2026-08-15T22:28:26.795744Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2411.04034","last_updated":"2024-11-06T16:32:40Z","snapshot_observed_at":"2026-08-16T13:02:22.889299Z","submitted_at":"2024-11-06T16:32:40Z","title":"Non-Stationary Learning of Neural Networks with Automatic Soft Parameter Reset","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2411.04034","snapshot_observed_at":"2026-08-15T22:28:26.932298Z","title":"Non-stationary learning of neural networks with automatic soft parameter reset","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.07267","last_updated":"2025-05-12T06:40:29Z","snapshot_observed_at":"2026-08-19T18:18:23.117951Z","submitted_at":"2025-05-12T06:40:29Z","title":"Adaptive, Robust and Scalable Bayesian Filtering for Online Learning","version":1},"reference_index":68,"source":"arxiv_source","source_observed_at":"2026-08-15T22:28:26.932298Z"},"links":{"cited_paper":"/paper/2411.04034","citing_paper":"/paper/2505.07267"},"observation_digest":"sha256:8964561cc31341658701f8addd2bb180f9a2cb66437cc5bc9d049ae0cee4eda7","observation_id":"d75a39e6-945b-495b-a7da-07349c3d8857","resolution":{"observed_at":"2026-08-15T22:28:26.932298Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T22:28:26.980463Z","title":"Knowledge discovery from data streams","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2505.07267","last_updated":"2025-05-12T06:40:29Z","snapshot_observed_at":"2026-08-19T18:18:23.117951Z","submitted_at":"2025-05-12T06:40:29Z","title":"Adaptive, Robust and Scalable Bayesian Filtering for Online Learning","version":1},"reference_index":69,"source":"arxiv_source","source_observed_at":"2026-08-15T22:28:26.980463Z"},"links":{"citing_paper":"/paper/2505.07267"},"observation_digest":"sha256:302f0c5c27f34e5499886cb6afdcdc51fa00ffdd0ca15ab27d4f7a35b470af42","observation_id":"39ca7cb0-e443-418a-a177-8b39221410a0","resolution":{"observed_at":"2026-08-15T22:28:26.980463Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T22:28:26.984020Z","title":"Variational learning for switching state-space models","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2505.07267","last_updated":"2025-05-12T06:40:29Z","snapshot_observed_at":"2026-08-19T18:18:23.117951Z","submitted_at":"2025-05-12T06:40:29Z","title":"Adaptive, Robust and Scalable Bayesian Filtering for Online Learning","version":1},"reference_index":70,"source":"arxiv_source","source_observed_at":"2026-08-15T22:28:26.984020Z"},"links":{"citing_paper":"/paper/2505.07267"},"observation_digest":"sha256:c8f50f5cb9a777cc2320bd98ed4460841a0f1486854e317737aba56f78a52947","observation_id":"0018fe44-b694-4326-842b-644b49bee17f","resolution":{"observed_at":"2026-08-15T22:28:26.984020Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T22:28:26.987161Z","title":"Tractable approximate gaussian inference for bayesian neural networks","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.07267","last_updated":"2025-05-12T06:40:29Z","snapshot_observed_at":"2026-08-19T18:18:23.117951Z","submitted_at":"2025-05-12T06:40:29Z","title":"Adaptive, Robust and Scalable Bayesian Filtering for Online Learning","version":1},"reference_index":71,"source":"arxiv_source","source_observed_at":"2026-08-15T22:28:26.987161Z"},"links":{"citing_paper":"/paper/2505.07267"},"observation_digest":"sha256:f4cefc0a26ca43405b1c387d47bd4f7d5e9a6fa8748b087026c89e66775d9236","observation_id":"8d558a4c-ecc2-4eba-ba33-fa249feccb84","resolution":{"observed_at":"2026-08-15T22:28:26.987161Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T22:28:26.991392Z","title":"Optimization or architecture: How to hack kalman filtering","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.07267","last_updated":"2025-05-12T06:40:29Z","snapshot_observed_at":"2026-08-19T18:18:23.117951Z","submitted_at":"2025-05-12T06:40:29Z","title":"Adaptive, Robust and Scalable Bayesian Filtering for Online Learning","version":1},"reference_index":72,"source":"arxiv_source","source_observed_at":"2026-08-15T22:28:26.991392Z"},"links":{"citing_paper":"/paper/2505.07267"},"observation_digest":"sha256:38f5d15e9275f3a94eef176fc09fb25f518b1d8bc1e328f36c929ea18ca2defe","observation_id":"f42e43a8-a390-4265-a9a8-50a4186bde4b","resolution":{"observed_at":"2026-08-15T22:28:26.991392Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T22:28:26.995666Z","title":"Applications of kalman filtering in aerospace 1960 to the present [historical perspectives]","venue":null,"work_id":null,"year":1960},"citing_paper":{"arxiv_id":"2505.07267","last_updated":"2025-05-12T06:40:29Z","snapshot_observed_at":"2026-08-19T18:18:23.117951Z","submitted_at":"2025-05-12T06:40:29Z","title":"Adaptive, Robust and Scalable Bayesian Filtering for Online Learning","version":1},"reference_index":73,"source":"arxiv_source","source_observed_at":"2026-08-15T22:28:26.995666Z"},"links":{"citing_paper":"/paper/2505.07267"},"observation_digest":"sha256:f662ed54e4ddf754c4a3948beadfbcb7af2b16070d55bc9789aefc2c2c36adae","observation_id":"0d0e378e-7bb8-448a-b2d9-51bc7b99bec6","resolution":{"observed_at":"2026-08-15T22:28:26.995666Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T22:28:26.999399Z","title":"The safe Bayesian","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2505.07267","last_updated":"2025-05-12T06:40:29Z","snapshot_observed_at":"2026-08-19T18:18:23.117951Z","submitted_at":"2025-05-12T06:40:29Z","title":"Adaptive, Robust and Scalable Bayesian Filtering for Online Learning","version":1},"reference_index":74,"source":"arxiv_source","source_observed_at":"2026-08-15T22:28:26.999399Z"},"links":{"citing_paper":"/paper/2505.07267"},"observation_digest":"sha256:f3fbd0b4e105896f66ffbd15af0dcaa11653bbc1fd0e99d1a79e3a2e94cfc967","observation_id":"3f1b4819-7bbf-42c3-ab3b-c0d202758e21","resolution":{"observed_at":"2026-08-15T22:28:26.999399Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T22:28:27.003977Z","title":"Inconsistency of B ayesian inference for misspecified linear models, and a proposal for repairing it","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2505.07267","last_updated":"2025-05-12T06:40:29Z","snapshot_observed_at":"2026-08-19T18:18:23.117951Z","submitted_at":"2025-05-12T06:40:29Z","title":"Adaptive, Robust and Scalable Bayesian Filtering for Online Learning","version":1},"reference_index":75,"source":"arxiv_source","source_observed_at":"2026-08-15T22:28:27.003977Z"},"links":{"citing_paper":"/paper/2505.07267"},"observation_digest":"sha256:9a712ffd432984e172962447de73eb02c4df2528dbbbaeac07f9b409f9db7cbd","observation_id":"9043f8b8-9780-4e78-8dba-cf8ddf305ae5","resolution":{"observed_at":"2026-08-15T22:28:27.003977Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T22:28:27.007993Z","title":"Survey on online streaming continual learning","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.07267","last_updated":"2025-05-12T06:40:29Z","snapshot_observed_at":"2026-08-19T18:18:23.117951Z","submitted_at":"2025-05-12T06:40:29Z","title":"Adaptive, Robust and Scalable Bayesian Filtering for Online Learning","version":1},"reference_index":76,"source":"arxiv_source","source_observed_at":"2026-08-15T22:28:27.007993Z"},"links":{"citing_paper":"/paper/2505.07267"},"observation_digest":"sha256:935a988d64dcee319697cd1c45707c74ee2180d535bdb968e9e437987c6688f2","observation_id":"a2030096-ee3b-4a48-bcde-34afa1e21e72","resolution":{"observed_at":"2026-08-15T22:28:27.007993Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T22:28:27.011533Z","title":"Comprehensive analysis of change-point dynamics detection in time series data: A review","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.07267","last_updated":"2025-05-12T06:40:29Z","snapshot_observed_at":"2026-08-19T18:18:23.117951Z","submitted_at":"2025-05-12T06:40:29Z","title":"Adaptive, Robust and Scalable Bayesian Filtering for Online Learning","version":1},"reference_index":77,"source":"arxiv_source","source_observed_at":"2026-08-15T22:28:27.011533Z"},"links":{"citing_paper":"/paper/2505.07267"},"observation_digest":"sha256:76c4f3449c774b046e6e42189c27ae1cec864b7686080a2a05b7cfacb821405c","observation_id":"ce60ca88-a058-4362-8477-83c93c9cdf83","resolution":{"observed_at":"2026-08-15T22:28:27.011533Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2404.11599","last_updated":"2024-04-17T17:50:24Z","snapshot_observed_at":"2026-08-18T12:59:42.896133Z","submitted_at":"2024-04-17T17:50:24Z","title":"Variational Bayesian Last Layers","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.11599","snapshot_observed_at":"2026-08-15T22:28:27.015313Z","title":"Variational bayesian last layers, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.07267","last_updated":"2025-05-12T06:40:29Z","snapshot_observed_at":"2026-08-19T18:18:23.117951Z","submitted_at":"2025-05-12T06:40:29Z","title":"Adaptive, Robust and Scalable Bayesian Filtering for Online Learning","version":1},"reference_index":78,"source":"arxiv_source","source_observed_at":"2026-08-15T22:28:27.015313Z"},"links":{"cited_paper":"/paper/2404.11599","citing_paper":"/paper/2505.07267"},"observation_digest":"sha256:fe62e702ecd2a7574b8e3347e3178c632d0a8bf7f917dfc9c92f8c652cb2a8ff","observation_id":"de195532-d6b0-4e07-bb21-9211ac6241d9","resolution":{"observed_at":"2026-08-15T22:28:27.015313Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T22:28:27.029570Z","title":"The elements of statistical learning: data mining, inference, and prediction, volume 2","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2505.07267","last_updated":"2025-05-12T06:40:29Z","snapshot_observed_at":"2026-08-19T18:18:23.117951Z","submitted_at":"2025-05-12T06:40:29Z","title":"Adaptive, Robust and Scalable Bayesian Filtering for Online Learning","version":1},"reference_index":79,"source":"arxiv_source","source_observed_at":"2026-08-15T22:28:27.029570Z"},"links":{"citing_paper":"/paper/2505.07267"},"observation_digest":"sha256:422d26f0bad1c1e2bb86e84d8907380431b464ab4aa03c358c2dcfef86868093","observation_id":"24172943-e74f-4e56-b44f-5a7f3d8f8995","resolution":{"observed_at":"2026-08-15T22:28:27.029570Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T22:28:27.136526Z","title":"Assigning a value to a power likelihood in a general Bayesian model","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2505.07267","last_updated":"2025-05-12T06:40:29Z","snapshot_observed_at":"2026-08-19T18:18:23.117951Z","submitted_at":"2025-05-12T06:40:29Z","title":"Adaptive, Robust and Scalable Bayesian Filtering for Online Learning","version":1},"reference_index":80,"source":"arxiv_source","source_observed_at":"2026-08-15T22:28:27.136526Z"},"links":{"citing_paper":"/paper/2505.07267"},"observation_digest":"sha256:a85f9afd83c80a60bcfd90d69c7f0132b42a2e7256a3e40cf5c00d33ef77e311","observation_id":"e113ca43-1546-415a-9320-95fd35d3e42e","resolution":{"observed_at":"2026-08-15T22:28:27.136526Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T22:28:27.209394Z","title":"Matrix analysis","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2505.07267","last_updated":"2025-05-12T06:40:29Z","snapshot_observed_at":"2026-08-19T18:18:23.117951Z","submitted_at":"2025-05-12T06:40:29Z","title":"Adaptive, Robust and Scalable Bayesian Filtering for Online Learning","version":1},"reference_index":81,"source":"arxiv_source","source_observed_at":"2026-08-15T22:28:27.209394Z"},"links":{"citing_paper":"/paper/2505.07267"},"observation_digest":"sha256:800749a9409b3beb833f6aae1254de6eeae58bf42b25a67f95aeeca59d95c412","observation_id":"530b2897-25a8-49de-a7dd-42afd7065842","resolution":{"observed_at":"2026-08-15T22:28:27.209394Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2106.09685","last_updated":"2021-10-16T18:40:34Z","snapshot_observed_at":"2026-08-20T11:47:17.477107Z","submitted_at":"2021-06-17T17:37:18Z","title":"LoRA: Low-Rank Adaptation of Large Language Models","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2106.09685","snapshot_observed_at":"2026-08-15T22:28:27.214282Z","title":"Lora: Low-rank adaptation of large language models","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.07267","last_updated":"2025-05-12T06:40:29Z","snapshot_observed_at":"2026-08-19T18:18:23.117951Z","submitted_at":"2025-05-12T06:40:29Z","title":"Adaptive, Robust and Scalable Bayesian Filtering for Online Learning","version":1},"reference_index":82,"source":"arxiv_source","source_observed_at":"2026-08-15T22:28:27.214282Z"},"links":{"cited_paper":"/paper/2106.09685","citing_paper":"/paper/2505.07267"},"observation_digest":"sha256:395127ca08f88c83ff29989e5de9fb8008f2dbb7bd32f5795c3180fb3e32ec03","observation_id":"ff17f977-d980-4dad-8631-8bf50e223917","resolution":{"observed_at":"2026-08-15T22:28:27.214282Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T22:28:27.219195Z","title":"A robust G aussian approximate filter for nonlinear systems with heavy tailed measurement noises","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2505.07267","last_updated":"2025-05-12T06:40:29Z","snapshot_observed_at":"2026-08-19T18:18:23.117951Z","submitted_at":"2025-05-12T06:40:29Z","title":"Adaptive, Robust and Scalable Bayesian Filtering for Online Learning","version":1},"reference_index":83,"source":"arxiv_source","source_observed_at":"2026-08-15T22:28:27.219195Z"},"links":{"citing_paper":"/paper/2505.07267"},"observation_digest":"sha256:347560a0c0f372ed1b89ee85fa529e9f2c523417ca04b1b8547d8561f13f0ede","observation_id":"cbca6641-534e-4601-bb5b-0f2ca7532e90","resolution":{"observed_at":"2026-08-15T22:28:27.219195Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T22:28:27.222231Z","title":"Robust statistics","venue":null,"work_id":null,"year":1981},"citing_paper":{"arxiv_id":"2505.07267","last_updated":"2025-05-12T06:40:29Z","snapshot_observed_at":"2026-08-19T18:18:23.117951Z","submitted_at":"2025-05-12T06:40:29Z","title":"Adaptive, Robust and Scalable Bayesian Filtering for Online Learning","version":1},"reference_index":84,"source":"arxiv_source","source_observed_at":"2026-08-15T22:28:27.222231Z"},"links":{"citing_paper":"/paper/2505.07267"},"observation_digest":"sha256:349b03afd71ea762e3142e9cef52e017dbd78efd4f5e57618ab08df04a2efb4f","observation_id":"8644aaae-f304-457a-a65e-2e1505c74cd5","resolution":{"observed_at":"2026-08-15T22:28:27.222231Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T22:28:27.225557Z","title":"Gradual changes versus abrupt changes","venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2505.07267","last_updated":"2025-05-12T06:40:29Z","snapshot_observed_at":"2026-08-19T18:18:23.117951Z","submitted_at":"2025-05-12T06:40:29Z","title":"Adaptive, Robust and Scalable Bayesian Filtering for Online Learning","version":1},"reference_index":85,"source":"arxiv_source","source_observed_at":"2026-08-15T22:28:27.225557Z"},"links":{"citing_paper":"/paper/2505.07267"},"observation_digest":"sha256:0b56242c85d946b1308ad18ba1c67cace06a9dd76542657d159e8923573e75fc","observation_id":"a6b24ea7-8a45-4d70-971e-bb9d0c2a8e5d","resolution":{"observed_at":"2026-08-15T22:28:27.225557Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T22:28:27.229072Z","title":"Improving predictions of bayesian neural nets via local linearization","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.07267","last_updated":"2025-05-12T06:40:29Z","snapshot_observed_at":"2026-08-19T18:18:23.117951Z","submitted_at":"2025-05-12T06:40:29Z","title":"Adaptive, Robust and Scalable Bayesian Filtering for Online Learning","version":1},"reference_index":86,"source":"arxiv_source","source_observed_at":"2026-08-15T22:28:27.229072Z"},"links":{"citing_paper":"/paper/2505.07267"},"observation_digest":"sha256:65ab0ee6d8b72298c39cd0852805143c57f32df4a783f99f3f0378bdeaaf13fe","observation_id":"fd2fcffb-357f-4b32-86a0-83c781eb023e","resolution":{"observed_at":"2026-08-15T22:28:27.229072Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T22:28:27.232304Z","title":"Equivalence between rls algorithms and the ridge regression technique","venue":null,"work_id":null,"year":1996},"citing_paper":{"arxiv_id":"2505.07267","last_updated":"2025-05-12T06:40:29Z","snapshot_observed_at":"2026-08-19T18:18:23.117951Z","submitted_at":"2025-05-12T06:40:29Z","title":"Adaptive, Robust and Scalable Bayesian Filtering for Online Learning","version":1},"reference_index":87,"source":"arxiv_source","source_observed_at":"2026-08-15T22:28:27.232304Z"},"links":{"citing_paper":"/paper/2505.07267"},"observation_digest":"sha256:f0f486fa5ff6d7787551c14532404eaa30785263866602f6ac8637188d75b843","observation_id":"3ceb2fcf-bef0-44a6-b0db-ed7f93f50057","resolution":{"observed_at":"2026-08-15T22:28:27.232304Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.19681","last_updated":"2024-10-31T07:25:58Z","snapshot_observed_at":"2026-08-19T19:10:38.824424Z","submitted_at":"2024-05-30T04:27:36Z","title":"Bayesian Online Natural Gradient (BONG)","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.19681","snapshot_observed_at":"2026-08-15T22:28:27.235754Z","title":"Bayesian online natural gradient ( BONG )","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.07267","last_updated":"2025-05-12T06:40:29Z","snapshot_observed_at":"2026-08-19T18:18:23.117951Z","submitted_at":"2025-05-12T06:40:29Z","title":"Adaptive, Robust and Scalable Bayesian Filtering for Online Learning","version":1},"reference_index":88,"source":"arxiv_source","source_observed_at":"2026-08-15T22:28:27.235754Z"},"links":{"cited_paper":"/paper/2405.19681","citing_paper":"/paper/2505.07267"},"observation_digest":"sha256:1bcb92aba914d835c5bf0b6ade15bc45aa6f16c94e595d2759a8839a5f1d656f","observation_id":"6a6ddf89-db49-4333-a5d1-e2173054f3b1","resolution":{"observed_at":"2026-08-15T22:28:27.235754Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T22:28:27.239462Z","title":null,"venue":null,"work_id":null,"year":1960},"citing_paper":{"arxiv_id":"2505.07267","last_updated":"2025-05-12T06:40:29Z","snapshot_observed_at":"2026-08-19T18:18:23.117951Z","submitted_at":"2025-05-12T06:40:29Z","title":"Adaptive, Robust and Scalable Bayesian Filtering for Online Learning","version":1},"reference_index":89,"source":"arxiv_source","source_observed_at":"2026-08-15T22:28:27.239462Z"},"links":{"citing_paper":"/paper/2505.07267"},"observation_digest":"sha256:79971a4bab7fb0aeeb764929f3d6be526ee864acbb004a03d5df5446bd603645","observation_id":"26ee929c-9d33-4458-bea7-9d9cd9cfeffa","resolution":{"observed_at":"2026-08-15T22:28:27.239462Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T22:28:27.242848Z","title":"Reducing geometric dilution of precision using ridge regression","venue":null,"work_id":null,"year":1990},"citing_paper":{"arxiv_id":"2505.07267","last_updated":"2025-05-12T06:40:29Z","snapshot_observed_at":"2026-08-19T18:18:23.117951Z","submitted_at":"2025-05-12T06:40:29Z","title":"Adaptive, Robust and Scalable Bayesian Filtering for Online Learning","version":1},"reference_index":90,"source":"arxiv_source","source_observed_at":"2026-08-15T22:28:27.242848Z"},"links":{"citing_paper":"/paper/2505.07267"},"observation_digest":"sha256:b58d716f995e31cbaf5f06f37f0d791b417a73a2be424c04de6f4e972ef5897e","observation_id":"8a573346-bdec-4179-b50c-35417a1a7de2","resolution":{"observed_at":"2026-08-15T22:28:27.242848Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T22:28:27.246161Z","title":"Kingma and Jimmy Ba","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2505.07267","last_updated":"2025-05-12T06:40:29Z","snapshot_observed_at":"2026-08-19T18:18:23.117951Z","submitted_at":"2025-05-12T06:40:29Z","title":"Adaptive, Robust and Scalable Bayesian Filtering for Online Learning","version":1},"reference_index":91,"source":"arxiv_source","source_observed_at":"2026-08-15T22:28:27.246161Z"},"links":{"citing_paper":"/paper/2505.07267"},"observation_digest":"sha256:9a74f03c7ee0d682b470826d68f09dcec6f459eb88ffb2124249ed060f6eab5a","observation_id":"c3c0f3ff-5c96-4a5e-883c-c9c36e5ce9d5","resolution":{"observed_at":"2026-08-15T22:28:27.246161Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T22:28:27.285924Z","title":"Spatio-temporal bayesian on-line changepoint detection with model selection","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2505.07267","last_updated":"2025-05-12T06:40:29Z","snapshot_observed_at":"2026-08-19T18:18:23.117951Z","submitted_at":"2025-05-12T06:40:29Z","title":"Adaptive, Robust and Scalable Bayesian Filtering for Online Learning","version":1},"reference_index":92,"source":"arxiv_source","source_observed_at":"2026-08-15T22:28:27.285924Z"},"links":{"citing_paper":"/paper/2505.07267"},"observation_digest":"sha256:8066668d14b093c50e0920efba84b41763201e5272d32f21f6adc25ddf4de682","observation_id":"c95f7829-34fd-4392-9b61-0251b11d9c9f","resolution":{"observed_at":"2026-08-15T22:28:27.285924Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T22:28:27.428754Z","title":"Doubly robust bayesian inference for non-stationary streaming data with -divergences","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2505.07267","last_updated":"2025-05-12T06:40:29Z","snapshot_observed_at":"2026-08-19T18:18:23.117951Z","submitted_at":"2025-05-12T06:40:29Z","title":"Adaptive, Robust and Scalable Bayesian Filtering for Online Learning","version":1},"reference_index":93,"source":"arxiv_source","source_observed_at":"2026-08-15T22:28:27.428754Z"},"links":{"citing_paper":"/paper/2505.07267"},"observation_digest":"sha256:b3b8a723e74d5397bd7372e8ec86d73ec4a6a4a9fb10204df9bd96fc83144ae9","observation_id":"4e913727-6802-4336-ba10-462c7e1b9751","resolution":{"observed_at":"2026-08-15T22:28:27.428754Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T22:28:27.529764Z","title":"An optimization-centric view on bayes' rule: Reviewing and generalizing variational inference","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.07267","last_updated":"2025-05-12T06:40:29Z","snapshot_observed_at":"2026-08-19T18:18:23.117951Z","submitted_at":"2025-05-12T06:40:29Z","title":"Adaptive, Robust and Scalable Bayesian Filtering for Online Learning","version":1},"reference_index":94,"source":"arxiv_source","source_observed_at":"2026-08-15T22:28:27.529764Z"},"links":{"citing_paper":"/paper/2505.07267"},"observation_digest":"sha256:bbf4398acdab043c27af179f2b7240d9819f1a7041215cc6703247c4100b49f7","observation_id":"cac0006a-97b0-4cbc-9efe-b0ab903e2bab","resolution":{"observed_at":"2026-08-15T22:28:27.529764Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T22:28:27.611057Z","title":"Ridge regression signal processing","venue":null,"work_id":null,"year":1989},"citing_paper":{"arxiv_id":"2505.07267","last_updated":"2025-05-12T06:40:29Z","snapshot_observed_at":"2026-08-19T18:18:23.117951Z","submitted_at":"2025-05-12T06:40:29Z","title":"Adaptive, Robust and Scalable Bayesian Filtering for Online Learning","version":1},"reference_index":95,"source":"arxiv_source","source_observed_at":"2026-08-15T22:28:27.611057Z"},"links":{"citing_paper":"/paper/2505.07267"},"observation_digest":"sha256:df90950c05d9956d815f2ee6df2a067b41ae7a99fc9362f2c1fd5007ba785ce1","observation_id":"c7d17e72-f105-4406-9a96-986079777e9f","resolution":{"observed_at":"2026-08-15T22:28:27.611057Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T22:28:27.614605Z","title":"On information and sufficiency","venue":null,"work_id":null,"year":1951},"citing_paper":{"arxiv_id":"2505.07267","last_updated":"2025-05-12T06:40:29Z","snapshot_observed_at":"2026-08-19T18:18:23.117951Z","submitted_at":"2025-05-12T06:40:29Z","title":"Adaptive, Robust and Scalable Bayesian Filtering for Online Learning","version":1},"reference_index":96,"source":"arxiv_source","source_observed_at":"2026-08-15T22:28:27.614605Z"},"links":{"citing_paper":"/paper/2505.07267"},"observation_digest":"sha256:0e1cdccc29971ee3ef644273760efdb9dc6953da69087083d4a2893246cb7a5d","observation_id":"44c69253-c615-40c7-9ad0-95f6e093633c","resolution":{"observed_at":"2026-08-15T22:28:27.614605Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T22:28:27.617617Z","title":"Continual learning with bayesian neural networks for non-stationary data","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2505.07267","last_updated":"2025-05-12T06:40:29Z","snapshot_observed_at":"2026-08-19T18:18:23.117951Z","submitted_at":"2025-05-12T06:40:29Z","title":"Adaptive, Robust and Scalable Bayesian Filtering for Online Learning","version":1},"reference_index":97,"source":"arxiv_source","source_observed_at":"2026-08-15T22:28:27.617617Z"},"links":{"citing_paper":"/paper/2505.07267"},"observation_digest":"sha256:e1966eba6e8caaa8452f076999bdadddbbc7a188225c6ebaf7629a37450bfe0f","observation_id":"f9dfc766-0724-444f-b4d9-7760a2e310cf","resolution":{"observed_at":"2026-08-15T22:28:27.617617Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T22:28:27.620606Z","title":"The recursive variational gaussian approximation (r-vga)","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.07267","last_updated":"2025-05-12T06:40:29Z","snapshot_observed_at":"2026-08-19T18:18:23.117951Z","submitted_at":"2025-05-12T06:40:29Z","title":"Adaptive, Robust and Scalable Bayesian Filtering for Online Learning","version":1},"reference_index":98,"source":"arxiv_source","source_observed_at":"2026-08-15T22:28:27.620606Z"},"links":{"citing_paper":"/paper/2505.07267"},"observation_digest":"sha256:da63d2867af2389eecdb37b32ebe036aaef0abb5e7ab0d4a639ea18e54303ebe","observation_id":"6f4fb8ef-3e14-4875-82e8-6a72b5f995a4","resolution":{"observed_at":"2026-08-15T22:28:27.620606Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T22:28:27.623726Z","title":"The limited-memory recursive variational gaussian approximation (l-rvga)","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2505.07267","last_updated":"2025-05-12T06:40:29Z","snapshot_observed_at":"2026-08-19T18:18:23.117951Z","submitted_at":"2025-05-12T06:40:29Z","title":"Adaptive, Robust and Scalable Bayesian Filtering for Online Learning","version":1},"reference_index":99,"source":"arxiv_source","source_observed_at":"2026-08-15T22:28:27.623726Z"},"links":{"citing_paper":"/paper/2505.07267"},"observation_digest":"sha256:2ed46a7e44bcbc853172ccb4b9b5c55896b4f8cd2577fa2952fa49b5230611dd","observation_id":"598c1429-8ddb-4d69-9c5b-8c8c0a62753d","resolution":{"observed_at":"2026-08-15T22:28:27.623726Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-15T22:28:27.626716Z","title":"Larsen, Stanislav Fort, Nic Becker, and Surya Ganguli","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.07267","last_updated":"2025-05-12T06:40:29Z","snapshot_observed_at":"2026-08-19T18:18:23.117951Z","submitted_at":"2025-05-12T06:40:29Z","title":"Adaptive, Robust and Scalable Bayesian Filtering for Online Learning","version":1},"reference_index":100,"source":"arxiv_source","source_observed_at":"2026-08-15T22:28:27.626716Z"},"links":{"citing_paper":"/paper/2505.07267"},"observation_digest":"sha256:201732bc0e66578f18464a301705cc5145a010d13eadccf149a7e3b7dc76c885","observation_id":"674fd6f2-b8d3-4dcb-aeb6-5a5ee9f13b12","resolution":{"observed_at":"2026-08-15T22:28:27.626716Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2505.07267","last_updated":"2025-05-12T06:40:29Z","latest_version":1,"primary_category":"stat.ML","snapshot_observed_at":"2026-08-19T18:18:23.117951Z","submitted_at":"2025-05-12T06:40:29Z","title":"Adaptive, Robust and Scalable Bayesian Filtering for Online Learning"},"reference_resolution":{"displayed":100,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":97,"verified_exact":3,"verified_fuzzy":0},"total_outbound_references":164},"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-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"thesis":"As of 21 August 2026, this Paper Citation Record lists 100 of 164 outbound references and 0 inbound Pith citation observations for arXiv:2505.07267."}