{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:HXMIWXAQJLOWGPLCOFCSVLFCUL","short_pith_number":"pith:HXMIWXAQ","schema_version":"1.0","canonical_sha256":"3dd88b5c104add633d6271452aaca2a2c597c62ee1201a30689fcbf268b66efe","source":{"kind":"arxiv","id":"1711.02848","version":1},"attestation_state":"computed","paper":{"title":"A note on two conjectures that strengthen the four colour theorem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Xuding Zhu","submitted_at":"2017-11-08T06:55:58Z","abstract_excerpt":"There are two conjectures concerning planar graph colourings that are strengthenings of the four colour theorem. One concerns signed graph colouring and is proposed by M\\'{a}\\v{c}ajov\\'{a}, Raspaud and \\v{S}koviera. It asserts that every signed planar graph is $4$-colourable. Another concerns list colouring and is proposed by K\\\"{u}ndgen and Ramamurthi which asserts that if $L$ is a $2$-list assignment of a planar graph $G$, then there is an $L$-colouring of $G$ such that each colour class induces a bipartite graph. In this note we prove that the first conjecture implies the second one."},"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":"1711.02848","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-11-08T06:55:58Z","cross_cats_sorted":[],"title_canon_sha256":"f8afe37697d6af2dc403b2b6b23fb0e8a889eb9e23aabfdb81c722010358b8d5","abstract_canon_sha256":"78513f660e8c9d752659781dbfd2063c1f7db145882d554b7c826091a7da1d50"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:01.539585Z","signature_b64":"YTXU68rGxSTrp7nZcNERhdeCz3Bskyf6y3UZEHjCRGyIurg9eI9EXAs6QQBzxH/DVZhgBjLQcF3r/Uv0Yj3oAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3dd88b5c104add633d6271452aaca2a2c597c62ee1201a30689fcbf268b66efe","last_reissued_at":"2026-05-18T00:31:01.538945Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:01.538945Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A note on two conjectures that strengthen the four colour theorem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Xuding Zhu","submitted_at":"2017-11-08T06:55:58Z","abstract_excerpt":"There are two conjectures concerning planar graph colourings that are strengthenings of the four colour theorem. One concerns signed graph colouring and is proposed by M\\'{a}\\v{c}ajov\\'{a}, Raspaud and \\v{S}koviera. It asserts that every signed planar graph is $4$-colourable. Another concerns list colouring and is proposed by K\\\"{u}ndgen and Ramamurthi which asserts that if $L$ is a $2$-list assignment of a planar graph $G$, then there is an $L$-colouring of $G$ such that each colour class induces a bipartite graph. In this note we prove that the first conjecture implies the second one."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.02848","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":"1711.02848","created_at":"2026-05-18T00:31:01.539040+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.02848v1","created_at":"2026-05-18T00:31:01.539040+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.02848","created_at":"2026-05-18T00:31:01.539040+00:00"},{"alias_kind":"pith_short_12","alias_value":"HXMIWXAQJLOW","created_at":"2026-05-18T12:31:21.493067+00:00"},{"alias_kind":"pith_short_16","alias_value":"HXMIWXAQJLOWGPLC","created_at":"2026-05-18T12:31:21.493067+00:00"},{"alias_kind":"pith_short_8","alias_value":"HXMIWXAQ","created_at":"2026-05-18T12:31:21.493067+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/HXMIWXAQJLOWGPLCOFCSVLFCUL","json":"https://pith.science/pith/HXMIWXAQJLOWGPLCOFCSVLFCUL.json","graph_json":"https://pith.science/api/pith-number/HXMIWXAQJLOWGPLCOFCSVLFCUL/graph.json","events_json":"https://pith.science/api/pith-number/HXMIWXAQJLOWGPLCOFCSVLFCUL/events.json","paper":"https://pith.science/paper/HXMIWXAQ"},"agent_actions":{"view_html":"https://pith.science/pith/HXMIWXAQJLOWGPLCOFCSVLFCUL","download_json":"https://pith.science/pith/HXMIWXAQJLOWGPLCOFCSVLFCUL.json","view_paper":"https://pith.science/paper/HXMIWXAQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.02848&json=true","fetch_graph":"https://pith.science/api/pith-number/HXMIWXAQJLOWGPLCOFCSVLFCUL/graph.json","fetch_events":"https://pith.science/api/pith-number/HXMIWXAQJLOWGPLCOFCSVLFCUL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HXMIWXAQJLOWGPLCOFCSVLFCUL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HXMIWXAQJLOWGPLCOFCSVLFCUL/action/storage_attestation","attest_author":"https://pith.science/pith/HXMIWXAQJLOWGPLCOFCSVLFCUL/action/author_attestation","sign_citation":"https://pith.science/pith/HXMIWXAQJLOWGPLCOFCSVLFCUL/action/citation_signature","submit_replication":"https://pith.science/pith/HXMIWXAQJLOWGPLCOFCSVLFCUL/action/replication_record"}},"created_at":"2026-05-18T00:31:01.539040+00:00","updated_at":"2026-05-18T00:31:01.539040+00:00"}