{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:JSNF72LTWAE4ZH2U4CXLTJ2VI4","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":"fceb6ef08ba701115c2dcdf6a6fd0002729a021d44fba0042f4f9026bf1fcb37","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-10-03T14:34:47Z","title_canon_sha256":"9bbce0400f1140e5b697c57bc4f02474c4d7319951a253fdab1814da1c709278"},"schema_version":"1.0","source":{"id":"1410.0861","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.0861","created_at":"2026-05-18T02:18:40Z"},{"alias_kind":"arxiv_version","alias_value":"1410.0861v3","created_at":"2026-05-18T02:18:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.0861","created_at":"2026-05-18T02:18:40Z"},{"alias_kind":"pith_short_12","alias_value":"JSNF72LTWAE4","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_16","alias_value":"JSNF72LTWAE4ZH2U","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_8","alias_value":"JSNF72LT","created_at":"2026-05-18T12:28:35Z"}],"graph_snapshots":[{"event_id":"sha256:783d88a8691f877092d628626f0b47537f1182d239b24043cf560a4ba14c91e5","target":"graph","created_at":"2026-05-18T02:18:40Z","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":"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","authors_text":"Fr\\'ed\\'eric Maffray, Laetitia Lemoine, Louis Esperet","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-10-03T14:34:47Z","title":"Equitable partition of graphs into induced forests"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.0861","kind":"arxiv","version":3},"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:db5b9ff73f00fd7a46371152dc0ec1e46d5fc2aff6209eb1b80b6dce5dde47d8","target":"record","created_at":"2026-05-18T02:18:40Z","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":"fceb6ef08ba701115c2dcdf6a6fd0002729a021d44fba0042f4f9026bf1fcb37","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-10-03T14:34:47Z","title_canon_sha256":"9bbce0400f1140e5b697c57bc4f02474c4d7319951a253fdab1814da1c709278"},"schema_version":"1.0","source":{"id":"1410.0861","kind":"arxiv","version":3}},"canonical_sha256":"4c9a5fe973b009cc9f54e0aeb9a75547370d66942383fb426afc3882105babf9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4c9a5fe973b009cc9f54e0aeb9a75547370d66942383fb426afc3882105babf9","first_computed_at":"2026-05-18T02:18:40.795640Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:18:40.795640Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KQx1XsdLGb1LOUenMezulOJ0RHopfdgn6JtIdzdy/W6HxCjFYd4qdBu9C3hJok0tSoUKCsPVZKIasxKtuy6KCw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:18:40.796293Z","signed_message":"canonical_sha256_bytes"},"source_id":"1410.0861","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:db5b9ff73f00fd7a46371152dc0ec1e46d5fc2aff6209eb1b80b6dce5dde47d8","sha256:783d88a8691f877092d628626f0b47537f1182d239b24043cf560a4ba14c91e5"],"state_sha256":"bef47fabaea0fad731eaacddfd4ba75b89e4a5ea5625f0b9a4717b1206b51e65"}