{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:QJEQRVZXO6NQ2LO462KIL54GEZ","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":"7310c9f46ad41ea27538abad0747c3de6c9d018a58e0dd4a4c0bf3e69c75e101","cross_cats_sorted":["cs.CR","cs.SY","eess.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-03-25T22:24:37Z","title_canon_sha256":"8879289853b8d3d0c59c3b8b2f70ede2af62dca4e2e239b1eb309c18b6f9537f"},"schema_version":"1.0","source":{"id":"1903.10620","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.10620","created_at":"2026-06-04T20:14:17Z"},{"alias_kind":"arxiv_version","alias_value":"1903.10620v4","created_at":"2026-06-04T20:14:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.10620","created_at":"2026-06-04T20:14:17Z"},{"alias_kind":"pith_short_12","alias_value":"QJEQRVZXO6NQ","created_at":"2026-06-04T20:14:17Z"},{"alias_kind":"pith_short_16","alias_value":"QJEQRVZXO6NQ2LO4","created_at":"2026-06-04T20:14:17Z"},{"alias_kind":"pith_short_8","alias_value":"QJEQRVZX","created_at":"2026-06-04T20:14:17Z"}],"graph_snapshots":[{"event_id":"sha256:79a324b585cdbbde18b508b7f2e65d9869e416c3729d1d81a154a28f9a21fb47","target":"graph","created_at":"2026-06-04T20:14:17Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1903.10620/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The growing complexity of modern Cyber-Physical Systems (CPS) and the frequent communication between their components make them vulnerable to malicious attacks. As a result, secure state estimation is a critical requirement for the control of these systems. Many existing secure state estimation methods suffer from combinatorial complexity which grows with the number of states and sensors in the system. This complexity can be mitigated using optimization-based methods that relax the original state estimation problem, although at the cost of optimality as these methods often identify attack-free","authors_text":"Michael M. Zavlanos, Miroslav Pajic, Xusheng Luo","cross_cats":["cs.CR","cs.SY","eess.SY"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-03-25T22:24:37Z","title":"An Optimal Graph-Search Method for Secure State Estimation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.10620","kind":"arxiv","version":4},"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:2d13abba68ed245cc419e9d4e4d73d7965af07e7ed432f7e4a8764864f9c3e5b","target":"record","created_at":"2026-06-04T20:14:17Z","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":"7310c9f46ad41ea27538abad0747c3de6c9d018a58e0dd4a4c0bf3e69c75e101","cross_cats_sorted":["cs.CR","cs.SY","eess.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-03-25T22:24:37Z","title_canon_sha256":"8879289853b8d3d0c59c3b8b2f70ede2af62dca4e2e239b1eb309c18b6f9537f"},"schema_version":"1.0","source":{"id":"1903.10620","kind":"arxiv","version":4}},"canonical_sha256":"824908d737779b0d2ddcf69485f78626420632d94f55c011ee18c6ccd4a10437","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"824908d737779b0d2ddcf69485f78626420632d94f55c011ee18c6ccd4a10437","first_computed_at":"2026-06-04T20:14:17.591394Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-04T20:14:17.591394Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7cQ8Qbo6u8ZqCw95RlSdBJgOPCsXzIBJr1d2hrbhHdl8bbPfZpW3c329t3j6bSLfrw6lQIN/qoCd4V29CspIBQ==","signature_status":"signed_v1","signed_at":"2026-06-04T20:14:17.591944Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.10620","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2d13abba68ed245cc419e9d4e4d73d7965af07e7ed432f7e4a8764864f9c3e5b","sha256:79a324b585cdbbde18b508b7f2e65d9869e416c3729d1d81a154a28f9a21fb47"],"state_sha256":"dd124e4d62c52f4149b01a01dfaf1cbccc2610bf3a5257dc98109566bdff5ee5"}