{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:67CUSYY3MBAD7DKL3TKIC2OJUB","short_pith_number":"pith:67CUSYY3","canonical_record":{"source":{"id":"1707.05418","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2017-07-18T00:15:52Z","cross_cats_sorted":[],"title_canon_sha256":"a4d857073d0b5c75a54ebd5c0b09794a59755041dab7ebc6a4204587063941ee","abstract_canon_sha256":"f0536ea80a2c7a4bd47188e7cb8121472de86a5406f87980b7c32084504c6e70"},"schema_version":"1.0"},"canonical_sha256":"f7c549631b60403f8d4bdcd48169c9a05300e3b102564feffc49cf9b5ea92984","source":{"kind":"arxiv","id":"1707.05418","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.05418","created_at":"2026-05-18T00:40:02Z"},{"alias_kind":"arxiv_version","alias_value":"1707.05418v1","created_at":"2026-05-18T00:40:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.05418","created_at":"2026-05-18T00:40:02Z"},{"alias_kind":"pith_short_12","alias_value":"67CUSYY3MBAD","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"67CUSYY3MBAD7DKL","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"67CUSYY3","created_at":"2026-05-18T12:31:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:67CUSYY3MBAD7DKL3TKIC2OJUB","target":"record","payload":{"canonical_record":{"source":{"id":"1707.05418","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2017-07-18T00:15:52Z","cross_cats_sorted":[],"title_canon_sha256":"a4d857073d0b5c75a54ebd5c0b09794a59755041dab7ebc6a4204587063941ee","abstract_canon_sha256":"f0536ea80a2c7a4bd47188e7cb8121472de86a5406f87980b7c32084504c6e70"},"schema_version":"1.0"},"canonical_sha256":"f7c549631b60403f8d4bdcd48169c9a05300e3b102564feffc49cf9b5ea92984","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:40:02.398943Z","signature_b64":"Mh+5LTROLGbBaSn0P6rdI03ZfSRst6uzvKGjradMu/nycsF+DWnM7FmWQurKI1bBfn0ae7SSOJXQNtFAkVvBDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f7c549631b60403f8d4bdcd48169c9a05300e3b102564feffc49cf9b5ea92984","last_reissued_at":"2026-05-18T00:40:02.398571Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:40:02.398571Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1707.05418","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:40:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ieNs8B5w673T/iOgJzbyQ+gM1FSbXBbRpvW6L7/wgXVoKy87CxR44xnWsXQgfi0Lqx65kdy/VU4yTxV7fX7KAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T22:09:29.392947Z"},"content_sha256":"b6bfad60dac775653cfb1feb08919be4a1e12670b6b259cf939d0a41400ab3ef","schema_version":"1.0","event_id":"sha256:b6bfad60dac775653cfb1feb08919be4a1e12670b6b259cf939d0a41400ab3ef"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:67CUSYY3MBAD7DKL3TKIC2OJUB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Computation of Worst Attacks: a LP Framework","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SY","authors_text":"Nabil H. Hirzallah, Petros G. Voulgaris","submitted_at":"2017-07-18T00:15:52Z","abstract_excerpt":"We consider the problem of false data injection attacks modeled as additive disturbances in various parts of a general LTI feedback system and derive necessary and sufficient conditions for the existence of stealthy unbounded attacks. We also consider the problem of characterizing the worst, bounded and stealthy attacks. This problem involves a maximization of a convex function subject to convex constraints, and hence, in principle, it is not easy to solve. However, by employing a $\\ell_\\infty$ framework, we show how tractable Linear Programming (LP) methods can be used to obtain the worst att"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.05418","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:40:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FH+JPMnyUI6EoJw2zsa6o1EVzpExt7kmqsX5hdnATvrpYJ08Qf5CVhGGWnibYnJm0go9/DxUM7Ec6sBY/E6RCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T22:09:29.393607Z"},"content_sha256":"7123be66b6ea60ae31708e6a95fd9d190757ed34bfd43c96b777285ba00aaf7b","schema_version":"1.0","event_id":"sha256:7123be66b6ea60ae31708e6a95fd9d190757ed34bfd43c96b777285ba00aaf7b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/67CUSYY3MBAD7DKL3TKIC2OJUB/bundle.json","state_url":"https://pith.science/pith/67CUSYY3MBAD7DKL3TKIC2OJUB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/67CUSYY3MBAD7DKL3TKIC2OJUB/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-27T22:09:29Z","links":{"resolver":"https://pith.science/pith/67CUSYY3MBAD7DKL3TKIC2OJUB","bundle":"https://pith.science/pith/67CUSYY3MBAD7DKL3TKIC2OJUB/bundle.json","state":"https://pith.science/pith/67CUSYY3MBAD7DKL3TKIC2OJUB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/67CUSYY3MBAD7DKL3TKIC2OJUB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:67CUSYY3MBAD7DKL3TKIC2OJUB","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":"f0536ea80a2c7a4bd47188e7cb8121472de86a5406f87980b7c32084504c6e70","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2017-07-18T00:15:52Z","title_canon_sha256":"a4d857073d0b5c75a54ebd5c0b09794a59755041dab7ebc6a4204587063941ee"},"schema_version":"1.0","source":{"id":"1707.05418","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.05418","created_at":"2026-05-18T00:40:02Z"},{"alias_kind":"arxiv_version","alias_value":"1707.05418v1","created_at":"2026-05-18T00:40:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.05418","created_at":"2026-05-18T00:40:02Z"},{"alias_kind":"pith_short_12","alias_value":"67CUSYY3MBAD","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"67CUSYY3MBAD7DKL","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"67CUSYY3","created_at":"2026-05-18T12:31:03Z"}],"graph_snapshots":[{"event_id":"sha256:7123be66b6ea60ae31708e6a95fd9d190757ed34bfd43c96b777285ba00aaf7b","target":"graph","created_at":"2026-05-18T00:40:02Z","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":"We consider the problem of false data injection attacks modeled as additive disturbances in various parts of a general LTI feedback system and derive necessary and sufficient conditions for the existence of stealthy unbounded attacks. We also consider the problem of characterizing the worst, bounded and stealthy attacks. This problem involves a maximization of a convex function subject to convex constraints, and hence, in principle, it is not easy to solve. However, by employing a $\\ell_\\infty$ framework, we show how tractable Linear Programming (LP) methods can be used to obtain the worst att","authors_text":"Nabil H. Hirzallah, Petros G. Voulgaris","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2017-07-18T00:15:52Z","title":"On the Computation of Worst Attacks: a LP Framework"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.05418","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:b6bfad60dac775653cfb1feb08919be4a1e12670b6b259cf939d0a41400ab3ef","target":"record","created_at":"2026-05-18T00:40:02Z","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":"f0536ea80a2c7a4bd47188e7cb8121472de86a5406f87980b7c32084504c6e70","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2017-07-18T00:15:52Z","title_canon_sha256":"a4d857073d0b5c75a54ebd5c0b09794a59755041dab7ebc6a4204587063941ee"},"schema_version":"1.0","source":{"id":"1707.05418","kind":"arxiv","version":1}},"canonical_sha256":"f7c549631b60403f8d4bdcd48169c9a05300e3b102564feffc49cf9b5ea92984","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f7c549631b60403f8d4bdcd48169c9a05300e3b102564feffc49cf9b5ea92984","first_computed_at":"2026-05-18T00:40:02.398571Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:40:02.398571Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Mh+5LTROLGbBaSn0P6rdI03ZfSRst6uzvKGjradMu/nycsF+DWnM7FmWQurKI1bBfn0ae7SSOJXQNtFAkVvBDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:40:02.398943Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.05418","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b6bfad60dac775653cfb1feb08919be4a1e12670b6b259cf939d0a41400ab3ef","sha256:7123be66b6ea60ae31708e6a95fd9d190757ed34bfd43c96b777285ba00aaf7b"],"state_sha256":"b4ca2fbb67ff66b12e0a677f9b9ec045cc3f2252d9721a2f0725a5721c9130ef"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MKTpnCCF/5UyCqwCABKA+N677H2rbZVHxtmKiDvkENw2Ovr2NGNepFrNWdSr1IUgCYiMqmuQbuoCs+NkGOn4Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T22:09:29.396365Z","bundle_sha256":"9b9c0748f9a71bd30c0d2d0e6b21eeac27aecd9e9d1b8b8fe7f6c8b5e7a1f238"}}