{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:UYER6ON5ICNJMOOHD7VFD2IXEY","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":"e4169a22db433f3142e81387b3633aaeda2eb3d4d9262d7f422972b3b81f5088","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-02-06T16:34:30Z","title_canon_sha256":"c3f2740c1bca131f1b15cb23b7ba2cf09b56c3193b4b7e17ad7e976248d4c025"},"schema_version":"1.0","source":{"id":"1802.02050","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.02050","created_at":"2026-05-18T00:24:11Z"},{"alias_kind":"arxiv_version","alias_value":"1802.02050v1","created_at":"2026-05-18T00:24:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.02050","created_at":"2026-05-18T00:24:11Z"},{"alias_kind":"pith_short_12","alias_value":"UYER6ON5ICNJ","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"UYER6ON5ICNJMOOH","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"UYER6ON5","created_at":"2026-05-18T12:32:56Z"}],"graph_snapshots":[{"event_id":"sha256:363f87d49d8b379c00a5df66049733b56399feb109bdd711e229efa282105145","target":"graph","created_at":"2026-05-18T00:24:11Z","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":"The theory of kernelization can be used to rigorously analyze data reduction for graph coloring problems. Here, the aim is to reduce a q-Coloring input to an equivalent but smaller input whose size is provably bounded in terms of structural properties, such as the size of a minimum vertex cover. In this paper we settle two open problems about data reduction for q-Coloring.\n  First, we obtain a kernel of bitsize $O(k^{q-1}\\log{k})$ for q-Coloring parameterized by Vertex Cover, for any q >= 3. This size bound is optimal up to $k^{o(1)}$ factors assuming NP is not a subset of coNP/poly, and impro","authors_text":"Astrid Pieterse, Bart M. P. Jansen","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-02-06T16:34:30Z","title":"Optimal Data Reduction for Graph Coloring Using Low-Degree Polynomials"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.02050","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:589531dd9f4e3f8916fce53f5cc38b8e770a85ccf1a2e057f87b1ab68d0c2782","target":"record","created_at":"2026-05-18T00:24:11Z","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":"e4169a22db433f3142e81387b3633aaeda2eb3d4d9262d7f422972b3b81f5088","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-02-06T16:34:30Z","title_canon_sha256":"c3f2740c1bca131f1b15cb23b7ba2cf09b56c3193b4b7e17ad7e976248d4c025"},"schema_version":"1.0","source":{"id":"1802.02050","kind":"arxiv","version":1}},"canonical_sha256":"a6091f39bd409a9639c71fea51e91726228ffab491606e10ee4bf4130a3c5250","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a6091f39bd409a9639c71fea51e91726228ffab491606e10ee4bf4130a3c5250","first_computed_at":"2026-05-18T00:24:11.050196Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:24:11.050196Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"l/7lif7oGxHSOnMl+b6ckb+kxOD4YZoNOkbEmOHf48/eLhqWdhGz3wBWKcyMqF1HJF4GpSBJt/jDwggizB4RBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:24:11.050859Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.02050","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:589531dd9f4e3f8916fce53f5cc38b8e770a85ccf1a2e057f87b1ab68d0c2782","sha256:363f87d49d8b379c00a5df66049733b56399feb109bdd711e229efa282105145"],"state_sha256":"9556caa00725b1eece1e6cd307fbaef55a4e341cae6344f3bf4b519998014bfb"}