{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:3GEBZWO3TUXWCWCRBDQZKV7EMN","short_pith_number":"pith:3GEBZWO3","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"},"canonical_sha256":"d9881cd9db9d2f61585108e19557e4636f9cb63be709c2332d2bd12ad5ea9c22","source":{"kind":"arxiv","id":"1710.02411","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.02411","created_at":"2026-05-18T00:18:00Z"},{"alias_kind":"arxiv_version","alias_value":"1710.02411v2","created_at":"2026-05-18T00:18:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.02411","created_at":"2026-05-18T00:18:00Z"},{"alias_kind":"pith_short_12","alias_value":"3GEBZWO3TUXW","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"3GEBZWO3TUXWCWCR","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"3GEBZWO3","created_at":"2026-05-18T12:30:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:3GEBZWO3TUXWCWCRBDQZKV7EMN","target":"record","payload":{"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"},"canonical_sha256":"d9881cd9db9d2f61585108e19557e4636f9cb63be709c2332d2bd12ad5ea9c22","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"},"source_kind":"arxiv","source_id":"1710.02411","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:18:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"73v7qHl2xS1nHNoAqACT87On7K5pHfdikITZ7hQFDG0DYtnQP2flgLvpSNKOk1fTNL2dBk7KYVr1UIdd989NBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T20:10:03.700418Z"},"content_sha256":"c34227612b2ffc9868fd488938223a785b85869572fc437c1a9d810139e88252","schema_version":"1.0","event_id":"sha256:c34227612b2ffc9868fd488938223a785b85869572fc437c1a9d810139e88252"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:3GEBZWO3TUXWCWCRBDQZKV7EMN","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:18:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uRMpUjuXa21hlO2sntJwi4X4Vo5SjrADKpgAHSYf+xfGQ/mj6V0i/TCMHgms1xYb4P+xMeDztrqctXrgT3pLDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T20:10:03.701120Z"},"content_sha256":"fc15120badd7136930571da130e511f72fa22e076b55d976e65332a6ea8a0e7b","schema_version":"1.0","event_id":"sha256:fc15120badd7136930571da130e511f72fa22e076b55d976e65332a6ea8a0e7b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3GEBZWO3TUXWCWCRBDQZKV7EMN/bundle.json","state_url":"https://pith.science/pith/3GEBZWO3TUXWCWCRBDQZKV7EMN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3GEBZWO3TUXWCWCRBDQZKV7EMN/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-26T20:10:03Z","links":{"resolver":"https://pith.science/pith/3GEBZWO3TUXWCWCRBDQZKV7EMN","bundle":"https://pith.science/pith/3GEBZWO3TUXWCWCRBDQZKV7EMN/bundle.json","state":"https://pith.science/pith/3GEBZWO3TUXWCWCRBDQZKV7EMN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3GEBZWO3TUXWCWCRBDQZKV7EMN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:3GEBZWO3TUXWCWCRBDQZKV7EMN","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":"6890abf9a2eaa6bd84f0500fcbf84684ca0508e044348d38c757625e0f9159c0","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-10-06T14:02:23Z","title_canon_sha256":"bd2f18076dd04c6cddefd13b46fd463d3d0ca92e0bb5f3e7a1ad258bdf908f80"},"schema_version":"1.0","source":{"id":"1710.02411","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.02411","created_at":"2026-05-18T00:18:00Z"},{"alias_kind":"arxiv_version","alias_value":"1710.02411v2","created_at":"2026-05-18T00:18:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.02411","created_at":"2026-05-18T00:18:00Z"},{"alias_kind":"pith_short_12","alias_value":"3GEBZWO3TUXW","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"3GEBZWO3TUXWCWCR","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"3GEBZWO3","created_at":"2026-05-18T12:30:58Z"}],"graph_snapshots":[{"event_id":"sha256:fc15120badd7136930571da130e511f72fa22e076b55d976e65332a6ea8a0e7b","target":"graph","created_at":"2026-05-18T00:18:00Z","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":"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]","authors_text":"Kolja Knauer, Torsten Ueckerdt","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-10-06T14:02:23Z","title":"Decomposing $4$-connected planar triangulations into two trees and one path"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.02411","kind":"arxiv","version":2},"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:c34227612b2ffc9868fd488938223a785b85869572fc437c1a9d810139e88252","target":"record","created_at":"2026-05-18T00:18:00Z","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":"6890abf9a2eaa6bd84f0500fcbf84684ca0508e044348d38c757625e0f9159c0","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-10-06T14:02:23Z","title_canon_sha256":"bd2f18076dd04c6cddefd13b46fd463d3d0ca92e0bb5f3e7a1ad258bdf908f80"},"schema_version":"1.0","source":{"id":"1710.02411","kind":"arxiv","version":2}},"canonical_sha256":"d9881cd9db9d2f61585108e19557e4636f9cb63be709c2332d2bd12ad5ea9c22","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d9881cd9db9d2f61585108e19557e4636f9cb63be709c2332d2bd12ad5ea9c22","first_computed_at":"2026-05-18T00:18:00.071125Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:18:00.071125Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RjCj7VZCcoM2iPUThFG1jUodHaf2H0U1wSsL5hBJ0XS8Sr3+lt9yYy0cR7yzoVB8I7sYIKD/MzHkW474o/RrAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:18:00.071705Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.02411","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c34227612b2ffc9868fd488938223a785b85869572fc437c1a9d810139e88252","sha256:fc15120badd7136930571da130e511f72fa22e076b55d976e65332a6ea8a0e7b"],"state_sha256":"46ee9cb694d73c6cfd6fc6edd1c1df502e7d82f4ed803615a9259792ae890db2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tKH9CNbXogdBrl7/3w7FqYQSQRc0u1qHQk5/tsYGo1uVW+htnc1btZL2hj3znatD75DRiHYJkm/KEflccXgjCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T20:10:03.704882Z","bundle_sha256":"6e72f5b7ad3aa03480f29abf742d1c04373404528a17e0be467c4132a43acb0e"}}