{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:WY5H2FCCIER3RT2MKPMV5ZV43Q","short_pith_number":"pith:WY5H2FCC","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"},"canonical_sha256":"b63a7d14424123b8cf4c53d95ee6bcdc2c601065d64978c8164e4bf3a78b7659","source":{"kind":"arxiv","id":"1406.3124","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.3124","created_at":"2026-05-18T02:49:53Z"},{"alias_kind":"arxiv_version","alias_value":"1406.3124v1","created_at":"2026-05-18T02:49:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.3124","created_at":"2026-05-18T02:49:53Z"},{"alias_kind":"pith_short_12","alias_value":"WY5H2FCCIER3","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_16","alias_value":"WY5H2FCCIER3RT2M","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_8","alias_value":"WY5H2FCC","created_at":"2026-05-18T12:28:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:WY5H2FCCIER3RT2MKPMV5ZV43Q","target":"record","payload":{"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"},"canonical_sha256":"b63a7d14424123b8cf4c53d95ee6bcdc2c601065d64978c8164e4bf3a78b7659","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"},"source_kind":"arxiv","source_id":"1406.3124","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:49:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H2meUpPTnKs22X4ynzMQJvVQeysczDu+7Ao5WmnvooH56Hx5q4GIKK3Okzc1Z6HhqvOejBbziRpjMRwzig8dAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T20:14:22.788872Z"},"content_sha256":"28af66f5dcdad9ac08a9357939198e13ea7e4d8831cdd20ec37aae7e7ef0ddcc","schema_version":"1.0","event_id":"sha256:28af66f5dcdad9ac08a9357939198e13ea7e4d8831cdd20ec37aae7e7ef0ddcc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:WY5H2FCCIER3RT2MKPMV5ZV43Q","target":"graph","payload":{"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"},"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:49:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jL6+lOxufsa8WUKYlzplnhJCRAK5JWRk8FyZIrSs7EtGdwnGDiVYSPmPDobqd0jYbOkLBPgo196w7ISQGu8vDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T20:14:22.789818Z"},"content_sha256":"1f5cb02ecc0221dd3f3c60a9063f41de77e955269667127d3ce9f163dce42e63","schema_version":"1.0","event_id":"sha256:1f5cb02ecc0221dd3f3c60a9063f41de77e955269667127d3ce9f163dce42e63"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WY5H2FCCIER3RT2MKPMV5ZV43Q/bundle.json","state_url":"https://pith.science/pith/WY5H2FCCIER3RT2MKPMV5ZV43Q/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WY5H2FCCIER3RT2MKPMV5ZV43Q/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-28T20:14:22Z","links":{"resolver":"https://pith.science/pith/WY5H2FCCIER3RT2MKPMV5ZV43Q","bundle":"https://pith.science/pith/WY5H2FCCIER3RT2MKPMV5ZV43Q/bundle.json","state":"https://pith.science/pith/WY5H2FCCIER3RT2MKPMV5ZV43Q/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WY5H2FCCIER3RT2MKPMV5ZV43Q/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:WY5H2FCCIER3RT2MKPMV5ZV43Q","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":"db6d4d306f58d922544d7a00f565fd42627d936493b1fe74ca67db22d01642ab","cross_cats_sorted":["cs.CC","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-06-12T05:44:06Z","title_canon_sha256":"95e60d0eac0f88719fe4e924ff903db5406be35e5452d9e4c1742b1a4dfbb089"},"schema_version":"1.0","source":{"id":"1406.3124","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.3124","created_at":"2026-05-18T02:49:53Z"},{"alias_kind":"arxiv_version","alias_value":"1406.3124v1","created_at":"2026-05-18T02:49:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.3124","created_at":"2026-05-18T02:49:53Z"},{"alias_kind":"pith_short_12","alias_value":"WY5H2FCCIER3","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_16","alias_value":"WY5H2FCCIER3RT2M","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_8","alias_value":"WY5H2FCC","created_at":"2026-05-18T12:28:54Z"}],"graph_snapshots":[{"event_id":"sha256:1f5cb02ecc0221dd3f3c60a9063f41de77e955269667127d3ce9f163dce42e63","target":"graph","created_at":"2026-05-18T02:49:53Z","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 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 ","authors_text":"Serge Gaspers, Stefan Szeider","cross_cats":["cs.CC","cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-06-12T05:44:06Z","title":"Guarantees and Limits of Preprocessing in Constraint Satisfaction and Reasoning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.3124","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:28af66f5dcdad9ac08a9357939198e13ea7e4d8831cdd20ec37aae7e7ef0ddcc","target":"record","created_at":"2026-05-18T02:49:53Z","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":"db6d4d306f58d922544d7a00f565fd42627d936493b1fe74ca67db22d01642ab","cross_cats_sorted":["cs.CC","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-06-12T05:44:06Z","title_canon_sha256":"95e60d0eac0f88719fe4e924ff903db5406be35e5452d9e4c1742b1a4dfbb089"},"schema_version":"1.0","source":{"id":"1406.3124","kind":"arxiv","version":1}},"canonical_sha256":"b63a7d14424123b8cf4c53d95ee6bcdc2c601065d64978c8164e4bf3a78b7659","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b63a7d14424123b8cf4c53d95ee6bcdc2c601065d64978c8164e4bf3a78b7659","first_computed_at":"2026-05-18T02:49:53.008265Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:49:53.008265Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HearEcr6k8re9yEp4QeJRAzlYV1OZLPyX7ppaumhAuTFDP6/JLoTzbsGeIsF6/iHMHVXQHYVaNULKBcFTWwBBw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:49:53.008772Z","signed_message":"canonical_sha256_bytes"},"source_id":"1406.3124","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:28af66f5dcdad9ac08a9357939198e13ea7e4d8831cdd20ec37aae7e7ef0ddcc","sha256:1f5cb02ecc0221dd3f3c60a9063f41de77e955269667127d3ce9f163dce42e63"],"state_sha256":"ac8488479228a8dc3481fd8abe5a507564e0256a5fd565b703c291b26514cf4b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Mb775nho0RecvXUXIPB8wbhgXbvE/ZwmOlxZgnF+f8+pZaGGFNwSg+JiekB963LaIPNgDxMpq7e2c7vJt85eAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T20:14:22.793218Z","bundle_sha256":"8935213813f98262441e1023d08cd1d8f8b4d451c118e002450fb29ed54d0ef4"}}