{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:MAXMCJIB4EB3PDGGZKNGTW7IQF","short_pith_number":"pith:MAXMCJIB","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"},"canonical_sha256":"602ec12501e103b78cc6ca9a69dbe8815f92143c5c1385342b5a9faf6dde7bb0","source":{"kind":"arxiv","id":"1809.05439","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.05439","created_at":"2026-05-18T00:05:41Z"},{"alias_kind":"arxiv_version","alias_value":"1809.05439v1","created_at":"2026-05-18T00:05:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.05439","created_at":"2026-05-18T00:05:41Z"},{"alias_kind":"pith_short_12","alias_value":"MAXMCJIB4EB3","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"MAXMCJIB4EB3PDGG","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"MAXMCJIB","created_at":"2026-05-18T12:32:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:MAXMCJIB4EB3PDGGZKNGTW7IQF","target":"record","payload":{"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"},"canonical_sha256":"602ec12501e103b78cc6ca9a69dbe8815f92143c5c1385342b5a9faf6dde7bb0","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"},"source_kind":"arxiv","source_id":"1809.05439","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-18T00:05:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k82Ywz7QyqgGk67P+TngrBtjEuJx7vS96gfMYWMN4jNXiQOe4jRaQI5SxnIWsm32VfihelnUO3uIl9CICpTqDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T16:00:23.862574Z"},"content_sha256":"e0dfcce76d66b67bb12c0fcfd9796a582c6a4a865622c582547daced2981a503","schema_version":"1.0","event_id":"sha256:e0dfcce76d66b67bb12c0fcfd9796a582c6a4a865622c582547daced2981a503"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:MAXMCJIB4EB3PDGGZKNGTW7IQF","target":"graph","payload":{"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"},"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-18T00:05:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0YSKjaLwYsKLVkvN5KhiDBvS6nbJaN48AMBgc7DcmE1TP0S3fdqnjLBHe8sk6Hp3ruzcJMZkg4jVBuXeFUvjDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T16:00:23.862917Z"},"content_sha256":"5e5395a46e78d89db6ba4164374ce5dba7e79e4d5071a798cd5a7726e73bb85f","schema_version":"1.0","event_id":"sha256:5e5395a46e78d89db6ba4164374ce5dba7e79e4d5071a798cd5a7726e73bb85f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MAXMCJIB4EB3PDGGZKNGTW7IQF/bundle.json","state_url":"https://pith.science/pith/MAXMCJIB4EB3PDGGZKNGTW7IQF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MAXMCJIB4EB3PDGGZKNGTW7IQF/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-06-25T16:00:23Z","links":{"resolver":"https://pith.science/pith/MAXMCJIB4EB3PDGGZKNGTW7IQF","bundle":"https://pith.science/pith/MAXMCJIB4EB3PDGGZKNGTW7IQF/bundle.json","state":"https://pith.science/pith/MAXMCJIB4EB3PDGGZKNGTW7IQF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MAXMCJIB4EB3PDGGZKNGTW7IQF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:MAXMCJIB4EB3PDGGZKNGTW7IQF","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":"073a51a6ed0bdfbcf73efd345c6b46bf33c5acf41315b84efbc71f420d2af72c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-09-14T14:26:15Z","title_canon_sha256":"d8c09bb415d573f5848696b4224d05ae56d60ee61ce088d5bc0e2e06bf175d4e"},"schema_version":"1.0","source":{"id":"1809.05439","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1809.05439","created_at":"2026-05-18T00:05:41Z"},{"alias_kind":"arxiv_version","alias_value":"1809.05439v1","created_at":"2026-05-18T00:05:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.05439","created_at":"2026-05-18T00:05:41Z"},{"alias_kind":"pith_short_12","alias_value":"MAXMCJIB4EB3","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"MAXMCJIB4EB3PDGG","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"MAXMCJIB","created_at":"2026-05-18T12:32:37Z"}],"graph_snapshots":[{"event_id":"sha256:5e5395a46e78d89db6ba4164374ce5dba7e79e4d5071a798cd5a7726e73bb85f","target":"graph","created_at":"2026-05-18T00:05:41Z","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"},"paper":{"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","authors_text":"Xiaolan Hu, Zden\\v{e}k Dvo\\v{r}\\'ak","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-09-14T14:26:15Z","title":"Fractional coloring of planar graphs of girth five"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.05439","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:e0dfcce76d66b67bb12c0fcfd9796a582c6a4a865622c582547daced2981a503","target":"record","created_at":"2026-05-18T00:05:41Z","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":"073a51a6ed0bdfbcf73efd345c6b46bf33c5acf41315b84efbc71f420d2af72c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-09-14T14:26:15Z","title_canon_sha256":"d8c09bb415d573f5848696b4224d05ae56d60ee61ce088d5bc0e2e06bf175d4e"},"schema_version":"1.0","source":{"id":"1809.05439","kind":"arxiv","version":1}},"canonical_sha256":"602ec12501e103b78cc6ca9a69dbe8815f92143c5c1385342b5a9faf6dde7bb0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"602ec12501e103b78cc6ca9a69dbe8815f92143c5c1385342b5a9faf6dde7bb0","first_computed_at":"2026-05-18T00:05:41.428548Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:05:41.428548Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kGb2DOeKfuRkZNsK6Xd2jUeF7XTavaxB7TppDtJzIwbGBNIZTeCTttpYWsvtcOa0CQ7QolyW/YWyjBB864yODw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:05:41.429113Z","signed_message":"canonical_sha256_bytes"},"source_id":"1809.05439","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e0dfcce76d66b67bb12c0fcfd9796a582c6a4a865622c582547daced2981a503","sha256:5e5395a46e78d89db6ba4164374ce5dba7e79e4d5071a798cd5a7726e73bb85f"],"state_sha256":"3313b6b6cffcb04e33fda01e8fd868e50550dee89242983c9e629f2119502085"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fNBx3czHi2zpw9XeIYeaCDWqkql+TIZWRgSkaoUXYVxN/nNFZFffZNMhnUikbgqvU84e+CBBJqMi2++3r5IxBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T16:00:23.864821Z","bundle_sha256":"3d80bde920b3cb5bc77663f44133361ea08c638f0788d03cb7a29998f8e93202"}}