{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:4EH7FEZ6ZYMNIXWMSANUFA3SNC","short_pith_number":"pith:4EH7FEZ6","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"},"canonical_sha256":"e10ff2933ece18d45ecc901b42837268b975c65f66e2d4c2dc368ca49a24c821","source":{"kind":"arxiv","id":"1104.4229","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.4229","created_at":"2026-05-18T02:22:01Z"},{"alias_kind":"arxiv_version","alias_value":"1104.4229v2","created_at":"2026-05-18T02:22:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.4229","created_at":"2026-05-18T02:22:01Z"},{"alias_kind":"pith_short_12","alias_value":"4EH7FEZ6ZYMN","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_16","alias_value":"4EH7FEZ6ZYMNIXWM","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_8","alias_value":"4EH7FEZ6","created_at":"2026-05-18T12:26:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:4EH7FEZ6ZYMNIXWMSANUFA3SNC","target":"record","payload":{"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"},"canonical_sha256":"e10ff2933ece18d45ecc901b42837268b975c65f66e2d4c2dc368ca49a24c821","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"},"source_kind":"arxiv","source_id":"1104.4229","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:22:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NcnNV2YFVyuku13OTlF5ekBCDKCRZb8ZsUT0aIbc44sXtbkWXFZEHI3YQJM5jc+Qt5fROPGNTioCiSLjT59GAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T17:42:41.460733Z"},"content_sha256":"e571abc6d959028408e29de03d210b494d6b268d578859d3bdf94236e0923e28","schema_version":"1.0","event_id":"sha256:e571abc6d959028408e29de03d210b494d6b268d578859d3bdf94236e0923e28"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:4EH7FEZ6ZYMNIXWMSANUFA3SNC","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:22:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"W8Rba7bDhk+UrQUl7kdQyHCXu/mmVSodq+S2jSYoL9OIqVKp1TXG1le6WHGCyKkb/speMo79LkoC9f1b8OT+BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T17:42:41.461300Z"},"content_sha256":"516ac0d5adc87e88203245fccd9045dfa392bfbd5373925fdc06cb3f24bf5fc4","schema_version":"1.0","event_id":"sha256:516ac0d5adc87e88203245fccd9045dfa392bfbd5373925fdc06cb3f24bf5fc4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4EH7FEZ6ZYMNIXWMSANUFA3SNC/bundle.json","state_url":"https://pith.science/pith/4EH7FEZ6ZYMNIXWMSANUFA3SNC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4EH7FEZ6ZYMNIXWMSANUFA3SNC/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-26T17:42:41Z","links":{"resolver":"https://pith.science/pith/4EH7FEZ6ZYMNIXWMSANUFA3SNC","bundle":"https://pith.science/pith/4EH7FEZ6ZYMNIXWMSANUFA3SNC/bundle.json","state":"https://pith.science/pith/4EH7FEZ6ZYMNIXWMSANUFA3SNC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4EH7FEZ6ZYMNIXWMSANUFA3SNC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:4EH7FEZ6ZYMNIXWMSANUFA3SNC","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":"fabab272841ee5c152cf9297e1058a283285eb2daa22edb56c905beb3d0ae29f","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-04-21T10:55:45Z","title_canon_sha256":"ad3e820d8e56a5c70f284221f8caea8b8698e5d48f4e7baac8501822b24620d3"},"schema_version":"1.0","source":{"id":"1104.4229","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.4229","created_at":"2026-05-18T02:22:01Z"},{"alias_kind":"arxiv_version","alias_value":"1104.4229v2","created_at":"2026-05-18T02:22:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.4229","created_at":"2026-05-18T02:22:01Z"},{"alias_kind":"pith_short_12","alias_value":"4EH7FEZ6ZYMN","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_16","alias_value":"4EH7FEZ6ZYMNIXWM","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_8","alias_value":"4EH7FEZ6","created_at":"2026-05-18T12:26:20Z"}],"graph_snapshots":[{"event_id":"sha256:516ac0d5adc87e88203245fccd9045dfa392bfbd5373925fdc06cb3f24bf5fc4","target":"graph","created_at":"2026-05-18T02:22:01Z","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":"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","authors_text":"Bart M. P. Jansen, Stefan Kratsch","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-04-21T10:55:45Z","title":"Data Reduction for Graph Coloring Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.4229","kind":"arxiv","version":2},"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:e571abc6d959028408e29de03d210b494d6b268d578859d3bdf94236e0923e28","target":"record","created_at":"2026-05-18T02:22:01Z","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":"fabab272841ee5c152cf9297e1058a283285eb2daa22edb56c905beb3d0ae29f","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-04-21T10:55:45Z","title_canon_sha256":"ad3e820d8e56a5c70f284221f8caea8b8698e5d48f4e7baac8501822b24620d3"},"schema_version":"1.0","source":{"id":"1104.4229","kind":"arxiv","version":2}},"canonical_sha256":"e10ff2933ece18d45ecc901b42837268b975c65f66e2d4c2dc368ca49a24c821","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e10ff2933ece18d45ecc901b42837268b975c65f66e2d4c2dc368ca49a24c821","first_computed_at":"2026-05-18T02:22:01.585929Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:22:01.585929Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"K6Rvxh1WcmLqd2aMgwYmW4YP5iaCrLUdIJFf+1RQFADhxbbvtwAq1oisfTh6xOrF45C8YEj5/3qNKA8IV4ApAg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:22:01.586538Z","signed_message":"canonical_sha256_bytes"},"source_id":"1104.4229","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e571abc6d959028408e29de03d210b494d6b268d578859d3bdf94236e0923e28","sha256:516ac0d5adc87e88203245fccd9045dfa392bfbd5373925fdc06cb3f24bf5fc4"],"state_sha256":"1e6a68481bf073733d668e4712d21ce01e2bf49912d0d3fab9874548f14b2f39"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w/+RWGIibqtttEBTg+Trd+TH99xMFLoAM+BJOc0tcE7YycjdwAeMZfllqNYpMbI6bQFy3LGMjWUl8Hd26a3EAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T17:42:41.464708Z","bundle_sha256":"62de1f409a1815db200ea820f4aaa93cd5e3ea8931671e466e709ed89dd82645"}}