{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:47Y4XQMXTJG4KRLXTI2INRP6FY","short_pith_number":"pith:47Y4XQMX","schema_version":"1.0","canonical_sha256":"e7f1cbc1979a4dc545779a3486c5fe2e218f4b6f3b214664f4e1845bff04a8e2","source":{"kind":"arxiv","id":"1301.4272","version":1},"attestation_state":"computed","paper":{"title":"View-based propagation of decomposable constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Marco Correia, Pedro Barahona","submitted_at":"2013-01-17T23:37:47Z","abstract_excerpt":"Constraints that may be obtained by composition from simpler constraints are present, in some way or another, in almost every constraint program. The decomposition of such constraints is a standard technique for obtaining an adequate propagation algorithm from a combination of propagators designed for simpler constraints. The decomposition approach is appealing in several ways. Firstly because creating a specific propagator for every constraint is clearly infeasible since the number of constraints is infinite. Secondly, because designing a propagation algorithm for complex constraints can be v"},"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":"1301.4272","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-01-17T23:37:47Z","cross_cats_sorted":[],"title_canon_sha256":"8a8935bd80f5fd502bbb5129c0611c2cbde4e05d7bb498572367e85a7b20916d","abstract_canon_sha256":"94c6eb4d1cbe16ab20ec0479f51f31e88bfb5c9170f4584f681de02a4dc7a566"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:36:05.750792Z","signature_b64":"Sw2fESgV/lBZPok0Uztw2ydFle8/mxcCNpyWduEChfZXr1YCdkujMrcyAeLXCVLJc5F4c1WI/ATF5QvA4pHXDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e7f1cbc1979a4dc545779a3486c5fe2e218f4b6f3b214664f4e1845bff04a8e2","last_reissued_at":"2026-05-18T03:36:05.750136Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:36:05.750136Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"View-based propagation of decomposable constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Marco Correia, Pedro Barahona","submitted_at":"2013-01-17T23:37:47Z","abstract_excerpt":"Constraints that may be obtained by composition from simpler constraints are present, in some way or another, in almost every constraint program. The decomposition of such constraints is a standard technique for obtaining an adequate propagation algorithm from a combination of propagators designed for simpler constraints. The decomposition approach is appealing in several ways. Firstly because creating a specific propagator for every constraint is clearly infeasible since the number of constraints is infinite. Secondly, because designing a propagation algorithm for complex constraints can be v"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.4272","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":"1301.4272","created_at":"2026-05-18T03:36:05.750231+00:00"},{"alias_kind":"arxiv_version","alias_value":"1301.4272v1","created_at":"2026-05-18T03:36:05.750231+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.4272","created_at":"2026-05-18T03:36:05.750231+00:00"},{"alias_kind":"pith_short_12","alias_value":"47Y4XQMXTJG4","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_16","alias_value":"47Y4XQMXTJG4KRLX","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_8","alias_value":"47Y4XQMX","created_at":"2026-05-18T12:27:32.513160+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/47Y4XQMXTJG4KRLXTI2INRP6FY","json":"https://pith.science/pith/47Y4XQMXTJG4KRLXTI2INRP6FY.json","graph_json":"https://pith.science/api/pith-number/47Y4XQMXTJG4KRLXTI2INRP6FY/graph.json","events_json":"https://pith.science/api/pith-number/47Y4XQMXTJG4KRLXTI2INRP6FY/events.json","paper":"https://pith.science/paper/47Y4XQMX"},"agent_actions":{"view_html":"https://pith.science/pith/47Y4XQMXTJG4KRLXTI2INRP6FY","download_json":"https://pith.science/pith/47Y4XQMXTJG4KRLXTI2INRP6FY.json","view_paper":"https://pith.science/paper/47Y4XQMX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1301.4272&json=true","fetch_graph":"https://pith.science/api/pith-number/47Y4XQMXTJG4KRLXTI2INRP6FY/graph.json","fetch_events":"https://pith.science/api/pith-number/47Y4XQMXTJG4KRLXTI2INRP6FY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/47Y4XQMXTJG4KRLXTI2INRP6FY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/47Y4XQMXTJG4KRLXTI2INRP6FY/action/storage_attestation","attest_author":"https://pith.science/pith/47Y4XQMXTJG4KRLXTI2INRP6FY/action/author_attestation","sign_citation":"https://pith.science/pith/47Y4XQMXTJG4KRLXTI2INRP6FY/action/citation_signature","submit_replication":"https://pith.science/pith/47Y4XQMXTJG4KRLXTI2INRP6FY/action/replication_record"}},"created_at":"2026-05-18T03:36:05.750231+00:00","updated_at":"2026-05-18T03:36:05.750231+00:00"}