{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:FOCBGXGAHHSXVGHL34QODA7SUI","short_pith_number":"pith:FOCBGXGA","schema_version":"1.0","canonical_sha256":"2b84135cc039e57a98ebdf20e183f2a22219001aff9ea31ac76b3569fafc66dc","source":{"kind":"arxiv","id":"1903.07345","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1903.07345","created_at":"2026-05-17T23:51:01.676385+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.07345v1","created_at":"2026-05-17T23:51:01.676385+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.07345","created_at":"2026-05-17T23:51:01.676385+00:00"},{"alias_kind":"pith_short_12","alias_value":"FOCBGXGAHHSX","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_16","alias_value":"FOCBGXGAHHSXVGHL","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_8","alias_value":"FOCBGXGA","created_at":"2026-05-18T12:33:15.570797+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/FOCBGXGAHHSXVGHL34QODA7SUI","json":"https://pith.science/pith/FOCBGXGAHHSXVGHL34QODA7SUI.json","graph_json":"https://pith.science/api/pith-number/FOCBGXGAHHSXVGHL34QODA7SUI/graph.json","events_json":"https://pith.science/api/pith-number/FOCBGXGAHHSXVGHL34QODA7SUI/events.json","paper":"https://pith.science/paper/FOCBGXGA"},"agent_actions":{"view_html":"https://pith.science/pith/FOCBGXGAHHSXVGHL34QODA7SUI","download_json":"https://pith.science/pith/FOCBGXGAHHSXVGHL34QODA7SUI.json","view_paper":"https://pith.science/paper/FOCBGXGA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.07345&json=true","fetch_graph":"https://pith.science/api/pith-number/FOCBGXGAHHSXVGHL34QODA7SUI/graph.json","fetch_events":"https://pith.science/api/pith-number/FOCBGXGAHHSXVGHL34QODA7SUI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FOCBGXGAHHSXVGHL34QODA7SUI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FOCBGXGAHHSXVGHL34QODA7SUI/action/storage_attestation","attest_author":"https://pith.science/pith/FOCBGXGAHHSXVGHL34QODA7SUI/action/author_attestation","sign_citation":"https://pith.science/pith/FOCBGXGAHHSXVGHL34QODA7SUI/action/citation_signature","submit_replication":"https://pith.science/pith/FOCBGXGAHHSXVGHL34QODA7SUI/action/replication_record"}},"created_at":"2026-05-17T23:51:01.676385+00:00","updated_at":"2026-05-17T23:51:01.676385+00:00"}