{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:WNJLRSPOHO43HQLTDSYWJHVUNM","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":"86001efe10d3336c614a47f4a50671e03a0a2e18fd5ac06fd4676c88c72cce02","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-02-06T17:02:45Z","title_canon_sha256":"30a0bf0afb605f5b58e63ae0fcc0adbeed987f8671b732b0d2565534a8c389d6"},"schema_version":"1.0","source":{"id":"1102.1169","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.1169","created_at":"2026-05-18T04:29:54Z"},{"alias_kind":"arxiv_version","alias_value":"1102.1169v1","created_at":"2026-05-18T04:29:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.1169","created_at":"2026-05-18T04:29:54Z"},{"alias_kind":"pith_short_12","alias_value":"WNJLRSPOHO43","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_16","alias_value":"WNJLRSPOHO43HQLT","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_8","alias_value":"WNJLRSPO","created_at":"2026-05-18T12:26:44Z"}],"graph_snapshots":[{"event_id":"sha256:b4cf49d1fad6bce5911c2d2092ad6108d8c078aa713991935e68d9d519a9448d","target":"graph","created_at":"2026-05-18T04:29:54Z","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":"We prove that if $G$ is a graph and $r_1, ..., r_k \\in \\mathbb{Z}_{\\geq 0}$ such that $\\sum_{i=1}^k r_i \\geq \\Delta(G) + 2 - k$ then $V(G)$ can be partitioned into sets $V_1, ..., V_k$ such that $\\Delta(G[V_i]) \\leq r_i$ and $G[V_i]$ contains no non-complete $r_i$-regular components for each $1 \\leq i \\leq k$. In particular, the vertex set of any graph $G$ can be partitioned into $\\left \\lceil \\frac{\\Delta(G) + 2}{3} \\right \\rceil$ sets, each of which induces a disjoint union of triangles and paths.","authors_text":"Landon Rabern","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-02-06T17:02:45Z","title":"Destroying Non-Complete Regular Components in Graph Partitions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.1169","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:c62bd5bd87d781fb36c36637f298f69f3840f9aea62df39a652c95d9f42e3a9e","target":"record","created_at":"2026-05-18T04:29:54Z","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":"86001efe10d3336c614a47f4a50671e03a0a2e18fd5ac06fd4676c88c72cce02","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-02-06T17:02:45Z","title_canon_sha256":"30a0bf0afb605f5b58e63ae0fcc0adbeed987f8671b732b0d2565534a8c389d6"},"schema_version":"1.0","source":{"id":"1102.1169","kind":"arxiv","version":1}},"canonical_sha256":"b352b8c9ee3bb9b3c1731cb1649eb46b1da0c13563f68d84ce1b90b3231d7272","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b352b8c9ee3bb9b3c1731cb1649eb46b1da0c13563f68d84ce1b90b3231d7272","first_computed_at":"2026-05-18T04:29:54.857791Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:29:54.857791Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CC0XCV/0vhWUYhyzGAElql406M2cXmFRqCWGspt3KfffeW/179M0+z3y389An6cpdG+g+37jv5i4VpHe/0kXBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:29:54.858386Z","signed_message":"canonical_sha256_bytes"},"source_id":"1102.1169","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c62bd5bd87d781fb36c36637f298f69f3840f9aea62df39a652c95d9f42e3a9e","sha256:b4cf49d1fad6bce5911c2d2092ad6108d8c078aa713991935e68d9d519a9448d"],"state_sha256":"523ed221d33d882421ac6f9d90bb82960f6307831c00d3d592d29186f1de847c"}