{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:G3LLAHBJLQLNPX2NMIU6XODLUS","short_pith_number":"pith:G3LLAHBJ","schema_version":"1.0","canonical_sha256":"36d6b01c295c16d7df4d6229ebb86ba4bc9eff2452666d5da0f9fa0438bec861","source":{"kind":"arxiv","id":"1712.02388","version":1},"attestation_state":"computed","paper":{"title":"Connected power domination in graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Boris Brimkov, Derek Mikesell, Logan Smith","submitted_at":"2017-12-06T19:42:42Z","abstract_excerpt":"The study of power domination in graphs arises from the problem of placing a minimum number of measurement devices in an electrical network while monitoring the entire network. A power dominating set of a graph is a set of vertices from which every vertex in the graph can be observed, following a set of rules for power system monitoring. In this paper, we study the problem of finding a minimum power dominating set which is connected; the cardinality of such a set is called the connected power domination number of the graph. We show that the connected power domination number of a graph is NP-ha"},"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":"1712.02388","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-12-06T19:42:42Z","cross_cats_sorted":[],"title_canon_sha256":"e22661df9b8bd74c77001c3dbae2f15864a8fec8a87b1174ade96b7d75edecb8","abstract_canon_sha256":"a7d92e2f8cb868cef96d30c0deb75d29dcda6bc83ac88e740ca0abe8d9cde158"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:28:34.400828Z","signature_b64":"5bmlfwtuvsUtPc9/Pmf4EVcMqFfCER6VLRzAc/AFspAZ9lC5DPUGFPSaaDGd6RQlOh1B245Jmtvnb7XOHR/wBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"36d6b01c295c16d7df4d6229ebb86ba4bc9eff2452666d5da0f9fa0438bec861","last_reissued_at":"2026-05-18T00:28:34.400069Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:28:34.400069Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Connected power domination in graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Boris Brimkov, Derek Mikesell, Logan Smith","submitted_at":"2017-12-06T19:42:42Z","abstract_excerpt":"The study of power domination in graphs arises from the problem of placing a minimum number of measurement devices in an electrical network while monitoring the entire network. A power dominating set of a graph is a set of vertices from which every vertex in the graph can be observed, following a set of rules for power system monitoring. In this paper, we study the problem of finding a minimum power dominating set which is connected; the cardinality of such a set is called the connected power domination number of the graph. We show that the connected power domination number of a graph is NP-ha"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.02388","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1712.02388","created_at":"2026-05-18T00:28:34.400188+00:00"},{"alias_kind":"arxiv_version","alias_value":"1712.02388v1","created_at":"2026-05-18T00:28:34.400188+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.02388","created_at":"2026-05-18T00:28:34.400188+00:00"},{"alias_kind":"pith_short_12","alias_value":"G3LLAHBJLQLN","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_16","alias_value":"G3LLAHBJLQLNPX2N","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_8","alias_value":"G3LLAHBJ","created_at":"2026-05-18T12:31:15.632608+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/G3LLAHBJLQLNPX2NMIU6XODLUS","json":"https://pith.science/pith/G3LLAHBJLQLNPX2NMIU6XODLUS.json","graph_json":"https://pith.science/api/pith-number/G3LLAHBJLQLNPX2NMIU6XODLUS/graph.json","events_json":"https://pith.science/api/pith-number/G3LLAHBJLQLNPX2NMIU6XODLUS/events.json","paper":"https://pith.science/paper/G3LLAHBJ"},"agent_actions":{"view_html":"https://pith.science/pith/G3LLAHBJLQLNPX2NMIU6XODLUS","download_json":"https://pith.science/pith/G3LLAHBJLQLNPX2NMIU6XODLUS.json","view_paper":"https://pith.science/paper/G3LLAHBJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1712.02388&json=true","fetch_graph":"https://pith.science/api/pith-number/G3LLAHBJLQLNPX2NMIU6XODLUS/graph.json","fetch_events":"https://pith.science/api/pith-number/G3LLAHBJLQLNPX2NMIU6XODLUS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/G3LLAHBJLQLNPX2NMIU6XODLUS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/G3LLAHBJLQLNPX2NMIU6XODLUS/action/storage_attestation","attest_author":"https://pith.science/pith/G3LLAHBJLQLNPX2NMIU6XODLUS/action/author_attestation","sign_citation":"https://pith.science/pith/G3LLAHBJLQLNPX2NMIU6XODLUS/action/citation_signature","submit_replication":"https://pith.science/pith/G3LLAHBJLQLNPX2NMIU6XODLUS/action/replication_record"}},"created_at":"2026-05-18T00:28:34.400188+00:00","updated_at":"2026-05-18T00:28:34.400188+00:00"}