{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:MAXMCJIB4EB3PDGGZKNGTW7IQF","short_pith_number":"pith:MAXMCJIB","schema_version":"1.0","canonical_sha256":"602ec12501e103b78cc6ca9a69dbe8815f92143c5c1385342b5a9faf6dde7bb0","source":{"kind":"arxiv","id":"1809.05439","version":1},"attestation_state":"computed","paper":{"title":"Fractional coloring of planar graphs of girth five","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Xiaolan Hu, Zden\\v{e}k Dvo\\v{r}\\'ak","submitted_at":"2018-09-14T14:26:15Z","abstract_excerpt":"A graph G is (a:b)-colorable if there exists an assignment of b-element subsets of {1,...,a} to vertices of G such that sets assigned to adjacent vertices are disjoint. We first show that for every triangle-free planar graph G and a vertex x of G, the graph G has a set coloring phi by subsets of {1,...,6} such that |phi(v)|>=2 for each vertex v of G and |phi(x)|=3. As a corollary, every triangle-free planar graph on n vertices is (6n:2n+1)-colorable. We further use this result to prove that for every Delta, there exists a constant M_Delta such that every planar graph G of girth at least five a"},"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":"1809.05439","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-09-14T14:26:15Z","cross_cats_sorted":[],"title_canon_sha256":"d8c09bb415d573f5848696b4224d05ae56d60ee61ce088d5bc0e2e06bf175d4e","abstract_canon_sha256":"073a51a6ed0bdfbcf73efd345c6b46bf33c5acf41315b84efbc71f420d2af72c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:05:41.429113Z","signature_b64":"kGb2DOeKfuRkZNsK6Xd2jUeF7XTavaxB7TppDtJzIwbGBNIZTeCTttpYWsvtcOa0CQ7QolyW/YWyjBB864yODw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"602ec12501e103b78cc6ca9a69dbe8815f92143c5c1385342b5a9faf6dde7bb0","last_reissued_at":"2026-05-18T00:05:41.428548Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:05:41.428548Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fractional coloring of planar graphs of girth five","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Xiaolan Hu, Zden\\v{e}k Dvo\\v{r}\\'ak","submitted_at":"2018-09-14T14:26:15Z","abstract_excerpt":"A graph G is (a:b)-colorable if there exists an assignment of b-element subsets of {1,...,a} to vertices of G such that sets assigned to adjacent vertices are disjoint. We first show that for every triangle-free planar graph G and a vertex x of G, the graph G has a set coloring phi by subsets of {1,...,6} such that |phi(v)|>=2 for each vertex v of G and |phi(x)|=3. As a corollary, every triangle-free planar graph on n vertices is (6n:2n+1)-colorable. We further use this result to prove that for every Delta, there exists a constant M_Delta such that every planar graph G of girth at least five a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.05439","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":""},"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":"1809.05439","created_at":"2026-05-18T00:05:41.428624+00:00"},{"alias_kind":"arxiv_version","alias_value":"1809.05439v1","created_at":"2026-05-18T00:05:41.428624+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.05439","created_at":"2026-05-18T00:05:41.428624+00:00"},{"alias_kind":"pith_short_12","alias_value":"MAXMCJIB4EB3","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_16","alias_value":"MAXMCJIB4EB3PDGG","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_8","alias_value":"MAXMCJIB","created_at":"2026-05-18T12:32:37.024351+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/MAXMCJIB4EB3PDGGZKNGTW7IQF","json":"https://pith.science/pith/MAXMCJIB4EB3PDGGZKNGTW7IQF.json","graph_json":"https://pith.science/api/pith-number/MAXMCJIB4EB3PDGGZKNGTW7IQF/graph.json","events_json":"https://pith.science/api/pith-number/MAXMCJIB4EB3PDGGZKNGTW7IQF/events.json","paper":"https://pith.science/paper/MAXMCJIB"},"agent_actions":{"view_html":"https://pith.science/pith/MAXMCJIB4EB3PDGGZKNGTW7IQF","download_json":"https://pith.science/pith/MAXMCJIB4EB3PDGGZKNGTW7IQF.json","view_paper":"https://pith.science/paper/MAXMCJIB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1809.05439&json=true","fetch_graph":"https://pith.science/api/pith-number/MAXMCJIB4EB3PDGGZKNGTW7IQF/graph.json","fetch_events":"https://pith.science/api/pith-number/MAXMCJIB4EB3PDGGZKNGTW7IQF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MAXMCJIB4EB3PDGGZKNGTW7IQF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MAXMCJIB4EB3PDGGZKNGTW7IQF/action/storage_attestation","attest_author":"https://pith.science/pith/MAXMCJIB4EB3PDGGZKNGTW7IQF/action/author_attestation","sign_citation":"https://pith.science/pith/MAXMCJIB4EB3PDGGZKNGTW7IQF/action/citation_signature","submit_replication":"https://pith.science/pith/MAXMCJIB4EB3PDGGZKNGTW7IQF/action/replication_record"}},"created_at":"2026-05-18T00:05:41.428624+00:00","updated_at":"2026-05-18T00:05:41.428624+00:00"}