{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:PLPN3EEPMFLC7UXG4LPR4PQ3IT","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":"e0a25d2808a563179102e9969cbe411f2ff984961dce07a012f6ed597fb40f37","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-04-18T08:28:03Z","title_canon_sha256":"74e597c5e43cd92075f38896cfdb9555a62e66b6797886b1daec74bd15d49390"},"schema_version":"1.0","source":{"id":"1204.4013","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.4013","created_at":"2026-05-18T03:57:37Z"},{"alias_kind":"arxiv_version","alias_value":"1204.4013v1","created_at":"2026-05-18T03:57:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.4013","created_at":"2026-05-18T03:57:37Z"},{"alias_kind":"pith_short_12","alias_value":"PLPN3EEPMFLC","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_16","alias_value":"PLPN3EEPMFLC7UXG","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_8","alias_value":"PLPN3EEP","created_at":"2026-05-18T12:27:18Z"}],"graph_snapshots":[{"event_id":"sha256:a4b54b8464624f60a280d8980dedeb5a7cb16ddd1103884a2fca8faf48419a25","target":"graph","created_at":"2026-05-18T03:57:37Z","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":"Let $G=(V,E)$ be a graph and $p$ be a positive integer. A subset $S\\subseteq V$ is called a $p$-dominating set if each vertex not in $S$ has at least $p$ neighbors in $S$. The $p$-domination number $\\g_p(G)$ is the size of a smallest $p$-dominating set of $G$. The $p$-reinforcement number $r_p(G)$ is the smallest number of edges whose addition to $G$ results in a graph $G'$ with $\\g_p(G')<\\g_p(G)$. In this paper, we give an original study on the $p$-reinforcement, determine $r_p(G)$ for some graphs such as paths, cycles and complete $t$-partite graphs, and establish some upper bounds of $r_p(G","authors_text":"Fu-Tao Hu, Jun-Ming Xu, You Lu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-04-18T08:28:03Z","title":"On the p-reinforcement and the complexity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.4013","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:2e92f79432af3c44f2b86b50aae6c7f5a5b8335b7622cf9bec574bfc5b46738a","target":"record","created_at":"2026-05-18T03:57:37Z","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":"e0a25d2808a563179102e9969cbe411f2ff984961dce07a012f6ed597fb40f37","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-04-18T08:28:03Z","title_canon_sha256":"74e597c5e43cd92075f38896cfdb9555a62e66b6797886b1daec74bd15d49390"},"schema_version":"1.0","source":{"id":"1204.4013","kind":"arxiv","version":1}},"canonical_sha256":"7adedd908f61562fd2e6e2df1e3e1b44e6476605edf2f56383040a70c5514648","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7adedd908f61562fd2e6e2df1e3e1b44e6476605edf2f56383040a70c5514648","first_computed_at":"2026-05-18T03:57:37.991096Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:57:37.991096Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"E49HF4+KKd5lVsSZjezhex2moR9h4xJdqI/qnHqnpmcQ+VmULl1yAOY2qIWmHY8kml9SCzJs5SEjjmizAjMqCg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:57:37.991795Z","signed_message":"canonical_sha256_bytes"},"source_id":"1204.4013","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2e92f79432af3c44f2b86b50aae6c7f5a5b8335b7622cf9bec574bfc5b46738a","sha256:a4b54b8464624f60a280d8980dedeb5a7cb16ddd1103884a2fca8faf48419a25"],"state_sha256":"4ecf7315b2ffc8fde71c2954e83add8cf1021dcde0885342488ba0c32b83f9ed"}