{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:WY5H2FCCIER3RT2MKPMV5ZV43Q","short_pith_number":"pith:WY5H2FCC","schema_version":"1.0","canonical_sha256":"b63a7d14424123b8cf4c53d95ee6bcdc2c601065d64978c8164e4bf3a78b7659","source":{"kind":"arxiv","id":"1406.3124","version":1},"attestation_state":"computed","paper":{"title":"Guarantees and Limits of Preprocessing in Constraint Satisfaction and Reasoning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DS"],"primary_cat":"cs.AI","authors_text":"Serge Gaspers, Stefan Szeider","submitted_at":"2014-06-12T05:44:06Z","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 under structural restrictions. All these problems involve two tasks: (i) identifying the structure in the input as required by the restriction, and (ii) using the identified structure to solve the reasoning task efficiently. We show that for most of the considered problems, task (i) admits a polynomial-time preprocessing to a "},"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":"1406.3124","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-06-12T05:44:06Z","cross_cats_sorted":["cs.CC","cs.DS"],"title_canon_sha256":"95e60d0eac0f88719fe4e924ff903db5406be35e5452d9e4c1742b1a4dfbb089","abstract_canon_sha256":"db6d4d306f58d922544d7a00f565fd42627d936493b1fe74ca67db22d01642ab"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:49:53.008772Z","signature_b64":"HearEcr6k8re9yEp4QeJRAzlYV1OZLPyX7ppaumhAuTFDP6/JLoTzbsGeIsF6/iHMHVXQHYVaNULKBcFTWwBBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b63a7d14424123b8cf4c53d95ee6bcdc2c601065d64978c8164e4bf3a78b7659","last_reissued_at":"2026-05-18T02:49:53.008265Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:49:53.008265Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Guarantees and Limits of Preprocessing in Constraint Satisfaction and Reasoning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DS"],"primary_cat":"cs.AI","authors_text":"Serge Gaspers, Stefan Szeider","submitted_at":"2014-06-12T05:44:06Z","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 under structural restrictions. All these problems involve two tasks: (i) identifying the structure in the input as required by the restriction, and (ii) using the identified structure to solve the reasoning task efficiently. We show that for most of the considered problems, task (i) admits a polynomial-time preprocessing to a "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.3124","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1406.3124","created_at":"2026-05-18T02:49:53.008341+00:00"},{"alias_kind":"arxiv_version","alias_value":"1406.3124v1","created_at":"2026-05-18T02:49:53.008341+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.3124","created_at":"2026-05-18T02:49:53.008341+00:00"},{"alias_kind":"pith_short_12","alias_value":"WY5H2FCCIER3","created_at":"2026-05-18T12:28:54.890064+00:00"},{"alias_kind":"pith_short_16","alias_value":"WY5H2FCCIER3RT2M","created_at":"2026-05-18T12:28:54.890064+00:00"},{"alias_kind":"pith_short_8","alias_value":"WY5H2FCC","created_at":"2026-05-18T12:28:54.890064+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/WY5H2FCCIER3RT2MKPMV5ZV43Q","json":"https://pith.science/pith/WY5H2FCCIER3RT2MKPMV5ZV43Q.json","graph_json":"https://pith.science/api/pith-number/WY5H2FCCIER3RT2MKPMV5ZV43Q/graph.json","events_json":"https://pith.science/api/pith-number/WY5H2FCCIER3RT2MKPMV5ZV43Q/events.json","paper":"https://pith.science/paper/WY5H2FCC"},"agent_actions":{"view_html":"https://pith.science/pith/WY5H2FCCIER3RT2MKPMV5ZV43Q","download_json":"https://pith.science/pith/WY5H2FCCIER3RT2MKPMV5ZV43Q.json","view_paper":"https://pith.science/paper/WY5H2FCC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1406.3124&json=true","fetch_graph":"https://pith.science/api/pith-number/WY5H2FCCIER3RT2MKPMV5ZV43Q/graph.json","fetch_events":"https://pith.science/api/pith-number/WY5H2FCCIER3RT2MKPMV5ZV43Q/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WY5H2FCCIER3RT2MKPMV5ZV43Q/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WY5H2FCCIER3RT2MKPMV5ZV43Q/action/storage_attestation","attest_author":"https://pith.science/pith/WY5H2FCCIER3RT2MKPMV5ZV43Q/action/author_attestation","sign_citation":"https://pith.science/pith/WY5H2FCCIER3RT2MKPMV5ZV43Q/action/citation_signature","submit_replication":"https://pith.science/pith/WY5H2FCCIER3RT2MKPMV5ZV43Q/action/replication_record"}},"created_at":"2026-05-18T02:49:53.008341+00:00","updated_at":"2026-05-18T02:49:53.008341+00:00"}