{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:U4H6HPEII6FVEK2PYDSUUZXQ5I","short_pith_number":"pith:U4H6HPEI","schema_version":"1.0","canonical_sha256":"a70fe3bc88478b522b4fc0e54a66f0ea2f8aa80a9763a061afb6fffeb8e726eb","source":{"kind":"arxiv","id":"1811.12012","version":1},"attestation_state":"computed","paper":{"title":"The Alon-Tarsi number of a planar graph minus a matching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jaros{\\l}aw Grytczuk, Xuding Zhu","submitted_at":"2018-11-29T08:33:06Z","abstract_excerpt":"This paper proves that every planar graph $G$ contains a matching $M$ such that the Alon-Tarsi number of $G-M$ is at most $4$. As a consequence, $G-M$ is $4$-paintable, and hence $G$ itself is $1$-defective $4$-paintable. This improves a result of Cushing and Kierstead [Planar Graphs are 1-relaxed, 4-choosable, {\\em European Journal of Combinatorics} 31(2010),1385-1397], who proved that every planar graph is $1$-defective $4$-choosable."},"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":"1811.12012","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-11-29T08:33:06Z","cross_cats_sorted":[],"title_canon_sha256":"79c7030436ae0ba72d89e22077c9227c452e784efc9fff0475c821392a8a8f68","abstract_canon_sha256":"72ac490a3f0579b01c978f0b8d9936dfa03e53198ceb2bfaa93a841df7257eb8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:59:34.709197Z","signature_b64":"p11kQU1aBD2eZDhOFl4olEPd6w/bxQ/GcwVvd2lWLiY6AWpnqRqz6LDMMKMFmo+AXYvqqIpqOxeowrB4DyjEAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a70fe3bc88478b522b4fc0e54a66f0ea2f8aa80a9763a061afb6fffeb8e726eb","last_reissued_at":"2026-05-17T23:59:34.708625Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:59:34.708625Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Alon-Tarsi number of a planar graph minus a matching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jaros{\\l}aw Grytczuk, Xuding Zhu","submitted_at":"2018-11-29T08:33:06Z","abstract_excerpt":"This paper proves that every planar graph $G$ contains a matching $M$ such that the Alon-Tarsi number of $G-M$ is at most $4$. As a consequence, $G-M$ is $4$-paintable, and hence $G$ itself is $1$-defective $4$-paintable. This improves a result of Cushing and Kierstead [Planar Graphs are 1-relaxed, 4-choosable, {\\em European Journal of Combinatorics} 31(2010),1385-1397], who proved that every planar graph is $1$-defective $4$-choosable."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.12012","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":"1811.12012","created_at":"2026-05-17T23:59:34.708725+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.12012v1","created_at":"2026-05-17T23:59:34.708725+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.12012","created_at":"2026-05-17T23:59:34.708725+00:00"},{"alias_kind":"pith_short_12","alias_value":"U4H6HPEII6FV","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_16","alias_value":"U4H6HPEII6FVEK2P","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_8","alias_value":"U4H6HPEI","created_at":"2026-05-18T12:32:56.356000+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/U4H6HPEII6FVEK2PYDSUUZXQ5I","json":"https://pith.science/pith/U4H6HPEII6FVEK2PYDSUUZXQ5I.json","graph_json":"https://pith.science/api/pith-number/U4H6HPEII6FVEK2PYDSUUZXQ5I/graph.json","events_json":"https://pith.science/api/pith-number/U4H6HPEII6FVEK2PYDSUUZXQ5I/events.json","paper":"https://pith.science/paper/U4H6HPEI"},"agent_actions":{"view_html":"https://pith.science/pith/U4H6HPEII6FVEK2PYDSUUZXQ5I","download_json":"https://pith.science/pith/U4H6HPEII6FVEK2PYDSUUZXQ5I.json","view_paper":"https://pith.science/paper/U4H6HPEI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.12012&json=true","fetch_graph":"https://pith.science/api/pith-number/U4H6HPEII6FVEK2PYDSUUZXQ5I/graph.json","fetch_events":"https://pith.science/api/pith-number/U4H6HPEII6FVEK2PYDSUUZXQ5I/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/U4H6HPEII6FVEK2PYDSUUZXQ5I/action/timestamp_anchor","attest_storage":"https://pith.science/pith/U4H6HPEII6FVEK2PYDSUUZXQ5I/action/storage_attestation","attest_author":"https://pith.science/pith/U4H6HPEII6FVEK2PYDSUUZXQ5I/action/author_attestation","sign_citation":"https://pith.science/pith/U4H6HPEII6FVEK2PYDSUUZXQ5I/action/citation_signature","submit_replication":"https://pith.science/pith/U4H6HPEII6FVEK2PYDSUUZXQ5I/action/replication_record"}},"created_at":"2026-05-17T23:59:34.708725+00:00","updated_at":"2026-05-17T23:59:34.708725+00:00"}