{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:JP7UYA7KC57ZUMTFWTO2ARHVAE","short_pith_number":"pith:JP7UYA7K","canonical_record":{"source":{"id":"1807.06285","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-07-17T08:59:33Z","cross_cats_sorted":[],"title_canon_sha256":"2c2f2351ccd2146f5854fcb68d1b44488bbdb7702ae542f2ac7818eb1be12aea","abstract_canon_sha256":"87fc9a43dd9607bc35ceb8a71ae6c4fa4bf30b50d51954bcc92de976622bdffc"},"schema_version":"1.0"},"canonical_sha256":"4bff4c03ea177f9a3265b4dda044f5011ebfc7500f3cd993b0b25f1c31f24ba5","source":{"kind":"arxiv","id":"1807.06285","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.06285","created_at":"2026-05-18T00:10:33Z"},{"alias_kind":"arxiv_version","alias_value":"1807.06285v1","created_at":"2026-05-18T00:10:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.06285","created_at":"2026-05-18T00:10:33Z"},{"alias_kind":"pith_short_12","alias_value":"JP7UYA7KC57Z","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"JP7UYA7KC57ZUMTF","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"JP7UYA7K","created_at":"2026-05-18T12:32:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:JP7UYA7KC57ZUMTFWTO2ARHVAE","target":"record","payload":{"canonical_record":{"source":{"id":"1807.06285","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-07-17T08:59:33Z","cross_cats_sorted":[],"title_canon_sha256":"2c2f2351ccd2146f5854fcb68d1b44488bbdb7702ae542f2ac7818eb1be12aea","abstract_canon_sha256":"87fc9a43dd9607bc35ceb8a71ae6c4fa4bf30b50d51954bcc92de976622bdffc"},"schema_version":"1.0"},"canonical_sha256":"4bff4c03ea177f9a3265b4dda044f5011ebfc7500f3cd993b0b25f1c31f24ba5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:10:33.472503Z","signature_b64":"a5X+DsxfVQvpIK9RrADNIIGbAbZIZAjOh1lfTN9VAloxcrwVKoV+PqDAmyX3+7sV7YMqrtm5ZlE6H+xvpLjMDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4bff4c03ea177f9a3265b4dda044f5011ebfc7500f3cd993b0b25f1c31f24ba5","last_reissued_at":"2026-05-18T00:10:33.471792Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:10:33.471792Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1807.06285","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:10:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"s5jjNDraMdsdDmqTasTSHetRM2Vd8heOcx/WE3TJxInH9d8Y7TuE0JkOBBgT3PJS44MXqjk8rA2errxH6ZsHBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T03:58:45.006546Z"},"content_sha256":"ad11c76f83bfa860fb51fddf6a7084b99afc8b0aaefa6d49ffea927d162fd92f","schema_version":"1.0","event_id":"sha256:ad11c76f83bfa860fb51fddf6a7084b99afc8b0aaefa6d49ffea927d162fd92f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:JP7UYA7KC57ZUMTFWTO2ARHVAE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fractional chromatic number of a random subgraph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bojan Mohar, Hehui Wu","submitted_at":"2018-07-17T08:59:33Z","abstract_excerpt":"It is well known that a random subgraph of the complete graph $K_n$ has chromatic number $\\Theta(n/\\log n)$ w.h.p. Boris Bukh asked whether the same holds for a random subgraph of any $n$-chromatic graph, at least in expectation. In this paper it is shown that for every graph, whose fractional chromatic number is at least $n$, the fractional chromatic number of its random subgraph is at least $n/(8\\log_2(4n))$ with probability more than $1-\\frac{1}{2n}$. This gives the affirmative answer for a strengthening of Bukh's question for the fractional chromatic number."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.06285","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:10:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ggY19Qpp0bbu2OSVYrnwX+GUj5662Qo69+JN5PJ18uOGKfz4oCHXBmbgp0QWV1n2wEbTOm0j1Zm//9w6TNEMBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T03:58:45.006891Z"},"content_sha256":"4fcdb1591bb57537ad5da1203421c0bd159d429dcaca03bc8a075e4fb5ed0459","schema_version":"1.0","event_id":"sha256:4fcdb1591bb57537ad5da1203421c0bd159d429dcaca03bc8a075e4fb5ed0459"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JP7UYA7KC57ZUMTFWTO2ARHVAE/bundle.json","state_url":"https://pith.science/pith/JP7UYA7KC57ZUMTFWTO2ARHVAE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JP7UYA7KC57ZUMTFWTO2ARHVAE/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-07T03:58:45Z","links":{"resolver":"https://pith.science/pith/JP7UYA7KC57ZUMTFWTO2ARHVAE","bundle":"https://pith.science/pith/JP7UYA7KC57ZUMTFWTO2ARHVAE/bundle.json","state":"https://pith.science/pith/JP7UYA7KC57ZUMTFWTO2ARHVAE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JP7UYA7KC57ZUMTFWTO2ARHVAE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:JP7UYA7KC57ZUMTFWTO2ARHVAE","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":"87fc9a43dd9607bc35ceb8a71ae6c4fa4bf30b50d51954bcc92de976622bdffc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-07-17T08:59:33Z","title_canon_sha256":"2c2f2351ccd2146f5854fcb68d1b44488bbdb7702ae542f2ac7818eb1be12aea"},"schema_version":"1.0","source":{"id":"1807.06285","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.06285","created_at":"2026-05-18T00:10:33Z"},{"alias_kind":"arxiv_version","alias_value":"1807.06285v1","created_at":"2026-05-18T00:10:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.06285","created_at":"2026-05-18T00:10:33Z"},{"alias_kind":"pith_short_12","alias_value":"JP7UYA7KC57Z","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"JP7UYA7KC57ZUMTF","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"JP7UYA7K","created_at":"2026-05-18T12:32:31Z"}],"graph_snapshots":[{"event_id":"sha256:4fcdb1591bb57537ad5da1203421c0bd159d429dcaca03bc8a075e4fb5ed0459","target":"graph","created_at":"2026-05-18T00:10:33Z","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":"It is well known that a random subgraph of the complete graph $K_n$ has chromatic number $\\Theta(n/\\log n)$ w.h.p. Boris Bukh asked whether the same holds for a random subgraph of any $n$-chromatic graph, at least in expectation. In this paper it is shown that for every graph, whose fractional chromatic number is at least $n$, the fractional chromatic number of its random subgraph is at least $n/(8\\log_2(4n))$ with probability more than $1-\\frac{1}{2n}$. This gives the affirmative answer for a strengthening of Bukh's question for the fractional chromatic number.","authors_text":"Bojan Mohar, Hehui Wu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-07-17T08:59:33Z","title":"Fractional chromatic number of a random subgraph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.06285","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:ad11c76f83bfa860fb51fddf6a7084b99afc8b0aaefa6d49ffea927d162fd92f","target":"record","created_at":"2026-05-18T00:10:33Z","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":"87fc9a43dd9607bc35ceb8a71ae6c4fa4bf30b50d51954bcc92de976622bdffc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-07-17T08:59:33Z","title_canon_sha256":"2c2f2351ccd2146f5854fcb68d1b44488bbdb7702ae542f2ac7818eb1be12aea"},"schema_version":"1.0","source":{"id":"1807.06285","kind":"arxiv","version":1}},"canonical_sha256":"4bff4c03ea177f9a3265b4dda044f5011ebfc7500f3cd993b0b25f1c31f24ba5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4bff4c03ea177f9a3265b4dda044f5011ebfc7500f3cd993b0b25f1c31f24ba5","first_computed_at":"2026-05-18T00:10:33.471792Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:10:33.471792Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"a5X+DsxfVQvpIK9RrADNIIGbAbZIZAjOh1lfTN9VAloxcrwVKoV+PqDAmyX3+7sV7YMqrtm5ZlE6H+xvpLjMDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:10:33.472503Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.06285","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ad11c76f83bfa860fb51fddf6a7084b99afc8b0aaefa6d49ffea927d162fd92f","sha256:4fcdb1591bb57537ad5da1203421c0bd159d429dcaca03bc8a075e4fb5ed0459"],"state_sha256":"c282c404fc47d50d22aa7d0ff6ddfaf6a5042f78e2c8bf036271803f40ff4848"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dbgLfjWPvgXAkQNktXHokPNHgAQkH+5NUy5db8EH86Jg+NHir2qf56Q3mlVavsZJM51+FQt5lMzK6sipZggPDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T03:58:45.008785Z","bundle_sha256":"56b040e6499f8b4dc4cab81672eae50807f8400d99404e07c73db5c4e0e18630"}}