{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:YISJKKDO22YASI55BQ2AKCBKHZ","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":"e10abf14f045c83f861f0e948e8a385499baa7eb4407a3f4d0d42656ceb1d02c","cross_cats_sorted":["cs.DS","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-05-06T23:25:11Z","title_canon_sha256":"f288bed9c636f03b3b439090f22a767eab032db76c659461ea024c16010f0fc7"},"schema_version":"1.0","source":{"id":"1205.1254","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.1254","created_at":"2026-05-18T03:56:11Z"},{"alias_kind":"arxiv_version","alias_value":"1205.1254v1","created_at":"2026-05-18T03:56:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.1254","created_at":"2026-05-18T03:56:11Z"},{"alias_kind":"pith_short_12","alias_value":"YISJKKDO22YA","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_16","alias_value":"YISJKKDO22YASI55","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_8","alias_value":"YISJKKDO","created_at":"2026-05-18T12:27:27Z"}],"graph_snapshots":[{"event_id":"sha256:ecd0682714ac1e9f28a20fcc154407daeef749ef089d33dfddec48499ad79d41","target":"graph","created_at":"2026-05-18T03:56:11Z","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":"We consider the problem of coloring a 3-colorable graph in polynomial time using as few colors as possible. We present a combinatorial algorithm getting down to $\\tO(n^{4/11})$ colors. This is the first combinatorial improvement of Blum's $\\tO(n^{3/8})$ bound from FOCS'90. Like Blum's algorithm, our new algorithm composes nicely with recent semi-definite approaches. The current best bound is $O(n^{0.2072})$ colors by Chlamtac from FOCS'07. We now bring it down to $O(n^{0.2038})$ colors.","authors_text":"Ken-ichi Kawarabayashi, Mikkel Thorup","cross_cats":["cs.DS","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-05-06T23:25:11Z","title":"Combinatorial coloring of 3-colorable graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.1254","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:2c1f0f9dd2cdbda247d46333311b27515de76debfe26badc26fefb61db55a5ee","target":"record","created_at":"2026-05-18T03:56:11Z","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":"e10abf14f045c83f861f0e948e8a385499baa7eb4407a3f4d0d42656ceb1d02c","cross_cats_sorted":["cs.DS","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-05-06T23:25:11Z","title_canon_sha256":"f288bed9c636f03b3b439090f22a767eab032db76c659461ea024c16010f0fc7"},"schema_version":"1.0","source":{"id":"1205.1254","kind":"arxiv","version":1}},"canonical_sha256":"c22495286ed6b00923bd0c3405082a3e6ce686556156c8dab2648bf969ece910","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c22495286ed6b00923bd0c3405082a3e6ce686556156c8dab2648bf969ece910","first_computed_at":"2026-05-18T03:56:11.676359Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:56:11.676359Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5ubYE2a1a/RPGymGAP6EolZGGFVxT4Y7xq6dK1QKHfQpgxUGKJG1/1329kJQ6ugsX5rWgWZ1wF840o/tROCdCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:56:11.677041Z","signed_message":"canonical_sha256_bytes"},"source_id":"1205.1254","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2c1f0f9dd2cdbda247d46333311b27515de76debfe26badc26fefb61db55a5ee","sha256:ecd0682714ac1e9f28a20fcc154407daeef749ef089d33dfddec48499ad79d41"],"state_sha256":"c282a725d82bb9fde1c9cd25e918f565dc10b4f85bd8b1665582f10dd720ce3b"}