{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:4EH7FEZ6ZYMNIXWMSANUFA3SNC","short_pith_number":"pith:4EH7FEZ6","schema_version":"1.0","canonical_sha256":"e10ff2933ece18d45ecc901b42837268b975c65f66e2d4c2dc368ca49a24c821","source":{"kind":"arxiv","id":"1104.4229","version":2},"attestation_state":"computed","paper":{"title":"Data Reduction for 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, Stefan Kratsch","submitted_at":"2011-04-21T10:55:45Z","abstract_excerpt":"This paper studies the kernelization complexity of graph coloring problems with respect to certain structural parameterizations of the input instances. We are interested in how well polynomial-time data reduction can provably shrink instances of coloring problems, in terms of the chosen parameter. It is well known that deciding 3-colorability is already NP-complete, hence parameterizing by the requested number of colors is not fruitful. Instead, we pick up on a research thread initiated by Cai (DAM, 2003) who studied coloring problems parameterized by the modification distance of the input gra"},"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":"1104.4229","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-04-21T10:55:45Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"ad3e820d8e56a5c70f284221f8caea8b8698e5d48f4e7baac8501822b24620d3","abstract_canon_sha256":"fabab272841ee5c152cf9297e1058a283285eb2daa22edb56c905beb3d0ae29f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:22:01.586538Z","signature_b64":"K6Rvxh1WcmLqd2aMgwYmW4YP5iaCrLUdIJFf+1RQFADhxbbvtwAq1oisfTh6xOrF45C8YEj5/3qNKA8IV4ApAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e10ff2933ece18d45ecc901b42837268b975c65f66e2d4c2dc368ca49a24c821","last_reissued_at":"2026-05-18T02:22:01.585929Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:22:01.585929Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Data Reduction for 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, Stefan Kratsch","submitted_at":"2011-04-21T10:55:45Z","abstract_excerpt":"This paper studies the kernelization complexity of graph coloring problems with respect to certain structural parameterizations of the input instances. We are interested in how well polynomial-time data reduction can provably shrink instances of coloring problems, in terms of the chosen parameter. It is well known that deciding 3-colorability is already NP-complete, hence parameterizing by the requested number of colors is not fruitful. Instead, we pick up on a research thread initiated by Cai (DAM, 2003) who studied coloring problems parameterized by the modification distance of the input gra"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.4229","kind":"arxiv","version":2},"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":"1104.4229","created_at":"2026-05-18T02:22:01.586033+00:00"},{"alias_kind":"arxiv_version","alias_value":"1104.4229v2","created_at":"2026-05-18T02:22:01.586033+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.4229","created_at":"2026-05-18T02:22:01.586033+00:00"},{"alias_kind":"pith_short_12","alias_value":"4EH7FEZ6ZYMN","created_at":"2026-05-18T12:26:20.644004+00:00"},{"alias_kind":"pith_short_16","alias_value":"4EH7FEZ6ZYMNIXWM","created_at":"2026-05-18T12:26:20.644004+00:00"},{"alias_kind":"pith_short_8","alias_value":"4EH7FEZ6","created_at":"2026-05-18T12:26:20.644004+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/4EH7FEZ6ZYMNIXWMSANUFA3SNC","json":"https://pith.science/pith/4EH7FEZ6ZYMNIXWMSANUFA3SNC.json","graph_json":"https://pith.science/api/pith-number/4EH7FEZ6ZYMNIXWMSANUFA3SNC/graph.json","events_json":"https://pith.science/api/pith-number/4EH7FEZ6ZYMNIXWMSANUFA3SNC/events.json","paper":"https://pith.science/paper/4EH7FEZ6"},"agent_actions":{"view_html":"https://pith.science/pith/4EH7FEZ6ZYMNIXWMSANUFA3SNC","download_json":"https://pith.science/pith/4EH7FEZ6ZYMNIXWMSANUFA3SNC.json","view_paper":"https://pith.science/paper/4EH7FEZ6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1104.4229&json=true","fetch_graph":"https://pith.science/api/pith-number/4EH7FEZ6ZYMNIXWMSANUFA3SNC/graph.json","fetch_events":"https://pith.science/api/pith-number/4EH7FEZ6ZYMNIXWMSANUFA3SNC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4EH7FEZ6ZYMNIXWMSANUFA3SNC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4EH7FEZ6ZYMNIXWMSANUFA3SNC/action/storage_attestation","attest_author":"https://pith.science/pith/4EH7FEZ6ZYMNIXWMSANUFA3SNC/action/author_attestation","sign_citation":"https://pith.science/pith/4EH7FEZ6ZYMNIXWMSANUFA3SNC/action/citation_signature","submit_replication":"https://pith.science/pith/4EH7FEZ6ZYMNIXWMSANUFA3SNC/action/replication_record"}},"created_at":"2026-05-18T02:22:01.586033+00:00","updated_at":"2026-05-18T02:22:01.586033+00:00"}