{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:VWICBRW66PPW62MKF6SDMMR5FI","short_pith_number":"pith:VWICBRW6","schema_version":"1.0","canonical_sha256":"ad9020c6def3df6f698a2fa436323d2a0b81518e17d9f0cf065e8f0a8403a853","source":{"kind":"arxiv","id":"1804.06321","version":1},"attestation_state":"computed","paper":{"title":"Robust Kalman Filtering: Asymptotic Analysis of the Least Favorable Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Bernard C. Levy, Mattia Zorzi","submitted_at":"2018-04-17T15:30:59Z","abstract_excerpt":"We consider a robust filtering problem where the robust filter is designed according to the least favorable model belonging to a ball about the nominal model. In this approach, the ball radius specifies the modeling error tolerance and the least favorable model is computed by performing a Riccati-like backward recursion. We show that this recursion converges provided that the tolerance is sufficiently small."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1804.06321","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-04-17T15:30:59Z","cross_cats_sorted":[],"title_canon_sha256":"ae84a592f589d27d10110e0283f340e74f29f8bbdc61a9661fb140079a983118","abstract_canon_sha256":"2c07477fb026e2cf62a9b158eb51c7e3d70979a082f56a1f46e182b1b90c7637"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:18:21.016659Z","signature_b64":"Ke4GcqGJA3k3Z8PWMtqHQ5qY0NDowOucsme1PJ0eR1VEqzfEARz7EWfuc4aDTs31xB4735GccVPcMnMBaq4lDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ad9020c6def3df6f698a2fa436323d2a0b81518e17d9f0cf065e8f0a8403a853","last_reissued_at":"2026-05-18T00:18:21.016016Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:18:21.016016Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Robust Kalman Filtering: Asymptotic Analysis of the Least Favorable Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Bernard C. Levy, Mattia Zorzi","submitted_at":"2018-04-17T15:30:59Z","abstract_excerpt":"We consider a robust filtering problem where the robust filter is designed according to the least favorable model belonging to a ball about the nominal model. In this approach, the ball radius specifies the modeling error tolerance and the least favorable model is computed by performing a Riccati-like backward recursion. We show that this recursion converges provided that the tolerance is sufficiently small."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.06321","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1804.06321","created_at":"2026-05-18T00:18:21.016136+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.06321v1","created_at":"2026-05-18T00:18:21.016136+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.06321","created_at":"2026-05-18T00:18:21.016136+00:00"},{"alias_kind":"pith_short_12","alias_value":"VWICBRW66PPW","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_16","alias_value":"VWICBRW66PPW62MK","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_8","alias_value":"VWICBRW6","created_at":"2026-05-18T12:32:59.047623+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VWICBRW66PPW62MKF6SDMMR5FI","json":"https://pith.science/pith/VWICBRW66PPW62MKF6SDMMR5FI.json","graph_json":"https://pith.science/api/pith-number/VWICBRW66PPW62MKF6SDMMR5FI/graph.json","events_json":"https://pith.science/api/pith-number/VWICBRW66PPW62MKF6SDMMR5FI/events.json","paper":"https://pith.science/paper/VWICBRW6"},"agent_actions":{"view_html":"https://pith.science/pith/VWICBRW66PPW62MKF6SDMMR5FI","download_json":"https://pith.science/pith/VWICBRW66PPW62MKF6SDMMR5FI.json","view_paper":"https://pith.science/paper/VWICBRW6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.06321&json=true","fetch_graph":"https://pith.science/api/pith-number/VWICBRW66PPW62MKF6SDMMR5FI/graph.json","fetch_events":"https://pith.science/api/pith-number/VWICBRW66PPW62MKF6SDMMR5FI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VWICBRW66PPW62MKF6SDMMR5FI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VWICBRW66PPW62MKF6SDMMR5FI/action/storage_attestation","attest_author":"https://pith.science/pith/VWICBRW66PPW62MKF6SDMMR5FI/action/author_attestation","sign_citation":"https://pith.science/pith/VWICBRW66PPW62MKF6SDMMR5FI/action/citation_signature","submit_replication":"https://pith.science/pith/VWICBRW66PPW62MKF6SDMMR5FI/action/replication_record"}},"created_at":"2026-05-18T00:18:21.016136+00:00","updated_at":"2026-05-18T00:18:21.016136+00:00"}