{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:P7RSO5HVCIIE45VHXD2YYWPFJP","short_pith_number":"pith:P7RSO5HV","canonical_record":{"source":{"id":"1403.5013","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-03-20T00:57:51Z","cross_cats_sorted":[],"title_canon_sha256":"6887ab8d1f10c6c75e42c96a74422d841abc924a3295db672346f40dddafee58","abstract_canon_sha256":"ee6fda223a425d781c5e53ab3c104da42bcafcf6055085dc615947337d884dfc"},"schema_version":"1.0"},"canonical_sha256":"7fe32774f512104e76a7b8f58c59e54bc457620bef265a5c4601464e53534a36","source":{"kind":"arxiv","id":"1403.5013","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.5013","created_at":"2026-05-18T02:55:58Z"},{"alias_kind":"arxiv_version","alias_value":"1403.5013v1","created_at":"2026-05-18T02:55:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.5013","created_at":"2026-05-18T02:55:58Z"},{"alias_kind":"pith_short_12","alias_value":"P7RSO5HVCIIE","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"P7RSO5HVCIIE45VH","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"P7RSO5HV","created_at":"2026-05-18T12:28:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:P7RSO5HVCIIE45VHXD2YYWPFJP","target":"record","payload":{"canonical_record":{"source":{"id":"1403.5013","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-03-20T00:57:51Z","cross_cats_sorted":[],"title_canon_sha256":"6887ab8d1f10c6c75e42c96a74422d841abc924a3295db672346f40dddafee58","abstract_canon_sha256":"ee6fda223a425d781c5e53ab3c104da42bcafcf6055085dc615947337d884dfc"},"schema_version":"1.0"},"canonical_sha256":"7fe32774f512104e76a7b8f58c59e54bc457620bef265a5c4601464e53534a36","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:55:58.322058Z","signature_b64":"4ZnqzWfcpKt5jxeQTCxQbEmX6bITXn6ZDJY1qHE2lc2HrHTRuYu3OYsX2ep8UTHlVBOWwsxLgRfO6vCnUGXxCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7fe32774f512104e76a7b8f58c59e54bc457620bef265a5c4601464e53534a36","last_reissued_at":"2026-05-18T02:55:58.321617Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:55:58.321617Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1403.5013","source_version":1,"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-18T02:55:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NY0wVrf1jXxdzWCrYgeu09GDe8VHWLT2tN8fxk3uQnLpQszH2J8+RRft4raUsfK5wvozQEtxLbTC/KuVz98iBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T12:22:24.298906Z"},"content_sha256":"23ea9ce4c619ea4f29878061e85eb8c256c30bb6d578beb408f42cb6e2cf9c6f","schema_version":"1.0","event_id":"sha256:23ea9ce4c619ea4f29878061e85eb8c256c30bb6d578beb408f42cb6e2cf9c6f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:P7RSO5HVCIIE45VHXD2YYWPFJP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Tree-colorable maximal planar graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Enqiang Zhu, Jin Xu, Zehui Shao, Zepeng Li","submitted_at":"2014-03-20T00:57:51Z","abstract_excerpt":"A tree-coloring of a maximal planar graph is a proper vertex $4$-coloring such that every bichromatic subgraph, induced by this coloring, is a tree. A maximal planar graph $G$ is tree-colorable if $G$ has a tree-coloring. In this article, we prove that a tree-colorable maximal planar graph $G$ with $\\delta(G)\\geq 4$ contains at least four odd-vertices.\n  Moreover, for a tree-colorable maximal planar graph of minimum degree 4 that contains exactly four odd-vertices, we show that the subgraph induced by its four odd-vertices is not a claw and contains no triangles."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.5013","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"},"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-18T02:55:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9F9pcgarczuDRwh70U8BOj+SgvVXZve2pXlJPDG2mz58eU33Jsx/IrQ8sZwr/Skqn9wMmOipb2NEbwQ+/czLCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T12:22:24.299746Z"},"content_sha256":"e6329d441c73ddab97e37fb7b5cdddd3ff67acaac65a3c02899d69386f4b331d","schema_version":"1.0","event_id":"sha256:e6329d441c73ddab97e37fb7b5cdddd3ff67acaac65a3c02899d69386f4b331d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/P7RSO5HVCIIE45VHXD2YYWPFJP/bundle.json","state_url":"https://pith.science/pith/P7RSO5HVCIIE45VHXD2YYWPFJP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/P7RSO5HVCIIE45VHXD2YYWPFJP/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-06-09T12:22:24Z","links":{"resolver":"https://pith.science/pith/P7RSO5HVCIIE45VHXD2YYWPFJP","bundle":"https://pith.science/pith/P7RSO5HVCIIE45VHXD2YYWPFJP/bundle.json","state":"https://pith.science/pith/P7RSO5HVCIIE45VHXD2YYWPFJP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/P7RSO5HVCIIE45VHXD2YYWPFJP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:P7RSO5HVCIIE45VHXD2YYWPFJP","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":"ee6fda223a425d781c5e53ab3c104da42bcafcf6055085dc615947337d884dfc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-03-20T00:57:51Z","title_canon_sha256":"6887ab8d1f10c6c75e42c96a74422d841abc924a3295db672346f40dddafee58"},"schema_version":"1.0","source":{"id":"1403.5013","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.5013","created_at":"2026-05-18T02:55:58Z"},{"alias_kind":"arxiv_version","alias_value":"1403.5013v1","created_at":"2026-05-18T02:55:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.5013","created_at":"2026-05-18T02:55:58Z"},{"alias_kind":"pith_short_12","alias_value":"P7RSO5HVCIIE","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"P7RSO5HVCIIE45VH","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"P7RSO5HV","created_at":"2026-05-18T12:28:43Z"}],"graph_snapshots":[{"event_id":"sha256:e6329d441c73ddab97e37fb7b5cdddd3ff67acaac65a3c02899d69386f4b331d","target":"graph","created_at":"2026-05-18T02:55:58Z","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":"A tree-coloring of a maximal planar graph is a proper vertex $4$-coloring such that every bichromatic subgraph, induced by this coloring, is a tree. A maximal planar graph $G$ is tree-colorable if $G$ has a tree-coloring. In this article, we prove that a tree-colorable maximal planar graph $G$ with $\\delta(G)\\geq 4$ contains at least four odd-vertices.\n  Moreover, for a tree-colorable maximal planar graph of minimum degree 4 that contains exactly four odd-vertices, we show that the subgraph induced by its four odd-vertices is not a claw and contains no triangles.","authors_text":"Enqiang Zhu, Jin Xu, Zehui Shao, Zepeng Li","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-03-20T00:57:51Z","title":"Tree-colorable maximal planar graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.5013","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:23ea9ce4c619ea4f29878061e85eb8c256c30bb6d578beb408f42cb6e2cf9c6f","target":"record","created_at":"2026-05-18T02:55:58Z","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":"ee6fda223a425d781c5e53ab3c104da42bcafcf6055085dc615947337d884dfc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-03-20T00:57:51Z","title_canon_sha256":"6887ab8d1f10c6c75e42c96a74422d841abc924a3295db672346f40dddafee58"},"schema_version":"1.0","source":{"id":"1403.5013","kind":"arxiv","version":1}},"canonical_sha256":"7fe32774f512104e76a7b8f58c59e54bc457620bef265a5c4601464e53534a36","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7fe32774f512104e76a7b8f58c59e54bc457620bef265a5c4601464e53534a36","first_computed_at":"2026-05-18T02:55:58.321617Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:55:58.321617Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4ZnqzWfcpKt5jxeQTCxQbEmX6bITXn6ZDJY1qHE2lc2HrHTRuYu3OYsX2ep8UTHlVBOWwsxLgRfO6vCnUGXxCw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:55:58.322058Z","signed_message":"canonical_sha256_bytes"},"source_id":"1403.5013","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:23ea9ce4c619ea4f29878061e85eb8c256c30bb6d578beb408f42cb6e2cf9c6f","sha256:e6329d441c73ddab97e37fb7b5cdddd3ff67acaac65a3c02899d69386f4b331d"],"state_sha256":"006c531e5b83964e08607e32e12df78fd28f59ca56099ce8c0aa41ffc65a6209"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bPpHhbR+WshwcMc/6dl0fXrGjOMaBLN1E+/A7tIS8jL9i/5pb1TU0EKtpqmK44BS57z3b5cxwjlQWNTR5xP1BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T12:22:24.302695Z","bundle_sha256":"fe9fa562e056ff3afe7479739b6e8e226a2ecf370c755d9a1212eb039e8d0104"}}