{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:L64S3OF6ZI26PTH6KOCJ4VFRWV","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":"646f1220f874c6a49f3b0e5ae869471eddc640936218764241907b952ac5cb1e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-08-08T03:18:21Z","title_canon_sha256":"ec6cf4b8469b5a0b0853142a84780b84318ef6fa71a9618c7d58ce68eb9aa1f9"},"schema_version":"1.0","source":{"id":"1808.02613","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.02613","created_at":"2026-05-18T00:08:34Z"},{"alias_kind":"arxiv_version","alias_value":"1808.02613v1","created_at":"2026-05-18T00:08:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.02613","created_at":"2026-05-18T00:08:34Z"},{"alias_kind":"pith_short_12","alias_value":"L64S3OF6ZI26","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"L64S3OF6ZI26PTH6","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"L64S3OF6","created_at":"2026-05-18T12:32:33Z"}],"graph_snapshots":[{"event_id":"sha256:8afb447c39148150583df6cdffc55d5765bb2bd453258f2d3e503d0ad4815022","target":"graph","created_at":"2026-05-18T00:08:34Z","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":"In this paper, we first show that the power domination number of a connected $4$-regular claw-free graph on $n$ vertices is at most $\\frac{n+1}{5}$, and the bound is sharp. The statement partly disprove the conjecture presented by Dorbec et al. in SIAM J. Discrete Math., 27:1559-1574, 2013. Then we present a dynamic programming style linear-time algorithm for weighted power domination problem in trees.","authors_text":"Bing Wang, Changhong Lu, Rui Mao","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-08-08T03:18:21Z","title":"Power domination in regular claw-free graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.02613","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:df296552668ee4cc5fdb254c884be780d5f92a5953b0378e65c98c6cabc3ced7","target":"record","created_at":"2026-05-18T00:08:34Z","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":"646f1220f874c6a49f3b0e5ae869471eddc640936218764241907b952ac5cb1e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-08-08T03:18:21Z","title_canon_sha256":"ec6cf4b8469b5a0b0853142a84780b84318ef6fa71a9618c7d58ce68eb9aa1f9"},"schema_version":"1.0","source":{"id":"1808.02613","kind":"arxiv","version":1}},"canonical_sha256":"5fb92db8beca35e7ccfe53849e54b1b5767bff562abfcbcb20ab4a375d139681","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5fb92db8beca35e7ccfe53849e54b1b5767bff562abfcbcb20ab4a375d139681","first_computed_at":"2026-05-18T00:08:34.835218Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:08:34.835218Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tVHaafMC9IP+ltWqDgQs7xK94dKEixiRBPgIxGce3Sr+aklBwExSf4pD+ejjBn1FyW3DQDFZNA29/cIz9ittBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:08:34.835904Z","signed_message":"canonical_sha256_bytes"},"source_id":"1808.02613","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:df296552668ee4cc5fdb254c884be780d5f92a5953b0378e65c98c6cabc3ced7","sha256:8afb447c39148150583df6cdffc55d5765bb2bd453258f2d3e503d0ad4815022"],"state_sha256":"22bbb793ce7c465e89e3bca509aa5ee7fe9f55a3e0c83051b9559e007a20c372"}