{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:PLPN3EEPMFLC7UXG4LPR4PQ3IT","short_pith_number":"pith:PLPN3EEP","schema_version":"1.0","canonical_sha256":"7adedd908f61562fd2e6e2df1e3e1b44e6476605edf2f56383040a70c5514648","source":{"kind":"arxiv","id":"1204.4013","version":1},"attestation_state":"computed","paper":{"title":"On the p-reinforcement and the complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Fu-Tao Hu, Jun-Ming Xu, You Lu","submitted_at":"2012-04-18T08:28:03Z","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"},"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":"1204.4013","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-04-18T08:28:03Z","cross_cats_sorted":[],"title_canon_sha256":"74e597c5e43cd92075f38896cfdb9555a62e66b6797886b1daec74bd15d49390","abstract_canon_sha256":"e0a25d2808a563179102e9969cbe411f2ff984961dce07a012f6ed597fb40f37"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:57:37.991795Z","signature_b64":"E49HF4+KKd5lVsSZjezhex2moR9h4xJdqI/qnHqnpmcQ+VmULl1yAOY2qIWmHY8kml9SCzJs5SEjjmizAjMqCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7adedd908f61562fd2e6e2df1e3e1b44e6476605edf2f56383040a70c5514648","last_reissued_at":"2026-05-18T03:57:37.991096Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:57:37.991096Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the p-reinforcement and the complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Fu-Tao Hu, Jun-Ming Xu, You Lu","submitted_at":"2012-04-18T08:28:03Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.4013","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":"1204.4013","created_at":"2026-05-18T03:57:37.991215+00:00"},{"alias_kind":"arxiv_version","alias_value":"1204.4013v1","created_at":"2026-05-18T03:57:37.991215+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.4013","created_at":"2026-05-18T03:57:37.991215+00:00"},{"alias_kind":"pith_short_12","alias_value":"PLPN3EEPMFLC","created_at":"2026-05-18T12:27:18.751474+00:00"},{"alias_kind":"pith_short_16","alias_value":"PLPN3EEPMFLC7UXG","created_at":"2026-05-18T12:27:18.751474+00:00"},{"alias_kind":"pith_short_8","alias_value":"PLPN3EEP","created_at":"2026-05-18T12:27:18.751474+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/PLPN3EEPMFLC7UXG4LPR4PQ3IT","json":"https://pith.science/pith/PLPN3EEPMFLC7UXG4LPR4PQ3IT.json","graph_json":"https://pith.science/api/pith-number/PLPN3EEPMFLC7UXG4LPR4PQ3IT/graph.json","events_json":"https://pith.science/api/pith-number/PLPN3EEPMFLC7UXG4LPR4PQ3IT/events.json","paper":"https://pith.science/paper/PLPN3EEP"},"agent_actions":{"view_html":"https://pith.science/pith/PLPN3EEPMFLC7UXG4LPR4PQ3IT","download_json":"https://pith.science/pith/PLPN3EEPMFLC7UXG4LPR4PQ3IT.json","view_paper":"https://pith.science/paper/PLPN3EEP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1204.4013&json=true","fetch_graph":"https://pith.science/api/pith-number/PLPN3EEPMFLC7UXG4LPR4PQ3IT/graph.json","fetch_events":"https://pith.science/api/pith-number/PLPN3EEPMFLC7UXG4LPR4PQ3IT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PLPN3EEPMFLC7UXG4LPR4PQ3IT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PLPN3EEPMFLC7UXG4LPR4PQ3IT/action/storage_attestation","attest_author":"https://pith.science/pith/PLPN3EEPMFLC7UXG4LPR4PQ3IT/action/author_attestation","sign_citation":"https://pith.science/pith/PLPN3EEPMFLC7UXG4LPR4PQ3IT/action/citation_signature","submit_replication":"https://pith.science/pith/PLPN3EEPMFLC7UXG4LPR4PQ3IT/action/replication_record"}},"created_at":"2026-05-18T03:57:37.991215+00:00","updated_at":"2026-05-18T03:57:37.991215+00:00"}