{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:KHISJIIQM2GL4T56XVL4D3MZRM","short_pith_number":"pith:KHISJIIQ","canonical_record":{"source":{"id":"1603.04996","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-03-16T09:12:37Z","cross_cats_sorted":[],"title_canon_sha256":"0e759ae026e5749babe2e172845b6a9989ec2fa422b71525d6a3acf6d45b72a9","abstract_canon_sha256":"b8bd819b03bcc945e1df23d468cb1bc929c5908293becb18dca809b550b001a3"},"schema_version":"1.0"},"canonical_sha256":"51d124a110668cbe4fbebd57c1ed998b1afe6df9f7531c0349f0952dc723b0b4","source":{"kind":"arxiv","id":"1603.04996","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.04996","created_at":"2026-05-18T00:50:01Z"},{"alias_kind":"arxiv_version","alias_value":"1603.04996v2","created_at":"2026-05-18T00:50:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.04996","created_at":"2026-05-18T00:50:01Z"},{"alias_kind":"pith_short_12","alias_value":"KHISJIIQM2GL","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_16","alias_value":"KHISJIIQM2GL4T56","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_8","alias_value":"KHISJIIQ","created_at":"2026-05-18T12:30:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:KHISJIIQM2GL4T56XVL4D3MZRM","target":"record","payload":{"canonical_record":{"source":{"id":"1603.04996","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-03-16T09:12:37Z","cross_cats_sorted":[],"title_canon_sha256":"0e759ae026e5749babe2e172845b6a9989ec2fa422b71525d6a3acf6d45b72a9","abstract_canon_sha256":"b8bd819b03bcc945e1df23d468cb1bc929c5908293becb18dca809b550b001a3"},"schema_version":"1.0"},"canonical_sha256":"51d124a110668cbe4fbebd57c1ed998b1afe6df9f7531c0349f0952dc723b0b4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:50:01.535041Z","signature_b64":"hjh+TrKoJ68tkDpmuLln7x5hZ/zaJdoN9st+yH9I7seHeQdqZG5eoZ1Sa8xnNbKbCK60ZklF5QUcp8MX1EocAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"51d124a110668cbe4fbebd57c1ed998b1afe6df9f7531c0349f0952dc723b0b4","last_reissued_at":"2026-05-18T00:50:01.534466Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:50:01.534466Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1603.04996","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-18T00:50:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4+ty/UE0FDoNAfe+ic2zG7mpJFI/A2kC4FftA+g1lkLmr8dRyk+JlI5dBkGLoC3uTo+ahwKxs5CiNENbV+fnDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T05:13:05.114711Z"},"content_sha256":"dfa37a0acc014dadd443febc84a8ddc1b19557a59edfcb4a30e70712446763ae","schema_version":"1.0","event_id":"sha256:dfa37a0acc014dadd443febc84a8ddc1b19557a59edfcb4a30e70712446763ae"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:KHISJIIQM2GL4T56XVL4D3MZRM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Relaxed Connected Dominating Set Problem with Application to Secure Power Network Design","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Jie Lu, Kin Cheong Sou","submitted_at":"2016-03-16T09:12:37Z","abstract_excerpt":"This paper investigates a combinatorial optimization problem motived from a secure power network design application in [D\\'{a}n and Sandberg 2010]. Two equivalent graph optimization formulations are derived. One of the formulations is a relaxed version of the connected dominating set problem, and hence the considered problem is referred to as relaxed connected dominating set (RCDS) problem. The RCDS problem is shown to be NP-hard, even for planar graphs. A mixed integer linear programming formulation is presented. In addition, for planar graphs a fixed parameter polynomial time solution method"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.04996","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-18T00:50:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2OiMW4vCYzt0x4Ajd8TpeghjHoHD63GMBpXefBqidUS/LV9i3EVRP04buvBJb7jYY3mZrVNlD+/I4LgfO096Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T05:13:05.115478Z"},"content_sha256":"55c3884dc151905f59cb19c1e5942f9347f65b6d757c6f1013640a7074f4dd30","schema_version":"1.0","event_id":"sha256:55c3884dc151905f59cb19c1e5942f9347f65b6d757c6f1013640a7074f4dd30"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KHISJIIQM2GL4T56XVL4D3MZRM/bundle.json","state_url":"https://pith.science/pith/KHISJIIQM2GL4T56XVL4D3MZRM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KHISJIIQM2GL4T56XVL4D3MZRM/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-08T05:13:05Z","links":{"resolver":"https://pith.science/pith/KHISJIIQM2GL4T56XVL4D3MZRM","bundle":"https://pith.science/pith/KHISJIIQM2GL4T56XVL4D3MZRM/bundle.json","state":"https://pith.science/pith/KHISJIIQM2GL4T56XVL4D3MZRM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KHISJIIQM2GL4T56XVL4D3MZRM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:KHISJIIQM2GL4T56XVL4D3MZRM","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":"b8bd819b03bcc945e1df23d468cb1bc929c5908293becb18dca809b550b001a3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-03-16T09:12:37Z","title_canon_sha256":"0e759ae026e5749babe2e172845b6a9989ec2fa422b71525d6a3acf6d45b72a9"},"schema_version":"1.0","source":{"id":"1603.04996","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.04996","created_at":"2026-05-18T00:50:01Z"},{"alias_kind":"arxiv_version","alias_value":"1603.04996v2","created_at":"2026-05-18T00:50:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.04996","created_at":"2026-05-18T00:50:01Z"},{"alias_kind":"pith_short_12","alias_value":"KHISJIIQM2GL","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_16","alias_value":"KHISJIIQM2GL4T56","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_8","alias_value":"KHISJIIQ","created_at":"2026-05-18T12:30:25Z"}],"graph_snapshots":[{"event_id":"sha256:55c3884dc151905f59cb19c1e5942f9347f65b6d757c6f1013640a7074f4dd30","target":"graph","created_at":"2026-05-18T00:50:01Z","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 investigates a combinatorial optimization problem motived from a secure power network design application in [D\\'{a}n and Sandberg 2010]. Two equivalent graph optimization formulations are derived. One of the formulations is a relaxed version of the connected dominating set problem, and hence the considered problem is referred to as relaxed connected dominating set (RCDS) problem. The RCDS problem is shown to be NP-hard, even for planar graphs. A mixed integer linear programming formulation is presented. In addition, for planar graphs a fixed parameter polynomial time solution method","authors_text":"Jie Lu, Kin Cheong Sou","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-03-16T09:12:37Z","title":"Relaxed Connected Dominating Set Problem with Application to Secure Power Network Design"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.04996","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:dfa37a0acc014dadd443febc84a8ddc1b19557a59edfcb4a30e70712446763ae","target":"record","created_at":"2026-05-18T00:50:01Z","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":"b8bd819b03bcc945e1df23d468cb1bc929c5908293becb18dca809b550b001a3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-03-16T09:12:37Z","title_canon_sha256":"0e759ae026e5749babe2e172845b6a9989ec2fa422b71525d6a3acf6d45b72a9"},"schema_version":"1.0","source":{"id":"1603.04996","kind":"arxiv","version":2}},"canonical_sha256":"51d124a110668cbe4fbebd57c1ed998b1afe6df9f7531c0349f0952dc723b0b4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"51d124a110668cbe4fbebd57c1ed998b1afe6df9f7531c0349f0952dc723b0b4","first_computed_at":"2026-05-18T00:50:01.534466Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:50:01.534466Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hjh+TrKoJ68tkDpmuLln7x5hZ/zaJdoN9st+yH9I7seHeQdqZG5eoZ1Sa8xnNbKbCK60ZklF5QUcp8MX1EocAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:50:01.535041Z","signed_message":"canonical_sha256_bytes"},"source_id":"1603.04996","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dfa37a0acc014dadd443febc84a8ddc1b19557a59edfcb4a30e70712446763ae","sha256:55c3884dc151905f59cb19c1e5942f9347f65b6d757c6f1013640a7074f4dd30"],"state_sha256":"e51db47ab382165cc806dc156e4967a27fb89a6fccbb507c2fd86aaad2100a89"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PdnXW7lrN9S+GucUSg7jZOKOxyxXv83Guk2ojPKDBE4VFduGM/LlUOZRGfKfr9OmpxuCMqlrGjDvC1sIaBwdCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T05:13:05.119812Z","bundle_sha256":"5efd7034d8a772919a3dd0deee80be0ee8538105a11e652f07618bd36d50331f"}}