{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:MVBGDGCL64DGXRSKH76VOOMCI3","short_pith_number":"pith:MVBGDGCL","schema_version":"1.0","canonical_sha256":"654261984bf7066bc64a3ffd57398246e13a561466ec427e316cc63d65701b35","source":{"kind":"arxiv","id":"2605.22860","version":1},"attestation_state":"computed","paper":{"title":"Every signed planar graph is $5$-choosable: A short proof and refinements","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Maxwell Ndognkon Manga, Pie Desire Ebode Atangana","submitted_at":"2026-05-19T16:24:20Z","abstract_excerpt":"A \\emph{signed graph} is a pair $\\Gs$ in which $G$ is a finite simple graph and $\\sigma:\\E(G)\\to\\{+1,-1\\}$ is a \\emph{signature}. Following M\\'a\\v{c}ajov\\'a--Raspaud- \\v{S}koviera and Jin--Kang--Steffen, a \\emph{proper coloring} of $\\Gs$ is a map $c:\\V(G)\\to\\Z$ with $c(u)\\ne\\sigma(uv)\\,c(v)$ for every edge $uv$, and $\\Gs$ is \\emph{signed $k$-choosable} if such a coloring exists from any list assignment $L$ with $|L(v)|\\ge k$. In a celebrated two-page note, Thomassen proved that every planar graph is $5$ choosable, and Jin, Kang, and Steffen subsequently extended this to signed planar graphs. O"},"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":"2605.22860","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-19T16:24:20Z","cross_cats_sorted":[],"title_canon_sha256":"88dac6664e0f438b3372322d067ae155b767fd07c71b6a1f65becc0182862d74","abstract_canon_sha256":"2a7ee406602e065d12dd6fb5c9523d4a2a14509f597d868fa4d6adba17138af9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-25T02:01:27.483089Z","signature_b64":"Fj+l+rxjtKcREkLwnSvZIbn/CCJvHt2S9J0F75wAUmtp8TeQ0ja8WGOfABmoT9MrkV34v/KfSaJgATb2Ry1JAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"654261984bf7066bc64a3ffd57398246e13a561466ec427e316cc63d65701b35","last_reissued_at":"2026-05-25T02:01:27.482214Z","signature_status":"signed_v1","first_computed_at":"2026-05-25T02:01:27.482214Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Every signed planar graph is $5$-choosable: A short proof and refinements","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Maxwell Ndognkon Manga, Pie Desire Ebode Atangana","submitted_at":"2026-05-19T16:24:20Z","abstract_excerpt":"A \\emph{signed graph} is a pair $\\Gs$ in which $G$ is a finite simple graph and $\\sigma:\\E(G)\\to\\{+1,-1\\}$ is a \\emph{signature}. Following M\\'a\\v{c}ajov\\'a--Raspaud- \\v{S}koviera and Jin--Kang--Steffen, a \\emph{proper coloring} of $\\Gs$ is a map $c:\\V(G)\\to\\Z$ with $c(u)\\ne\\sigma(uv)\\,c(v)$ for every edge $uv$, and $\\Gs$ is \\emph{signed $k$-choosable} if such a coloring exists from any list assignment $L$ with $|L(v)|\\ge k$. In a celebrated two-page note, Thomassen proved that every planar graph is $5$ choosable, and Jin, Kang, and Steffen subsequently extended this to signed planar graphs. O"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.22860","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.22860/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2605.22860","created_at":"2026-05-25T02:01:27.482366+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.22860v1","created_at":"2026-05-25T02:01:27.482366+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.22860","created_at":"2026-05-25T02:01:27.482366+00:00"},{"alias_kind":"pith_short_12","alias_value":"MVBGDGCL64DG","created_at":"2026-05-25T02:01:27.482366+00:00"},{"alias_kind":"pith_short_16","alias_value":"MVBGDGCL64DGXRSK","created_at":"2026-05-25T02:01:27.482366+00:00"},{"alias_kind":"pith_short_8","alias_value":"MVBGDGCL","created_at":"2026-05-25T02:01:27.482366+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/MVBGDGCL64DGXRSKH76VOOMCI3","json":"https://pith.science/pith/MVBGDGCL64DGXRSKH76VOOMCI3.json","graph_json":"https://pith.science/api/pith-number/MVBGDGCL64DGXRSKH76VOOMCI3/graph.json","events_json":"https://pith.science/api/pith-number/MVBGDGCL64DGXRSKH76VOOMCI3/events.json","paper":"https://pith.science/paper/MVBGDGCL"},"agent_actions":{"view_html":"https://pith.science/pith/MVBGDGCL64DGXRSKH76VOOMCI3","download_json":"https://pith.science/pith/MVBGDGCL64DGXRSKH76VOOMCI3.json","view_paper":"https://pith.science/paper/MVBGDGCL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.22860&json=true","fetch_graph":"https://pith.science/api/pith-number/MVBGDGCL64DGXRSKH76VOOMCI3/graph.json","fetch_events":"https://pith.science/api/pith-number/MVBGDGCL64DGXRSKH76VOOMCI3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MVBGDGCL64DGXRSKH76VOOMCI3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MVBGDGCL64DGXRSKH76VOOMCI3/action/storage_attestation","attest_author":"https://pith.science/pith/MVBGDGCL64DGXRSKH76VOOMCI3/action/author_attestation","sign_citation":"https://pith.science/pith/MVBGDGCL64DGXRSKH76VOOMCI3/action/citation_signature","submit_replication":"https://pith.science/pith/MVBGDGCL64DGXRSKH76VOOMCI3/action/replication_record"}},"created_at":"2026-05-25T02:01:27.482366+00:00","updated_at":"2026-05-25T02:01:27.482366+00:00"}