{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:YCIG6ZAYRGHOUS5MAMBOGMNAEP","short_pith_number":"pith:YCIG6ZAY","schema_version":"1.0","canonical_sha256":"c0906f6418898eea4bac0302e331a023fd44e83852586047b09bd5621b95255d","source":{"kind":"arxiv","id":"1908.03172","version":1},"attestation_state":"computed","paper":{"title":"Planar graphs with girth at least 5 are (3,4)-colorable","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Gexin Yu, Ilkyoo Choi, Xia Zhang","submitted_at":"2019-08-08T17:04:40Z","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 "},"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":"1908.03172","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-08-08T17:04:40Z","cross_cats_sorted":[],"title_canon_sha256":"0b5578f2f2a64cabec716a6c074b4e5d2891dc5400a50dec6f2cad71a9a584df","abstract_canon_sha256":"1217469d4767d952a55f6e0117377a4dd0898f003ee56fae8865458588886802"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T23:52:26.824123Z","signature_b64":"OaFx30ipsFM36u5buEHzAUqecfbRaxhBsP/+IZgySMDoA7KwU7+2ICqOikuSpLs8Hkad50f4VJAB17xasGwYCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c0906f6418898eea4bac0302e331a023fd44e83852586047b09bd5621b95255d","last_reissued_at":"2026-07-04T23:52:26.823719Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T23:52:26.823719Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Planar graphs with girth at least 5 are (3,4)-colorable","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Gexin Yu, Ilkyoo Choi, Xia Zhang","submitted_at":"2019-08-08T17:04:40Z","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 "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.03172","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/1908.03172/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":"1908.03172","created_at":"2026-07-04T23:52:26.823777+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.03172v1","created_at":"2026-07-04T23:52:26.823777+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.03172","created_at":"2026-07-04T23:52:26.823777+00:00"},{"alias_kind":"pith_short_12","alias_value":"YCIG6ZAYRGHO","created_at":"2026-07-04T23:52:26.823777+00:00"},{"alias_kind":"pith_short_16","alias_value":"YCIG6ZAYRGHOUS5M","created_at":"2026-07-04T23:52:26.823777+00:00"},{"alias_kind":"pith_short_8","alias_value":"YCIG6ZAY","created_at":"2026-07-04T23:52:26.823777+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/YCIG6ZAYRGHOUS5MAMBOGMNAEP","json":"https://pith.science/pith/YCIG6ZAYRGHOUS5MAMBOGMNAEP.json","graph_json":"https://pith.science/api/pith-number/YCIG6ZAYRGHOUS5MAMBOGMNAEP/graph.json","events_json":"https://pith.science/api/pith-number/YCIG6ZAYRGHOUS5MAMBOGMNAEP/events.json","paper":"https://pith.science/paper/YCIG6ZAY"},"agent_actions":{"view_html":"https://pith.science/pith/YCIG6ZAYRGHOUS5MAMBOGMNAEP","download_json":"https://pith.science/pith/YCIG6ZAYRGHOUS5MAMBOGMNAEP.json","view_paper":"https://pith.science/paper/YCIG6ZAY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.03172&json=true","fetch_graph":"https://pith.science/api/pith-number/YCIG6ZAYRGHOUS5MAMBOGMNAEP/graph.json","fetch_events":"https://pith.science/api/pith-number/YCIG6ZAYRGHOUS5MAMBOGMNAEP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YCIG6ZAYRGHOUS5MAMBOGMNAEP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YCIG6ZAYRGHOUS5MAMBOGMNAEP/action/storage_attestation","attest_author":"https://pith.science/pith/YCIG6ZAYRGHOUS5MAMBOGMNAEP/action/author_attestation","sign_citation":"https://pith.science/pith/YCIG6ZAYRGHOUS5MAMBOGMNAEP/action/citation_signature","submit_replication":"https://pith.science/pith/YCIG6ZAYRGHOUS5MAMBOGMNAEP/action/replication_record"}},"created_at":"2026-07-04T23:52:26.823777+00:00","updated_at":"2026-07-04T23:52:26.823777+00:00"}