{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:IU5QECT5ZMARHWLFDAY56ZZVQ6","short_pith_number":"pith:IU5QECT5","schema_version":"1.0","canonical_sha256":"453b020a7dcb0113d9651831df673587af247a86913e39cd55f1754de6698ba0","source":{"kind":"arxiv","id":"1611.02050","version":2},"attestation_state":"computed","paper":{"title":"Worst-case Prediction Performance Analysis of the Kalman Filter","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Kristiaan Pelckmans, Sholeh Yasini","submitted_at":"2016-11-07T13:48:37Z","abstract_excerpt":"In this paper, we study the prediction performance of the Kalman filter (KF) in a worst-case, minimax setting as studied in online machine learning, information - and game theory. The aim is to predict the sequence of observations almost as well as the best reference predictor (comparator) sequence in a comparison class. We prove worst-case bounds on the cumulative squared prediction errors using a priori knowledge about the complexity of reference predictor sequence. In fact, the performance of the KF is derived as a function of the performance of the best reference predictor and the total am"},"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":"1611.02050","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-11-07T13:48:37Z","cross_cats_sorted":[],"title_canon_sha256":"4b98bb6bcb8e608aa0122b90218ca8cb464bec4b29b2521c8a8c5da5f9702fdc","abstract_canon_sha256":"db8c6706811ccec110308a820f36b1011f91c4cf409dd3b4225417815538ee6c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:57:25.302835Z","signature_b64":"5jgPLYt0P1SB6eMbGjq3wLUjFTE9tHz2Q9/QZZ+XfEH+t/Nznk55hHlQIiUaNAp6/qh04R7WV2KiH7JasP5VCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"453b020a7dcb0113d9651831df673587af247a86913e39cd55f1754de6698ba0","last_reissued_at":"2026-05-18T00:57:25.302329Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:57:25.302329Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Worst-case Prediction Performance Analysis of the Kalman Filter","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Kristiaan Pelckmans, Sholeh Yasini","submitted_at":"2016-11-07T13:48:37Z","abstract_excerpt":"In this paper, we study the prediction performance of the Kalman filter (KF) in a worst-case, minimax setting as studied in online machine learning, information - and game theory. The aim is to predict the sequence of observations almost as well as the best reference predictor (comparator) sequence in a comparison class. We prove worst-case bounds on the cumulative squared prediction errors using a priori knowledge about the complexity of reference predictor sequence. In fact, the performance of the KF is derived as a function of the performance of the best reference predictor and the total am"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.02050","kind":"arxiv","version":2},"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":"1611.02050","created_at":"2026-05-18T00:57:25.302407+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.02050v2","created_at":"2026-05-18T00:57:25.302407+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.02050","created_at":"2026-05-18T00:57:25.302407+00:00"},{"alias_kind":"pith_short_12","alias_value":"IU5QECT5ZMAR","created_at":"2026-05-18T12:30:22.444734+00:00"},{"alias_kind":"pith_short_16","alias_value":"IU5QECT5ZMARHWLF","created_at":"2026-05-18T12:30:22.444734+00:00"},{"alias_kind":"pith_short_8","alias_value":"IU5QECT5","created_at":"2026-05-18T12:30:22.444734+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/IU5QECT5ZMARHWLFDAY56ZZVQ6","json":"https://pith.science/pith/IU5QECT5ZMARHWLFDAY56ZZVQ6.json","graph_json":"https://pith.science/api/pith-number/IU5QECT5ZMARHWLFDAY56ZZVQ6/graph.json","events_json":"https://pith.science/api/pith-number/IU5QECT5ZMARHWLFDAY56ZZVQ6/events.json","paper":"https://pith.science/paper/IU5QECT5"},"agent_actions":{"view_html":"https://pith.science/pith/IU5QECT5ZMARHWLFDAY56ZZVQ6","download_json":"https://pith.science/pith/IU5QECT5ZMARHWLFDAY56ZZVQ6.json","view_paper":"https://pith.science/paper/IU5QECT5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.02050&json=true","fetch_graph":"https://pith.science/api/pith-number/IU5QECT5ZMARHWLFDAY56ZZVQ6/graph.json","fetch_events":"https://pith.science/api/pith-number/IU5QECT5ZMARHWLFDAY56ZZVQ6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IU5QECT5ZMARHWLFDAY56ZZVQ6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IU5QECT5ZMARHWLFDAY56ZZVQ6/action/storage_attestation","attest_author":"https://pith.science/pith/IU5QECT5ZMARHWLFDAY56ZZVQ6/action/author_attestation","sign_citation":"https://pith.science/pith/IU5QECT5ZMARHWLFDAY56ZZVQ6/action/citation_signature","submit_replication":"https://pith.science/pith/IU5QECT5ZMARHWLFDAY56ZZVQ6/action/replication_record"}},"created_at":"2026-05-18T00:57:25.302407+00:00","updated_at":"2026-05-18T00:57:25.302407+00:00"}