{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:FOCBGXGAHHSXVGHL34QODA7SUI","short_pith_number":"pith:FOCBGXGA","canonical_record":{"source":{"id":"1903.07345","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2019-03-18T10:16:47Z","cross_cats_sorted":[],"title_canon_sha256":"40274a75f5b4cda543dd7133e5fe26b8c31db6a4f21a8b968f3c207aecd96492","abstract_canon_sha256":"66544461c49dc5050b251a178857703f78952f965a9be4b7685307948e037c81"},"schema_version":"1.0"},"canonical_sha256":"2b84135cc039e57a98ebdf20e183f2a22219001aff9ea31ac76b3569fafc66dc","source":{"kind":"arxiv","id":"1903.07345","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.07345","created_at":"2026-05-17T23:51:01Z"},{"alias_kind":"arxiv_version","alias_value":"1903.07345v1","created_at":"2026-05-17T23:51:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.07345","created_at":"2026-05-17T23:51:01Z"},{"alias_kind":"pith_short_12","alias_value":"FOCBGXGAHHSX","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"FOCBGXGAHHSXVGHL","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"FOCBGXGA","created_at":"2026-05-18T12:33:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:FOCBGXGAHHSXVGHL34QODA7SUI","target":"record","payload":{"canonical_record":{"source":{"id":"1903.07345","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2019-03-18T10:16:47Z","cross_cats_sorted":[],"title_canon_sha256":"40274a75f5b4cda543dd7133e5fe26b8c31db6a4f21a8b968f3c207aecd96492","abstract_canon_sha256":"66544461c49dc5050b251a178857703f78952f965a9be4b7685307948e037c81"},"schema_version":"1.0"},"canonical_sha256":"2b84135cc039e57a98ebdf20e183f2a22219001aff9ea31ac76b3569fafc66dc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:01.676779Z","signature_b64":"MvObADAyI6FDY+X43F2IivefK0EoDmQCPbEmTXZi9tjKIHo1FUekxTYUn9mie19klNJiUWFeLezyre8GVOgzDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2b84135cc039e57a98ebdf20e183f2a22219001aff9ea31ac76b3569fafc66dc","last_reissued_at":"2026-05-17T23:51:01.676299Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:01.676299Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1903.07345","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-17T23:51:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ed1+JcnJrjhNcMQMW2qoK6PUUWxw0b2DodxGxNzZ3nyjHDdkvJbQNqkEtyrP9ld/gLndXXGD9dp/YDhC2rGEBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T10:33:45.050628Z"},"content_sha256":"ba6632ff73f191c48af51cbc1525060f15295bc3f6a56886a317e460dadcb3d4","schema_version":"1.0","event_id":"sha256:ba6632ff73f191c48af51cbc1525060f15295bc3f6a56886a317e460dadcb3d4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:FOCBGXGAHHSXVGHL34QODA7SUI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Secure distributed filtering for unstable dynamics under compromised observations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SY","authors_text":"Henrik Sandberg, Karl Henrik Johansson, Xiaoqiang Ren, Xingkang He","submitted_at":"2019-03-18T10:16:47Z","abstract_excerpt":"In this paper, we consider a secure distributed filtering problem for linear time-invariant systems with bounded noises and unstable dynamics under compromised observations. A malicious attacker is able to compromise a subset of the agents and manipulate the observations arbitrarily. We first propose a recursive distributed filter consisting of two parts at each time. The first part employs a saturation-like scheme, which gives a small gain if the innovation is too large. The second part is a consensus operation of state estimates among neighboring agents. A sufficient condition is then establ"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.07345","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-17T23:51:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZLtLbJD31afiuo8ZvK9okugEqQdekubEFoBc4NCxcrX5JmHGYrMmG/e3hY4zeWqj2gnWINqnztp/2Q72bwkrBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T10:33:45.051047Z"},"content_sha256":"0bfdddab0f3352319c3a6044383d71540ef998be1b8e7a7bbbf7769e481cafa0","schema_version":"1.0","event_id":"sha256:0bfdddab0f3352319c3a6044383d71540ef998be1b8e7a7bbbf7769e481cafa0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FOCBGXGAHHSXVGHL34QODA7SUI/bundle.json","state_url":"https://pith.science/pith/FOCBGXGAHHSXVGHL34QODA7SUI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FOCBGXGAHHSXVGHL34QODA7SUI/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-26T10:33:45Z","links":{"resolver":"https://pith.science/pith/FOCBGXGAHHSXVGHL34QODA7SUI","bundle":"https://pith.science/pith/FOCBGXGAHHSXVGHL34QODA7SUI/bundle.json","state":"https://pith.science/pith/FOCBGXGAHHSXVGHL34QODA7SUI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FOCBGXGAHHSXVGHL34QODA7SUI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:FOCBGXGAHHSXVGHL34QODA7SUI","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":"66544461c49dc5050b251a178857703f78952f965a9be4b7685307948e037c81","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2019-03-18T10:16:47Z","title_canon_sha256":"40274a75f5b4cda543dd7133e5fe26b8c31db6a4f21a8b968f3c207aecd96492"},"schema_version":"1.0","source":{"id":"1903.07345","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.07345","created_at":"2026-05-17T23:51:01Z"},{"alias_kind":"arxiv_version","alias_value":"1903.07345v1","created_at":"2026-05-17T23:51:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.07345","created_at":"2026-05-17T23:51:01Z"},{"alias_kind":"pith_short_12","alias_value":"FOCBGXGAHHSX","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"FOCBGXGAHHSXVGHL","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"FOCBGXGA","created_at":"2026-05-18T12:33:15Z"}],"graph_snapshots":[{"event_id":"sha256:0bfdddab0f3352319c3a6044383d71540ef998be1b8e7a7bbbf7769e481cafa0","target":"graph","created_at":"2026-05-17T23:51:01Z","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":"In this paper, we consider a secure distributed filtering problem for linear time-invariant systems with bounded noises and unstable dynamics under compromised observations. A malicious attacker is able to compromise a subset of the agents and manipulate the observations arbitrarily. We first propose a recursive distributed filter consisting of two parts at each time. The first part employs a saturation-like scheme, which gives a small gain if the innovation is too large. The second part is a consensus operation of state estimates among neighboring agents. A sufficient condition is then establ","authors_text":"Henrik Sandberg, Karl Henrik Johansson, Xiaoqiang Ren, Xingkang He","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2019-03-18T10:16:47Z","title":"Secure distributed filtering for unstable dynamics under compromised observations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.07345","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:ba6632ff73f191c48af51cbc1525060f15295bc3f6a56886a317e460dadcb3d4","target":"record","created_at":"2026-05-17T23:51:01Z","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":"66544461c49dc5050b251a178857703f78952f965a9be4b7685307948e037c81","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2019-03-18T10:16:47Z","title_canon_sha256":"40274a75f5b4cda543dd7133e5fe26b8c31db6a4f21a8b968f3c207aecd96492"},"schema_version":"1.0","source":{"id":"1903.07345","kind":"arxiv","version":1}},"canonical_sha256":"2b84135cc039e57a98ebdf20e183f2a22219001aff9ea31ac76b3569fafc66dc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2b84135cc039e57a98ebdf20e183f2a22219001aff9ea31ac76b3569fafc66dc","first_computed_at":"2026-05-17T23:51:01.676299Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:51:01.676299Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MvObADAyI6FDY+X43F2IivefK0EoDmQCPbEmTXZi9tjKIHo1FUekxTYUn9mie19klNJiUWFeLezyre8GVOgzDQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:51:01.676779Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.07345","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ba6632ff73f191c48af51cbc1525060f15295bc3f6a56886a317e460dadcb3d4","sha256:0bfdddab0f3352319c3a6044383d71540ef998be1b8e7a7bbbf7769e481cafa0"],"state_sha256":"f4df8942d2727d0e0c64ad283c5e1fb1ea8895386ca1ff8ae5ff8ae9e1db6c4a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Bna8MuZw3AEhHBaNOMKXUSeO4HtwvHEqnqbazm7BkEBaspeL3ExAi5iJ6d90bJpm4f29ifntzobK04hTiwR6DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T10:33:45.054402Z","bundle_sha256":"bcb3774025f6389b0f1fc76b0afa788e4da98e32e7cfa281e3b54cd0129b9430"}}