{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:JSNF72LTWAE4ZH2U4CXLTJ2VI4","short_pith_number":"pith:JSNF72LT","schema_version":"1.0","canonical_sha256":"4c9a5fe973b009cc9f54e0aeb9a75547370d66942383fb426afc3882105babf9","source":{"kind":"arxiv","id":"1410.0861","version":3},"attestation_state":"computed","paper":{"title":"Equitable partition of graphs into induced forests","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Fr\\'ed\\'eric Maffray, Laetitia Lemoine, Louis Esperet","submitted_at":"2014-10-03T14:34:47Z","abstract_excerpt":"An equitable partition of a graph $G$ is a partition of the vertex-set of $G$ such that the sizes of any two parts differ by at most one. We show that every graph with an acyclic coloring with at most $k$ colors can be equitably partitioned into $k-1$ induced forests. We also prove that for any integers $d\\ge 1$ and $k\\ge 3^{d-1}$, any $d$-degenerate graph can be equitably partitioned into $k$ induced forests.\n  Each of these results implies the existence of a constant $c$ such that for any $k \\ge c$, any planar graph has an equitable partition into $k$ induced forests. This was conjectured by"},"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":"1410.0861","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-10-03T14:34:47Z","cross_cats_sorted":[],"title_canon_sha256":"9bbce0400f1140e5b697c57bc4f02474c4d7319951a253fdab1814da1c709278","abstract_canon_sha256":"fceb6ef08ba701115c2dcdf6a6fd0002729a021d44fba0042f4f9026bf1fcb37"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:18:40.796293Z","signature_b64":"KQx1XsdLGb1LOUenMezulOJ0RHopfdgn6JtIdzdy/W6HxCjFYd4qdBu9C3hJok0tSoUKCsPVZKIasxKtuy6KCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4c9a5fe973b009cc9f54e0aeb9a75547370d66942383fb426afc3882105babf9","last_reissued_at":"2026-05-18T02:18:40.795640Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:18:40.795640Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Equitable partition of graphs into induced forests","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Fr\\'ed\\'eric Maffray, Laetitia Lemoine, Louis Esperet","submitted_at":"2014-10-03T14:34:47Z","abstract_excerpt":"An equitable partition of a graph $G$ is a partition of the vertex-set of $G$ such that the sizes of any two parts differ by at most one. We show that every graph with an acyclic coloring with at most $k$ colors can be equitably partitioned into $k-1$ induced forests. We also prove that for any integers $d\\ge 1$ and $k\\ge 3^{d-1}$, any $d$-degenerate graph can be equitably partitioned into $k$ induced forests.\n  Each of these results implies the existence of a constant $c$ such that for any $k \\ge c$, any planar graph has an equitable partition into $k$ induced forests. This was conjectured by"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.0861","kind":"arxiv","version":3},"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":"1410.0861","created_at":"2026-05-18T02:18:40.795777+00:00"},{"alias_kind":"arxiv_version","alias_value":"1410.0861v3","created_at":"2026-05-18T02:18:40.795777+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.0861","created_at":"2026-05-18T02:18:40.795777+00:00"},{"alias_kind":"pith_short_12","alias_value":"JSNF72LTWAE4","created_at":"2026-05-18T12:28:35.611951+00:00"},{"alias_kind":"pith_short_16","alias_value":"JSNF72LTWAE4ZH2U","created_at":"2026-05-18T12:28:35.611951+00:00"},{"alias_kind":"pith_short_8","alias_value":"JSNF72LT","created_at":"2026-05-18T12:28:35.611951+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/JSNF72LTWAE4ZH2U4CXLTJ2VI4","json":"https://pith.science/pith/JSNF72LTWAE4ZH2U4CXLTJ2VI4.json","graph_json":"https://pith.science/api/pith-number/JSNF72LTWAE4ZH2U4CXLTJ2VI4/graph.json","events_json":"https://pith.science/api/pith-number/JSNF72LTWAE4ZH2U4CXLTJ2VI4/events.json","paper":"https://pith.science/paper/JSNF72LT"},"agent_actions":{"view_html":"https://pith.science/pith/JSNF72LTWAE4ZH2U4CXLTJ2VI4","download_json":"https://pith.science/pith/JSNF72LTWAE4ZH2U4CXLTJ2VI4.json","view_paper":"https://pith.science/paper/JSNF72LT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1410.0861&json=true","fetch_graph":"https://pith.science/api/pith-number/JSNF72LTWAE4ZH2U4CXLTJ2VI4/graph.json","fetch_events":"https://pith.science/api/pith-number/JSNF72LTWAE4ZH2U4CXLTJ2VI4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JSNF72LTWAE4ZH2U4CXLTJ2VI4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JSNF72LTWAE4ZH2U4CXLTJ2VI4/action/storage_attestation","attest_author":"https://pith.science/pith/JSNF72LTWAE4ZH2U4CXLTJ2VI4/action/author_attestation","sign_citation":"https://pith.science/pith/JSNF72LTWAE4ZH2U4CXLTJ2VI4/action/citation_signature","submit_replication":"https://pith.science/pith/JSNF72LTWAE4ZH2U4CXLTJ2VI4/action/replication_record"}},"created_at":"2026-05-18T02:18:40.795777+00:00","updated_at":"2026-05-18T02:18:40.795777+00:00"}