{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:WNJLRSPOHO43HQLTDSYWJHVUNM","short_pith_number":"pith:WNJLRSPO","schema_version":"1.0","canonical_sha256":"b352b8c9ee3bb9b3c1731cb1649eb46b1da0c13563f68d84ce1b90b3231d7272","source":{"kind":"arxiv","id":"1102.1169","version":1},"attestation_state":"computed","paper":{"title":"Destroying Non-Complete Regular Components in Graph Partitions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Landon Rabern","submitted_at":"2011-02-06T17:02:45Z","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."},"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":"1102.1169","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-02-06T17:02:45Z","cross_cats_sorted":[],"title_canon_sha256":"30a0bf0afb605f5b58e63ae0fcc0adbeed987f8671b732b0d2565534a8c389d6","abstract_canon_sha256":"86001efe10d3336c614a47f4a50671e03a0a2e18fd5ac06fd4676c88c72cce02"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:29:54.858386Z","signature_b64":"CC0XCV/0vhWUYhyzGAElql406M2cXmFRqCWGspt3KfffeW/179M0+z3y389An6cpdG+g+37jv5i4VpHe/0kXBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b352b8c9ee3bb9b3c1731cb1649eb46b1da0c13563f68d84ce1b90b3231d7272","last_reissued_at":"2026-05-18T04:29:54.857791Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:29:54.857791Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Destroying Non-Complete Regular Components in Graph Partitions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Landon Rabern","submitted_at":"2011-02-06T17:02:45Z","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."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.1169","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":"1102.1169","created_at":"2026-05-18T04:29:54.857867+00:00"},{"alias_kind":"arxiv_version","alias_value":"1102.1169v1","created_at":"2026-05-18T04:29:54.857867+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.1169","created_at":"2026-05-18T04:29:54.857867+00:00"},{"alias_kind":"pith_short_12","alias_value":"WNJLRSPOHO43","created_at":"2026-05-18T12:26:44.992195+00:00"},{"alias_kind":"pith_short_16","alias_value":"WNJLRSPOHO43HQLT","created_at":"2026-05-18T12:26:44.992195+00:00"},{"alias_kind":"pith_short_8","alias_value":"WNJLRSPO","created_at":"2026-05-18T12:26:44.992195+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/WNJLRSPOHO43HQLTDSYWJHVUNM","json":"https://pith.science/pith/WNJLRSPOHO43HQLTDSYWJHVUNM.json","graph_json":"https://pith.science/api/pith-number/WNJLRSPOHO43HQLTDSYWJHVUNM/graph.json","events_json":"https://pith.science/api/pith-number/WNJLRSPOHO43HQLTDSYWJHVUNM/events.json","paper":"https://pith.science/paper/WNJLRSPO"},"agent_actions":{"view_html":"https://pith.science/pith/WNJLRSPOHO43HQLTDSYWJHVUNM","download_json":"https://pith.science/pith/WNJLRSPOHO43HQLTDSYWJHVUNM.json","view_paper":"https://pith.science/paper/WNJLRSPO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1102.1169&json=true","fetch_graph":"https://pith.science/api/pith-number/WNJLRSPOHO43HQLTDSYWJHVUNM/graph.json","fetch_events":"https://pith.science/api/pith-number/WNJLRSPOHO43HQLTDSYWJHVUNM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WNJLRSPOHO43HQLTDSYWJHVUNM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WNJLRSPOHO43HQLTDSYWJHVUNM/action/storage_attestation","attest_author":"https://pith.science/pith/WNJLRSPOHO43HQLTDSYWJHVUNM/action/author_attestation","sign_citation":"https://pith.science/pith/WNJLRSPOHO43HQLTDSYWJHVUNM/action/citation_signature","submit_replication":"https://pith.science/pith/WNJLRSPOHO43HQLTDSYWJHVUNM/action/replication_record"}},"created_at":"2026-05-18T04:29:54.857867+00:00","updated_at":"2026-05-18T04:29:54.857867+00:00"}