{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:3GEBZWO3TUXWCWCRBDQZKV7EMN","short_pith_number":"pith:3GEBZWO3","schema_version":"1.0","canonical_sha256":"d9881cd9db9d2f61585108e19557e4636f9cb63be709c2332d2bd12ad5ea9c22","source":{"kind":"arxiv","id":"1710.02411","version":2},"attestation_state":"computed","paper":{"title":"Decomposing $4$-connected planar triangulations into two trees and one path","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Kolja Knauer, Torsten Ueckerdt","submitted_at":"2017-10-06T14:02:23Z","abstract_excerpt":"Refining a classical proof of Whitney, we show that any $4$-connected planar triangulation can be decomposed into a Hamiltonian path and two trees.\n  Therefore, every $4$-connected planar graph decomposes into three forests, one having maximum degree at most $2$.\n  We use this result to show that any Hamiltonian planar triangulation can be decomposed into two trees and one spanning tree of maximum degree at most $3$.\n  These decompositions improve the result of Gon\\c{c}alves [Covering planar graphs with forests, one having bounded maximum degree. J. Comb. Theory, Ser. B, 100(6):729--739, 2010]"},"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":"1710.02411","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-10-06T14:02:23Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"bd2f18076dd04c6cddefd13b46fd463d3d0ca92e0bb5f3e7a1ad258bdf908f80","abstract_canon_sha256":"6890abf9a2eaa6bd84f0500fcbf84684ca0508e044348d38c757625e0f9159c0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:18:00.071705Z","signature_b64":"RjCj7VZCcoM2iPUThFG1jUodHaf2H0U1wSsL5hBJ0XS8Sr3+lt9yYy0cR7yzoVB8I7sYIKD/MzHkW474o/RrAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d9881cd9db9d2f61585108e19557e4636f9cb63be709c2332d2bd12ad5ea9c22","last_reissued_at":"2026-05-18T00:18:00.071125Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:18:00.071125Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Decomposing $4$-connected planar triangulations into two trees and one path","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Kolja Knauer, Torsten Ueckerdt","submitted_at":"2017-10-06T14:02:23Z","abstract_excerpt":"Refining a classical proof of Whitney, we show that any $4$-connected planar triangulation can be decomposed into a Hamiltonian path and two trees.\n  Therefore, every $4$-connected planar graph decomposes into three forests, one having maximum degree at most $2$.\n  We use this result to show that any Hamiltonian planar triangulation can be decomposed into two trees and one spanning tree of maximum degree at most $3$.\n  These decompositions improve the result of Gon\\c{c}alves [Covering planar graphs with forests, one having bounded maximum degree. J. Comb. Theory, Ser. B, 100(6):729--739, 2010]"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.02411","kind":"arxiv","version":2},"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":"1710.02411","created_at":"2026-05-18T00:18:00.071195+00:00"},{"alias_kind":"arxiv_version","alias_value":"1710.02411v2","created_at":"2026-05-18T00:18:00.071195+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.02411","created_at":"2026-05-18T00:18:00.071195+00:00"},{"alias_kind":"pith_short_12","alias_value":"3GEBZWO3TUXW","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_16","alias_value":"3GEBZWO3TUXWCWCR","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_8","alias_value":"3GEBZWO3","created_at":"2026-05-18T12:30:58.224056+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/3GEBZWO3TUXWCWCRBDQZKV7EMN","json":"https://pith.science/pith/3GEBZWO3TUXWCWCRBDQZKV7EMN.json","graph_json":"https://pith.science/api/pith-number/3GEBZWO3TUXWCWCRBDQZKV7EMN/graph.json","events_json":"https://pith.science/api/pith-number/3GEBZWO3TUXWCWCRBDQZKV7EMN/events.json","paper":"https://pith.science/paper/3GEBZWO3"},"agent_actions":{"view_html":"https://pith.science/pith/3GEBZWO3TUXWCWCRBDQZKV7EMN","download_json":"https://pith.science/pith/3GEBZWO3TUXWCWCRBDQZKV7EMN.json","view_paper":"https://pith.science/paper/3GEBZWO3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1710.02411&json=true","fetch_graph":"https://pith.science/api/pith-number/3GEBZWO3TUXWCWCRBDQZKV7EMN/graph.json","fetch_events":"https://pith.science/api/pith-number/3GEBZWO3TUXWCWCRBDQZKV7EMN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3GEBZWO3TUXWCWCRBDQZKV7EMN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3GEBZWO3TUXWCWCRBDQZKV7EMN/action/storage_attestation","attest_author":"https://pith.science/pith/3GEBZWO3TUXWCWCRBDQZKV7EMN/action/author_attestation","sign_citation":"https://pith.science/pith/3GEBZWO3TUXWCWCRBDQZKV7EMN/action/citation_signature","submit_replication":"https://pith.science/pith/3GEBZWO3TUXWCWCRBDQZKV7EMN/action/replication_record"}},"created_at":"2026-05-18T00:18:00.071195+00:00","updated_at":"2026-05-18T00:18:00.071195+00:00"}