{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:HQ75GSWQCGW6FJHW6UINPOUQH7","short_pith_number":"pith:HQ75GSWQ","schema_version":"1.0","canonical_sha256":"3c3fd34ad011ade2a4f6f510d7ba903fed8d4fa69e5376f206c05ab8e01d92a8","source":{"kind":"arxiv","id":"1812.00133","version":1},"attestation_state":"computed","paper":{"title":"On a Sufficient Condition for Planar Graphs of Maximum Degree 6 to be Totally 7-Colorable","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Chanjuan Liu, Enqiang Zhu, Yongsheng Rao","submitted_at":"2018-12-01T03:24:43Z","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"},"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":"1812.00133","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-12-01T03:24:43Z","cross_cats_sorted":[],"title_canon_sha256":"e79f70a4933c2ae13723b70dbffd209556c221a54799ee7e4c1594a8b6afdaf1","abstract_canon_sha256":"213b9c88872bff19384fe66aa63233f8dd03ba6de1918a36ca009f5adc362251"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:59:27.165542Z","signature_b64":"MRJLOgtLbovBjujY0z+gANU8LpXWyi21L2JSh6Aieo2+JeKaim75nPMbczvAgxpq8tYUEhOIrvZrCRGx//aABQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3c3fd34ad011ade2a4f6f510d7ba903fed8d4fa69e5376f206c05ab8e01d92a8","last_reissued_at":"2026-05-17T23:59:27.164912Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:59:27.164912Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On a Sufficient Condition for Planar Graphs of Maximum Degree 6 to be Totally 7-Colorable","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Chanjuan Liu, Enqiang Zhu, Yongsheng Rao","submitted_at":"2018-12-01T03:24:43Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.00133","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":"1812.00133","created_at":"2026-05-17T23:59:27.165003+00:00"},{"alias_kind":"arxiv_version","alias_value":"1812.00133v1","created_at":"2026-05-17T23:59:27.165003+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.00133","created_at":"2026-05-17T23:59:27.165003+00:00"},{"alias_kind":"pith_short_12","alias_value":"HQ75GSWQCGW6","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_16","alias_value":"HQ75GSWQCGW6FJHW","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_8","alias_value":"HQ75GSWQ","created_at":"2026-05-18T12:32:28.185984+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/HQ75GSWQCGW6FJHW6UINPOUQH7","json":"https://pith.science/pith/HQ75GSWQCGW6FJHW6UINPOUQH7.json","graph_json":"https://pith.science/api/pith-number/HQ75GSWQCGW6FJHW6UINPOUQH7/graph.json","events_json":"https://pith.science/api/pith-number/HQ75GSWQCGW6FJHW6UINPOUQH7/events.json","paper":"https://pith.science/paper/HQ75GSWQ"},"agent_actions":{"view_html":"https://pith.science/pith/HQ75GSWQCGW6FJHW6UINPOUQH7","download_json":"https://pith.science/pith/HQ75GSWQCGW6FJHW6UINPOUQH7.json","view_paper":"https://pith.science/paper/HQ75GSWQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1812.00133&json=true","fetch_graph":"https://pith.science/api/pith-number/HQ75GSWQCGW6FJHW6UINPOUQH7/graph.json","fetch_events":"https://pith.science/api/pith-number/HQ75GSWQCGW6FJHW6UINPOUQH7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HQ75GSWQCGW6FJHW6UINPOUQH7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HQ75GSWQCGW6FJHW6UINPOUQH7/action/storage_attestation","attest_author":"https://pith.science/pith/HQ75GSWQCGW6FJHW6UINPOUQH7/action/author_attestation","sign_citation":"https://pith.science/pith/HQ75GSWQCGW6FJHW6UINPOUQH7/action/citation_signature","submit_replication":"https://pith.science/pith/HQ75GSWQCGW6FJHW6UINPOUQH7/action/replication_record"}},"created_at":"2026-05-17T23:59:27.165003+00:00","updated_at":"2026-05-17T23:59:27.165003+00:00"}