{"as_of":"2026-08-10T08:47:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:46781e8bee9e032a0ef291583828d415b2a2ebde80325b7ebfc66b3701b44fb5","coverage":[{"denominator":28,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":28,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-06T21:28:52.743398Z","state":"measured"},{"denominator":28,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":28,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+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/2507.00272/citation-record","integrity":"/paper/2507.00272/integrity","json":"/paper/2507.00272/citation-record.json","paper":"/paper/2507.00272"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:28:58.858952Z","title":"A new approach to linear filtering and prediction problems","venue":null,"work_id":"5440f054-1775-4917-9968-1758576efdbe","year":1960},"citing_paper":{"arxiv_id":"2507.00272","last_updated":"2025-06-30T21:30:58Z","snapshot_observed_at":"2026-08-09T08:24:30.180954Z","submitted_at":"2025-06-30T21:30:58Z","title":"Iteratively Saturated Kalman Filtering","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-06T21:28:49.037743Z"},"links":{"citing_paper":"/paper/2507.00272"},"observation_digest":"sha256:0dc4351fc18c603f94d364039d2dca18310f6006bd2fb6cfd5df032e297d3a32","observation_id":"476de3ff-9fb8-4cef-9794-ec00adb8b178","resolution":{"observed_at":"2026-08-06T21:28:58.998319Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:28:58.641187Z","title":"Efficient decoding with steady-state Kalman filter in neural interface systems","venue":null,"work_id":"fc88b665-99b9-48c4-86d1-a0c1a4343f77","year":2010},"citing_paper":{"arxiv_id":"2507.00272","last_updated":"2025-06-30T21:30:58Z","snapshot_observed_at":"2026-08-09T08:24:30.180954Z","submitted_at":"2025-06-30T21:30:58Z","title":"Iteratively Saturated Kalman Filtering","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-06T21:28:49.142258Z"},"links":{"citing_paper":"/paper/2507.00272"},"observation_digest":"sha256:972240ae202c60bedbec921ef9af3ba0843a45a1af7379d87da6bac52bc6b135","observation_id":"7dd342cf-7b48-45dd-9a5d-888267b71da7","resolution":{"observed_at":"2026-08-06T21:28:58.744855Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:28:58.376051Z","title":"Shocks and frictions in US business cycles: A Bayesian DSGE approach","venue":null,"work_id":"e6c56cc9-0ec7-4049-8204-f8205dc952ae","year":2007},"citing_paper":{"arxiv_id":"2507.00272","last_updated":"2025-06-30T21:30:58Z","snapshot_observed_at":"2026-08-09T08:24:30.180954Z","submitted_at":"2025-06-30T21:30:58Z","title":"Iteratively Saturated Kalman Filtering","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-06T21:28:49.291308Z"},"links":{"citing_paper":"/paper/2507.00272"},"observation_digest":"sha256:da7625a9913cfbc220b931ee72eeb31a8a3dacf6ce673aebd887ddcd41824537","observation_id":"1d021101-1034-4379-bc6a-47386cfaa513","resolution":{"observed_at":"2026-08-06T21:28:58.504540Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:28:58.103968Z","title":"Huber,An augmented steady-state Kalman filter to evaluate the likelihood of linear and time: Invariant state-space models, tech","venue":null,"work_id":"76a422df-44e5-487e-a185-37c5ac29fc3a","year":2022},"citing_paper":{"arxiv_id":"2507.00272","last_updated":"2025-06-30T21:30:58Z","snapshot_observed_at":"2026-08-09T08:24:30.180954Z","submitted_at":"2025-06-30T21:30:58Z","title":"Iteratively Saturated Kalman Filtering","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-06T21:28:49.416927Z"},"links":{"citing_paper":"/paper/2507.00272"},"observation_digest":"sha256:2fff92639ffa801313548476d4f635470c7e05db4b2f53589d94b7071ad6bdee","observation_id":"7c02f50f-fe1b-48b2-8975-58bfbcd383cf","resolution":{"observed_at":"2026-08-06T21:28:58.231879Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:28:57.889285Z","title":"Robust Bayesian estimation for the linear model and robustifying the Kalman filter","venue":null,"work_id":"4f2701dc-a757-419f-9ffc-80276db099bd","year":1977},"citing_paper":{"arxiv_id":"2507.00272","last_updated":"2025-06-30T21:30:58Z","snapshot_observed_at":"2026-08-09T08:24:30.180954Z","submitted_at":"2025-06-30T21:30:58Z","title":"Iteratively Saturated Kalman Filtering","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-06T21:28:49.557138Z"},"links":{"citing_paper":"/paper/2507.00272"},"observation_digest":"sha256:fc944c2cee95e2342a0409a57eda64247762fc6bd892f9301822579931991a94","observation_id":"6a586784-6079-47ee-9b65-2cd74e238f49","resolution":{"observed_at":"2026-08-06T21:28:57.994872Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"biblio/4252678","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:28:53.144043Z","title":"Davidon,Variable metric method for minimization, tech","venue":null,"work_id":"0c8108c1-e58a-4827-937b-46c8ecd386b7","year":1959},"citing_paper":{"arxiv_id":"2507.00272","last_updated":"2025-06-30T21:30:58Z","snapshot_observed_at":"2026-08-09T08:24:30.180954Z","submitted_at":"2025-06-30T21:30:58Z","title":"Iteratively Saturated Kalman Filtering","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-06T21:28:49.724261Z"},"links":{"citing_paper":"/paper/2507.00272"},"observation_digest":"sha256:51e742b31b15e1bec803581cc6c44030eae1def31ca1bc795a274ff0d9f25056","observation_id":"2cbe8dbc-8c80-49e1-b3b0-2fcd3edb1ddb","resolution":{"observed_at":"2026-08-06T21:28:53.247674Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T21:28:49.846770Z","title":"A Rapidly Convergent Descent Method for Minimization","venue":null,"work_id":null,"year":1963},"citing_paper":{"arxiv_id":"2507.00272","last_updated":"2025-06-30T21:30:58Z","snapshot_observed_at":"2026-08-09T08:24:30.180954Z","submitted_at":"2025-06-30T21:30:58Z","title":"Iteratively Saturated Kalman Filtering","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-06T21:28:49.846770Z"},"links":{"citing_paper":"/paper/2507.00272"},"observation_digest":"sha256:4315a709de0e8e8aa20c1dd1806ea255d5cfbb8dd79eecf9eae201a2caf25cd1","observation_id":"2fe082e1-c75d-470a-9b98-36a32a506520","resolution":{"observed_at":"2026-08-06T21:28:49.846770Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:28:57.674453Z","title":"Robust estimation with unknown noise statistics","venue":null,"work_id":"2fc0dd4f-7273-456e-9818-823a16ed8138","year":1999},"citing_paper":{"arxiv_id":"2507.00272","last_updated":"2025-06-30T21:30:58Z","snapshot_observed_at":"2026-08-09T08:24:30.180954Z","submitted_at":"2025-06-30T21:30:58Z","title":"Iteratively Saturated Kalman Filtering","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-06T21:28:50.011422Z"},"links":{"citing_paper":"/paper/2507.00272"},"observation_digest":"sha256:9d94f693cc1eae231d2e404e8010a08fce322a621b7affe1db86164bbaac62e2","observation_id":"4de9f4d5-7aea-46d2-8e90-05a61444a8da","resolution":{"observed_at":"2026-08-06T21:28:57.780386Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:28:57.496511Z","title":"Robust Kalman filtering based on Mahalanobis distance as outlier judging criterion","venue":null,"work_id":"556276d3-09e8-4bc0-b6d1-b92a324d7dcd","year":2014},"citing_paper":{"arxiv_id":"2507.00272","last_updated":"2025-06-30T21:30:58Z","snapshot_observed_at":"2026-08-09T08:24:30.180954Z","submitted_at":"2025-06-30T21:30:58Z","title":"Iteratively Saturated Kalman Filtering","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-06T21:28:50.129696Z"},"links":{"citing_paper":"/paper/2507.00272"},"observation_digest":"sha256:cd0ebc7f93a8d3ddb3c0aee42d82e0c7088d85d7ef188745a32d68308bd429e9","observation_id":"0b6b8e9d-171f-4d42-8a46-dd567925a9a9","resolution":{"observed_at":"2026-08-06T21:28:57.569316Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2405.05646","last_updated":"2024-05-28T07:03:49Z","snapshot_observed_at":"2026-07-06T18:12:01.364458Z","submitted_at":"2024-05-09T09:40:56Z","title":"Outlier-robust Kalman Filtering through Generalised Bayes","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.05646","snapshot_observed_at":"2026-08-06T21:28:50.237241Z","title":"Outlier-robust Kalman Filtering through Generalised Bayes","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.00272","last_updated":"2025-06-30T21:30:58Z","snapshot_observed_at":"2026-08-09T08:24:30.180954Z","submitted_at":"2025-06-30T21:30:58Z","title":"Iteratively Saturated Kalman Filtering","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-06T21:28:50.237241Z"},"links":{"cited_paper":"/paper/2405.05646","citing_paper":"/paper/2507.00272"},"observation_digest":"sha256:f3ebfc1344bf40b658a3cd0374038ba8e7217c0dfd5e75c3a45cfcce47ea11e7","observation_id":"18b14a92-f474-44bc-b321-bcbe57a4bf17","resolution":{"observed_at":"2026-08-06T21:28:50.237241Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:28:57.264281Z","title":"A Kalman filter for robust outlier detection","venue":null,"work_id":"97677fc4-3c57-48b4-a456-041de3c955dc","year":2007},"citing_paper":{"arxiv_id":"2507.00272","last_updated":"2025-06-30T21:30:58Z","snapshot_observed_at":"2026-08-09T08:24:30.180954Z","submitted_at":"2025-06-30T21:30:58Z","title":"Iteratively Saturated Kalman Filtering","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-06T21:28:50.406586Z"},"links":{"citing_paper":"/paper/2507.00272"},"observation_digest":"sha256:8bb115690fec0fa8c36d3792a298440f965d19873502d76256474a22a00e104f","observation_id":"dd7ab3dc-3470-4754-a3b8-dfbe9dfa1067","resolution":{"observed_at":"2026-08-06T21:28:57.398001Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:28:57.047398Z","title":"An outlier-robust Kalman filter","venue":null,"work_id":"35cdc084-f33c-40e9-9e7e-f0f1c9f2eaf1","year":2011},"citing_paper":{"arxiv_id":"2507.00272","last_updated":"2025-06-30T21:30:58Z","snapshot_observed_at":"2026-08-09T08:24:30.180954Z","submitted_at":"2025-06-30T21:30:58Z","title":"Iteratively Saturated Kalman Filtering","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-06T21:28:50.522047Z"},"links":{"citing_paper":"/paper/2507.00272"},"observation_digest":"sha256:c0024b128f68b23007842012a8fb9a6a127bb7dd04ab3818fbe37c12c369eef2","observation_id":"1189e915-f268-4289-b4bc-e293cebbfec7","resolution":{"observed_at":"2026-08-06T21:28:57.122062Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-06T21:28:50.637264Z","title":"Robust Estimation of a Location Parameter","venue":null,"work_id":null,"year":1964},"citing_paper":{"arxiv_id":"2507.00272","last_updated":"2025-06-30T21:30:58Z","snapshot_observed_at":"2026-08-09T08:24:30.180954Z","submitted_at":"2025-06-30T21:30:58Z","title":"Iteratively Saturated Kalman Filtering","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-06T21:28:50.637264Z"},"links":{"citing_paper":"/paper/2507.00272"},"observation_digest":"sha256:a59e3e12afe87ef13fda396d8f40ed70fa9d3ab7b41c73c9edf5a713631acf73","observation_id":"a1226d0e-d36e-4f8a-ba91-9a99670ca18e","resolution":{"observed_at":"2026-08-06T21:28:50.637264Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:28:56.849207Z","title":"Robust Kalman filter and its application in time series analysis","venue":null,"work_id":"705547b0-345c-45b6-b585-5cdb47b47df9","year":1991},"citing_paper":{"arxiv_id":"2507.00272","last_updated":"2025-06-30T21:30:58Z","snapshot_observed_at":"2026-08-09T08:24:30.180954Z","submitted_at":"2025-06-30T21:30:58Z","title":"Iteratively Saturated Kalman Filtering","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-06T21:28:50.778282Z"},"links":{"citing_paper":"/paper/2507.00272"},"observation_digest":"sha256:7ee675072660873d483728a63813f6197f93dc3da47f88a42a97b1d7d8590865","observation_id":"0e5253b3-57ab-4b67-aceb-35c7c57f1189","resolution":{"observed_at":"2026-08-06T21:28:56.972847Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:28:56.568706Z","title":"On robust Kalman filtering","venue":null,"work_id":"fe043a5b-a848-4926-adde-4fc94859b40d","year":1992},"citing_paper":{"arxiv_id":"2507.00272","last_updated":"2025-06-30T21:30:58Z","snapshot_observed_at":"2026-08-09T08:24:30.180954Z","submitted_at":"2025-06-30T21:30:58Z","title":"Iteratively Saturated Kalman Filtering","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-06T21:28:50.954096Z"},"links":{"citing_paper":"/paper/2507.00272"},"observation_digest":"sha256:fe8956ca6bedf6b4a5704f3e1a439e37576fdca8f59fd4fa029436c20a940cdc","observation_id":"c096d396-2388-4f7c-b330-23a680029d0a","resolution":{"observed_at":"2026-08-06T21:28:56.695455Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:28:56.319345Z","title":"CVXGEN: A code generator for embedded convex optimization","venue":null,"work_id":"d4acb28b-d919-43d2-b14a-97814368b1e2","year":2012},"citing_paper":{"arxiv_id":"2507.00272","last_updated":"2025-06-30T21:30:58Z","snapshot_observed_at":"2026-08-09T08:24:30.180954Z","submitted_at":"2025-06-30T21:30:58Z","title":"Iteratively Saturated Kalman Filtering","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-06T21:28:51.081761Z"},"links":{"citing_paper":"/paper/2507.00272"},"observation_digest":"sha256:9b3e82967521b2bccc2ec51913ab6cd79a7fb39308d1db32661b33ffac772c1d","observation_id":"430478d7-43d2-42d4-8fb1-926da8954645","resolution":{"observed_at":"2026-08-06T21:28:56.401041Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:28:56.114230Z","title":"Random sample consensus (RANSAC)","venue":null,"work_id":"2c1c2a59-dfff-43ee-a678-a399956e7a71","year":1981},"citing_paper":{"arxiv_id":"2507.00272","last_updated":"2025-06-30T21:30:58Z","snapshot_observed_at":"2026-08-09T08:24:30.180954Z","submitted_at":"2025-06-30T21:30:58Z","title":"Iteratively Saturated Kalman Filtering","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-06T21:28:51.219716Z"},"links":{"citing_paper":"/paper/2507.00272"},"observation_digest":"sha256:69616d8e1ce8c9123e0cd7a9e8662a96405a569bef9376e736097dd5331f14d1","observation_id":"5ab517f6-3e32-4541-9dc4-cb76b3189a67","resolution":{"observed_at":"2026-08-06T21:28:56.203766Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:28:55.911471Z","title":"KALMANSAC: Robust filtering by consensus","venue":null,"work_id":"9b1cd83d-66ec-4ec2-85f4-affd50836923","year":2005},"citing_paper":{"arxiv_id":"2507.00272","last_updated":"2025-06-30T21:30:58Z","snapshot_observed_at":"2026-08-09T08:24:30.180954Z","submitted_at":"2025-06-30T21:30:58Z","title":"Iteratively Saturated Kalman Filtering","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-06T21:28:51.373996Z"},"links":{"citing_paper":"/paper/2507.00272"},"observation_digest":"sha256:648d47ee3b999508c203eac8eb57178e9fc61d31ef43fea1082ba476dcbf692b","observation_id":"0c9727fa-dce0-4d8f-9589-066c8573c390","resolution":{"observed_at":"2026-08-06T21:28:55.984837Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:28:55.688810Z","title":"Recursive outlier-robust filtering and smoothing for nonlinear systems using the multivariate Student-t distribution","venue":null,"work_id":"74a16572-f05a-431b-a4dd-f7a9d6c65cef","year":2012},"citing_paper":{"arxiv_id":"2507.00272","last_updated":"2025-06-30T21:30:58Z","snapshot_observed_at":"2026-08-09T08:24:30.180954Z","submitted_at":"2025-06-30T21:30:58Z","title":"Iteratively Saturated Kalman Filtering","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-06T21:28:51.476436Z"},"links":{"citing_paper":"/paper/2507.00272"},"observation_digest":"sha256:1e83ccb8624b8e6caa826331e2c77e7501344dbdec7a641188553f7a0ea26f8d","observation_id":"2edebd2a-d150-4e82-9ebb-0a446987f215","resolution":{"observed_at":"2026-08-06T21:28:55.807271Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:28:55.422995Z","title":"Nonlinear regression Huber–Kalman filtering and fixed-interval smoothing","venue":null,"work_id":"476f16cb-8b71-4780-a375-d448c17028ee","year":2015},"citing_paper":{"arxiv_id":"2507.00272","last_updated":"2025-06-30T21:30:58Z","snapshot_observed_at":"2026-08-09T08:24:30.180954Z","submitted_at":"2025-06-30T21:30:58Z","title":"Iteratively Saturated Kalman Filtering","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-06T21:28:51.598235Z"},"links":{"citing_paper":"/paper/2507.00272"},"observation_digest":"sha256:80ad311fe64ffb703e88787e3de2e83a4bfe10ea9fc642ec854dd761e5c33f87","observation_id":"97949974-218e-4217-bc8c-ade6b8fb96ba","resolution":{"observed_at":"2026-08-06T21:28:55.551671Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:28:55.130225Z","title":"Robustifying the Kalman filter against measurement outliers: An innovation saturation mechanism","venue":null,"work_id":"f7140959-acdc-4d8b-b568-55a9732442dc","year":2018},"citing_paper":{"arxiv_id":"2507.00272","last_updated":"2025-06-30T21:30:58Z","snapshot_observed_at":"2026-08-09T08:24:30.180954Z","submitted_at":"2025-06-30T21:30:58Z","title":"Iteratively Saturated Kalman Filtering","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-06T21:28:51.766646Z"},"links":{"citing_paper":"/paper/2507.00272"},"observation_digest":"sha256:bd804aae8fa1d604a40a404b0924f3f2c9e74c6e9713e15025fe8eca2cbadcea","observation_id":"74227318-ffa3-4bf6-bbb8-09a84bfd1bcb","resolution":{"observed_at":"2026-08-06T21:28:55.230807Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:28:54.844062Z","title":"Generalised Bayesian filtering via sequential Monte Carlo","venue":null,"work_id":"c3e1946f-3e07-4c60-b3da-c63b0e63f260","year":2020},"citing_paper":{"arxiv_id":"2507.00272","last_updated":"2025-06-30T21:30:58Z","snapshot_observed_at":"2026-08-09T08:24:30.180954Z","submitted_at":"2025-06-30T21:30:58Z","title":"Iteratively Saturated Kalman Filtering","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-06T21:28:51.911714Z"},"links":{"citing_paper":"/paper/2507.00272"},"observation_digest":"sha256:27c53480d5a4eac1d51f446d2bee7e892f877b7a1b5c7b063a7279ed24e74530","observation_id":"747dc199-e9d5-4b30-ad98-fba314b74775","resolution":{"observed_at":"2026-08-06T21:28:54.995863Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:28:54.557272Z","title":"Simon, John Wiley & Sons, 2006","venue":null,"work_id":"4c0618f7-bd1b-4dbc-ba37-7b43ebee94e1","year":2006},"citing_paper":{"arxiv_id":"2507.00272","last_updated":"2025-06-30T21:30:58Z","snapshot_observed_at":"2026-08-09T08:24:30.180954Z","submitted_at":"2025-06-30T21:30:58Z","title":"Iteratively Saturated Kalman Filtering","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-06T21:28:52.046008Z"},"links":{"citing_paper":"/paper/2507.00272"},"observation_digest":"sha256:3ca64dad232f5289443f2bb1772d070792f220eeb11ea3760200bd656dc32031","observation_id":"a09ca1af-48df-4296-98fd-c7780d08522d","resolution":{"observed_at":"2026-08-06T21:28:54.710522Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:28:54.249121Z","title":"Polyak, Optimization Software, 1987","venue":null,"work_id":"3da41b64-32db-48af-93ba-1c83006222be","year":1987},"citing_paper":{"arxiv_id":"2507.00272","last_updated":"2025-06-30T21:30:58Z","snapshot_observed_at":"2026-08-09T08:24:30.180954Z","submitted_at":"2025-06-30T21:30:58Z","title":"Iteratively Saturated Kalman Filtering","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-06T21:28:52.164049Z"},"links":{"citing_paper":"/paper/2507.00272"},"observation_digest":"sha256:242d87ecbeadb3a5ca9601bbc02f4e9740f7daa97ae88623aee9e546d0a44540","observation_id":"c694c7b6-a74e-4914-8144-a08a501922f8","resolution":{"observed_at":"2026-08-06T21:28:54.379692Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2405.12762","last_updated":"2024-05-21T13:15:19Z","snapshot_observed_at":"2026-08-08T05:36:37.901792Z","submitted_at":"2024-05-21T13:15:19Z","title":"Clarabel: An interior-point solver for conic programs with quadratic objectives","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.12762","snapshot_observed_at":"2026-08-06T21:28:52.303119Z","title":"Goulart and Y","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2507.00272","last_updated":"2025-06-30T21:30:58Z","snapshot_observed_at":"2026-08-09T08:24:30.180954Z","submitted_at":"2025-06-30T21:30:58Z","title":"Iteratively Saturated Kalman Filtering","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-06T21:28:52.303119Z"},"links":{"cited_paper":"/paper/2405.12762","citing_paper":"/paper/2507.00272"},"observation_digest":"sha256:59a76422c14c98459d34d65e48cf1bb777c07d3b180acd8e0c40ebc54076c133","observation_id":"1b815ff9-7bfc-43e4-8da2-e43b4d33fddc","resolution":{"observed_at":"2026-08-06T21:28:52.303119Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:28:53.964537Z","title":"Bequette, Prentice Hall Englewood Cliffs, NJ, 1998","venue":null,"work_id":"b57ecbf3-a75c-4dcb-a4db-a934608d9181","year":1998},"citing_paper":{"arxiv_id":"2507.00272","last_updated":"2025-06-30T21:30:58Z","snapshot_observed_at":"2026-08-09T08:24:30.180954Z","submitted_at":"2025-06-30T21:30:58Z","title":"Iteratively Saturated Kalman Filtering","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-06T21:28:52.454657Z"},"links":{"citing_paper":"/paper/2507.00272"},"observation_digest":"sha256:b2544637a35b8d0f37a0a166cb94cc89b54955766fbcff9bc636e2eb3a99b779","observation_id":"91f3714a-c785-4d66-89d8-5a1d5329bd64","resolution":{"observed_at":"2026-08-06T21:28:54.076863Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:28:53.670714Z","title":"Seborg, T","venue":null,"work_id":"103aa4e5-1efc-4c0d-871e-ccb004454265","year":2016},"citing_paper":{"arxiv_id":"2507.00272","last_updated":"2025-06-30T21:30:58Z","snapshot_observed_at":"2026-08-09T08:24:30.180954Z","submitted_at":"2025-06-30T21:30:58Z","title":"Iteratively Saturated Kalman Filtering","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-06T21:28:52.613727Z"},"links":{"citing_paper":"/paper/2507.00272"},"observation_digest":"sha256:511791313b8fadf6ff6d719d2ca41eecc4f707e4ce4a50d284a80614d0ced467","observation_id":"8a945b63-52f8-4f17-b057-da07125eaa55","resolution":{"observed_at":"2026-08-06T21:28:53.789241Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-06T21:28:53.388110Z","title":"About the Authors Alan Yang is a Ph.D candidate in Electri- cal Engineering at Stanford University","venue":null,"work_id":"ca62fadb-8c8a-4b95-9197-04717907bc5d","year":2025},"citing_paper":{"arxiv_id":"2507.00272","last_updated":"2025-06-30T21:30:58Z","snapshot_observed_at":"2026-08-09T08:24:30.180954Z","submitted_at":"2025-06-30T21:30:58Z","title":"Iteratively Saturated Kalman Filtering","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-06T21:28:52.743398Z"},"links":{"citing_paper":"/paper/2507.00272"},"observation_digest":"sha256:5d47bbb07ac7df8905810f3885b0947c10bc4b6d04d082567712501ba52f1836","observation_id":"fc4c1c04-2cf5-484c-a5b5-8f99ef39a179","resolution":{"observed_at":"2026-08-06T21:28:53.513690Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2507.00272","last_updated":"2025-06-30T21:30:58Z","latest_version":1,"primary_category":"eess.SY","snapshot_observed_at":"2026-08-09T08:24:30.180954Z","submitted_at":"2025-06-30T21:30:58Z","title":"Iteratively Saturated Kalman Filtering"},"reference_resolution":{"displayed":28,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":4,"verified_exact":1,"verified_fuzzy":23},"total_outbound_references":28},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 28 of 28 outbound references and 0 inbound Pith citation observations for arXiv:2507.00272."}