{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:4OGH5LXNGD7WEHW5A2XTBGPV54","short_pith_number":"pith:4OGH5LXN","canonical_record":{"source":{"id":"1702.07559","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-02-24T12:46:34Z","cross_cats_sorted":[],"title_canon_sha256":"d5c933af1348968bb00653a2a1c59c4a1581e927ce1651f8332c8280b5223cce","abstract_canon_sha256":"cce20335d3ee53a00e4e65d0e41046f07bfcdb19b79167c81445eab851c54302"},"schema_version":"1.0"},"canonical_sha256":"e38c7eaeed30ff621edd06af3099f5ef2bf04ec91f75936496b400b0813b5c02","source":{"kind":"arxiv","id":"1702.07559","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.07559","created_at":"2026-05-18T00:50:02Z"},{"alias_kind":"arxiv_version","alias_value":"1702.07559v1","created_at":"2026-05-18T00:50:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.07559","created_at":"2026-05-18T00:50:02Z"},{"alias_kind":"pith_short_12","alias_value":"4OGH5LXNGD7W","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"4OGH5LXNGD7WEHW5","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"4OGH5LXN","created_at":"2026-05-18T12:31:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:4OGH5LXNGD7WEHW5A2XTBGPV54","target":"record","payload":{"canonical_record":{"source":{"id":"1702.07559","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-02-24T12:46:34Z","cross_cats_sorted":[],"title_canon_sha256":"d5c933af1348968bb00653a2a1c59c4a1581e927ce1651f8332c8280b5223cce","abstract_canon_sha256":"cce20335d3ee53a00e4e65d0e41046f07bfcdb19b79167c81445eab851c54302"},"schema_version":"1.0"},"canonical_sha256":"e38c7eaeed30ff621edd06af3099f5ef2bf04ec91f75936496b400b0813b5c02","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:50:02.911521Z","signature_b64":"x8GlxcNY6f6iDnF3VJ/Fgi8601kbKHMMKKfZ+jt0tXl4Cc2+lucCU1NxsGXqt8HTwR4/8zSFZznT8/mlTomaCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e38c7eaeed30ff621edd06af3099f5ef2bf04ec91f75936496b400b0813b5c02","last_reissued_at":"2026-05-18T00:50:02.910952Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:50:02.910952Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1702.07559","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-18T00:50:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XBEpkoOJsMPTcP6GCha21JpetC9x4Zf4S2xzPxmLDNyguekqxmnQ9VIXXQJp6ySnWkyrGCxsKjSVW0Jsld4gAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T11:14:06.028252Z"},"content_sha256":"9a0ee0ba32ba3459e536abe885c96b3ebe173632a20ad242906805cd6bfe97fb","schema_version":"1.0","event_id":"sha256:9a0ee0ba32ba3459e536abe885c96b3ebe173632a20ad242906805cd6bfe97fb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:4OGH5LXNGD7WEHW5A2XTBGPV54","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Remarks on planar edge-chromatic critical graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Eckhard Steffen, Ligang Jin, Yingli Kang","submitted_at":"2017-02-24T12:46:34Z","abstract_excerpt":"The only open case of Vizing's conjecture that every planar graph with $\\Delta\\geq 6$ is a class 1 graph is $\\Delta = 6$. We give a short proof of the following statement: there is no 6-critical plane graph $G$, such that every vertex of $G$ is incident to at most three 3-faces. A stronger statement without restriction to critical graphs is stated in \\cite{Wang_Xu_2013}. However, the proof given there works only for critical graphs. Furthermore, we show that every 5-critical plane graph has a 3-face which is adjacent to a $k$-face $(k\\in \\{3,4\\})$.\n  For $\\Delta = 5$ our result gives insights "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.07559","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-18T00:50:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SH0CNzqrWbGKaqf8ATuK22pK1ro7CxeY6ez7XYqxFXbu/PFfj3nFcha74Rbl4TpdtKWZXBkfpI0gOF7oTE92Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T11:14:06.028821Z"},"content_sha256":"adf57b9a9907334f451b029bdf3cbce1f9ecb131c1c0d25b14e662a2e8d8403a","schema_version":"1.0","event_id":"sha256:adf57b9a9907334f451b029bdf3cbce1f9ecb131c1c0d25b14e662a2e8d8403a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4OGH5LXNGD7WEHW5A2XTBGPV54/bundle.json","state_url":"https://pith.science/pith/4OGH5LXNGD7WEHW5A2XTBGPV54/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4OGH5LXNGD7WEHW5A2XTBGPV54/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-05-30T11:14:06Z","links":{"resolver":"https://pith.science/pith/4OGH5LXNGD7WEHW5A2XTBGPV54","bundle":"https://pith.science/pith/4OGH5LXNGD7WEHW5A2XTBGPV54/bundle.json","state":"https://pith.science/pith/4OGH5LXNGD7WEHW5A2XTBGPV54/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4OGH5LXNGD7WEHW5A2XTBGPV54/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:4OGH5LXNGD7WEHW5A2XTBGPV54","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":"cce20335d3ee53a00e4e65d0e41046f07bfcdb19b79167c81445eab851c54302","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-02-24T12:46:34Z","title_canon_sha256":"d5c933af1348968bb00653a2a1c59c4a1581e927ce1651f8332c8280b5223cce"},"schema_version":"1.0","source":{"id":"1702.07559","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.07559","created_at":"2026-05-18T00:50:02Z"},{"alias_kind":"arxiv_version","alias_value":"1702.07559v1","created_at":"2026-05-18T00:50:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.07559","created_at":"2026-05-18T00:50:02Z"},{"alias_kind":"pith_short_12","alias_value":"4OGH5LXNGD7W","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"4OGH5LXNGD7WEHW5","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"4OGH5LXN","created_at":"2026-05-18T12:31:00Z"}],"graph_snapshots":[{"event_id":"sha256:adf57b9a9907334f451b029bdf3cbce1f9ecb131c1c0d25b14e662a2e8d8403a","target":"graph","created_at":"2026-05-18T00:50:02Z","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":"The only open case of Vizing's conjecture that every planar graph with $\\Delta\\geq 6$ is a class 1 graph is $\\Delta = 6$. We give a short proof of the following statement: there is no 6-critical plane graph $G$, such that every vertex of $G$ is incident to at most three 3-faces. A stronger statement without restriction to critical graphs is stated in \\cite{Wang_Xu_2013}. However, the proof given there works only for critical graphs. Furthermore, we show that every 5-critical plane graph has a 3-face which is adjacent to a $k$-face $(k\\in \\{3,4\\})$.\n  For $\\Delta = 5$ our result gives insights ","authors_text":"Eckhard Steffen, Ligang Jin, Yingli Kang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-02-24T12:46:34Z","title":"Remarks on planar edge-chromatic critical graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.07559","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:9a0ee0ba32ba3459e536abe885c96b3ebe173632a20ad242906805cd6bfe97fb","target":"record","created_at":"2026-05-18T00:50:02Z","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":"cce20335d3ee53a00e4e65d0e41046f07bfcdb19b79167c81445eab851c54302","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-02-24T12:46:34Z","title_canon_sha256":"d5c933af1348968bb00653a2a1c59c4a1581e927ce1651f8332c8280b5223cce"},"schema_version":"1.0","source":{"id":"1702.07559","kind":"arxiv","version":1}},"canonical_sha256":"e38c7eaeed30ff621edd06af3099f5ef2bf04ec91f75936496b400b0813b5c02","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e38c7eaeed30ff621edd06af3099f5ef2bf04ec91f75936496b400b0813b5c02","first_computed_at":"2026-05-18T00:50:02.910952Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:50:02.910952Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"x8GlxcNY6f6iDnF3VJ/Fgi8601kbKHMMKKfZ+jt0tXl4Cc2+lucCU1NxsGXqt8HTwR4/8zSFZznT8/mlTomaCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:50:02.911521Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.07559","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9a0ee0ba32ba3459e536abe885c96b3ebe173632a20ad242906805cd6bfe97fb","sha256:adf57b9a9907334f451b029bdf3cbce1f9ecb131c1c0d25b14e662a2e8d8403a"],"state_sha256":"286fcd8b71f3c57f6794e30292ef4c79c91fac572b20d76bae6ad0d34a542517"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PIUIwOPx469aKSeLCP4yWHXE2odam02l8D4eq29esdX2/L8BMdQGQL3fLYbLrjJoGSr45NoN+TPdmS37VtP+Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T11:14:06.031867Z","bundle_sha256":"35020d7638f84cbee63ba2c24f65c67311760a34e6b34638fe89f58c5b499859"}}