{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:N2GDS7CXTGJCTELU2DEOS7QVBS","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":"7dad4737324a6d34b3ee5447ca8520e2d30d03a7936e26cf8cc95951f351eef6","cross_cats_sorted":["math.CO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-06-01T08:19:59Z","title_canon_sha256":"976aa6b859a6238b36394f57a0d698543c43509c5a3efd1cb091a34dad8083c6"},"schema_version":"1.0","source":{"id":"2406.00357","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2406.00357","created_at":"2026-07-05T08:26:00Z"},{"alias_kind":"arxiv_version","alias_value":"2406.00357v1","created_at":"2026-07-05T08:26:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.00357","created_at":"2026-07-05T08:26:00Z"},{"alias_kind":"pith_short_12","alias_value":"N2GDS7CXTGJC","created_at":"2026-07-05T08:26:00Z"},{"alias_kind":"pith_short_16","alias_value":"N2GDS7CXTGJCTELU","created_at":"2026-07-05T08:26:00Z"},{"alias_kind":"pith_short_8","alias_value":"N2GDS7CX","created_at":"2026-07-05T08:26:00Z"}],"graph_snapshots":[{"event_id":"sha256:d247a8eba48f51407f2682b22028a4b7289c099827576ec61c716da391bce0b6","target":"graph","created_at":"2026-07-05T08:26:00Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2406.00357/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We consider the problem of coloring a 3-colorable graph in polynomial time using as few colors as possible. This is one of the most challenging problems in graph algorithms.\n  In this paper using Blum's notion of ``progress'', we develop a new combinatorial algorithm for the following: Given any 3-colorable graph with minimum degree $\\ds>\\sqrt n$, we can, in polynomial time, make progress towards a $k$-coloring for some $k=\\sqrt{n/\\ds}\\cdot n^{o(1)}$.\n  We balance our main result with the best-known semi-definite(SDP) approach which we use for degrees below $n^{0.605073}$. As a result, we show","authors_text":"Hirotaka Yoneda, Ken-ichi Kawarabayashi, Mikkel Thorup","cross_cats":["math.CO"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-06-01T08:19:59Z","title":"Better coloring of 3-colorable graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.00357","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:6624ca6d247f89bb4abcc7a601cd6794dd2cea60b40b2cdc39c5d94724444099","target":"record","created_at":"2026-07-05T08:26:00Z","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":"7dad4737324a6d34b3ee5447ca8520e2d30d03a7936e26cf8cc95951f351eef6","cross_cats_sorted":["math.CO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-06-01T08:19:59Z","title_canon_sha256":"976aa6b859a6238b36394f57a0d698543c43509c5a3efd1cb091a34dad8083c6"},"schema_version":"1.0","source":{"id":"2406.00357","kind":"arxiv","version":1}},"canonical_sha256":"6e8c397c579992299174d0c8e97e150cbd51dbf6e72d948fc4b3a5223d1faf40","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6e8c397c579992299174d0c8e97e150cbd51dbf6e72d948fc4b3a5223d1faf40","first_computed_at":"2026-07-05T08:26:00.669110Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:26:00.669110Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UcnX/NopDT0TkFlGPWux0n1GgsHGFY9+pyIl5wtE29539MGnPLZgNB+GWR9ka3NZ1ebEnB124Tjk0Rnc4qYKAw==","signature_status":"signed_v1","signed_at":"2026-07-05T08:26:00.669657Z","signed_message":"canonical_sha256_bytes"},"source_id":"2406.00357","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6624ca6d247f89bb4abcc7a601cd6794dd2cea60b40b2cdc39c5d94724444099","sha256:d247a8eba48f51407f2682b22028a4b7289c099827576ec61c716da391bce0b6"],"state_sha256":"816cbc9ddc777b349fc321d156b522cdf56d1e193fe2d52395c650174bd2df13"}