{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:P7RSO5HVCIIE45VHXD2YYWPFJP","short_pith_number":"pith:P7RSO5HV","schema_version":"1.0","canonical_sha256":"7fe32774f512104e76a7b8f58c59e54bc457620bef265a5c4601464e53534a36","source":{"kind":"arxiv","id":"1403.5013","version":1},"attestation_state":"computed","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."},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1403.5013","created_at":"2026-05-18T02:55:58.321695+00:00"},{"alias_kind":"arxiv_version","alias_value":"1403.5013v1","created_at":"2026-05-18T02:55:58.321695+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.5013","created_at":"2026-05-18T02:55:58.321695+00:00"},{"alias_kind":"pith_short_12","alias_value":"P7RSO5HVCIIE","created_at":"2026-05-18T12:28:43.426989+00:00"},{"alias_kind":"pith_short_16","alias_value":"P7RSO5HVCIIE45VH","created_at":"2026-05-18T12:28:43.426989+00:00"},{"alias_kind":"pith_short_8","alias_value":"P7RSO5HV","created_at":"2026-05-18T12:28:43.426989+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/P7RSO5HVCIIE45VHXD2YYWPFJP","json":"https://pith.science/pith/P7RSO5HVCIIE45VHXD2YYWPFJP.json","graph_json":"https://pith.science/api/pith-number/P7RSO5HVCIIE45VHXD2YYWPFJP/graph.json","events_json":"https://pith.science/api/pith-number/P7RSO5HVCIIE45VHXD2YYWPFJP/events.json","paper":"https://pith.science/paper/P7RSO5HV"},"agent_actions":{"view_html":"https://pith.science/pith/P7RSO5HVCIIE45VHXD2YYWPFJP","download_json":"https://pith.science/pith/P7RSO5HVCIIE45VHXD2YYWPFJP.json","view_paper":"https://pith.science/paper/P7RSO5HV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1403.5013&json=true","fetch_graph":"https://pith.science/api/pith-number/P7RSO5HVCIIE45VHXD2YYWPFJP/graph.json","fetch_events":"https://pith.science/api/pith-number/P7RSO5HVCIIE45VHXD2YYWPFJP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/P7RSO5HVCIIE45VHXD2YYWPFJP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/P7RSO5HVCIIE45VHXD2YYWPFJP/action/storage_attestation","attest_author":"https://pith.science/pith/P7RSO5HVCIIE45VHXD2YYWPFJP/action/author_attestation","sign_citation":"https://pith.science/pith/P7RSO5HVCIIE45VHXD2YYWPFJP/action/citation_signature","submit_replication":"https://pith.science/pith/P7RSO5HVCIIE45VHXD2YYWPFJP/action/replication_record"}},"created_at":"2026-05-18T02:55:58.321695+00:00","updated_at":"2026-05-18T02:55:58.321695+00:00"}