{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:OSITF3MEJGDD4GK6I6B3WFXYEA","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":"4fa08382f61d5d7e981be56394772e515a252310fb13f96b5f7b9732382e6f37","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-01-07T12:58:25Z","title_canon_sha256":"80561f59c84caf3b14a83b512b98bec5e1d33668055810f91eec17d10bcfe4ff"},"schema_version":"1.0","source":{"id":"1601.01523","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.01523","created_at":"2026-05-18T01:23:13Z"},{"alias_kind":"arxiv_version","alias_value":"1601.01523v1","created_at":"2026-05-18T01:23:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.01523","created_at":"2026-05-18T01:23:13Z"},{"alias_kind":"pith_short_12","alias_value":"OSITF3MEJGDD","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"OSITF3MEJGDD4GK6","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"OSITF3ME","created_at":"2026-05-18T12:30:36Z"}],"graph_snapshots":[{"event_id":"sha256:03a7b72bce70806d069d56caab1cc89d9c8a4d1d9b2768610081b184007b4a25","target":"graph","created_at":"2026-05-18T01:23:13Z","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 $({\\cal F},{\\cal F}_d)$-partition of a graph is a vertex-partition into two sets $F$ and $F_d$ such that the graph induced by $F$ is a forest and the one induced by $F_d$ is a forest with maximum degree at most $d$. We prove that every triangle-free planar graph admits an $({\\cal F},{\\cal F}_5)$-partition. Moreover we show that if for some integer $d$ there exists a triangle-free planar graph that does not admit an $({\\cal F},{\\cal F}_d)$-partition, then it is an NP-complete problem to decide whether a triangle-free planar graph admits such a partition.","authors_text":"Alexandre Pinlou, Fran\\c{c}ois Dross, Mickael Montassier","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-01-07T12:58:25Z","title":"Partitioning a triangle-free planar graph into a forest and a forest of bounded degree"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.01523","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:41ca4f5bedb18887c5d4d50097206a509410d45e65df6334fe20a7ca4dc7744c","target":"record","created_at":"2026-05-18T01:23:13Z","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":"4fa08382f61d5d7e981be56394772e515a252310fb13f96b5f7b9732382e6f37","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-01-07T12:58:25Z","title_canon_sha256":"80561f59c84caf3b14a83b512b98bec5e1d33668055810f91eec17d10bcfe4ff"},"schema_version":"1.0","source":{"id":"1601.01523","kind":"arxiv","version":1}},"canonical_sha256":"749132ed8449863e195e4783bb16f82013b9ccf15fbc93d6bc3462d3f4753983","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"749132ed8449863e195e4783bb16f82013b9ccf15fbc93d6bc3462d3f4753983","first_computed_at":"2026-05-18T01:23:13.397130Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:23:13.397130Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Po6keLqZCR+PwKT3yxsfORuh5GaEFYLoAU44xGiavXHHAh5tzMbjJ5pVbh67hw6MfNOf8iHoLpPEbQkglDkhDA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:23:13.397773Z","signed_message":"canonical_sha256_bytes"},"source_id":"1601.01523","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:41ca4f5bedb18887c5d4d50097206a509410d45e65df6334fe20a7ca4dc7744c","sha256:03a7b72bce70806d069d56caab1cc89d9c8a4d1d9b2768610081b184007b4a25"],"state_sha256":"62fe0f2d7880afb96ee4953826acaa456bc07958639a01b0721265ab3e0bc395"}