{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:FGD4KN6I37A37K2F36CVVOUV6W","short_pith_number":"pith:FGD4KN6I","schema_version":"1.0","canonical_sha256":"2987c537c8dfc1bfab45df855aba95f5a1ee6dd65e51d778d83391f48d6e4a69","source":{"kind":"arxiv","id":"1312.7495","version":1},"attestation_state":"computed","paper":{"title":"Size of edge-critical uniquely 3-colorable 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":"2013-12-29T03:40:26Z","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. A uniquely $k$-colorable graph $G$ is edge-critical if $G-e$ is not a uniquely $k$-colorable graph for any edge $e\\in E(G)$. Mel'nikov and Steinberg [L. S. Mel'nikov, R. Steinberg, One counterexample for two conjectures on three coloring, Discrete Math. 20 (1977) 203-206] asked to find an exact upper bound for the number of edges in a edge-critical 3-colorable planar graph with $n$ vertices. In this paper, we give some properties of edge-critical u"},"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":"1312.7495","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-12-29T03:40:26Z","cross_cats_sorted":[],"title_canon_sha256":"0b6cb2f3fe46d90bd929e6de1303fff0b16d625cfc9e151f1287cf278b390875","abstract_canon_sha256":"1145e7cfde7c24898eae265655b72c4b54062b4d1523b282a102fe96572fae38"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:03:43.308238Z","signature_b64":"GkQX9iPG7bzBlvQAzcc7o+bQsS3ixw2YEdA0g2jJtcBFr03rNNLnhgBbVOMwBl8t02vUYvO40Y0ftU+eLcqGAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2987c537c8dfc1bfab45df855aba95f5a1ee6dd65e51d778d83391f48d6e4a69","last_reissued_at":"2026-05-18T03:03:43.307592Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:03:43.307592Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Size of edge-critical uniquely 3-colorable 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":"2013-12-29T03:40:26Z","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. A uniquely $k$-colorable graph $G$ is edge-critical if $G-e$ is not a uniquely $k$-colorable graph for any edge $e\\in E(G)$. Mel'nikov and Steinberg [L. S. Mel'nikov, R. Steinberg, One counterexample for two conjectures on three coloring, Discrete Math. 20 (1977) 203-206] asked to find an exact upper bound for the number of edges in a edge-critical 3-colorable planar graph with $n$ vertices. In this paper, we give some properties of edge-critical u"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.7495","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":"1312.7495","created_at":"2026-05-18T03:03:43.307700+00:00"},{"alias_kind":"arxiv_version","alias_value":"1312.7495v1","created_at":"2026-05-18T03:03:43.307700+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.7495","created_at":"2026-05-18T03:03:43.307700+00:00"},{"alias_kind":"pith_short_12","alias_value":"FGD4KN6I37A3","created_at":"2026-05-18T12:27:45.050594+00:00"},{"alias_kind":"pith_short_16","alias_value":"FGD4KN6I37A37K2F","created_at":"2026-05-18T12:27:45.050594+00:00"},{"alias_kind":"pith_short_8","alias_value":"FGD4KN6I","created_at":"2026-05-18T12:27:45.050594+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/FGD4KN6I37A37K2F36CVVOUV6W","json":"https://pith.science/pith/FGD4KN6I37A37K2F36CVVOUV6W.json","graph_json":"https://pith.science/api/pith-number/FGD4KN6I37A37K2F36CVVOUV6W/graph.json","events_json":"https://pith.science/api/pith-number/FGD4KN6I37A37K2F36CVVOUV6W/events.json","paper":"https://pith.science/paper/FGD4KN6I"},"agent_actions":{"view_html":"https://pith.science/pith/FGD4KN6I37A37K2F36CVVOUV6W","download_json":"https://pith.science/pith/FGD4KN6I37A37K2F36CVVOUV6W.json","view_paper":"https://pith.science/paper/FGD4KN6I","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1312.7495&json=true","fetch_graph":"https://pith.science/api/pith-number/FGD4KN6I37A37K2F36CVVOUV6W/graph.json","fetch_events":"https://pith.science/api/pith-number/FGD4KN6I37A37K2F36CVVOUV6W/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FGD4KN6I37A37K2F36CVVOUV6W/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FGD4KN6I37A37K2F36CVVOUV6W/action/storage_attestation","attest_author":"https://pith.science/pith/FGD4KN6I37A37K2F36CVVOUV6W/action/author_attestation","sign_citation":"https://pith.science/pith/FGD4KN6I37A37K2F36CVVOUV6W/action/citation_signature","submit_replication":"https://pith.science/pith/FGD4KN6I37A37K2F36CVVOUV6W/action/replication_record"}},"created_at":"2026-05-18T03:03:43.307700+00:00","updated_at":"2026-05-18T03:03:43.307700+00:00"}