{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:6TPDMXUAX7LOZURRHA6CUNHPBD","short_pith_number":"pith:6TPDMXUA","schema_version":"1.0","canonical_sha256":"f4de365e80bfd6ecd231383c2a34ef08d594f6fbc106a94a76c77765901d2c89","source":{"kind":"arxiv","id":"1507.02815","version":1},"attestation_state":"computed","paper":{"title":"Splitting Planar Graphs of Girth 6 into Two Linear Forests with Short Paths","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Maria Axenovich, Pascal Weiner, Torsten Ueckerdt","submitted_at":"2015-07-10T09:15:59Z","abstract_excerpt":"Recently, Borodin, Kostochka, and Yancey (On $1$-improper $2$-coloring of sparse graphs. Discrete Mathematics, 313(22), 2013) showed that the vertices of each planar graph of girth at least $7$ can be $2$-colored so that each color class induces a subgraph of a matching. We prove that any planar graph of girth at least $6$ admits a vertex coloring in $2$ colors such that each monochromatic component is a path of length at most $14$. Moreover, we show a list version of this result. On the other hand, for each positive integer $t\\geq 3$, we construct a planar graph of girth $4$ such that in any "},"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":"1507.02815","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-07-10T09:15:59Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"3e871ba65f3bfdb83afcbc5f27a8448f82fdd17ddc4e7f9a6349d08217a00940","abstract_canon_sha256":"59f521e37bf146163bac597570c24a0c3de75de3b77ef8f49d074811f293f8a0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:37:03.139041Z","signature_b64":"NO2e/dFIL1G6CY7pqmAm5WmrvipCN7o0AFAV7O9s6RP9z6grvH76ao1KON0vEVCztuOHp4rCIEDnoKZu9OJIAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f4de365e80bfd6ecd231383c2a34ef08d594f6fbc106a94a76c77765901d2c89","last_reissued_at":"2026-05-18T01:37:03.138498Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:37:03.138498Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Splitting Planar Graphs of Girth 6 into Two Linear Forests with Short Paths","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Maria Axenovich, Pascal Weiner, Torsten Ueckerdt","submitted_at":"2015-07-10T09:15:59Z","abstract_excerpt":"Recently, Borodin, Kostochka, and Yancey (On $1$-improper $2$-coloring of sparse graphs. Discrete Mathematics, 313(22), 2013) showed that the vertices of each planar graph of girth at least $7$ can be $2$-colored so that each color class induces a subgraph of a matching. We prove that any planar graph of girth at least $6$ admits a vertex coloring in $2$ colors such that each monochromatic component is a path of length at most $14$. Moreover, we show a list version of this result. On the other hand, for each positive integer $t\\geq 3$, we construct a planar graph of girth $4$ such that in any "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.02815","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":"1507.02815","created_at":"2026-05-18T01:37:03.138581+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.02815v1","created_at":"2026-05-18T01:37:03.138581+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.02815","created_at":"2026-05-18T01:37:03.138581+00:00"},{"alias_kind":"pith_short_12","alias_value":"6TPDMXUAX7LO","created_at":"2026-05-18T12:29:07.941421+00:00"},{"alias_kind":"pith_short_16","alias_value":"6TPDMXUAX7LOZURR","created_at":"2026-05-18T12:29:07.941421+00:00"},{"alias_kind":"pith_short_8","alias_value":"6TPDMXUA","created_at":"2026-05-18T12:29:07.941421+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/6TPDMXUAX7LOZURRHA6CUNHPBD","json":"https://pith.science/pith/6TPDMXUAX7LOZURRHA6CUNHPBD.json","graph_json":"https://pith.science/api/pith-number/6TPDMXUAX7LOZURRHA6CUNHPBD/graph.json","events_json":"https://pith.science/api/pith-number/6TPDMXUAX7LOZURRHA6CUNHPBD/events.json","paper":"https://pith.science/paper/6TPDMXUA"},"agent_actions":{"view_html":"https://pith.science/pith/6TPDMXUAX7LOZURRHA6CUNHPBD","download_json":"https://pith.science/pith/6TPDMXUAX7LOZURRHA6CUNHPBD.json","view_paper":"https://pith.science/paper/6TPDMXUA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.02815&json=true","fetch_graph":"https://pith.science/api/pith-number/6TPDMXUAX7LOZURRHA6CUNHPBD/graph.json","fetch_events":"https://pith.science/api/pith-number/6TPDMXUAX7LOZURRHA6CUNHPBD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6TPDMXUAX7LOZURRHA6CUNHPBD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6TPDMXUAX7LOZURRHA6CUNHPBD/action/storage_attestation","attest_author":"https://pith.science/pith/6TPDMXUAX7LOZURRHA6CUNHPBD/action/author_attestation","sign_citation":"https://pith.science/pith/6TPDMXUAX7LOZURRHA6CUNHPBD/action/citation_signature","submit_replication":"https://pith.science/pith/6TPDMXUAX7LOZURRHA6CUNHPBD/action/replication_record"}},"created_at":"2026-05-18T01:37:03.138581+00:00","updated_at":"2026-05-18T01:37:03.138581+00:00"}