{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:HQ75GSWQCGW6FJHW6UINPOUQH7","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":"213b9c88872bff19384fe66aa63233f8dd03ba6de1918a36ca009f5adc362251","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-12-01T03:24:43Z","title_canon_sha256":"e79f70a4933c2ae13723b70dbffd209556c221a54799ee7e4c1594a8b6afdaf1"},"schema_version":"1.0","source":{"id":"1812.00133","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.00133","created_at":"2026-05-17T23:59:27Z"},{"alias_kind":"arxiv_version","alias_value":"1812.00133v1","created_at":"2026-05-17T23:59:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.00133","created_at":"2026-05-17T23:59:27Z"},{"alias_kind":"pith_short_12","alias_value":"HQ75GSWQCGW6","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"HQ75GSWQCGW6FJHW","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"HQ75GSWQ","created_at":"2026-05-18T12:32:28Z"}],"graph_snapshots":[{"event_id":"sha256:e63e94f7d66fa5b4e63b4a0c7da8d50e874385c08fcb9e7bcd2d302f180f771d","target":"graph","created_at":"2026-05-17T23:59:27Z","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 total $k$-coloring of a graph is an assignment of $k$ colors to its vertices and edges such that no two adjacent or incident elements receive the same color. The Total Coloring Conjecture (TCC) states that every simple graph $G$ has a total ($\\Delta(G)+2$)-coloring, where $\\Delta(G)$ is the maximum degree of $G$. This conjecture has been confirmed for planar graphs with maximum degree at least 7 or at most 5, i.e., the only open case of TCC is that of maximum degree 6. It is known that every planar graph $G$ of $\\Delta(G) \\geq 9$ or $\\Delta(G) \\in \\{7, 8\\}$ with some restrictions has a total","authors_text":"Chanjuan Liu, Enqiang Zhu, Yongsheng Rao","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-12-01T03:24:43Z","title":"On a Sufficient Condition for Planar Graphs of Maximum Degree 6 to be Totally 7-Colorable"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.00133","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:0cdc2f44f9d6844527e1207a4383f99c10f3745cc13733fd5993844407fcb3f5","target":"record","created_at":"2026-05-17T23:59:27Z","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":"213b9c88872bff19384fe66aa63233f8dd03ba6de1918a36ca009f5adc362251","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-12-01T03:24:43Z","title_canon_sha256":"e79f70a4933c2ae13723b70dbffd209556c221a54799ee7e4c1594a8b6afdaf1"},"schema_version":"1.0","source":{"id":"1812.00133","kind":"arxiv","version":1}},"canonical_sha256":"3c3fd34ad011ade2a4f6f510d7ba903fed8d4fa69e5376f206c05ab8e01d92a8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3c3fd34ad011ade2a4f6f510d7ba903fed8d4fa69e5376f206c05ab8e01d92a8","first_computed_at":"2026-05-17T23:59:27.164912Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:59:27.164912Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MRJLOgtLbovBjujY0z+gANU8LpXWyi21L2JSh6Aieo2+JeKaim75nPMbczvAgxpq8tYUEhOIrvZrCRGx//aABQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:59:27.165542Z","signed_message":"canonical_sha256_bytes"},"source_id":"1812.00133","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0cdc2f44f9d6844527e1207a4383f99c10f3745cc13733fd5993844407fcb3f5","sha256:e63e94f7d66fa5b4e63b4a0c7da8d50e874385c08fcb9e7bcd2d302f180f771d"],"state_sha256":"d84452a51fb0f5b334ad0fb18bd18f7cc4bb7483c1ac7a50dda921bbc968a7d5"}