{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:LNBNPUYMRG6S6ZIVUE6ZDYPRFX","short_pith_number":"pith:LNBNPUYM","schema_version":"1.0","canonical_sha256":"5b42d7d30c89bd2f6515a13d91e1f12dda62115ed0ccbbf51dee34470c2c8ff9","source":{"kind":"arxiv","id":"1701.06985","version":1},"attestation_state":"computed","paper":{"title":"Fine-Grained Parameterized Complexity Analysis of Graph Coloring Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Bart M. P. Jansen, Lars Jaffke","submitted_at":"2017-01-24T17:13:26Z","abstract_excerpt":"The $q$-Coloring problem asks whether the vertices of a graph can be properly colored with $q$ colors. Lokshtanov et al. [SODA 2011] showed that $q$-Coloring on graphs with a feedback vertex set of size $k$ cannot be solved in time $\\mathcal{O}^*((q-\\varepsilon)^k)$, for any $\\varepsilon > 0$, unless the Strong Exponential-Time Hypothesis (SETH) fails. In this paper we perform a fine-grained analysis of the complexity of $q$-Coloring with respect to a hierarchy of parameters. We show that even when parameterized by the vertex cover number, $q$ must appear in the base of the exponent: Unless ET"},"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":"1701.06985","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-01-24T17:13:26Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"02ec2f8865eccff5d8d23df28682932960ec46adb6e7c69a4bf9bf30a32ecfdb","abstract_canon_sha256":"881fb43ffc889f886a9da4c6c9ad1ea74b118021cdc22ab27d7da65ccdbb3f8e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:52:09.974731Z","signature_b64":"P8zd4G64cg1HF1MKyxnj8aRqI+xTcY5ENU2S71iBiQ8WIF4dzIoyt97vezVmEa/iDN1r3HfqHXt9atAugY/5AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5b42d7d30c89bd2f6515a13d91e1f12dda62115ed0ccbbf51dee34470c2c8ff9","last_reissued_at":"2026-05-18T00:52:09.974108Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:52:09.974108Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fine-Grained Parameterized Complexity Analysis of Graph Coloring Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Bart M. P. Jansen, Lars Jaffke","submitted_at":"2017-01-24T17:13:26Z","abstract_excerpt":"The $q$-Coloring problem asks whether the vertices of a graph can be properly colored with $q$ colors. Lokshtanov et al. [SODA 2011] showed that $q$-Coloring on graphs with a feedback vertex set of size $k$ cannot be solved in time $\\mathcal{O}^*((q-\\varepsilon)^k)$, for any $\\varepsilon > 0$, unless the Strong Exponential-Time Hypothesis (SETH) fails. In this paper we perform a fine-grained analysis of the complexity of $q$-Coloring with respect to a hierarchy of parameters. We show that even when parameterized by the vertex cover number, $q$ must appear in the base of the exponent: Unless ET"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.06985","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":""},"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":"1701.06985","created_at":"2026-05-18T00:52:09.974204+00:00"},{"alias_kind":"arxiv_version","alias_value":"1701.06985v1","created_at":"2026-05-18T00:52:09.974204+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.06985","created_at":"2026-05-18T00:52:09.974204+00:00"},{"alias_kind":"pith_short_12","alias_value":"LNBNPUYMRG6S","created_at":"2026-05-18T12:31:28.150371+00:00"},{"alias_kind":"pith_short_16","alias_value":"LNBNPUYMRG6S6ZIV","created_at":"2026-05-18T12:31:28.150371+00:00"},{"alias_kind":"pith_short_8","alias_value":"LNBNPUYM","created_at":"2026-05-18T12:31:28.150371+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/LNBNPUYMRG6S6ZIVUE6ZDYPRFX","json":"https://pith.science/pith/LNBNPUYMRG6S6ZIVUE6ZDYPRFX.json","graph_json":"https://pith.science/api/pith-number/LNBNPUYMRG6S6ZIVUE6ZDYPRFX/graph.json","events_json":"https://pith.science/api/pith-number/LNBNPUYMRG6S6ZIVUE6ZDYPRFX/events.json","paper":"https://pith.science/paper/LNBNPUYM"},"agent_actions":{"view_html":"https://pith.science/pith/LNBNPUYMRG6S6ZIVUE6ZDYPRFX","download_json":"https://pith.science/pith/LNBNPUYMRG6S6ZIVUE6ZDYPRFX.json","view_paper":"https://pith.science/paper/LNBNPUYM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1701.06985&json=true","fetch_graph":"https://pith.science/api/pith-number/LNBNPUYMRG6S6ZIVUE6ZDYPRFX/graph.json","fetch_events":"https://pith.science/api/pith-number/LNBNPUYMRG6S6ZIVUE6ZDYPRFX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LNBNPUYMRG6S6ZIVUE6ZDYPRFX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LNBNPUYMRG6S6ZIVUE6ZDYPRFX/action/storage_attestation","attest_author":"https://pith.science/pith/LNBNPUYMRG6S6ZIVUE6ZDYPRFX/action/author_attestation","sign_citation":"https://pith.science/pith/LNBNPUYMRG6S6ZIVUE6ZDYPRFX/action/citation_signature","submit_replication":"https://pith.science/pith/LNBNPUYMRG6S6ZIVUE6ZDYPRFX/action/replication_record"}},"created_at":"2026-05-18T00:52:09.974204+00:00","updated_at":"2026-05-18T00:52:09.974204+00:00"}