{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:6HKVAXXEEF5BHRC5WX5HA7YDGL","short_pith_number":"pith:6HKVAXXE","schema_version":"1.0","canonical_sha256":"f1d5505ee4217a13c45db5fa707f0332d6c273e21d04ba1f7d555df8dd54a774","source":{"kind":"arxiv","id":"1511.08927","version":2},"attestation_state":"computed","paper":{"title":"A Branch-Decomposition Approach to Power Network Design","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Kin Cheong Sou","submitted_at":"2015-11-28T20:56:22Z","abstract_excerpt":"This paper proposes a procedure to solve combinatorial power network design problems such as phasor measurement unit (PMU) placement and protection assignment against cyber-physical attacks. The proposed approach tackles the design problems through solving a dominating set problem on the power network graph. A combined branch-decomposition and dynamic programming procedure is applied to solve the dominating set problem. Contrary to standard integer programming and heuristic/evolutionary approaches for power network design, the proposed approach is exact and requires only polynomial computation"},"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":"1511.08927","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-11-28T20:56:22Z","cross_cats_sorted":[],"title_canon_sha256":"a60046bb9d4615af473efb44863be0115228804d085d3ecb7e35d17668b1161a","abstract_canon_sha256":"9ef78154f6f388df77f3dc9f0320ba1509e60a96aaf88cba9eb8eb1c5d94cc43"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:20:25.759206Z","signature_b64":"4OQXe6SxuRRWW6ow+E1jLQFXE+E5Qq6OG8/XMOfB6Ao3LTSwBDjJWKvrGLEOoRcjPdBImt4onGK1aE6o3QH+Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f1d5505ee4217a13c45db5fa707f0332d6c273e21d04ba1f7d555df8dd54a774","last_reissued_at":"2026-05-18T01:20:25.758658Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:20:25.758658Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Branch-Decomposition Approach to Power Network Design","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Kin Cheong Sou","submitted_at":"2015-11-28T20:56:22Z","abstract_excerpt":"This paper proposes a procedure to solve combinatorial power network design problems such as phasor measurement unit (PMU) placement and protection assignment against cyber-physical attacks. The proposed approach tackles the design problems through solving a dominating set problem on the power network graph. A combined branch-decomposition and dynamic programming procedure is applied to solve the dominating set problem. Contrary to standard integer programming and heuristic/evolutionary approaches for power network design, the proposed approach is exact and requires only polynomial computation"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.08927","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":"1511.08927","created_at":"2026-05-18T01:20:25.758751+00:00"},{"alias_kind":"arxiv_version","alias_value":"1511.08927v2","created_at":"2026-05-18T01:20:25.758751+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.08927","created_at":"2026-05-18T01:20:25.758751+00:00"},{"alias_kind":"pith_short_12","alias_value":"6HKVAXXEEF5B","created_at":"2026-05-18T12:29:07.941421+00:00"},{"alias_kind":"pith_short_16","alias_value":"6HKVAXXEEF5BHRC5","created_at":"2026-05-18T12:29:07.941421+00:00"},{"alias_kind":"pith_short_8","alias_value":"6HKVAXXE","created_at":"2026-05-18T12:29:07.941421+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/6HKVAXXEEF5BHRC5WX5HA7YDGL","json":"https://pith.science/pith/6HKVAXXEEF5BHRC5WX5HA7YDGL.json","graph_json":"https://pith.science/api/pith-number/6HKVAXXEEF5BHRC5WX5HA7YDGL/graph.json","events_json":"https://pith.science/api/pith-number/6HKVAXXEEF5BHRC5WX5HA7YDGL/events.json","paper":"https://pith.science/paper/6HKVAXXE"},"agent_actions":{"view_html":"https://pith.science/pith/6HKVAXXEEF5BHRC5WX5HA7YDGL","download_json":"https://pith.science/pith/6HKVAXXEEF5BHRC5WX5HA7YDGL.json","view_paper":"https://pith.science/paper/6HKVAXXE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1511.08927&json=true","fetch_graph":"https://pith.science/api/pith-number/6HKVAXXEEF5BHRC5WX5HA7YDGL/graph.json","fetch_events":"https://pith.science/api/pith-number/6HKVAXXEEF5BHRC5WX5HA7YDGL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6HKVAXXEEF5BHRC5WX5HA7YDGL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6HKVAXXEEF5BHRC5WX5HA7YDGL/action/storage_attestation","attest_author":"https://pith.science/pith/6HKVAXXEEF5BHRC5WX5HA7YDGL/action/author_attestation","sign_citation":"https://pith.science/pith/6HKVAXXEEF5BHRC5WX5HA7YDGL/action/citation_signature","submit_replication":"https://pith.science/pith/6HKVAXXEEF5BHRC5WX5HA7YDGL/action/replication_record"}},"created_at":"2026-05-18T01:20:25.758751+00:00","updated_at":"2026-05-18T01:20:25.758751+00:00"}