{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:W3JJ5FP4NREX6ESKN2M7YGYCS2","short_pith_number":"pith:W3JJ5FP4","schema_version":"1.0","canonical_sha256":"b6d29e95fc6c497f124a6e99fc1b029681270effddb3fd6dc876e64d76aad65b","source":{"kind":"arxiv","id":"2105.15061","version":3},"attestation_state":"computed","paper":{"title":"All-in-one: Certifiable Optimal Distributed Kalman Filter under Unknown Correlations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"eess.SY","authors_text":"Carlos Sag\\\"u\\'es, Eduardo Montijano, Eduardo Sebasti\\'an","submitted_at":"2021-05-31T15:49:03Z","abstract_excerpt":"The optimal fusion of estimates in a Distributed Kalman Filter (DKF) requires tracking of the complete network error covariance, problematic in terms of memory and communication. A scalable alternative is to fuse estimates under unknown correlations, doing the update by solving an optimisation problem. Unfortunately, this problem is NP-hard, forcing relaxations that lose optimality guarantees. Motivated by this, we present the first Certifiable Optimal DKF (CO-DKF). Using only information from one-hop neighbours, CO-DKF solves the optimal fusion of estimates under unknown correlations by a par"},"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":"2105.15061","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2021-05-31T15:49:03Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"30994cf80dcd8fc7d14b31e7b912d33affc92d0f424d8238ae53fc9fcf210b22","abstract_canon_sha256":"2bea6fa2042d3eea469a68dfbc63083e16de777cfa04f3a8be2a989cd372663a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:30:51.265614Z","signature_b64":"NtaGexeuDBseR0v98n3jjwpH4g7chtyl90vLfgAV9cbknX3b1LSRBB1nHQBxJO8IXVqIAWRtdZFu78vOUBphAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b6d29e95fc6c497f124a6e99fc1b029681270effddb3fd6dc876e64d76aad65b","last_reissued_at":"2026-07-05T04:30:51.265229Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:30:51.265229Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"All-in-one: Certifiable Optimal Distributed Kalman Filter under Unknown Correlations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"eess.SY","authors_text":"Carlos Sag\\\"u\\'es, Eduardo Montijano, Eduardo Sebasti\\'an","submitted_at":"2021-05-31T15:49:03Z","abstract_excerpt":"The optimal fusion of estimates in a Distributed Kalman Filter (DKF) requires tracking of the complete network error covariance, problematic in terms of memory and communication. A scalable alternative is to fuse estimates under unknown correlations, doing the update by solving an optimisation problem. Unfortunately, this problem is NP-hard, forcing relaxations that lose optimality guarantees. Motivated by this, we present the first Certifiable Optimal DKF (CO-DKF). Using only information from one-hop neighbours, CO-DKF solves the optimal fusion of estimates under unknown correlations by a par"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2105.15061","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2105.15061/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2105.15061","created_at":"2026-07-05T04:30:51.265276+00:00"},{"alias_kind":"arxiv_version","alias_value":"2105.15061v3","created_at":"2026-07-05T04:30:51.265276+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2105.15061","created_at":"2026-07-05T04:30:51.265276+00:00"},{"alias_kind":"pith_short_12","alias_value":"W3JJ5FP4NREX","created_at":"2026-07-05T04:30:51.265276+00:00"},{"alias_kind":"pith_short_16","alias_value":"W3JJ5FP4NREX6ESK","created_at":"2026-07-05T04:30:51.265276+00:00"},{"alias_kind":"pith_short_8","alias_value":"W3JJ5FP4","created_at":"2026-07-05T04:30:51.265276+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/W3JJ5FP4NREX6ESKN2M7YGYCS2","json":"https://pith.science/pith/W3JJ5FP4NREX6ESKN2M7YGYCS2.json","graph_json":"https://pith.science/api/pith-number/W3JJ5FP4NREX6ESKN2M7YGYCS2/graph.json","events_json":"https://pith.science/api/pith-number/W3JJ5FP4NREX6ESKN2M7YGYCS2/events.json","paper":"https://pith.science/paper/W3JJ5FP4"},"agent_actions":{"view_html":"https://pith.science/pith/W3JJ5FP4NREX6ESKN2M7YGYCS2","download_json":"https://pith.science/pith/W3JJ5FP4NREX6ESKN2M7YGYCS2.json","view_paper":"https://pith.science/paper/W3JJ5FP4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2105.15061&json=true","fetch_graph":"https://pith.science/api/pith-number/W3JJ5FP4NREX6ESKN2M7YGYCS2/graph.json","fetch_events":"https://pith.science/api/pith-number/W3JJ5FP4NREX6ESKN2M7YGYCS2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/W3JJ5FP4NREX6ESKN2M7YGYCS2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/W3JJ5FP4NREX6ESKN2M7YGYCS2/action/storage_attestation","attest_author":"https://pith.science/pith/W3JJ5FP4NREX6ESKN2M7YGYCS2/action/author_attestation","sign_citation":"https://pith.science/pith/W3JJ5FP4NREX6ESKN2M7YGYCS2/action/citation_signature","submit_replication":"https://pith.science/pith/W3JJ5FP4NREX6ESKN2M7YGYCS2/action/replication_record"}},"created_at":"2026-07-05T04:30:51.265276+00:00","updated_at":"2026-07-05T04:30:51.265276+00:00"}