{"as_of":"2026-08-17T01:40:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d9b7e9fd5f7f0b1c1e1700b8d42087c0b9a5c14d7bc76d111db7ae3022406b3c","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-16T06:30:59.297886+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-15T22:18:47.453234Z","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:ff8737c45027d818f6f44c99362095411dc8806b0467b154d7af877d80e61dc5","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-15T22:18:47.453234Z","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:bea2f8543f8720385a8d36743e76d7da4e01c0b2049fc5bed93a249811cf4b9c","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-15T22:18:47.453234Z","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:e968eba452163bbf007e1ad2e8dbc3f3d590e343d45efc877337cdc97350c403","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-15T22:18:47.453234Z","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:df9432a4e13dedbd67a7e88738602f1b0bf31f3697abf37205c96e62e075f34e","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-15T22:18:47.453234Z","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:393a06fffe555743acaef9919c13173b5cfc891e3e316179d44d4ed2860906c5","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-15T22:18:47.453234Z","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:8093e4bc4553f64a0839635dc6d84b452f826bca4aedad8aef140e26c899601d","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-15T22:18:47.453234Z","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:ade85a27f14ea3ded83eee1f42b7c7cd54404c7c4ad0fb8a9701697d126c67c6","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-15T22:18:47.453234Z","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:8642bf60d90dc153f9dc45860dfee140f84e27fb3db419204bb33f3f978536d2","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-15T22:18:47.453234Z","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:f1704144108c1c60b63583363d1a320eb82edb37935013c923e2f5649adeab9e","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-15T22:18:47.453234Z","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:e6d051c3d73bb8cafd4edd04719c10bdd4ec53576816da09ce81978c15e99a9a","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-15T22:18:47.453234Z","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:a5e4bc515c096a8742c727d309a0c6b8bf1feb4d9b80c26653648e26b8fc22b6","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-15T22:18:47.453234Z","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:f89fecf22f60c7af34043cdd8b87cc9746860ddc2eecf5668613749a1bfe4ff4","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T22:18:47.453234Z","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:4c8d96f87d8eaa3931e5f3b9befa8199116939cf62de21681e28e9df9b1e5018","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-15T22:18:47.453234Z","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:d1881a8865aaf0abb1dfec21f3dd36548d2b99733af0c389b1c6ff033f8b99e2","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-15T22:18:47.453234Z","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:a36af33f61e2b363405e2c33d4248d4cd3daae5fc6c981d1810f7e5f06544c03","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-15T22:18:47.453234Z","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:61d3aac2238020a5732db02a1d4e7ad9358b7cf37541449b3d960f9a8428f778","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-15T22:18:47.453234Z","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:99c665f849c97ff42a7f5b1c4e78134d0751b993bf85c7ff582038e9c04678b6","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-15T22:18:47.453234Z","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:dfc49a1d9386228ab0a7fbe318ba8410ee8c8eba2ce002d52f459e384956bafd","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-15T22:18:47.453234Z","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:d9aa6d06a3c645d2b294f2cd0600982655aa8f733615b226822d15b8d46cbdf7","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-15T22:18:47.453234Z","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:3c5890b925771b309422736afce8faaa0e4cc8f78dd3da8e04cff403e23efd8e","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-15T22:18:47.453234Z","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:0988fc91018f376c3a4b66abe3f879eb946a37c83a288d3ebd5aa9f1e9d4d2a2","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-15T22:18:47.453234Z","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:a08c551f0617674caff440808e9d8b628ba15c2e9f1f46d88bdc150c9ebab52c","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-15T22:18:47.453234Z","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:b312887369cfa0117b397333fcf398745aaccc2f5631557ecf53dfb00743f7dd","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-16T14:42:22.262804Z","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-15T22:18:47.453234Z","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:aaf844e2463c123f4b5e9d8e0ca844a278e5a973eafdf9fe1babbe78fc4a8656","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T22:18:47.453234Z","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:39f57057635fdfe51a4f0107d56a4f59fd871efa74e66ea7f989a6c0638b2754","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-15T22:18:47.453234Z","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:8f5a5ad7a1a72533198b85bbd2ca6687420a18d00cf73aaef1839d4f4c405ef0","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-15T22:18:47.453234Z","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:e53368bdc979c7573258b8d3cc2b1e91e52fb4a785b9a9905619e7fd5b0f41c9","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-15T22:18:47.453234Z","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:4acb58dc8941778eaf331199a641ab74ca85be64608dd2c09e07182df3f59f2b","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-15T22:18:47.453234Z","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:63837643bbefdd6ec97ed31e76f1e60e517979da46643b74682e04b3d6660fe6","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-15T22:18:47.453234Z","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:e149e5bc0e89b05fa33b7aebf9b1c882646586bc8e5b90935993ca7496c67d40","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-15T22:18:47.453234Z","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:efbc3a43dd32143dcced5fa7c6e6fec2951b4bfa76f61d2e21ed3120cea9a431","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-15T22:18:47.453234Z","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:24f8f0f2caa729fdfa55aee37216cb7b4586e883064b6ef63dc1140d684cd341","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-15T22:18:47.453234Z","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:a11a2b8fe8667be3e2dd8714c40edae1f10489c8a77d5c7cc537b42cca2a13ff","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-15T22:18:47.453234Z","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:a52dea83d0fba3137fd4240e4810d6e9d95c05c69c08a28d5a9d474c233381df","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-15T22:18:47.453234Z","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:12ba502aa856e722833ea070fae741df29f38a50fa8cdbd7ed80d83670938d1e","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-15T22:18:47.453234Z","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:ce582f73a757446fa255b06e405aea68f9d41460cac8e30ff0aa5b5261f06ad2","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-15T22:18:47.453234Z","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:c379cb8b42c32609ab9857317280704b7eeaed9175dfaa24299d5685bd86768d","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-15T22:18:47.453234Z","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:f1483bc36a690b592dfe38f169b68ade1cf220ba9ba143880be8350a4d6017fa","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-15T22:18:47.453234Z","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:75fd7ec264983655ec126ad05b1c69223c8763f38a9a968e7cbf0507e2efb0c5","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-15T22:18:47.453234Z","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:5972c282eb1cf4344a5f5ddd6ab2461ae922e4faf65d66d961938847652f757c","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-15T22:18:47.453234Z","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:d385b8e4f68232efc695188b6a801a5050a31ad010d736d387d436daefa17ec5","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-15T22:18:47.453234Z","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:c5547563975a1194a5406f2d87aae748d1d6ce9e4074481179b68f4b61ba1830","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-15T22:18:47.453234Z","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:822316d8426672d5061debbc0540af812811f93a6fbf736bd47c85666c757cc9","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-15T22:18:47.453234Z","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:ca29bda3a91885545ac4115687aca62fca283deffe4222286b07e6381bf5ea0b","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-15T22:18:47.453234Z","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:9c1678468517e518462f71ba4f4c3b40d4a6136688f3fe4fcdb37d7dc5990d2f","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-15T22:18:47.453234Z","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:9166ed61c814ab11bcc68b49db34d66af1932196ef2c9ffad7a46755b7d745f9","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-15T22:18:47.453234Z","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:de01b061cf26d1962dfb4c1f936d5d1bab2d0e17dfb0f537b7a6ee3bcedc0c4b","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-15T22:18:47.453234Z","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:aa7f539220c65c6c15b233cabcefce4469462cea3707b83296cc68abd0f62283","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-15T22:18:47.453234Z","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:5620343a97869ac3cb6bd5213f5749d15eaa039927136ecef3e5bc68729075ee","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-15T22:18:47.453234Z","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:26feb83c3ed3530278bdd0068efe6bc6c155423c74cde2c7be8ceba9f66e62f3","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-16T15:47:10.022222Z","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-15T22:18:47.453234Z","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:eda612f8702a6739e955eb237e534ff16dfd87be67feb1838fc5a11f8db4ea07","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-15T22:18:47.453234Z","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:6079c446b3d0429c537b751bee905c3df7bca63c013e051aaebbe653df9a7f67","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-15T22:18:47.453234Z","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:b45fa5ac34b855dd9f120bdcbefdea081b1705dabfa24ac48ad713d2dbff2747","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-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+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-15T22:18:47.453234Z","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:a43e103e8718b01aaca6b853014f81ec6bdc391459921e69dc5ca226dbc1fc85","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-15T22:18:47.453234Z","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:eb2fbbb2e4e6784cd55ea0446f7a498a2c1a6a90f47787a7fb2cdeffceae9a2c","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-15T22:18:47.453234Z","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:d927043e5a74990b77824e60449572e617b997f3af296aa4c8ab5b69bc59b4ec","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-15T22:18:47.453234Z","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:bc0d7cacb7bf124b54a114deb8336cbd87158b412f1bd47913ec1b580bd2de19","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-15T22:18:47.453234Z","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:f223f7e14f718b1a96239780745f4375937c1de2bf4dfdab8d99947c573369ec","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-15T22:18:47.453234Z","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:99fe7d1fdcb66aeb706592256fe3705a8d3b6a81dc52598e95bbf3e841d3dc8b","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-15T22:18:47.453234Z","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:3b658f8a44864684756b4a2580089493e203856c5522f80dcb5c56025290e99c","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-15T22:18:47.453234Z","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:16f75a4d49a0ac9969cad54c3ba700304ddc8c0109b8f8b8f5cce3d6a4c5a239","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-15T22:18:47.453234Z","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:02d2aeb2f4f9392b7ec49967e1c348c697df357dec9bbf1c60ef63592c25ce71","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-15T22:18:47.453234Z","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:577b8ca621cce63e13a53f34485e3c7baf88e60b64b60ac3b12df578bb699bef","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-15T22:18:47.453234Z","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:6c10f28312918dafa01dc5e7650a1317a4e87ba896be71ce0e7a8adc23d13e4e","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-15T22:18:47.453234Z","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:3d7dcc708f75d47422120c7e6b1c0edd6c7246ebf3472c0b770b52365c2c0fa5","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-15T22:18:47.453234Z","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:1b310e46161858820b759616c3d2df33b2802253557169b31f6e700b14c9aa3c","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-15T22:18:47.453234Z","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:19823c74cf86746392deb616100caaa5c2f0fd7ef9de163cda15f263d9326225","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-15T22:18:47.453234Z","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:d9b8edc2a66842dfb63955255a475577878db6b557375a8caa04a785498f63ee","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-15T22:18:47.453234Z","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:ef0bf50b80941bedf820da1137de4add4e6e87084f53532cb11a00d6231cabce","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-15T22:18:47.453234Z","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:14d29090112979bcbe9efeaa39ae4b0ca4fb925c83ac428a2c30134224057546","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-15T22:18:47.453234Z","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:baa71ad74f88d96a96cd5d2706a0fce35676c168611322f1fbdb1b76666a86bb","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-15T22:18:47.453234Z","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:13eee04dce50d96582f1937e7e87bdb3f0660825b79bb7d7f0cb4b0a5b3ea9ef","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-15T22:18:47.453234Z","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:6cf237cfaafb9d924aef531e1732d4921f3a0e7f0889f3f1ef6baa35ee533542","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-15T22:18:47.453234Z","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:55d772e404832d0b991965a7f13d6e9bb80daef280e49a36d6d5a2c4f37edde6","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-15T22:18:47.453234Z","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:d12d7581400c40d29a152c043966e27707721129f889bb6bd173794e454698bd","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-15T22:18:47.453234Z","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:7ae0fca69d2a3134c6cd9108ed729c69e1f2d8fda5531ec42814c8d0a02e8d75","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-15T22:18:47.453234Z","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:fae992497c001b87fa0ec72787a58d600a9639c5d45f9c0c0d74a694d5330a28","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-16T14:00:00.717958Z","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-15T22:18:47.453234Z","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:fce8453e33a6f6b636c4da75ca8332e65c8e4ebfe600bede22cb8d2d55c534dd","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-15T22:18:47.453234Z","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:52743ba547710d381d0b85179f709d2ec5ab3f780274c4a43075144219f98e79","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-15T22:18:47.453234Z","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:b7aa3bbe42dd6d09881f0e2af3c2efe564aa6c453de3ae3730d48cdb1a19061d","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-15T22:18:47.453234Z","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:e41fa2527d1720cd2fabdb6c7da4bc63ea1a1a14f1dd829acb57600736f3da93","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-11T08:20:29.798517Z","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-15T22:18:47.453234Z","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:cae1940f70cfc683c168b78cdb740e405f2ba7e90147726f88f4024d6adaac32","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-15T22:18:47.453234Z","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:b440c75ad713738472bb21bac782c6641a6ef5b2447b32b9bad0f0c39d9d137f","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-15T22:18:47.453234Z","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:8a6a1b24a12d285044730da163c316841159a98b350b95a9586148fd7ec89815","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-15T22:18:47.453234Z","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:776310f8e291e88a22b5f8dc1036b0318ea23eb7b6fdaebac9b7b52050a55fcf","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-15T22:18:47.453234Z","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:8db99f114b48d7786ef12a4e0ae48d9ba8193ba717e31bdc772924792a21ceff","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-15T22:18:47.453234Z","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:ce097f0da9dc29ecf0cd5148297754d9a377130319a7a73baf0845c154923a9a","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-16T13:47:55.772994Z","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-15T22:18:47.453234Z","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:cc6633ca493347c30ef60eebcd7ce776aa7f98ed0210356d56ed34e8f85f701e","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-15T22:18:47.453234Z","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:ae161b88a18e43849e38d9be6b998c3bfee7702124972d1865830e1fbef3757a","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-15T22:18:47.453234Z","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:3dd87bbb45b7aaeb8e810e2fd176ea14e9f060c1141a2c87857b2e0d901a2fdd","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-15T22:18:47.453234Z","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:bc175c516c909ca5c9b38b7a108324a6fbc10f3da60e1e83da0aecc102361965","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-15T22:18:47.453234Z","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:ff8b618d1d29ad95d304f54a6420e5527bd1b647be68a227bf0d8d99003c4296","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-15T22:18:47.453234Z","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:0a27ff531c67cc8b5553e62da8f362b6abe68382db6bc51756db59d8db14e215","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-15T22:18:47.453234Z","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:2f608339aecc64a9cf5cae1a0320df29db3659bc0280301719885842da312a99","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-15T22:18:47.453234Z","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:3149155e89b0139f9d8757cc0d819eb8e190a564193291fe900396a7fb5dc7a5","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-15T22:18:47.453234Z","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:993c292a13cdaf93373218dcae2f6f841797df5ed0d80bc2a81d9d7dff4b4e5c","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-15T22:18:47.453234Z","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:b4d11c109751374401a392fa4010464f28e2d0047524b81e7cd82309dd137a93","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-15T22:18:47.453234Z","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:57b7d5d75b80aeeb0c65342083a277c7594268229b1408cfa7249b2b3840089a","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-15T22:18:47.453234Z","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:22dccd3460a3bf4a30bad3d39b1a3610a2901cae1c6b01627ec927cae26a95b6","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-15T22:18:47.453234Z","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:4ab84e52f6edafa9507154397ac03e696afe467373756d15e400864a7084db6f","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-15T22:18:47.453234Z","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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 17 August 2026, this Paper Citation Record lists 100 of 164 outbound references and 0 inbound Pith citation observations for arXiv:2505.07267."}