{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:UJUEXKRIIYME4ISA332RGNEO7U","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":"b091801f1bac67de6354cb1e25f2688baf839f046b0dd90f700dacd4ccd25f24","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-11-25T08:35:46Z","title_canon_sha256":"c27a7cc9e6b00846bdf08526d4a7f322bbb15103170f5970afa97ca2f7fcfff4"},"schema_version":"1.0","source":{"id":"1211.5742","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.5742","created_at":"2026-05-18T03:40:02Z"},{"alias_kind":"arxiv_version","alias_value":"1211.5742v1","created_at":"2026-05-18T03:40:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.5742","created_at":"2026-05-18T03:40:02Z"},{"alias_kind":"pith_short_12","alias_value":"UJUEXKRIIYME","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_16","alias_value":"UJUEXKRIIYME4ISA","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_8","alias_value":"UJUEXKRI","created_at":"2026-05-18T12:27:23Z"}],"graph_snapshots":[{"event_id":"sha256:fd18298f283c9e25b77cf49ec4a290214a03715051b294c2c119deed65260aa1","target":"graph","created_at":"2026-05-18T03:40:02Z","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$ a positive integer. The $p$-domination number $\\g_p(G)$ is the minimum cardinality of a set $D\\subseteq V$ with $|N_G(x)\\cap D|\\geq p$ for all $x\\in V\\setminus D$. 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)$. Recently, it was proved by Lu et al. that $r_p(T)\\leq p+1$ for a tree $T$ and $p\\geq 2$. In this paper, we characterize all trees attaining this upper bound for $p\\geq 3$.","authors_text":"Jun-Ming Xu, You Lu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-11-25T08:35:46Z","title":"Trees with Maximum p-Reinforcement Number"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.5742","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:526ad58f460f55664d5b84180c849715b113a740fd9ba9b52c7a6400c9750515","target":"record","created_at":"2026-05-18T03:40:02Z","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":"b091801f1bac67de6354cb1e25f2688baf839f046b0dd90f700dacd4ccd25f24","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-11-25T08:35:46Z","title_canon_sha256":"c27a7cc9e6b00846bdf08526d4a7f322bbb15103170f5970afa97ca2f7fcfff4"},"schema_version":"1.0","source":{"id":"1211.5742","kind":"arxiv","version":1}},"canonical_sha256":"a2684baa2846184e2240def513348efd03045d721348a502c967e19766a19f71","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a2684baa2846184e2240def513348efd03045d721348a502c967e19766a19f71","first_computed_at":"2026-05-18T03:40:02.072365Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:40:02.072365Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GvmeMxX4upR6dXDsT8FPbIJ79/njsiUFnFWI493tHIRKMJNMYPXEP8perejJ/+d4pmlOkF66rpZaztcPJKtJCw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:40:02.072838Z","signed_message":"canonical_sha256_bytes"},"source_id":"1211.5742","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:526ad58f460f55664d5b84180c849715b113a740fd9ba9b52c7a6400c9750515","sha256:fd18298f283c9e25b77cf49ec4a290214a03715051b294c2c119deed65260aa1"],"state_sha256":"2d881188c2b04525df35ab7892725b686cfdfd14e2b18b4668edc474b3748ebb"}