{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:7KOS2YO2T4AZHLYR5QZ65DUFMD","short_pith_number":"pith:7KOS2YO2","canonical_record":{"source":{"id":"2607.25973","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.DS","submitted_at":"2026-07-28T16:53:58Z","cross_cats_sorted":[],"title_canon_sha256":"58c723ba9efda34ed0648e55ad972b0b03fca9603beafec5bce5e00ae6c0831e","abstract_canon_sha256":"e80a34b17eabbbaa71bbf5d0e8c144c124592bbb23b5c8acd2f01f4905f9e9d8"},"schema_version":"1.0"},"canonical_sha256":"fa9d2d61da9f0193af11ec33ee8e8560facb8e4e05e2fe0e3457859c6ae84e44","source":{"kind":"arxiv","id":"2607.25973","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.25973","created_at":"2026-07-29T01:26:17Z"},{"alias_kind":"arxiv_version","alias_value":"2607.25973v1","created_at":"2026-07-29T01:26:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.25973","created_at":"2026-07-29T01:26:17Z"},{"alias_kind":"pith_short_12","alias_value":"7KOS2YO2T4AZ","created_at":"2026-07-29T01:26:17Z"},{"alias_kind":"pith_short_16","alias_value":"7KOS2YO2T4AZHLYR","created_at":"2026-07-29T01:26:17Z"},{"alias_kind":"pith_short_8","alias_value":"7KOS2YO2","created_at":"2026-07-29T01:26:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:7KOS2YO2T4AZHLYR5QZ65DUFMD","target":"record","payload":{"canonical_record":{"source":{"id":"2607.25973","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.DS","submitted_at":"2026-07-28T16:53:58Z","cross_cats_sorted":[],"title_canon_sha256":"58c723ba9efda34ed0648e55ad972b0b03fca9603beafec5bce5e00ae6c0831e","abstract_canon_sha256":"e80a34b17eabbbaa71bbf5d0e8c144c124592bbb23b5c8acd2f01f4905f9e9d8"},"schema_version":"1.0"},"canonical_sha256":"fa9d2d61da9f0193af11ec33ee8e8560facb8e4e05e2fe0e3457859c6ae84e44","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-29T01:26:17.237985Z","signature_b64":"+a5cHgulhlJYj3IyLhLyh0KvRjqIB/5s25eiM+s2uvIuySPbNlZm5qZe+cxApBTA3NC78yTXDqMEq5HS4FCqAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fa9d2d61da9f0193af11ec33ee8e8560facb8e4e05e2fe0e3457859c6ae84e44","last_reissued_at":"2026-07-29T01:26:17.237091Z","signature_status":"signed_v1","first_computed_at":"2026-07-29T01:26:17.237091Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2607.25973","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-07-29T01:26:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eLLYYRx5byPL30uiu0GGdh5b9LuhsgMyjMuPjdypjRAP6nx3U3NlEXXLziE5rDEgg/RtcmDUbnrnK5NMfDU+BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T14:14:53.233679Z"},"content_sha256":"6e3ffa1d3e447113c1b39e8cddd930a62c214bc23ca8d6859f99b7064e99d782","schema_version":"1.0","event_id":"sha256:6e3ffa1d3e447113c1b39e8cddd930a62c214bc23ca8d6859f99b7064e99d782"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:7KOS2YO2T4AZHLYR5QZ65DUFMD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"k-Coloring is Faster than Computing the Chromatic Number","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Or Zamir","submitted_at":"2026-07-28T16:53:58Z","abstract_excerpt":"We prove that $k$-coloring on $n$-vertex graphs has a randomized algorithm running in time $(2-\\varepsilon_k)^n$, where $\\varepsilon_k>0$ for every fixed $k$. Previously, only the cases $k\\leq 6$ were known to have faster solutions than the general $O^\\star\\bigl(2^n\\bigr)$ time algorithm of [Bj\\\"{o}rklund, Husfeldt, Koivisto, SICOMP 2009] that computes the chromatic number.\n  We resolve this long-standing open problem by generalizing and combining tools from the $(k+2)$-coloring to $k$-list-coloring reduction of [Zamir, ICALP 2021] and the hypergraph-containers based approach in [Zamir, STOC 2"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.25973","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.25973/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"},"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-07-29T01:26:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eGaZ89xXjZzMx/lw0mzDi/ynT4aXTYkRzfKjCuNAnIKmXtj6uyY1CWm+uYkTN2HIADGU3U18Fv+UKXbp2xBiAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T14:14:53.234327Z"},"content_sha256":"8bd63516f73920f75813932a5ae67a3d653819dcc4fc4adc43cd9457e35aae19","schema_version":"1.0","event_id":"sha256:8bd63516f73920f75813932a5ae67a3d653819dcc4fc4adc43cd9457e35aae19"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7KOS2YO2T4AZHLYR5QZ65DUFMD/bundle.json","state_url":"https://pith.science/pith/7KOS2YO2T4AZHLYR5QZ65DUFMD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7KOS2YO2T4AZHLYR5QZ65DUFMD/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-08-12T14:14:53Z","links":{"resolver":"https://pith.science/pith/7KOS2YO2T4AZHLYR5QZ65DUFMD","bundle":"https://pith.science/pith/7KOS2YO2T4AZHLYR5QZ65DUFMD/bundle.json","state":"https://pith.science/pith/7KOS2YO2T4AZHLYR5QZ65DUFMD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7KOS2YO2T4AZHLYR5QZ65DUFMD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:7KOS2YO2T4AZHLYR5QZ65DUFMD","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":"e80a34b17eabbbaa71bbf5d0e8c144c124592bbb23b5c8acd2f01f4905f9e9d8","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.DS","submitted_at":"2026-07-28T16:53:58Z","title_canon_sha256":"58c723ba9efda34ed0648e55ad972b0b03fca9603beafec5bce5e00ae6c0831e"},"schema_version":"1.0","source":{"id":"2607.25973","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.25973","created_at":"2026-07-29T01:26:17Z"},{"alias_kind":"arxiv_version","alias_value":"2607.25973v1","created_at":"2026-07-29T01:26:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.25973","created_at":"2026-07-29T01:26:17Z"},{"alias_kind":"pith_short_12","alias_value":"7KOS2YO2T4AZ","created_at":"2026-07-29T01:26:17Z"},{"alias_kind":"pith_short_16","alias_value":"7KOS2YO2T4AZHLYR","created_at":"2026-07-29T01:26:17Z"},{"alias_kind":"pith_short_8","alias_value":"7KOS2YO2","created_at":"2026-07-29T01:26:17Z"}],"graph_snapshots":[{"event_id":"sha256:8bd63516f73920f75813932a5ae67a3d653819dcc4fc4adc43cd9457e35aae19","target":"graph","created_at":"2026-07-29T01:26:17Z","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/2607.25973/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We prove that $k$-coloring on $n$-vertex graphs has a randomized algorithm running in time $(2-\\varepsilon_k)^n$, where $\\varepsilon_k>0$ for every fixed $k$. Previously, only the cases $k\\leq 6$ were known to have faster solutions than the general $O^\\star\\bigl(2^n\\bigr)$ time algorithm of [Bj\\\"{o}rklund, Husfeldt, Koivisto, SICOMP 2009] that computes the chromatic number.\n  We resolve this long-standing open problem by generalizing and combining tools from the $(k+2)$-coloring to $k$-list-coloring reduction of [Zamir, ICALP 2021] and the hypergraph-containers based approach in [Zamir, STOC 2","authors_text":"Or Zamir","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.DS","submitted_at":"2026-07-28T16:53:58Z","title":"k-Coloring is Faster than Computing the Chromatic Number"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.25973","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:6e3ffa1d3e447113c1b39e8cddd930a62c214bc23ca8d6859f99b7064e99d782","target":"record","created_at":"2026-07-29T01:26:17Z","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":"e80a34b17eabbbaa71bbf5d0e8c144c124592bbb23b5c8acd2f01f4905f9e9d8","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.DS","submitted_at":"2026-07-28T16:53:58Z","title_canon_sha256":"58c723ba9efda34ed0648e55ad972b0b03fca9603beafec5bce5e00ae6c0831e"},"schema_version":"1.0","source":{"id":"2607.25973","kind":"arxiv","version":1}},"canonical_sha256":"fa9d2d61da9f0193af11ec33ee8e8560facb8e4e05e2fe0e3457859c6ae84e44","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fa9d2d61da9f0193af11ec33ee8e8560facb8e4e05e2fe0e3457859c6ae84e44","first_computed_at":"2026-07-29T01:26:17.237091Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-29T01:26:17.237091Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+a5cHgulhlJYj3IyLhLyh0KvRjqIB/5s25eiM+s2uvIuySPbNlZm5qZe+cxApBTA3NC78yTXDqMEq5HS4FCqAg==","signature_status":"signed_v1","signed_at":"2026-07-29T01:26:17.237985Z","signed_message":"canonical_sha256_bytes"},"source_id":"2607.25973","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6e3ffa1d3e447113c1b39e8cddd930a62c214bc23ca8d6859f99b7064e99d782","sha256:8bd63516f73920f75813932a5ae67a3d653819dcc4fc4adc43cd9457e35aae19"],"state_sha256":"65b2cb28772ecd82bdf6d58dde01c89f5ac44fe40e49d3d0564b8b4fd1de3aa9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ov241I1vzjl8xQjuB7DhUbiur9tqkynd5xtItqt2S+SgmGXn5oSqw0JNIy4w898UsNaCrnfhZH8klZw9Y2IBBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-12T14:14:53.238796Z","bundle_sha256":"e3698813c57b917d71d241be0d3d31dd53fce0a7d76b19c1844222ff79d4d422"}}