{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:YMWLG5HBDH2XAY6BG7SA7CGGEH","short_pith_number":"pith:YMWLG5HB","schema_version":"1.0","canonical_sha256":"c32cb374e119f57063c137e40f88c621c7c9c6d5d399719064ef7f65bd30ae7e","source":{"kind":"arxiv","id":"1810.01009","version":1},"attestation_state":"computed","paper":{"title":"Power domination throttling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Boris Brimkov, Illya V. Hicks, Joshua Carlson, Logan Smith, Rutvik Patel","submitted_at":"2018-10-01T23:05:51Z","abstract_excerpt":"A power dominating set of a graph $G=(V,E)$ is a set $S\\subset V$ that colors every vertex of $G$ according to the following rules: in the first timestep, every vertex in $N[S]$ becomes colored; in each subsequent timestep, every vertex which is the only non-colored neighbor of some colored vertex becomes colored. The power domination throttling number of $G$ is the minimum sum of the size of a power dominating set $S$ and the number of timesteps it takes $S$ to color the graph. In this paper, we determine the complexity of power domination throttling and give some tools for computing and boun"},"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":"1810.01009","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-10-01T23:05:51Z","cross_cats_sorted":[],"title_canon_sha256":"8ee69279e5b44b0a0877bd38b59cf0418f27f9e37493a87043c08270a5053620","abstract_canon_sha256":"b7bef3f5b63e54a9331307cb8266ab9afdb8519bae590521e709d0c48c66ff8e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:04:19.250698Z","signature_b64":"qTIJe/2Bxkj8foOIrwcx5ZWoT7y7lOh+GdGrZtNzIx3XJ9C8YX7JfVN18ckI2fJSGuKnLpbMXAKO6sBc9i0qAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c32cb374e119f57063c137e40f88c621c7c9c6d5d399719064ef7f65bd30ae7e","last_reissued_at":"2026-05-18T00:04:19.249988Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:04:19.249988Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Power domination throttling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Boris Brimkov, Illya V. Hicks, Joshua Carlson, Logan Smith, Rutvik Patel","submitted_at":"2018-10-01T23:05:51Z","abstract_excerpt":"A power dominating set of a graph $G=(V,E)$ is a set $S\\subset V$ that colors every vertex of $G$ according to the following rules: in the first timestep, every vertex in $N[S]$ becomes colored; in each subsequent timestep, every vertex which is the only non-colored neighbor of some colored vertex becomes colored. The power domination throttling number of $G$ is the minimum sum of the size of a power dominating set $S$ and the number of timesteps it takes $S$ to color the graph. In this paper, we determine the complexity of power domination throttling and give some tools for computing and boun"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.01009","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":"1810.01009","created_at":"2026-05-18T00:04:19.250099+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.01009v1","created_at":"2026-05-18T00:04:19.250099+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.01009","created_at":"2026-05-18T00:04:19.250099+00:00"},{"alias_kind":"pith_short_12","alias_value":"YMWLG5HBDH2X","created_at":"2026-05-18T12:33:04.347982+00:00"},{"alias_kind":"pith_short_16","alias_value":"YMWLG5HBDH2XAY6B","created_at":"2026-05-18T12:33:04.347982+00:00"},{"alias_kind":"pith_short_8","alias_value":"YMWLG5HB","created_at":"2026-05-18T12:33:04.347982+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/YMWLG5HBDH2XAY6BG7SA7CGGEH","json":"https://pith.science/pith/YMWLG5HBDH2XAY6BG7SA7CGGEH.json","graph_json":"https://pith.science/api/pith-number/YMWLG5HBDH2XAY6BG7SA7CGGEH/graph.json","events_json":"https://pith.science/api/pith-number/YMWLG5HBDH2XAY6BG7SA7CGGEH/events.json","paper":"https://pith.science/paper/YMWLG5HB"},"agent_actions":{"view_html":"https://pith.science/pith/YMWLG5HBDH2XAY6BG7SA7CGGEH","download_json":"https://pith.science/pith/YMWLG5HBDH2XAY6BG7SA7CGGEH.json","view_paper":"https://pith.science/paper/YMWLG5HB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.01009&json=true","fetch_graph":"https://pith.science/api/pith-number/YMWLG5HBDH2XAY6BG7SA7CGGEH/graph.json","fetch_events":"https://pith.science/api/pith-number/YMWLG5HBDH2XAY6BG7SA7CGGEH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YMWLG5HBDH2XAY6BG7SA7CGGEH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YMWLG5HBDH2XAY6BG7SA7CGGEH/action/storage_attestation","attest_author":"https://pith.science/pith/YMWLG5HBDH2XAY6BG7SA7CGGEH/action/author_attestation","sign_citation":"https://pith.science/pith/YMWLG5HBDH2XAY6BG7SA7CGGEH/action/citation_signature","submit_replication":"https://pith.science/pith/YMWLG5HBDH2XAY6BG7SA7CGGEH/action/replication_record"}},"created_at":"2026-05-18T00:04:19.250099+00:00","updated_at":"2026-05-18T00:04:19.250099+00:00"}