{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:XIKXOUIU2KVWH7IMIQ7W4QCCJN","short_pith_number":"pith:XIKXOUIU","canonical_record":{"source":{"id":"1704.03125","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-04-11T03:14:27Z","cross_cats_sorted":[],"title_canon_sha256":"57e78671a3b4b2d22590896f3573cb3cbc5124fc2461f09f547a0a89eef112be","abstract_canon_sha256":"3a4afc8723d2aa614f6dfa9f654b55c30b76f0ca8f6f2a069c0ca05547217c65"},"schema_version":"1.0"},"canonical_sha256":"ba15775114d2ab63fd0c443f6e40424b559de316f74d5d76c87e2a8e56a5229d","source":{"kind":"arxiv","id":"1704.03125","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.03125","created_at":"2026-05-18T00:46:33Z"},{"alias_kind":"arxiv_version","alias_value":"1704.03125v1","created_at":"2026-05-18T00:46:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.03125","created_at":"2026-05-18T00:46:33Z"},{"alias_kind":"pith_short_12","alias_value":"XIKXOUIU2KVW","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_16","alias_value":"XIKXOUIU2KVWH7IM","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_8","alias_value":"XIKXOUIU","created_at":"2026-05-18T12:31:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:XIKXOUIU2KVWH7IMIQ7W4QCCJN","target":"record","payload":{"canonical_record":{"source":{"id":"1704.03125","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-04-11T03:14:27Z","cross_cats_sorted":[],"title_canon_sha256":"57e78671a3b4b2d22590896f3573cb3cbc5124fc2461f09f547a0a89eef112be","abstract_canon_sha256":"3a4afc8723d2aa614f6dfa9f654b55c30b76f0ca8f6f2a069c0ca05547217c65"},"schema_version":"1.0"},"canonical_sha256":"ba15775114d2ab63fd0c443f6e40424b559de316f74d5d76c87e2a8e56a5229d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:33.457898Z","signature_b64":"eTP8dAHwGePfv7ahWs7O+wCu4JCOhVWuUI4+GDQH9Y96XYfBB1p0S5wxmatU8PiZemCSTNn6U+I78I5v1IkbBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ba15775114d2ab63fd0c443f6e40424b559de316f74d5d76c87e2a8e56a5229d","last_reissued_at":"2026-05-18T00:46:33.457176Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:33.457176Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1704.03125","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:46:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uLMwkjIn4jb6DDYPCmKdqfQbnZJgx/onTToUwUIhvSWw1/zsJNQMFL9IvDDtC6GUPpmtkUpineQu1jwKsF7oDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T10:30:35.762568Z"},"content_sha256":"0e472558814628e3aa587204a835e2f2b1dcbde5b4b33f182f16079a9c60994a","schema_version":"1.0","event_id":"sha256:0e472558814628e3aa587204a835e2f2b1dcbde5b4b33f182f16079a9c60994a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:XIKXOUIU2KVWH7IMIQ7W4QCCJN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Large-scale distributed Kalman filtering via an optimization approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Mathias Hudoba de Badyn, Mehran Mesbahi","submitted_at":"2017-04-11T03:14:27Z","abstract_excerpt":"Large-scale distributed systems such as sensor networks, often need to achieve filtering and consensus on an estimated parameter from high-dimensional measurements. Running a Kalman filter on every node in such a network is computationally intensive; in particular the matrix inversion in the Kalman gain update step is expensive. In this paper, we extend previous results in distributed Kalman filtering and large-scale machine learning to propose a gradient descent step for updating an estimate of the error covariance matrix; this is then embedded and analyzed in the context of distributed Kalma"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.03125","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:46:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xT8VFx1D4Fg8GvskYvXzKP5IcyIXwjL5vF2ORZAo8agw7siTCNlIKs8RK1uA//2U3t8ZpOjCuG1Q2f2MHJ7gDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T10:30:35.762907Z"},"content_sha256":"348469ba7cc2640f93991d224cac087344b60bc496658e9145dd7872ae59044a","schema_version":"1.0","event_id":"sha256:348469ba7cc2640f93991d224cac087344b60bc496658e9145dd7872ae59044a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XIKXOUIU2KVWH7IMIQ7W4QCCJN/bundle.json","state_url":"https://pith.science/pith/XIKXOUIU2KVWH7IMIQ7W4QCCJN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XIKXOUIU2KVWH7IMIQ7W4QCCJN/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-28T10:30:35Z","links":{"resolver":"https://pith.science/pith/XIKXOUIU2KVWH7IMIQ7W4QCCJN","bundle":"https://pith.science/pith/XIKXOUIU2KVWH7IMIQ7W4QCCJN/bundle.json","state":"https://pith.science/pith/XIKXOUIU2KVWH7IMIQ7W4QCCJN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XIKXOUIU2KVWH7IMIQ7W4QCCJN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:XIKXOUIU2KVWH7IMIQ7W4QCCJN","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"3a4afc8723d2aa614f6dfa9f654b55c30b76f0ca8f6f2a069c0ca05547217c65","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-04-11T03:14:27Z","title_canon_sha256":"57e78671a3b4b2d22590896f3573cb3cbc5124fc2461f09f547a0a89eef112be"},"schema_version":"1.0","source":{"id":"1704.03125","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.03125","created_at":"2026-05-18T00:46:33Z"},{"alias_kind":"arxiv_version","alias_value":"1704.03125v1","created_at":"2026-05-18T00:46:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.03125","created_at":"2026-05-18T00:46:33Z"},{"alias_kind":"pith_short_12","alias_value":"XIKXOUIU2KVW","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_16","alias_value":"XIKXOUIU2KVWH7IM","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_8","alias_value":"XIKXOUIU","created_at":"2026-05-18T12:31:53Z"}],"graph_snapshots":[{"event_id":"sha256:348469ba7cc2640f93991d224cac087344b60bc496658e9145dd7872ae59044a","target":"graph","created_at":"2026-05-18T00:46:33Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Large-scale distributed systems such as sensor networks, often need to achieve filtering and consensus on an estimated parameter from high-dimensional measurements. Running a Kalman filter on every node in such a network is computationally intensive; in particular the matrix inversion in the Kalman gain update step is expensive. In this paper, we extend previous results in distributed Kalman filtering and large-scale machine learning to propose a gradient descent step for updating an estimate of the error covariance matrix; this is then embedded and analyzed in the context of distributed Kalma","authors_text":"Mathias Hudoba de Badyn, Mehran Mesbahi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-04-11T03:14:27Z","title":"Large-scale distributed Kalman filtering via an optimization approach"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.03125","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:0e472558814628e3aa587204a835e2f2b1dcbde5b4b33f182f16079a9c60994a","target":"record","created_at":"2026-05-18T00:46:33Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"3a4afc8723d2aa614f6dfa9f654b55c30b76f0ca8f6f2a069c0ca05547217c65","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-04-11T03:14:27Z","title_canon_sha256":"57e78671a3b4b2d22590896f3573cb3cbc5124fc2461f09f547a0a89eef112be"},"schema_version":"1.0","source":{"id":"1704.03125","kind":"arxiv","version":1}},"canonical_sha256":"ba15775114d2ab63fd0c443f6e40424b559de316f74d5d76c87e2a8e56a5229d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ba15775114d2ab63fd0c443f6e40424b559de316f74d5d76c87e2a8e56a5229d","first_computed_at":"2026-05-18T00:46:33.457176Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:46:33.457176Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"eTP8dAHwGePfv7ahWs7O+wCu4JCOhVWuUI4+GDQH9Y96XYfBB1p0S5wxmatU8PiZemCSTNn6U+I78I5v1IkbBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:46:33.457898Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.03125","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0e472558814628e3aa587204a835e2f2b1dcbde5b4b33f182f16079a9c60994a","sha256:348469ba7cc2640f93991d224cac087344b60bc496658e9145dd7872ae59044a"],"state_sha256":"df43d37a3ada3c0438348b9d3f1124ec4657e693dc73986ba535dc762cac4ee2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"L2ko4rE5AWW3sRpU2JnHh64ulCFzLVqCpCLGquhCa6BNFh6Lo9xjVQpQF9NLWYK8d+Nr7wAUjI5BE+Z8p1r0Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T10:30:35.764849Z","bundle_sha256":"3c55a9eb0022c7a876ae42b1f17bb556e76cd2618baf8c3a76c197f95e370e88"}}