{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:P27P64UYM2M2FSN27ASSOLDK66","short_pith_number":"pith:P27P64UY","canonical_record":{"source":{"id":"1104.5566","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-04-29T08:31:41Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"c530bfd84ab73b024f9e1986e361273010edee908d2659c412afdbb0d35b9b2c","abstract_canon_sha256":"8ea7d66f9d41bd0692346c247b4104d64640b5507a59db24d47f9646d6cc4e44"},"schema_version":"1.0"},"canonical_sha256":"7ebeff72986699a2c9baf825272c6af7979f41c07588429be8af034eb3a14552","source":{"kind":"arxiv","id":"1104.5566","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.5566","created_at":"2026-05-18T04:15:38Z"},{"alias_kind":"arxiv_version","alias_value":"1104.5566v2","created_at":"2026-05-18T04:15:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.5566","created_at":"2026-05-18T04:15:38Z"},{"alias_kind":"pith_short_12","alias_value":"P27P64UYM2M2","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_16","alias_value":"P27P64UYM2M2FSN2","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_8","alias_value":"P27P64UY","created_at":"2026-05-18T12:26:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:P27P64UYM2M2FSN27ASSOLDK66","target":"record","payload":{"canonical_record":{"source":{"id":"1104.5566","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-04-29T08:31:41Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"c530bfd84ab73b024f9e1986e361273010edee908d2659c412afdbb0d35b9b2c","abstract_canon_sha256":"8ea7d66f9d41bd0692346c247b4104d64640b5507a59db24d47f9646d6cc4e44"},"schema_version":"1.0"},"canonical_sha256":"7ebeff72986699a2c9baf825272c6af7979f41c07588429be8af034eb3a14552","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:15:38.803705Z","signature_b64":"tuCRXEjsL/QAIqXj8DYrL1Q6wE1rorL/Cb7QW94WQWY73FpJeh6teMCBl0wgDCDbX8NEiMitTT4c2+K7ugG8Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7ebeff72986699a2c9baf825272c6af7979f41c07588429be8af034eb3a14552","last_reissued_at":"2026-05-18T04:15:38.803020Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:15:38.803020Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1104.5566","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-18T04:15:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tLKEyf0GwYBZM/7veBXOFVY4oQXRy9wtrvwUBdE9thsYTv/N8apQK0H4eRSfchs3uxREuz6/O3nUk2D6O8shCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T22:46:40.711408Z"},"content_sha256":"f3ae83ea45e622d609037a018d8118b531a2251b3fec49f66ee2b3399f0f420c","schema_version":"1.0","event_id":"sha256:f3ae83ea45e622d609037a018d8118b531a2251b3fec49f66ee2b3399f0f420c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:P27P64UYM2M2FSN27ASSOLDK66","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Limits of Preprocessing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.AI","authors_text":"Stefan Szeider","submitted_at":"2011-04-29T08:31:41Z","abstract_excerpt":"We present a first theoretical analysis of the power of polynomial-time preprocessing for important combinatorial problems from various areas in AI. We consider problems from Constraint Satisfaction, Global Constraints, Satisfiability, Nonmonotonic and Bayesian Reasoning. We show that, subject to a complexity theoretic assumption, none of the considered problems can be reduced by polynomial-time preprocessing to a problem kernel whose size is polynomial in a structural problem parameter of the input, such as induced width or backdoor size. Our results provide a firm theoretical boundary for th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.5566","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-18T04:15:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6j+U0TKD1XdA8MFV+YKDt8fg3VNKaljwXAGjMsdvIKBjZc01/H0PEFfN+GTfhQYa9VzJ57JYhqsdel06l1LSBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T22:46:40.711972Z"},"content_sha256":"9a4647dbf06b6d7a9dc68807f989985722a47aa01df2d8033e3347fd551025a6","schema_version":"1.0","event_id":"sha256:9a4647dbf06b6d7a9dc68807f989985722a47aa01df2d8033e3347fd551025a6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/P27P64UYM2M2FSN27ASSOLDK66/bundle.json","state_url":"https://pith.science/pith/P27P64UYM2M2FSN27ASSOLDK66/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/P27P64UYM2M2FSN27ASSOLDK66/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-29T22:46:40Z","links":{"resolver":"https://pith.science/pith/P27P64UYM2M2FSN27ASSOLDK66","bundle":"https://pith.science/pith/P27P64UYM2M2FSN27ASSOLDK66/bundle.json","state":"https://pith.science/pith/P27P64UYM2M2FSN27ASSOLDK66/state.json","well_known_bundle":"https://pith.science/.well-known/pith/P27P64UYM2M2FSN27ASSOLDK66/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:P27P64UYM2M2FSN27ASSOLDK66","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":"8ea7d66f9d41bd0692346c247b4104d64640b5507a59db24d47f9646d6cc4e44","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-04-29T08:31:41Z","title_canon_sha256":"c530bfd84ab73b024f9e1986e361273010edee908d2659c412afdbb0d35b9b2c"},"schema_version":"1.0","source":{"id":"1104.5566","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.5566","created_at":"2026-05-18T04:15:38Z"},{"alias_kind":"arxiv_version","alias_value":"1104.5566v2","created_at":"2026-05-18T04:15:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.5566","created_at":"2026-05-18T04:15:38Z"},{"alias_kind":"pith_short_12","alias_value":"P27P64UYM2M2","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_16","alias_value":"P27P64UYM2M2FSN2","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_8","alias_value":"P27P64UY","created_at":"2026-05-18T12:26:39Z"}],"graph_snapshots":[{"event_id":"sha256:9a4647dbf06b6d7a9dc68807f989985722a47aa01df2d8033e3347fd551025a6","target":"graph","created_at":"2026-05-18T04:15:38Z","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 present a first theoretical analysis of the power of polynomial-time preprocessing for important combinatorial problems from various areas in AI. We consider problems from Constraint Satisfaction, Global Constraints, Satisfiability, Nonmonotonic and Bayesian Reasoning. We show that, subject to a complexity theoretic assumption, none of the considered problems can be reduced by polynomial-time preprocessing to a problem kernel whose size is polynomial in a structural problem parameter of the input, such as induced width or backdoor size. Our results provide a firm theoretical boundary for th","authors_text":"Stefan Szeider","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-04-29T08:31:41Z","title":"Limits of Preprocessing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.5566","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:f3ae83ea45e622d609037a018d8118b531a2251b3fec49f66ee2b3399f0f420c","target":"record","created_at":"2026-05-18T04:15:38Z","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":"8ea7d66f9d41bd0692346c247b4104d64640b5507a59db24d47f9646d6cc4e44","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-04-29T08:31:41Z","title_canon_sha256":"c530bfd84ab73b024f9e1986e361273010edee908d2659c412afdbb0d35b9b2c"},"schema_version":"1.0","source":{"id":"1104.5566","kind":"arxiv","version":2}},"canonical_sha256":"7ebeff72986699a2c9baf825272c6af7979f41c07588429be8af034eb3a14552","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7ebeff72986699a2c9baf825272c6af7979f41c07588429be8af034eb3a14552","first_computed_at":"2026-05-18T04:15:38.803020Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:15:38.803020Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tuCRXEjsL/QAIqXj8DYrL1Q6wE1rorL/Cb7QW94WQWY73FpJeh6teMCBl0wgDCDbX8NEiMitTT4c2+K7ugG8Dw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:15:38.803705Z","signed_message":"canonical_sha256_bytes"},"source_id":"1104.5566","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f3ae83ea45e622d609037a018d8118b531a2251b3fec49f66ee2b3399f0f420c","sha256:9a4647dbf06b6d7a9dc68807f989985722a47aa01df2d8033e3347fd551025a6"],"state_sha256":"975078af860b2ef8ba8162886b4cdcdffdfad78387c88ef778d983250702e817"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pIv2ZZqqmHTahNcOdKPHooS21QnizUAFcW0m6aEqEoDokUxY7cWrOiovMLd2mtDK06aH3/TrJSZStZbcLcXEBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T22:46:40.714412Z","bundle_sha256":"5b5e01b66d895a2112a6ce6586168033199e5e5ad34f566b6f6f65b0ac0140e2"}}