{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:7QT4YZOUKPVYNVYTQBIHZ223VK","short_pith_number":"pith:7QT4YZOU","canonical_record":{"source":{"id":"2504.21821","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-04-30T17:26:36Z","cross_cats_sorted":[],"title_canon_sha256":"d64805eb95ad743f13b5eca85ae5be9c937bad41b6f175eda4905921e94b287e","abstract_canon_sha256":"e0bf148c6be4e4377f6b2fe5af5769a822dbdad2ceb8b1acf74f4909c4dcf57b"},"schema_version":"1.0"},"canonical_sha256":"fc27cc65d453eb86d71380507ceb5baabfe470540b7ba019a070f2e2ab643afc","source":{"kind":"arxiv","id":"2504.21821","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2504.21821","created_at":"2026-07-05T10:56:29Z"},{"alias_kind":"arxiv_version","alias_value":"2504.21821v1","created_at":"2026-07-05T10:56:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.21821","created_at":"2026-07-05T10:56:29Z"},{"alias_kind":"pith_short_12","alias_value":"7QT4YZOUKPVY","created_at":"2026-07-05T10:56:29Z"},{"alias_kind":"pith_short_16","alias_value":"7QT4YZOUKPVYNVYT","created_at":"2026-07-05T10:56:29Z"},{"alias_kind":"pith_short_8","alias_value":"7QT4YZOU","created_at":"2026-07-05T10:56:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:7QT4YZOUKPVYNVYTQBIHZ223VK","target":"record","payload":{"canonical_record":{"source":{"id":"2504.21821","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-04-30T17:26:36Z","cross_cats_sorted":[],"title_canon_sha256":"d64805eb95ad743f13b5eca85ae5be9c937bad41b6f175eda4905921e94b287e","abstract_canon_sha256":"e0bf148c6be4e4377f6b2fe5af5769a822dbdad2ceb8b1acf74f4909c4dcf57b"},"schema_version":"1.0"},"canonical_sha256":"fc27cc65d453eb86d71380507ceb5baabfe470540b7ba019a070f2e2ab643afc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:56:29.898191Z","signature_b64":"oem3JxvcGbXNwl2wceXPLyICPVgRhdfPYEMeva78SslGcVhkNO2BWpolVubVDVC+NV8xRqG+pEOwNKK4QPBIBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fc27cc65d453eb86d71380507ceb5baabfe470540b7ba019a070f2e2ab643afc","last_reissued_at":"2026-07-05T10:56:29.897734Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:56:29.897734Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2504.21821","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-07-05T10:56:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2Xcv81WR+GLKw5GHcoxiJATydP8QiBIJQyyRtJPcKRbFInjzo2awEkBcRu2uKJiHbO30bnAQvQhfxJa1sF3nDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T13:13:53.892090Z"},"content_sha256":"d030da0c2d619a5a3e5000f6c0d98fd2dba2d92f62861914463b25680e175281","schema_version":"1.0","event_id":"sha256:d030da0c2d619a5a3e5000f6c0d98fd2dba2d92f62861914463b25680e175281"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:7QT4YZOUKPVYNVYTQBIHZ223VK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Local Weak Degeneracy of Planar Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Evelyne Smith-Roberge, Ewan Davies","submitted_at":"2025-04-30T17:26:36Z","abstract_excerpt":"Thomassen showed that planar graphs are 5-list-colourable, and that planar graphs of girth at least five are 3-list-colourable. An easy degeneracy argument shows that planar graphs of girth at least four are 4-list-colourable. In 2022, Postle and Smith-Roberge proved a common strengthening of these three results: with $g(v)$ denoting the length of a shortest cycle containing a vertex $v$, they showed that if $G$ is a planar graph and $L$ a list assignment for $G$ where $|L(v)| \\geq \\max\\{3,8-g(v)\\}$ for all $v \\in V(G)$, then $G$ is $L$-colourable. Moreover, they conjectured that an analogous "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.21821","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/2504.21821/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-07-05T10:56:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vPtJE3MhQ8oG3jvtcTQEN/6xIVzAatfk/62IadRUuvzGIJui38UAjWcG1/LjmHT3LFtrFDIqArUVRp6aORYSAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T13:13:53.892663Z"},"content_sha256":"f3bc355a9720c7ae45b182d3ece5c7a35b3f67a54d5a1847d6a091d341302d3f","schema_version":"1.0","event_id":"sha256:f3bc355a9720c7ae45b182d3ece5c7a35b3f67a54d5a1847d6a091d341302d3f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7QT4YZOUKPVYNVYTQBIHZ223VK/bundle.json","state_url":"https://pith.science/pith/7QT4YZOUKPVYNVYTQBIHZ223VK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7QT4YZOUKPVYNVYTQBIHZ223VK/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-08-20T13:13:53Z","links":{"resolver":"https://pith.science/pith/7QT4YZOUKPVYNVYTQBIHZ223VK","bundle":"https://pith.science/pith/7QT4YZOUKPVYNVYTQBIHZ223VK/bundle.json","state":"https://pith.science/pith/7QT4YZOUKPVYNVYTQBIHZ223VK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7QT4YZOUKPVYNVYTQBIHZ223VK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:7QT4YZOUKPVYNVYTQBIHZ223VK","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":"e0bf148c6be4e4377f6b2fe5af5769a822dbdad2ceb8b1acf74f4909c4dcf57b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-04-30T17:26:36Z","title_canon_sha256":"d64805eb95ad743f13b5eca85ae5be9c937bad41b6f175eda4905921e94b287e"},"schema_version":"1.0","source":{"id":"2504.21821","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2504.21821","created_at":"2026-07-05T10:56:29Z"},{"alias_kind":"arxiv_version","alias_value":"2504.21821v1","created_at":"2026-07-05T10:56:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.21821","created_at":"2026-07-05T10:56:29Z"},{"alias_kind":"pith_short_12","alias_value":"7QT4YZOUKPVY","created_at":"2026-07-05T10:56:29Z"},{"alias_kind":"pith_short_16","alias_value":"7QT4YZOUKPVYNVYT","created_at":"2026-07-05T10:56:29Z"},{"alias_kind":"pith_short_8","alias_value":"7QT4YZOU","created_at":"2026-07-05T10:56:29Z"}],"graph_snapshots":[{"event_id":"sha256:f3bc355a9720c7ae45b182d3ece5c7a35b3f67a54d5a1847d6a091d341302d3f","target":"graph","created_at":"2026-07-05T10:56:29Z","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/2504.21821/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Thomassen showed that planar graphs are 5-list-colourable, and that planar graphs of girth at least five are 3-list-colourable. An easy degeneracy argument shows that planar graphs of girth at least four are 4-list-colourable. In 2022, Postle and Smith-Roberge proved a common strengthening of these three results: with $g(v)$ denoting the length of a shortest cycle containing a vertex $v$, they showed that if $G$ is a planar graph and $L$ a list assignment for $G$ where $|L(v)| \\geq \\max\\{3,8-g(v)\\}$ for all $v \\in V(G)$, then $G$ is $L$-colourable. Moreover, they conjectured that an analogous ","authors_text":"Evelyne Smith-Roberge, Ewan Davies","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-04-30T17:26:36Z","title":"Local Weak Degeneracy of Planar Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.21821","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:d030da0c2d619a5a3e5000f6c0d98fd2dba2d92f62861914463b25680e175281","target":"record","created_at":"2026-07-05T10:56:29Z","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":"e0bf148c6be4e4377f6b2fe5af5769a822dbdad2ceb8b1acf74f4909c4dcf57b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-04-30T17:26:36Z","title_canon_sha256":"d64805eb95ad743f13b5eca85ae5be9c937bad41b6f175eda4905921e94b287e"},"schema_version":"1.0","source":{"id":"2504.21821","kind":"arxiv","version":1}},"canonical_sha256":"fc27cc65d453eb86d71380507ceb5baabfe470540b7ba019a070f2e2ab643afc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fc27cc65d453eb86d71380507ceb5baabfe470540b7ba019a070f2e2ab643afc","first_computed_at":"2026-07-05T10:56:29.897734Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:56:29.897734Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"oem3JxvcGbXNwl2wceXPLyICPVgRhdfPYEMeva78SslGcVhkNO2BWpolVubVDVC+NV8xRqG+pEOwNKK4QPBIBw==","signature_status":"signed_v1","signed_at":"2026-07-05T10:56:29.898191Z","signed_message":"canonical_sha256_bytes"},"source_id":"2504.21821","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d030da0c2d619a5a3e5000f6c0d98fd2dba2d92f62861914463b25680e175281","sha256:f3bc355a9720c7ae45b182d3ece5c7a35b3f67a54d5a1847d6a091d341302d3f"],"state_sha256":"eb0a0318d15e3cd76e5e25dac3250af7e3d2ea6a4fb1562043edf6876f0b5c36"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PQS7thSQhWWEIHRKKyB/g0zVGKZrYLWc7wNL/ErB8ThznaN/rZ5YIqS/1eR8WoYqF4Tc12CwwKFBh8dUCIlcCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-20T13:13:53.898291Z","bundle_sha256":"a618defa65fb868244ef9127b6f035b87094f7aa1044faab17fb2789dc810a56"}}