{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:C7NBZOJ7APPWBHWRHRNFIRMGAH","short_pith_number":"pith:C7NBZOJ7","schema_version":"1.0","canonical_sha256":"17da1cb93f03df609ed13c5a54458601d4a54f31539f67b8c5c901dcfbb9b96d","source":{"kind":"arxiv","id":"1201.5019","version":2},"attestation_state":"computed","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-"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1201.5019","created_at":"2026-05-18T03:45:31.810551+00:00"},{"alias_kind":"arxiv_version","alias_value":"1201.5019v2","created_at":"2026-05-18T03:45:31.810551+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.5019","created_at":"2026-05-18T03:45:31.810551+00:00"},{"alias_kind":"pith_short_12","alias_value":"C7NBZOJ7APPW","created_at":"2026-05-18T12:26:26.731475+00:00"},{"alias_kind":"pith_short_16","alias_value":"C7NBZOJ7APPWBHWR","created_at":"2026-05-18T12:26:26.731475+00:00"},{"alias_kind":"pith_short_8","alias_value":"C7NBZOJ7","created_at":"2026-05-18T12:26:26.731475+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/C7NBZOJ7APPWBHWRHRNFIRMGAH","json":"https://pith.science/pith/C7NBZOJ7APPWBHWRHRNFIRMGAH.json","graph_json":"https://pith.science/api/pith-number/C7NBZOJ7APPWBHWRHRNFIRMGAH/graph.json","events_json":"https://pith.science/api/pith-number/C7NBZOJ7APPWBHWRHRNFIRMGAH/events.json","paper":"https://pith.science/paper/C7NBZOJ7"},"agent_actions":{"view_html":"https://pith.science/pith/C7NBZOJ7APPWBHWRHRNFIRMGAH","download_json":"https://pith.science/pith/C7NBZOJ7APPWBHWRHRNFIRMGAH.json","view_paper":"https://pith.science/paper/C7NBZOJ7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1201.5019&json=true","fetch_graph":"https://pith.science/api/pith-number/C7NBZOJ7APPWBHWRHRNFIRMGAH/graph.json","fetch_events":"https://pith.science/api/pith-number/C7NBZOJ7APPWBHWRHRNFIRMGAH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/C7NBZOJ7APPWBHWRHRNFIRMGAH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/C7NBZOJ7APPWBHWRHRNFIRMGAH/action/storage_attestation","attest_author":"https://pith.science/pith/C7NBZOJ7APPWBHWRHRNFIRMGAH/action/author_attestation","sign_citation":"https://pith.science/pith/C7NBZOJ7APPWBHWRHRNFIRMGAH/action/citation_signature","submit_replication":"https://pith.science/pith/C7NBZOJ7APPWBHWRHRNFIRMGAH/action/replication_record"}},"created_at":"2026-05-18T03:45:31.810551+00:00","updated_at":"2026-05-18T03:45:31.810551+00:00"}