{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:AQRJ5SAUAXVFMVS3OCH6XRGKH3","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":"f1e1cfb04ed41587c718e3ab9c58d07fe2d4f7ef2d25a1cb50b8ef6fbf305aed","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-14T19:44:39Z","title_canon_sha256":"7370abbc29599ed522a9d68aecc48cd4434a35f4c43cb713d795d69d89214c90"},"schema_version":"1.0","source":{"id":"1504.03670","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.03670","created_at":"2026-05-18T01:37:07Z"},{"alias_kind":"arxiv_version","alias_value":"1504.03670v3","created_at":"2026-05-18T01:37:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.03670","created_at":"2026-05-18T01:37:07Z"},{"alias_kind":"pith_short_12","alias_value":"AQRJ5SAUAXVF","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"AQRJ5SAUAXVFMVS3","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"AQRJ5SAU","created_at":"2026-05-18T12:29:10Z"}],"graph_snapshots":[{"event_id":"sha256:53a4a54c06d07829bdbc852e9e42a78c55a72ddabf02c4b114a733afd169ac88","target":"graph","created_at":"2026-05-18T01:37:07Z","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":"Lokshtanov, Marx, and Saurabh SODA 2011 proved that there is no $(k-\\epsilon)^{\\operatorname{pw}(G)}\\operatorname{poly}(n)$ time algorithm for deciding if an $n$-vertex graph $G$ with pathwidth $\\operatorname{pw}(G)$ admits a proper vertex coloring with $k$ colors unless the Strong Exponential Time Hypothesis (SETH) is false. We show here that nevertheless, when $k>\\lfloor \\Delta/2 \\rfloor + 1$, where $\\Delta$ is the maximum degree in the graph $G$, there is a better algorithm, at least when there are few colorings. We present a Monte Carlo algorithm that given a graph $G$ along with a path de","authors_text":"Andreas Bj\\\"orklund","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-14T19:44:39Z","title":"Coloring Graphs having Few Colorings over Path Decompositions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.03670","kind":"arxiv","version":3},"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:88c6157d7a056a69583bf93a27023cafdab086351047de3a22a0cae4b0a42f2d","target":"record","created_at":"2026-05-18T01:37:07Z","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":"f1e1cfb04ed41587c718e3ab9c58d07fe2d4f7ef2d25a1cb50b8ef6fbf305aed","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-14T19:44:39Z","title_canon_sha256":"7370abbc29599ed522a9d68aecc48cd4434a35f4c43cb713d795d69d89214c90"},"schema_version":"1.0","source":{"id":"1504.03670","kind":"arxiv","version":3}},"canonical_sha256":"04229ec81405ea56565b708febc4ca3eea853f1dece40e4138084ed307789347","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"04229ec81405ea56565b708febc4ca3eea853f1dece40e4138084ed307789347","first_computed_at":"2026-05-18T01:37:07.381946Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:37:07.381946Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"D8dV7NhOTvffIBItbz7syT9gH4uvp6kgVykuRyq4r3pqXMLtqGjHGfPZlXxPPL8P+oXN+fp6ZPyViVABFsrcBA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:37:07.382397Z","signed_message":"canonical_sha256_bytes"},"source_id":"1504.03670","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:88c6157d7a056a69583bf93a27023cafdab086351047de3a22a0cae4b0a42f2d","sha256:53a4a54c06d07829bdbc852e9e42a78c55a72ddabf02c4b114a733afd169ac88"],"state_sha256":"9404b9789f796915917fe69728a0c4c677415b606b183f65040492732ed8f4a7"}