{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:DKVRJLAWRHFMBYX6APQIDSMSEQ","short_pith_number":"pith:DKVRJLAW","schema_version":"1.0","canonical_sha256":"1aab14ac1689cac0e2fe03e081c99224086eed1c45d7318902cbf8a46c2a63ce","source":{"kind":"arxiv","id":"2607.27159","version":1},"attestation_state":"computed","paper":{"title":"Breaking the $2^n$ barrier for graph $k$-coloring","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Kevin Pratt","submitted_at":"2026-07-29T17:36:11Z","abstract_excerpt":"We show that for all $k$, there exists $\\varepsilon_k > 0$ such that graph $k$-coloring can be solved by a randomized algorithm with one-sided error in time $O((2-\\varepsilon_k)^n)$. Prior to this work and independent concurrent work of Zamir [arXiv, 2026], exponential improvements over the $2^n \\cdot \\mathrm{poly}(n)$-time algorithm of Bj\\\"orklund, Husfeldt, and Koivisto [SIAM Journal on Computing, 2009] were only known for $k \\le 6$."},"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":"2607.27159","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-07-29T17:36:11Z","cross_cats_sorted":[],"title_canon_sha256":"f3c40e1529734a56ab599e58c95fba10e7dae3049ddd96d9254969ae774b77b3","abstract_canon_sha256":"a0347c6e4a95b57821b1359fee49426fde83356e743d2b11ecd93ac7cc484ca5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1aab14ac1689cac0e2fe03e081c99224086eed1c45d7318902cbf8a46c2a63ce","last_reissued_at":"2026-07-30T01:23:54.741427Z","signature_status":"unsigned_v0","first_computed_at":"2026-07-30T01:23:54.741427Z"},"graph_snapshot":{"paper":{"title":"Breaking the $2^n$ barrier for graph $k$-coloring","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Kevin Pratt","submitted_at":"2026-07-29T17:36:11Z","abstract_excerpt":"We show that for all $k$, there exists $\\varepsilon_k > 0$ such that graph $k$-coloring can be solved by a randomized algorithm with one-sided error in time $O((2-\\varepsilon_k)^n)$. Prior to this work and independent concurrent work of Zamir [arXiv, 2026], exponential improvements over the $2^n \\cdot \\mathrm{poly}(n)$-time algorithm of Bj\\\"orklund, Husfeldt, and Koivisto [SIAM Journal on Computing, 2009] were only known for $k \\le 6$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.27159","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2607.27159/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2607.27159","created_at":"2026-07-30T01:23:54.746426+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.27159v1","created_at":"2026-07-30T01:23:54.746426+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.27159","created_at":"2026-07-30T01:23:54.746426+00:00"},{"alias_kind":"pith_short_12","alias_value":"DKVRJLAWRHFM","created_at":"2026-07-30T01:23:54.746426+00:00"},{"alias_kind":"pith_short_16","alias_value":"DKVRJLAWRHFMBYX6","created_at":"2026-07-30T01:23:54.746426+00:00"},{"alias_kind":"pith_short_8","alias_value":"DKVRJLAW","created_at":"2026-07-30T01:23:54.746426+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/DKVRJLAWRHFMBYX6APQIDSMSEQ","json":"https://pith.science/pith/DKVRJLAWRHFMBYX6APQIDSMSEQ.json","graph_json":"https://pith.science/api/pith-number/DKVRJLAWRHFMBYX6APQIDSMSEQ/graph.json","events_json":"https://pith.science/api/pith-number/DKVRJLAWRHFMBYX6APQIDSMSEQ/events.json","paper":"https://pith.science/paper/DKVRJLAW"},"agent_actions":{"view_html":"https://pith.science/pith/DKVRJLAWRHFMBYX6APQIDSMSEQ","download_json":"https://pith.science/pith/DKVRJLAWRHFMBYX6APQIDSMSEQ.json","view_paper":"https://pith.science/paper/DKVRJLAW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.27159&json=true","fetch_graph":"https://pith.science/api/pith-number/DKVRJLAWRHFMBYX6APQIDSMSEQ/graph.json","fetch_events":"https://pith.science/api/pith-number/DKVRJLAWRHFMBYX6APQIDSMSEQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DKVRJLAWRHFMBYX6APQIDSMSEQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DKVRJLAWRHFMBYX6APQIDSMSEQ/action/storage_attestation","attest_author":"https://pith.science/pith/DKVRJLAWRHFMBYX6APQIDSMSEQ/action/author_attestation","sign_citation":"https://pith.science/pith/DKVRJLAWRHFMBYX6APQIDSMSEQ/action/citation_signature","submit_replication":"https://pith.science/pith/DKVRJLAWRHFMBYX6APQIDSMSEQ/action/replication_record"}},"created_at":"2026-07-30T01:23:54.746426+00:00","updated_at":"2026-07-30T01:23:54.746426+00:00"}