{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:YCIG6ZAYRGHOUS5MAMBOGMNAEP","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":"1217469d4767d952a55f6e0117377a4dd0898f003ee56fae8865458588886802","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-08-08T17:04:40Z","title_canon_sha256":"0b5578f2f2a64cabec716a6c074b4e5d2891dc5400a50dec6f2cad71a9a584df"},"schema_version":"1.0","source":{"id":"1908.03172","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.03172","created_at":"2026-07-04T23:52:26Z"},{"alias_kind":"arxiv_version","alias_value":"1908.03172v1","created_at":"2026-07-04T23:52:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.03172","created_at":"2026-07-04T23:52:26Z"},{"alias_kind":"pith_short_12","alias_value":"YCIG6ZAYRGHO","created_at":"2026-07-04T23:52:26Z"},{"alias_kind":"pith_short_16","alias_value":"YCIG6ZAYRGHOUS5M","created_at":"2026-07-04T23:52:26Z"},{"alias_kind":"pith_short_8","alias_value":"YCIG6ZAY","created_at":"2026-07-04T23:52:26Z"}],"graph_snapshots":[{"event_id":"sha256:d3ba2df3199573eb36760426b556a7a533c3b175fa674d929d1008b737a32980","target":"graph","created_at":"2026-07-04T23:52:26Z","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/1908.03172/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A graph is $(d_1, \\ldots, d_k)$-colorable if its vertex set can be partitioned into $k$ nonempty subsets so that the subgraph induced by the $i$th part has maximum degree at most $d_i$ for each $i\\in\\{1, \\ldots, k\\}$. It is known that for each pair $(d_1, d_2)$, there exists a planar graph with girth $4$ that is not $(d_1, d_2)$-colorable. This sparked the interest in finding the pairs $(d_1, d_2)$ such that planar graphs with girth at least $5$ are $(d_1, d_2)$-colorable. Given $d_1\\leq d_2$, it is known that planar graphs with girth at least $5$ are $(d_1, d_2)$-colorable if either $d_1\\geq ","authors_text":"Gexin Yu, Ilkyoo Choi, Xia Zhang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-08-08T17:04:40Z","title":"Planar graphs with girth at least 5 are (3,4)-colorable"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.03172","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:a306d9f2bd35842104301d6583254d1f3412dce55e4e5bc44bca0b7ec2f2f837","target":"record","created_at":"2026-07-04T23:52:26Z","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":"1217469d4767d952a55f6e0117377a4dd0898f003ee56fae8865458588886802","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-08-08T17:04:40Z","title_canon_sha256":"0b5578f2f2a64cabec716a6c074b4e5d2891dc5400a50dec6f2cad71a9a584df"},"schema_version":"1.0","source":{"id":"1908.03172","kind":"arxiv","version":1}},"canonical_sha256":"c0906f6418898eea4bac0302e331a023fd44e83852586047b09bd5621b95255d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c0906f6418898eea4bac0302e331a023fd44e83852586047b09bd5621b95255d","first_computed_at":"2026-07-04T23:52:26.823719Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T23:52:26.823719Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OaFx30ipsFM36u5buEHzAUqecfbRaxhBsP/+IZgySMDoA7KwU7+2ICqOikuSpLs8Hkad50f4VJAB17xasGwYCg==","signature_status":"signed_v1","signed_at":"2026-07-04T23:52:26.824123Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.03172","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a306d9f2bd35842104301d6583254d1f3412dce55e4e5bc44bca0b7ec2f2f837","sha256:d3ba2df3199573eb36760426b556a7a533c3b175fa674d929d1008b737a32980"],"state_sha256":"c3d2bcb1400a7f2b5b346efd250abf15905cbdf11ed1fe8cde0899e98878f1a4"}