{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:YMWLG5HBDH2XAY6BG7SA7CGGEH","short_pith_number":"pith:YMWLG5HB","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"},"canonical_sha256":"c32cb374e119f57063c137e40f88c621c7c9c6d5d399719064ef7f65bd30ae7e","source":{"kind":"arxiv","id":"1810.01009","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.01009","created_at":"2026-05-18T00:04:19Z"},{"alias_kind":"arxiv_version","alias_value":"1810.01009v1","created_at":"2026-05-18T00:04:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.01009","created_at":"2026-05-18T00:04:19Z"},{"alias_kind":"pith_short_12","alias_value":"YMWLG5HBDH2X","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_16","alias_value":"YMWLG5HBDH2XAY6B","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_8","alias_value":"YMWLG5HB","created_at":"2026-05-18T12:33:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:YMWLG5HBDH2XAY6BG7SA7CGGEH","target":"record","payload":{"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"},"canonical_sha256":"c32cb374e119f57063c137e40f88c621c7c9c6d5d399719064ef7f65bd30ae7e","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"},"source_kind":"arxiv","source_id":"1810.01009","source_version":1,"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:04:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bspl46d8/ApA4M2XymBQqYDfLFaqVvJeBJtIDhk2Q66/YEef4v87ERPtY4/XmLkL2eWdwQb1amuiOH0IuaFnDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T12:08:21.385472Z"},"content_sha256":"ef0cf91889f87408931a33e134b1886de9b07f6f3d1785ed55fa1d4189cd70cf","schema_version":"1.0","event_id":"sha256:ef0cf91889f87408931a33e134b1886de9b07f6f3d1785ed55fa1d4189cd70cf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:YMWLG5HBDH2XAY6BG7SA7CGGEH","target":"graph","payload":{"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"},"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:04:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gisi4mEOKgZ2N6slEoop4dy3ZwBLjMS7EMq9DmQ8jIhzuae16qBo0wi2xAPHnWGJx1Or9l/BP3igy7uoUKPfCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T12:08:21.386018Z"},"content_sha256":"5ddea835d3edcacfe77c03e8cae8de6a548b27371e797902ecbfe494c291f708","schema_version":"1.0","event_id":"sha256:5ddea835d3edcacfe77c03e8cae8de6a548b27371e797902ecbfe494c291f708"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YMWLG5HBDH2XAY6BG7SA7CGGEH/bundle.json","state_url":"https://pith.science/pith/YMWLG5HBDH2XAY6BG7SA7CGGEH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YMWLG5HBDH2XAY6BG7SA7CGGEH/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-05-30T12:08:21Z","links":{"resolver":"https://pith.science/pith/YMWLG5HBDH2XAY6BG7SA7CGGEH","bundle":"https://pith.science/pith/YMWLG5HBDH2XAY6BG7SA7CGGEH/bundle.json","state":"https://pith.science/pith/YMWLG5HBDH2XAY6BG7SA7CGGEH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YMWLG5HBDH2XAY6BG7SA7CGGEH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:YMWLG5HBDH2XAY6BG7SA7CGGEH","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":"b7bef3f5b63e54a9331307cb8266ab9afdb8519bae590521e709d0c48c66ff8e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-10-01T23:05:51Z","title_canon_sha256":"8ee69279e5b44b0a0877bd38b59cf0418f27f9e37493a87043c08270a5053620"},"schema_version":"1.0","source":{"id":"1810.01009","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.01009","created_at":"2026-05-18T00:04:19Z"},{"alias_kind":"arxiv_version","alias_value":"1810.01009v1","created_at":"2026-05-18T00:04:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.01009","created_at":"2026-05-18T00:04:19Z"},{"alias_kind":"pith_short_12","alias_value":"YMWLG5HBDH2X","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_16","alias_value":"YMWLG5HBDH2XAY6B","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_8","alias_value":"YMWLG5HB","created_at":"2026-05-18T12:33:04Z"}],"graph_snapshots":[{"event_id":"sha256:5ddea835d3edcacfe77c03e8cae8de6a548b27371e797902ecbfe494c291f708","target":"graph","created_at":"2026-05-18T00:04:19Z","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":"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","authors_text":"Boris Brimkov, Illya V. Hicks, Joshua Carlson, Logan Smith, Rutvik Patel","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-10-01T23:05:51Z","title":"Power domination throttling"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.01009","kind":"arxiv","version":1},"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:ef0cf91889f87408931a33e134b1886de9b07f6f3d1785ed55fa1d4189cd70cf","target":"record","created_at":"2026-05-18T00:04:19Z","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":"b7bef3f5b63e54a9331307cb8266ab9afdb8519bae590521e709d0c48c66ff8e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-10-01T23:05:51Z","title_canon_sha256":"8ee69279e5b44b0a0877bd38b59cf0418f27f9e37493a87043c08270a5053620"},"schema_version":"1.0","source":{"id":"1810.01009","kind":"arxiv","version":1}},"canonical_sha256":"c32cb374e119f57063c137e40f88c621c7c9c6d5d399719064ef7f65bd30ae7e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c32cb374e119f57063c137e40f88c621c7c9c6d5d399719064ef7f65bd30ae7e","first_computed_at":"2026-05-18T00:04:19.249988Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:04:19.249988Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qTIJe/2Bxkj8foOIrwcx5ZWoT7y7lOh+GdGrZtNzIx3XJ9C8YX7JfVN18ckI2fJSGuKnLpbMXAKO6sBc9i0qAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:04:19.250698Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.01009","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ef0cf91889f87408931a33e134b1886de9b07f6f3d1785ed55fa1d4189cd70cf","sha256:5ddea835d3edcacfe77c03e8cae8de6a548b27371e797902ecbfe494c291f708"],"state_sha256":"a5e93a9e09fa8c8d08ce36af43cb317491b8e54a29e0381ce9e234d59a71d831"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XQErcUHnwZkN9H1wwZLvlty8HoJv5xpSAEWsdE6umkOl9SgYKTwdI3zzJ/CGe2Z6rkqZs76ls/MM8F6Jt4HNAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T12:08:21.388387Z","bundle_sha256":"207bce949f79945ae27b00ad9b11536fbbc2df3a9de3552486a5f0cf40beedca"}}