{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:C7OFP5CAFEUOTDRFUGPPADWVMY","short_pith_number":"pith:C7OFP5CA","schema_version":"1.0","canonical_sha256":"17dc57f4402928e98e25a19ef00ed566022f131d887aa2fdf42c812a15bf2196","source":{"kind":"arxiv","id":"1802.09651","version":2},"attestation_state":"computed","paper":{"title":"Byzantine-Resilient Distributed Observers for LTI Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SY","authors_text":"Aritra Mitra, Shreyas Sundaram","submitted_at":"2018-02-27T00:01:48Z","abstract_excerpt":"Consider a linear time-invariant (LTI) dynamical system monitored by a network of sensors, modeled as nodes of an underlying directed communication graph. We study the problem of collaboratively estimating the state of the system when certain nodes are compromised by adversaries. Specifically, we consider a Byzantine adversary model, where a compromised node possesses complete knowledge of the system dynamics and the network, and can deviate arbitrarily from the rules of any prescribed algorithm. We first characterize certain fundamental limitations of any distributed state estimation algorith"},"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":"1802.09651","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2018-02-27T00:01:48Z","cross_cats_sorted":[],"title_canon_sha256":"2507f6fe192ee3b3a90c1da8384f096065deb63904d9c6e0b12441c82fab8665","abstract_canon_sha256":"7ac8677261157104a848b0e4f633c102147fa335d85a5be37b07adf05f7355ef"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:03:56.364132Z","signature_b64":"Js+lIJgcELclS6jscX5Od5168V8IkM35Es+he6elufAB3njTdfY88zOv4Ry5IFRXlsyDy8ufKyznQ7KHKlFKDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"17dc57f4402928e98e25a19ef00ed566022f131d887aa2fdf42c812a15bf2196","last_reissued_at":"2026-05-18T00:03:56.363596Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:03:56.363596Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Byzantine-Resilient Distributed Observers for LTI Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SY","authors_text":"Aritra Mitra, Shreyas Sundaram","submitted_at":"2018-02-27T00:01:48Z","abstract_excerpt":"Consider a linear time-invariant (LTI) dynamical system monitored by a network of sensors, modeled as nodes of an underlying directed communication graph. We study the problem of collaboratively estimating the state of the system when certain nodes are compromised by adversaries. Specifically, we consider a Byzantine adversary model, where a compromised node possesses complete knowledge of the system dynamics and the network, and can deviate arbitrarily from the rules of any prescribed algorithm. We first characterize certain fundamental limitations of any distributed state estimation algorith"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.09651","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":"1802.09651","created_at":"2026-05-18T00:03:56.363697+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.09651v2","created_at":"2026-05-18T00:03:56.363697+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.09651","created_at":"2026-05-18T00:03:56.363697+00:00"},{"alias_kind":"pith_short_12","alias_value":"C7OFP5CAFEUO","created_at":"2026-05-18T12:32:16.446611+00:00"},{"alias_kind":"pith_short_16","alias_value":"C7OFP5CAFEUOTDRF","created_at":"2026-05-18T12:32:16.446611+00:00"},{"alias_kind":"pith_short_8","alias_value":"C7OFP5CA","created_at":"2026-05-18T12:32:16.446611+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"1906.08254","citing_title":"Resilient Leader-Follower Consensus with Time-Varying Leaders in Discrete-Time Systems","ref_index":11,"is_internal_anchor":true},{"citing_arxiv_id":"1906.09096","citing_title":"Resilient Leader-Follower Consensus to Arbitrary Reference Values in Time-Varying Graphs","ref_index":11,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/C7OFP5CAFEUOTDRFUGPPADWVMY","json":"https://pith.science/pith/C7OFP5CAFEUOTDRFUGPPADWVMY.json","graph_json":"https://pith.science/api/pith-number/C7OFP5CAFEUOTDRFUGPPADWVMY/graph.json","events_json":"https://pith.science/api/pith-number/C7OFP5CAFEUOTDRFUGPPADWVMY/events.json","paper":"https://pith.science/paper/C7OFP5CA"},"agent_actions":{"view_html":"https://pith.science/pith/C7OFP5CAFEUOTDRFUGPPADWVMY","download_json":"https://pith.science/pith/C7OFP5CAFEUOTDRFUGPPADWVMY.json","view_paper":"https://pith.science/paper/C7OFP5CA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.09651&json=true","fetch_graph":"https://pith.science/api/pith-number/C7OFP5CAFEUOTDRFUGPPADWVMY/graph.json","fetch_events":"https://pith.science/api/pith-number/C7OFP5CAFEUOTDRFUGPPADWVMY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/C7OFP5CAFEUOTDRFUGPPADWVMY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/C7OFP5CAFEUOTDRFUGPPADWVMY/action/storage_attestation","attest_author":"https://pith.science/pith/C7OFP5CAFEUOTDRFUGPPADWVMY/action/author_attestation","sign_citation":"https://pith.science/pith/C7OFP5CAFEUOTDRFUGPPADWVMY/action/citation_signature","submit_replication":"https://pith.science/pith/C7OFP5CAFEUOTDRFUGPPADWVMY/action/replication_record"}},"created_at":"2026-05-18T00:03:56.363697+00:00","updated_at":"2026-05-18T00:03:56.363697+00:00"}