{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:MVBGDGCL64DGXRSKH76VOOMCI3","short_pith_number":"pith:MVBGDGCL","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"},"canonical_sha256":"654261984bf7066bc64a3ffd57398246e13a561466ec427e316cc63d65701b35","source":{"kind":"arxiv","id":"2605.22860","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.22860","created_at":"2026-05-25T02:01:27Z"},{"alias_kind":"arxiv_version","alias_value":"2605.22860v1","created_at":"2026-05-25T02:01:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.22860","created_at":"2026-05-25T02:01:27Z"},{"alias_kind":"pith_short_12","alias_value":"MVBGDGCL64DG","created_at":"2026-05-25T02:01:27Z"},{"alias_kind":"pith_short_16","alias_value":"MVBGDGCL64DGXRSK","created_at":"2026-05-25T02:01:27Z"},{"alias_kind":"pith_short_8","alias_value":"MVBGDGCL","created_at":"2026-05-25T02:01:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:MVBGDGCL64DGXRSKH76VOOMCI3","target":"record","payload":{"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"},"canonical_sha256":"654261984bf7066bc64a3ffd57398246e13a561466ec427e316cc63d65701b35","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"},"source_kind":"arxiv","source_id":"2605.22860","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-25T02:01:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IzNKCRfIQsp4myNEwVqdr/8pewM2Rz7jJnB3lNiP6HInB4RDGYgPMjiPns0ySW6FAjK4BiEn9nA5QnGqWptdDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T22:34:23.026976Z"},"content_sha256":"fc7b8e2aea6c5289a364013502fa35d49efc3598762d8c63b287016144b3fd2c","schema_version":"1.0","event_id":"sha256:fc7b8e2aea6c5289a364013502fa35d49efc3598762d8c63b287016144b3fd2c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:MVBGDGCL64DGXRSKH76VOOMCI3","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-25T02:01:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5Aqpw3E7J8JH3RTvXSqOgcB042jAenaDoenBHd8SxLNKJ4tinnpLofMt+63605fSlRsInPUtvpgDZQh56x6SDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T22:34:23.027751Z"},"content_sha256":"a0b38d66dd4c6ddbe54a1a621ec007ed7cf1a98c7acabdcb64fd18debc23a272","schema_version":"1.0","event_id":"sha256:a0b38d66dd4c6ddbe54a1a621ec007ed7cf1a98c7acabdcb64fd18debc23a272"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MVBGDGCL64DGXRSKH76VOOMCI3/bundle.json","state_url":"https://pith.science/pith/MVBGDGCL64DGXRSKH76VOOMCI3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MVBGDGCL64DGXRSKH76VOOMCI3/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-30T22:34:23Z","links":{"resolver":"https://pith.science/pith/MVBGDGCL64DGXRSKH76VOOMCI3","bundle":"https://pith.science/pith/MVBGDGCL64DGXRSKH76VOOMCI3/bundle.json","state":"https://pith.science/pith/MVBGDGCL64DGXRSKH76VOOMCI3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MVBGDGCL64DGXRSKH76VOOMCI3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:MVBGDGCL64DGXRSKH76VOOMCI3","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"2a7ee406602e065d12dd6fb5c9523d4a2a14509f597d868fa4d6adba17138af9","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-19T16:24:20Z","title_canon_sha256":"88dac6664e0f438b3372322d067ae155b767fd07c71b6a1f65becc0182862d74"},"schema_version":"1.0","source":{"id":"2605.22860","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.22860","created_at":"2026-05-25T02:01:27Z"},{"alias_kind":"arxiv_version","alias_value":"2605.22860v1","created_at":"2026-05-25T02:01:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.22860","created_at":"2026-05-25T02:01:27Z"},{"alias_kind":"pith_short_12","alias_value":"MVBGDGCL64DG","created_at":"2026-05-25T02:01:27Z"},{"alias_kind":"pith_short_16","alias_value":"MVBGDGCL64DGXRSK","created_at":"2026-05-25T02:01:27Z"},{"alias_kind":"pith_short_8","alias_value":"MVBGDGCL","created_at":"2026-05-25T02:01:27Z"}],"graph_snapshots":[{"event_id":"sha256:a0b38d66dd4c6ddbe54a1a621ec007ed7cf1a98c7acabdcb64fd18debc23a272","target":"graph","created_at":"2026-05-25T02:01:27Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2605.22860/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Maxwell Ndognkon Manga, Pie Desire Ebode Atangana","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-19T16:24:20Z","title":"Every signed planar graph is $5$-choosable: A short proof and refinements"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.22860","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:fc7b8e2aea6c5289a364013502fa35d49efc3598762d8c63b287016144b3fd2c","target":"record","created_at":"2026-05-25T02:01:27Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"2a7ee406602e065d12dd6fb5c9523d4a2a14509f597d868fa4d6adba17138af9","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-05-19T16:24:20Z","title_canon_sha256":"88dac6664e0f438b3372322d067ae155b767fd07c71b6a1f65becc0182862d74"},"schema_version":"1.0","source":{"id":"2605.22860","kind":"arxiv","version":1}},"canonical_sha256":"654261984bf7066bc64a3ffd57398246e13a561466ec427e316cc63d65701b35","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"654261984bf7066bc64a3ffd57398246e13a561466ec427e316cc63d65701b35","first_computed_at":"2026-05-25T02:01:27.482214Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-25T02:01:27.482214Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Fj+l+rxjtKcREkLwnSvZIbn/CCJvHt2S9J0F75wAUmtp8TeQ0ja8WGOfABmoT9MrkV34v/KfSaJgATb2Ry1JAg==","signature_status":"signed_v1","signed_at":"2026-05-25T02:01:27.483089Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.22860","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fc7b8e2aea6c5289a364013502fa35d49efc3598762d8c63b287016144b3fd2c","sha256:a0b38d66dd4c6ddbe54a1a621ec007ed7cf1a98c7acabdcb64fd18debc23a272"],"state_sha256":"d0e09cde208c91bea42adfbca90d7163a3c8e02c1f0d526a336d0a2dd1ce5c1f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cnnRiZFngR6HMUfAr13dvEP07MkZm8oVFajC5H+nF3BDdtEk76d6NizFholCEjd+rNpI/lIJyhRpVmybDpl3Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T22:34:23.031950Z","bundle_sha256":"427de5330d5f39023fa1274289fdbc33a28617a9532a7a2ef2465d6326a04ea9"}}