{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:JYVQ4MPXNFKSEE4LHYJ36M5OG4","short_pith_number":"pith:JYVQ4MPX","schema_version":"1.0","canonical_sha256":"4e2b0e31f7695522138b3e13bf33ae37266e20c067aa7a6b9f6082f1162bfa44","source":{"kind":"arxiv","id":"1509.03053","version":1},"attestation_state":"computed","paper":{"title":"On uniquely 3-colorable plane graphs without prescribed adjacent faces","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Enqiang Zhu, Jin Xu, Naoki Matsumoto, Tommy Jensen, Zepeng Li","submitted_at":"2015-09-10T08:47:20Z","abstract_excerpt":"A graph $G$ is \\emph{uniquely k-colorable} if the chromatic number of $G$ is $k$ and $G$ has only one $k$-coloring up to permutation of the colors. For a plane graph $G$, two faces $f_1$ and $f_2$ of $G$ are \\emph{adjacent $(i,j)$-faces} if $d(f_1)=i$, $d(f_2)=j$ and $f_1$ and $f_2$ have a common edge, where $d(f)$ is the degree of a face $f$. In this paper, we prove that every uniquely 3-colorable plane graph has adjacent $(3,k)$-faces, where $k\\leq 5$. The bound 5 for $k$ is best possible. Furthermore, we prove that there exist a class of uniquely 3-colorable plane graphs having neither adja"},"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":"1509.03053","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-09-10T08:47:20Z","cross_cats_sorted":[],"title_canon_sha256":"6d1506e9132203818004296cb47319d6200ae4196ee820fe8d6e0dcac2153d9b","abstract_canon_sha256":"7c7cfbd97d1232242e95ae0bde50bcd00a5ad713e810029e0ee18f51030bb12a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:33:25.612848Z","signature_b64":"w7IhbwX73+McBiDeq17EPL0tKCsKePRzgWAXipa0k1IWfDY9K806YHNYqZT5l1YH32BafbQYodWfPLghVovaBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4e2b0e31f7695522138b3e13bf33ae37266e20c067aa7a6b9f6082f1162bfa44","last_reissued_at":"2026-05-18T01:33:25.612117Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:33:25.612117Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On uniquely 3-colorable plane graphs without prescribed adjacent faces","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Enqiang Zhu, Jin Xu, Naoki Matsumoto, Tommy Jensen, Zepeng Li","submitted_at":"2015-09-10T08:47:20Z","abstract_excerpt":"A graph $G$ is \\emph{uniquely k-colorable} if the chromatic number of $G$ is $k$ and $G$ has only one $k$-coloring up to permutation of the colors. For a plane graph $G$, two faces $f_1$ and $f_2$ of $G$ are \\emph{adjacent $(i,j)$-faces} if $d(f_1)=i$, $d(f_2)=j$ and $f_1$ and $f_2$ have a common edge, where $d(f)$ is the degree of a face $f$. In this paper, we prove that every uniquely 3-colorable plane graph has adjacent $(3,k)$-faces, where $k\\leq 5$. The bound 5 for $k$ is best possible. Furthermore, we prove that there exist a class of uniquely 3-colorable plane graphs having neither adja"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.03053","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":"1509.03053","created_at":"2026-05-18T01:33:25.612247+00:00"},{"alias_kind":"arxiv_version","alias_value":"1509.03053v1","created_at":"2026-05-18T01:33:25.612247+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.03053","created_at":"2026-05-18T01:33:25.612247+00:00"},{"alias_kind":"pith_short_12","alias_value":"JYVQ4MPXNFKS","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_16","alias_value":"JYVQ4MPXNFKSEE4L","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_8","alias_value":"JYVQ4MPX","created_at":"2026-05-18T12:29:27.538025+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/JYVQ4MPXNFKSEE4LHYJ36M5OG4","json":"https://pith.science/pith/JYVQ4MPXNFKSEE4LHYJ36M5OG4.json","graph_json":"https://pith.science/api/pith-number/JYVQ4MPXNFKSEE4LHYJ36M5OG4/graph.json","events_json":"https://pith.science/api/pith-number/JYVQ4MPXNFKSEE4LHYJ36M5OG4/events.json","paper":"https://pith.science/paper/JYVQ4MPX"},"agent_actions":{"view_html":"https://pith.science/pith/JYVQ4MPXNFKSEE4LHYJ36M5OG4","download_json":"https://pith.science/pith/JYVQ4MPXNFKSEE4LHYJ36M5OG4.json","view_paper":"https://pith.science/paper/JYVQ4MPX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1509.03053&json=true","fetch_graph":"https://pith.science/api/pith-number/JYVQ4MPXNFKSEE4LHYJ36M5OG4/graph.json","fetch_events":"https://pith.science/api/pith-number/JYVQ4MPXNFKSEE4LHYJ36M5OG4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JYVQ4MPXNFKSEE4LHYJ36M5OG4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JYVQ4MPXNFKSEE4LHYJ36M5OG4/action/storage_attestation","attest_author":"https://pith.science/pith/JYVQ4MPXNFKSEE4LHYJ36M5OG4/action/author_attestation","sign_citation":"https://pith.science/pith/JYVQ4MPXNFKSEE4LHYJ36M5OG4/action/citation_signature","submit_replication":"https://pith.science/pith/JYVQ4MPXNFKSEE4LHYJ36M5OG4/action/replication_record"}},"created_at":"2026-05-18T01:33:25.612247+00:00","updated_at":"2026-05-18T01:33:25.612247+00:00"}