{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:UYER6ON5ICNJMOOHD7VFD2IXEY","short_pith_number":"pith:UYER6ON5","schema_version":"1.0","canonical_sha256":"a6091f39bd409a9639c71fea51e91726228ffab491606e10ee4bf4130a3c5250","source":{"kind":"arxiv","id":"1802.02050","version":1},"attestation_state":"computed","paper":{"title":"Optimal Data Reduction for Graph Coloring Using Low-Degree Polynomials","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Astrid Pieterse, Bart M. P. Jansen","submitted_at":"2018-02-06T16:34:30Z","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"},"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":"1802.02050","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-02-06T16:34:30Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"c3f2740c1bca131f1b15cb23b7ba2cf09b56c3193b4b7e17ad7e976248d4c025","abstract_canon_sha256":"e4169a22db433f3142e81387b3633aaeda2eb3d4d9262d7f422972b3b81f5088"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:24:11.050859Z","signature_b64":"l/7lif7oGxHSOnMl+b6ckb+kxOD4YZoNOkbEmOHf48/eLhqWdhGz3wBWKcyMqF1HJF4GpSBJt/jDwggizB4RBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a6091f39bd409a9639c71fea51e91726228ffab491606e10ee4bf4130a3c5250","last_reissued_at":"2026-05-18T00:24:11.050196Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:24:11.050196Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal Data Reduction for Graph Coloring Using Low-Degree Polynomials","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Astrid Pieterse, Bart M. P. Jansen","submitted_at":"2018-02-06T16:34:30Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.02050","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":"1802.02050","created_at":"2026-05-18T00:24:11.050351+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.02050v1","created_at":"2026-05-18T00:24:11.050351+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.02050","created_at":"2026-05-18T00:24:11.050351+00:00"},{"alias_kind":"pith_short_12","alias_value":"UYER6ON5ICNJ","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_16","alias_value":"UYER6ON5ICNJMOOH","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_8","alias_value":"UYER6ON5","created_at":"2026-05-18T12:32:56.356000+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/UYER6ON5ICNJMOOHD7VFD2IXEY","json":"https://pith.science/pith/UYER6ON5ICNJMOOHD7VFD2IXEY.json","graph_json":"https://pith.science/api/pith-number/UYER6ON5ICNJMOOHD7VFD2IXEY/graph.json","events_json":"https://pith.science/api/pith-number/UYER6ON5ICNJMOOHD7VFD2IXEY/events.json","paper":"https://pith.science/paper/UYER6ON5"},"agent_actions":{"view_html":"https://pith.science/pith/UYER6ON5ICNJMOOHD7VFD2IXEY","download_json":"https://pith.science/pith/UYER6ON5ICNJMOOHD7VFD2IXEY.json","view_paper":"https://pith.science/paper/UYER6ON5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.02050&json=true","fetch_graph":"https://pith.science/api/pith-number/UYER6ON5ICNJMOOHD7VFD2IXEY/graph.json","fetch_events":"https://pith.science/api/pith-number/UYER6ON5ICNJMOOHD7VFD2IXEY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UYER6ON5ICNJMOOHD7VFD2IXEY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UYER6ON5ICNJMOOHD7VFD2IXEY/action/storage_attestation","attest_author":"https://pith.science/pith/UYER6ON5ICNJMOOHD7VFD2IXEY/action/author_attestation","sign_citation":"https://pith.science/pith/UYER6ON5ICNJMOOHD7VFD2IXEY/action/citation_signature","submit_replication":"https://pith.science/pith/UYER6ON5ICNJMOOHD7VFD2IXEY/action/replication_record"}},"created_at":"2026-05-18T00:24:11.050351+00:00","updated_at":"2026-05-18T00:24:11.050351+00:00"}