{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:P27P64UYM2M2FSN27ASSOLDK66","short_pith_number":"pith:P27P64UY","schema_version":"1.0","canonical_sha256":"7ebeff72986699a2c9baf825272c6af7979f41c07588429be8af034eb3a14552","source":{"kind":"arxiv","id":"1104.5566","version":2},"attestation_state":"computed","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"},"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.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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1104.5566","created_at":"2026-05-18T04:15:38.803117+00:00"},{"alias_kind":"arxiv_version","alias_value":"1104.5566v2","created_at":"2026-05-18T04:15:38.803117+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.5566","created_at":"2026-05-18T04:15:38.803117+00:00"},{"alias_kind":"pith_short_12","alias_value":"P27P64UYM2M2","created_at":"2026-05-18T12:26:39.201973+00:00"},{"alias_kind":"pith_short_16","alias_value":"P27P64UYM2M2FSN2","created_at":"2026-05-18T12:26:39.201973+00:00"},{"alias_kind":"pith_short_8","alias_value":"P27P64UY","created_at":"2026-05-18T12:26:39.201973+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/P27P64UYM2M2FSN27ASSOLDK66","json":"https://pith.science/pith/P27P64UYM2M2FSN27ASSOLDK66.json","graph_json":"https://pith.science/api/pith-number/P27P64UYM2M2FSN27ASSOLDK66/graph.json","events_json":"https://pith.science/api/pith-number/P27P64UYM2M2FSN27ASSOLDK66/events.json","paper":"https://pith.science/paper/P27P64UY"},"agent_actions":{"view_html":"https://pith.science/pith/P27P64UYM2M2FSN27ASSOLDK66","download_json":"https://pith.science/pith/P27P64UYM2M2FSN27ASSOLDK66.json","view_paper":"https://pith.science/paper/P27P64UY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1104.5566&json=true","fetch_graph":"https://pith.science/api/pith-number/P27P64UYM2M2FSN27ASSOLDK66/graph.json","fetch_events":"https://pith.science/api/pith-number/P27P64UYM2M2FSN27ASSOLDK66/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/P27P64UYM2M2FSN27ASSOLDK66/action/timestamp_anchor","attest_storage":"https://pith.science/pith/P27P64UYM2M2FSN27ASSOLDK66/action/storage_attestation","attest_author":"https://pith.science/pith/P27P64UYM2M2FSN27ASSOLDK66/action/author_attestation","sign_citation":"https://pith.science/pith/P27P64UYM2M2FSN27ASSOLDK66/action/citation_signature","submit_replication":"https://pith.science/pith/P27P64UYM2M2FSN27ASSOLDK66/action/replication_record"}},"created_at":"2026-05-18T04:15:38.803117+00:00","updated_at":"2026-05-18T04:15:38.803117+00:00"}