{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:C7NBZOJ7APPWBHWRHRNFIRMGAH","short_pith_number":"pith:C7NBZOJ7","canonical_record":{"source":{"id":"1201.5019","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-12-22T12:19:47Z","cross_cats_sorted":["cs.CE","cs.SY"],"title_canon_sha256":"ba98b503d4a789783891e2d06185eaf411b893b537970ff69937ae4fa45d7797","abstract_canon_sha256":"3d05279e96355f48101747a9e9f729a037958f2d24be51a96b6fb13649130980"},"schema_version":"1.0"},"canonical_sha256":"17da1cb93f03df609ed13c5a54458601d4a54f31539f67b8c5c901dcfbb9b96d","source":{"kind":"arxiv","id":"1201.5019","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.5019","created_at":"2026-05-18T03:45:31Z"},{"alias_kind":"arxiv_version","alias_value":"1201.5019v2","created_at":"2026-05-18T03:45:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.5019","created_at":"2026-05-18T03:45:31Z"},{"alias_kind":"pith_short_12","alias_value":"C7NBZOJ7APPW","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_16","alias_value":"C7NBZOJ7APPWBHWR","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_8","alias_value":"C7NBZOJ7","created_at":"2026-05-18T12:26:26Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:C7NBZOJ7APPWBHWRHRNFIRMGAH","target":"record","payload":{"canonical_record":{"source":{"id":"1201.5019","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-12-22T12:19:47Z","cross_cats_sorted":["cs.CE","cs.SY"],"title_canon_sha256":"ba98b503d4a789783891e2d06185eaf411b893b537970ff69937ae4fa45d7797","abstract_canon_sha256":"3d05279e96355f48101747a9e9f729a037958f2d24be51a96b6fb13649130980"},"schema_version":"1.0"},"canonical_sha256":"17da1cb93f03df609ed13c5a54458601d4a54f31539f67b8c5c901dcfbb9b96d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:45:31.810980Z","signature_b64":"KqkZbQzw3oEdEzKwUKcUduJEIgnCjfh0ijccpSnQdsA3EDEbK2F2oo6092BtEuSw8nK5leGU6jCWDe38PrmSDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"17da1cb93f03df609ed13c5a54458601d4a54f31539f67b8c5c901dcfbb9b96d","last_reissued_at":"2026-05-18T03:45:31.810474Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:45:31.810474Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1201.5019","source_version":2,"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-18T03:45:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nm+vZQAaExeQDU7IOjbcNULdAlSA8MOr7d35OkLlGdBwazEcxYg14DvGZeqYW3maLPztZTdSdcSOuqb7vOZ7BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T17:19:41.980688Z"},"content_sha256":"cd0319338e3a44029da80da8c33e40c9b914b1b7c6811b61107fb3d16de7e4fb","schema_version":"1.0","event_id":"sha256:cd0319338e3a44029da80da8c33e40c9b914b1b7c6811b61107fb3d16de7e4fb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:C7NBZOJ7APPWBHWRHRNFIRMGAH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Exact Solution to a Smart Grid Cyber-Security Analysis Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CE","cs.SY"],"primary_cat":"math.OC","authors_text":"Henrik Sandberg, Karl Henrik Johansson, Kin Cheong Sou","submitted_at":"2011-12-22T12:19:47Z","abstract_excerpt":"This paper considers a smart grid cyber-security problem analyzing the vulnerabilities of electric power networks to false data attacks. The analysis problem is related to a constrained cardinality minimization problem. The main result shows that an $l_1$ relaxation technique provides an exact optimal solution to this cardinality minimization problem. The proposed result is based on a polyhedral combinatorics argument. It is different from well-known results based on mutual coherence and restricted isometry property. The results are illustrated on benchmarks including the IEEE 118-bus and 300-"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.5019","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"},"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-18T03:45:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dAqnoUK/IYDyt8qRRRBkTzcZvoxMBLPF0s8bgwxxS51fsp+B4vwC3rgLN0Jj1hxRb0jXEvtmTSjJVE3kuo6bCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T17:19:41.981365Z"},"content_sha256":"ac80bb4ff7c9dca045da23285ecb726ad451df6bdfe28d8fe6c80a52da4c7311","schema_version":"1.0","event_id":"sha256:ac80bb4ff7c9dca045da23285ecb726ad451df6bdfe28d8fe6c80a52da4c7311"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/C7NBZOJ7APPWBHWRHRNFIRMGAH/bundle.json","state_url":"https://pith.science/pith/C7NBZOJ7APPWBHWRHRNFIRMGAH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/C7NBZOJ7APPWBHWRHRNFIRMGAH/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-06-07T17:19:41Z","links":{"resolver":"https://pith.science/pith/C7NBZOJ7APPWBHWRHRNFIRMGAH","bundle":"https://pith.science/pith/C7NBZOJ7APPWBHWRHRNFIRMGAH/bundle.json","state":"https://pith.science/pith/C7NBZOJ7APPWBHWRHRNFIRMGAH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/C7NBZOJ7APPWBHWRHRNFIRMGAH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:C7NBZOJ7APPWBHWRHRNFIRMGAH","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":"3d05279e96355f48101747a9e9f729a037958f2d24be51a96b6fb13649130980","cross_cats_sorted":["cs.CE","cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-12-22T12:19:47Z","title_canon_sha256":"ba98b503d4a789783891e2d06185eaf411b893b537970ff69937ae4fa45d7797"},"schema_version":"1.0","source":{"id":"1201.5019","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.5019","created_at":"2026-05-18T03:45:31Z"},{"alias_kind":"arxiv_version","alias_value":"1201.5019v2","created_at":"2026-05-18T03:45:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.5019","created_at":"2026-05-18T03:45:31Z"},{"alias_kind":"pith_short_12","alias_value":"C7NBZOJ7APPW","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_16","alias_value":"C7NBZOJ7APPWBHWR","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_8","alias_value":"C7NBZOJ7","created_at":"2026-05-18T12:26:26Z"}],"graph_snapshots":[{"event_id":"sha256:ac80bb4ff7c9dca045da23285ecb726ad451df6bdfe28d8fe6c80a52da4c7311","target":"graph","created_at":"2026-05-18T03:45:31Z","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":"This paper considers a smart grid cyber-security problem analyzing the vulnerabilities of electric power networks to false data attacks. The analysis problem is related to a constrained cardinality minimization problem. The main result shows that an $l_1$ relaxation technique provides an exact optimal solution to this cardinality minimization problem. The proposed result is based on a polyhedral combinatorics argument. It is different from well-known results based on mutual coherence and restricted isometry property. The results are illustrated on benchmarks including the IEEE 118-bus and 300-","authors_text":"Henrik Sandberg, Karl Henrik Johansson, Kin Cheong Sou","cross_cats":["cs.CE","cs.SY"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-12-22T12:19:47Z","title":"On the Exact Solution to a Smart Grid Cyber-Security Analysis Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.5019","kind":"arxiv","version":2},"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:cd0319338e3a44029da80da8c33e40c9b914b1b7c6811b61107fb3d16de7e4fb","target":"record","created_at":"2026-05-18T03:45:31Z","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":"3d05279e96355f48101747a9e9f729a037958f2d24be51a96b6fb13649130980","cross_cats_sorted":["cs.CE","cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-12-22T12:19:47Z","title_canon_sha256":"ba98b503d4a789783891e2d06185eaf411b893b537970ff69937ae4fa45d7797"},"schema_version":"1.0","source":{"id":"1201.5019","kind":"arxiv","version":2}},"canonical_sha256":"17da1cb93f03df609ed13c5a54458601d4a54f31539f67b8c5c901dcfbb9b96d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"17da1cb93f03df609ed13c5a54458601d4a54f31539f67b8c5c901dcfbb9b96d","first_computed_at":"2026-05-18T03:45:31.810474Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:45:31.810474Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KqkZbQzw3oEdEzKwUKcUduJEIgnCjfh0ijccpSnQdsA3EDEbK2F2oo6092BtEuSw8nK5leGU6jCWDe38PrmSDA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:45:31.810980Z","signed_message":"canonical_sha256_bytes"},"source_id":"1201.5019","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cd0319338e3a44029da80da8c33e40c9b914b1b7c6811b61107fb3d16de7e4fb","sha256:ac80bb4ff7c9dca045da23285ecb726ad451df6bdfe28d8fe6c80a52da4c7311"],"state_sha256":"bd59910bfadd2e32defb2ebf086bce5446eff463c7f34904156941f6dd8571fd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WMzOP50N4db5p0l+q0zhLJ9HDp3F7XW4puRM6NtJ214FTbyz+1wngafwlNbEnQ9Pw1787cJ4jvNlr0Ba1Yu4Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T17:19:41.984864Z","bundle_sha256":"a9efadfe4e6d6b7bca0ac5b3f86314b2a1539334e93e197a797feea586599107"}}