{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:62TQ6STTNPDESKT7ZAXZXCZY7L","short_pith_number":"pith:62TQ6STT","schema_version":"1.0","canonical_sha256":"f6a70f4a736bc6492a7fc82f9b8b38faf289fccaecc44cfa35385914927c97c4","source":{"kind":"arxiv","id":"1711.10817","version":1},"attestation_state":"computed","paper":{"title":"The Alon-Tarsi number of planar graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Xuding Zhu","submitted_at":"2017-11-29T12:37:46Z","abstract_excerpt":"This paper proves that the Alon-Tarsi number of any planar graph is at most $5$, which gives an alternate proof of the $5$-choosability as well as the $5$-paintability of planar graphs."},"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.10817","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-11-29T12:37:46Z","cross_cats_sorted":[],"title_canon_sha256":"7f8703fb80883a098a7848848dac8a28a08f7b09708d2249d34d72bf72df19cd","abstract_canon_sha256":"2a3967bb0f937c3e4decc4ba5537111755376df0fbc9d1f00233fdddbb99a9bb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:29:16.861417Z","signature_b64":"0II4XUiApHA0vmWQkIs9zLwCZAkufYHBztDlJpxrspVg/0Bg0w0eOO/TbgXajdvbCwQx8r8/ad5KifFUYXs+BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f6a70f4a736bc6492a7fc82f9b8b38faf289fccaecc44cfa35385914927c97c4","last_reissued_at":"2026-05-18T00:29:16.860371Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:29:16.860371Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Alon-Tarsi number of planar graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Xuding Zhu","submitted_at":"2017-11-29T12:37:46Z","abstract_excerpt":"This paper proves that the Alon-Tarsi number of any planar graph is at most $5$, which gives an alternate proof of the $5$-choosability as well as the $5$-paintability of planar graphs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.10817","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.10817","created_at":"2026-05-18T00:29:16.860863+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.10817v1","created_at":"2026-05-18T00:29:16.860863+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.10817","created_at":"2026-05-18T00:29:16.860863+00:00"},{"alias_kind":"pith_short_12","alias_value":"62TQ6STTNPDE","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_16","alias_value":"62TQ6STTNPDESKT7","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_8","alias_value":"62TQ6STT","created_at":"2026-05-18T12:31:03.183658+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/62TQ6STTNPDESKT7ZAXZXCZY7L","json":"https://pith.science/pith/62TQ6STTNPDESKT7ZAXZXCZY7L.json","graph_json":"https://pith.science/api/pith-number/62TQ6STTNPDESKT7ZAXZXCZY7L/graph.json","events_json":"https://pith.science/api/pith-number/62TQ6STTNPDESKT7ZAXZXCZY7L/events.json","paper":"https://pith.science/paper/62TQ6STT"},"agent_actions":{"view_html":"https://pith.science/pith/62TQ6STTNPDESKT7ZAXZXCZY7L","download_json":"https://pith.science/pith/62TQ6STTNPDESKT7ZAXZXCZY7L.json","view_paper":"https://pith.science/paper/62TQ6STT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.10817&json=true","fetch_graph":"https://pith.science/api/pith-number/62TQ6STTNPDESKT7ZAXZXCZY7L/graph.json","fetch_events":"https://pith.science/api/pith-number/62TQ6STTNPDESKT7ZAXZXCZY7L/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/62TQ6STTNPDESKT7ZAXZXCZY7L/action/timestamp_anchor","attest_storage":"https://pith.science/pith/62TQ6STTNPDESKT7ZAXZXCZY7L/action/storage_attestation","attest_author":"https://pith.science/pith/62TQ6STTNPDESKT7ZAXZXCZY7L/action/author_attestation","sign_citation":"https://pith.science/pith/62TQ6STTNPDESKT7ZAXZXCZY7L/action/citation_signature","submit_replication":"https://pith.science/pith/62TQ6STTNPDESKT7ZAXZXCZY7L/action/replication_record"}},"created_at":"2026-05-18T00:29:16.860863+00:00","updated_at":"2026-05-18T00:29:16.860863+00:00"}