{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:XDA6EKMYHHYJQLLVKCGPBJDHGC","short_pith_number":"pith:XDA6EKMY","canonical_record":{"source":{"id":"1206.5941","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-06-26T10:06:37Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"78bdd62dc74d0a67ba5af9bd4ad01b5471b7c1f81561fcd479f4bce1316edb71","abstract_canon_sha256":"e4c5aae65a479f9dee169d5293da0ff6de15f938abd4be26dc2fd4c354a9962e"},"schema_version":"1.0"},"canonical_sha256":"b8c1e2299839f0982d75508cf0a467308d6e61dcb2ab07dec9984b1adaac0fe0","source":{"kind":"arxiv","id":"1206.5941","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.5941","created_at":"2026-05-18T02:21:08Z"},{"alias_kind":"arxiv_version","alias_value":"1206.5941v1","created_at":"2026-05-18T02:21:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.5941","created_at":"2026-05-18T02:21:08Z"},{"alias_kind":"pith_short_12","alias_value":"XDA6EKMYHHYJ","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_16","alias_value":"XDA6EKMYHHYJQLLV","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_8","alias_value":"XDA6EKMY","created_at":"2026-05-18T12:27:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:XDA6EKMYHHYJQLLVKCGPBJDHGC","target":"record","payload":{"canonical_record":{"source":{"id":"1206.5941","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-06-26T10:06:37Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"78bdd62dc74d0a67ba5af9bd4ad01b5471b7c1f81561fcd479f4bce1316edb71","abstract_canon_sha256":"e4c5aae65a479f9dee169d5293da0ff6de15f938abd4be26dc2fd4c354a9962e"},"schema_version":"1.0"},"canonical_sha256":"b8c1e2299839f0982d75508cf0a467308d6e61dcb2ab07dec9984b1adaac0fe0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:08.751532Z","signature_b64":"rAj6atH+7DNpMkhPZkXgc/VxiM4sxo5NOM7QIR3ksmAhz+1pFX+WG6kPqE/wzJPmFa7N90sw7pZraK+NQDuSDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b8c1e2299839f0982d75508cf0a467308d6e61dcb2ab07dec9984b1adaac0fe0","last_reissued_at":"2026-05-18T02:21:08.750953Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:08.750953Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1206.5941","source_version":1,"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:21:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VqKt1YPxV9thNtPL4RlPklPB+BiTcMNfHLY2xa5KqMoBeLge8x1dt3uqDkOlqGXvt8/fsYmoNHl1FuvrZEP9BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T12:20:08.045003Z"},"content_sha256":"d5dd417fed6c5de3be88ef9aec0158788f97da0dd777f4ee0d50c712d10df711","schema_version":"1.0","event_id":"sha256:d5dd417fed6c5de3be88ef9aec0158788f97da0dd777f4ee0d50c712d10df711"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:XDA6EKMYHHYJQLLVKCGPBJDHGC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Kernelization Lower Bounds By Cross-Composition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Bart M. P. Jansen, Hans L. Bodlaender, Stefan Kratsch","submitted_at":"2012-06-26T10:06:37Z","abstract_excerpt":"We introduce the cross-composition framework for proving kernelization lower bounds. A classical problem L AND/OR-cross-composes into a parameterized problem Q if it is possible to efficiently construct an instance of Q with polynomially bounded parameter value that expresses the logical AND or OR of a sequence of instances of L. Building on work by Bodlaender et al. (ICALP 2008) and using a result by Fortnow and Santhanam (STOC 2008) with a refinement by Dell and van Melkebeek (STOC 2010), we show that if an NP-hard problem OR-cross-composes into a parameterized problem Q then Q does not admi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.5941","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"},"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:21:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1Z37hOrnX4fHZgkgYESK6XRfCvLKyogPM2uLiGMP/9wupDpadb14AsA/vbfQCu7MzSZcRyrt1sJ3+IoKqqz8Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T12:20:08.045705Z"},"content_sha256":"407b3d1c8ab9f665b8c90fa1069f3ab5f90f83d51292d9a4da4da57c6d2ebeaf","schema_version":"1.0","event_id":"sha256:407b3d1c8ab9f665b8c90fa1069f3ab5f90f83d51292d9a4da4da57c6d2ebeaf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XDA6EKMYHHYJQLLVKCGPBJDHGC/bundle.json","state_url":"https://pith.science/pith/XDA6EKMYHHYJQLLVKCGPBJDHGC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XDA6EKMYHHYJQLLVKCGPBJDHGC/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-26T12:20:08Z","links":{"resolver":"https://pith.science/pith/XDA6EKMYHHYJQLLVKCGPBJDHGC","bundle":"https://pith.science/pith/XDA6EKMYHHYJQLLVKCGPBJDHGC/bundle.json","state":"https://pith.science/pith/XDA6EKMYHHYJQLLVKCGPBJDHGC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XDA6EKMYHHYJQLLVKCGPBJDHGC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:XDA6EKMYHHYJQLLVKCGPBJDHGC","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":"e4c5aae65a479f9dee169d5293da0ff6de15f938abd4be26dc2fd4c354a9962e","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-06-26T10:06:37Z","title_canon_sha256":"78bdd62dc74d0a67ba5af9bd4ad01b5471b7c1f81561fcd479f4bce1316edb71"},"schema_version":"1.0","source":{"id":"1206.5941","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.5941","created_at":"2026-05-18T02:21:08Z"},{"alias_kind":"arxiv_version","alias_value":"1206.5941v1","created_at":"2026-05-18T02:21:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.5941","created_at":"2026-05-18T02:21:08Z"},{"alias_kind":"pith_short_12","alias_value":"XDA6EKMYHHYJ","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_16","alias_value":"XDA6EKMYHHYJQLLV","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_8","alias_value":"XDA6EKMY","created_at":"2026-05-18T12:27:27Z"}],"graph_snapshots":[{"event_id":"sha256:407b3d1c8ab9f665b8c90fa1069f3ab5f90f83d51292d9a4da4da57c6d2ebeaf","target":"graph","created_at":"2026-05-18T02:21:08Z","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":"We introduce the cross-composition framework for proving kernelization lower bounds. A classical problem L AND/OR-cross-composes into a parameterized problem Q if it is possible to efficiently construct an instance of Q with polynomially bounded parameter value that expresses the logical AND or OR of a sequence of instances of L. Building on work by Bodlaender et al. (ICALP 2008) and using a result by Fortnow and Santhanam (STOC 2008) with a refinement by Dell and van Melkebeek (STOC 2010), we show that if an NP-hard problem OR-cross-composes into a parameterized problem Q then Q does not admi","authors_text":"Bart M. P. Jansen, Hans L. Bodlaender, Stefan Kratsch","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-06-26T10:06:37Z","title":"Kernelization Lower Bounds By Cross-Composition"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.5941","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:d5dd417fed6c5de3be88ef9aec0158788f97da0dd777f4ee0d50c712d10df711","target":"record","created_at":"2026-05-18T02:21:08Z","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":"e4c5aae65a479f9dee169d5293da0ff6de15f938abd4be26dc2fd4c354a9962e","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-06-26T10:06:37Z","title_canon_sha256":"78bdd62dc74d0a67ba5af9bd4ad01b5471b7c1f81561fcd479f4bce1316edb71"},"schema_version":"1.0","source":{"id":"1206.5941","kind":"arxiv","version":1}},"canonical_sha256":"b8c1e2299839f0982d75508cf0a467308d6e61dcb2ab07dec9984b1adaac0fe0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b8c1e2299839f0982d75508cf0a467308d6e61dcb2ab07dec9984b1adaac0fe0","first_computed_at":"2026-05-18T02:21:08.750953Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:21:08.750953Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rAj6atH+7DNpMkhPZkXgc/VxiM4sxo5NOM7QIR3ksmAhz+1pFX+WG6kPqE/wzJPmFa7N90sw7pZraK+NQDuSDA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:21:08.751532Z","signed_message":"canonical_sha256_bytes"},"source_id":"1206.5941","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d5dd417fed6c5de3be88ef9aec0158788f97da0dd777f4ee0d50c712d10df711","sha256:407b3d1c8ab9f665b8c90fa1069f3ab5f90f83d51292d9a4da4da57c6d2ebeaf"],"state_sha256":"29d4232f6e55f7758153c359cd0e2819ad57591b149af3f772ff365f1694f3d0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qQN2krugV3hjwZDUMZvrVstKL/WXw7cZyktp6btzqEBqFhxZI+HTtpowYxY+5EgugSnWe+JQQoEup0iOLUobDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T12:20:08.051101Z","bundle_sha256":"3bdac9cee42a9ae5fc316556d3d2dd6efe70555b9b53754b96949f4c1e72b196"}}