{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:FGD4KN6I37A37K2F36CVVOUV6W","short_pith_number":"pith:FGD4KN6I","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"},"canonical_sha256":"2987c537c8dfc1bfab45df855aba95f5a1ee6dd65e51d778d83391f48d6e4a69","source":{"kind":"arxiv","id":"1312.7495","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.7495","created_at":"2026-05-18T03:03:43Z"},{"alias_kind":"arxiv_version","alias_value":"1312.7495v1","created_at":"2026-05-18T03:03:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.7495","created_at":"2026-05-18T03:03:43Z"},{"alias_kind":"pith_short_12","alias_value":"FGD4KN6I37A3","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"FGD4KN6I37A37K2F","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"FGD4KN6I","created_at":"2026-05-18T12:27:45Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:FGD4KN6I37A37K2F36CVVOUV6W","target":"record","payload":{"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"},"canonical_sha256":"2987c537c8dfc1bfab45df855aba95f5a1ee6dd65e51d778d83391f48d6e4a69","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"},"source_kind":"arxiv","source_id":"1312.7495","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-18T03:03:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nMdwCDBG08LudheKZ+llmIOs8XlHhqOQ3rukHt2CUObkXcyt8WsuC5q7qFonnlqfMaDP/xYuhKSzXo1sAoSVCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T00:24:43.935881Z"},"content_sha256":"a8b4470318269e68abb0ed7a2d2a7b5a8f73a80a225938d208319d959ce36856","schema_version":"1.0","event_id":"sha256:a8b4470318269e68abb0ed7a2d2a7b5a8f73a80a225938d208319d959ce36856"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:FGD4KN6I37A37K2F36CVVOUV6W","target":"graph","payload":{"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"},"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-18T03:03:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P99hmiumOqTfiHPUiO2c87IHLk38ZhZXYyI8ST+UrcEg4vrirqHd+6Z1OUddi3Y4iMlVNZHS+KN62mb68yhSCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T00:24:43.936217Z"},"content_sha256":"0d8563a9d60f136065fd4428950236d7a0d2fd4e3e74b5bd7ea588f81309e6bb","schema_version":"1.0","event_id":"sha256:0d8563a9d60f136065fd4428950236d7a0d2fd4e3e74b5bd7ea588f81309e6bb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FGD4KN6I37A37K2F36CVVOUV6W/bundle.json","state_url":"https://pith.science/pith/FGD4KN6I37A37K2F36CVVOUV6W/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FGD4KN6I37A37K2F36CVVOUV6W/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-09T00:24:43Z","links":{"resolver":"https://pith.science/pith/FGD4KN6I37A37K2F36CVVOUV6W","bundle":"https://pith.science/pith/FGD4KN6I37A37K2F36CVVOUV6W/bundle.json","state":"https://pith.science/pith/FGD4KN6I37A37K2F36CVVOUV6W/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FGD4KN6I37A37K2F36CVVOUV6W/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:FGD4KN6I37A37K2F36CVVOUV6W","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":"1145e7cfde7c24898eae265655b72c4b54062b4d1523b282a102fe96572fae38","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-12-29T03:40:26Z","title_canon_sha256":"0b6cb2f3fe46d90bd929e6de1303fff0b16d625cfc9e151f1287cf278b390875"},"schema_version":"1.0","source":{"id":"1312.7495","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.7495","created_at":"2026-05-18T03:03:43Z"},{"alias_kind":"arxiv_version","alias_value":"1312.7495v1","created_at":"2026-05-18T03:03:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.7495","created_at":"2026-05-18T03:03:43Z"},{"alias_kind":"pith_short_12","alias_value":"FGD4KN6I37A3","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"FGD4KN6I37A37K2F","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"FGD4KN6I","created_at":"2026-05-18T12:27:45Z"}],"graph_snapshots":[{"event_id":"sha256:0d8563a9d60f136065fd4428950236d7a0d2fd4e3e74b5bd7ea588f81309e6bb","target":"graph","created_at":"2026-05-18T03:03:43Z","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 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","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":"2013-12-29T03:40:26Z","title":"Size of edge-critical uniquely 3-colorable planar graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.7495","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:a8b4470318269e68abb0ed7a2d2a7b5a8f73a80a225938d208319d959ce36856","target":"record","created_at":"2026-05-18T03:03:43Z","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":"1145e7cfde7c24898eae265655b72c4b54062b4d1523b282a102fe96572fae38","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-12-29T03:40:26Z","title_canon_sha256":"0b6cb2f3fe46d90bd929e6de1303fff0b16d625cfc9e151f1287cf278b390875"},"schema_version":"1.0","source":{"id":"1312.7495","kind":"arxiv","version":1}},"canonical_sha256":"2987c537c8dfc1bfab45df855aba95f5a1ee6dd65e51d778d83391f48d6e4a69","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2987c537c8dfc1bfab45df855aba95f5a1ee6dd65e51d778d83391f48d6e4a69","first_computed_at":"2026-05-18T03:03:43.307592Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:03:43.307592Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GkQX9iPG7bzBlvQAzcc7o+bQsS3ixw2YEdA0g2jJtcBFr03rNNLnhgBbVOMwBl8t02vUYvO40Y0ftU+eLcqGAg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:03:43.308238Z","signed_message":"canonical_sha256_bytes"},"source_id":"1312.7495","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a8b4470318269e68abb0ed7a2d2a7b5a8f73a80a225938d208319d959ce36856","sha256:0d8563a9d60f136065fd4428950236d7a0d2fd4e3e74b5bd7ea588f81309e6bb"],"state_sha256":"76b818a4662f062847b3cb1fbb3784548ae3c7e07634eac714a2fc902a24cd3b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zIQppp3wZLqa41Quc/7+BooJG0zFGwDvRDrp5wvrjpuLDTGHN/F6QddRX75WDw2WigSaeIscGquIprRpLlt6CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T00:24:43.938100Z","bundle_sha256":"2a0f01f0a652e07f604350de4bf69b78ef886091656337a6eb0196aa35fa66f9"}}