{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:47Y4XQMXTJG4KRLXTI2INRP6FY","short_pith_number":"pith:47Y4XQMX","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"},"canonical_sha256":"e7f1cbc1979a4dc545779a3486c5fe2e218f4b6f3b214664f4e1845bff04a8e2","source":{"kind":"arxiv","id":"1301.4272","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.4272","created_at":"2026-05-18T03:36:05Z"},{"alias_kind":"arxiv_version","alias_value":"1301.4272v1","created_at":"2026-05-18T03:36:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.4272","created_at":"2026-05-18T03:36:05Z"},{"alias_kind":"pith_short_12","alias_value":"47Y4XQMXTJG4","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"47Y4XQMXTJG4KRLX","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"47Y4XQMX","created_at":"2026-05-18T12:27:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:47Y4XQMXTJG4KRLXTI2INRP6FY","target":"record","payload":{"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"},"canonical_sha256":"e7f1cbc1979a4dc545779a3486c5fe2e218f4b6f3b214664f4e1845bff04a8e2","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"},"source_kind":"arxiv","source_id":"1301.4272","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-18T03:36:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DWdS03nF0UvAFI1GKECsKTDhimDzWBu3XDOWvQb6KrZxS9jh/QamnXQf7rVfQlivC/VHV5mdLdJs6xUi7SGhDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T04:31:22.309027Z"},"content_sha256":"291ae129018115c8f98f49e6bcc8230acc35296cf4a9e1c09de23876c7005430","schema_version":"1.0","event_id":"sha256:291ae129018115c8f98f49e6bcc8230acc35296cf4a9e1c09de23876c7005430"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:47Y4XQMXTJG4KRLXTI2INRP6FY","target":"graph","payload":{"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"},"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-18T03:36:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T1yPG2/HfVXc20qBDN3AMd45fNViHrQqQXGlAyE0WlGlnImfVtY1deBoQKrqTH/RakTVe7pys8S8tlrQGjWGDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T04:31:22.309757Z"},"content_sha256":"1cadd4a5b1a9fb2fc9ef701a7233fc017b71e5fbe247da0ea7b593eaf3527105","schema_version":"1.0","event_id":"sha256:1cadd4a5b1a9fb2fc9ef701a7233fc017b71e5fbe247da0ea7b593eaf3527105"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/47Y4XQMXTJG4KRLXTI2INRP6FY/bundle.json","state_url":"https://pith.science/pith/47Y4XQMXTJG4KRLXTI2INRP6FY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/47Y4XQMXTJG4KRLXTI2INRP6FY/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-06-01T04:31:22Z","links":{"resolver":"https://pith.science/pith/47Y4XQMXTJG4KRLXTI2INRP6FY","bundle":"https://pith.science/pith/47Y4XQMXTJG4KRLXTI2INRP6FY/bundle.json","state":"https://pith.science/pith/47Y4XQMXTJG4KRLXTI2INRP6FY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/47Y4XQMXTJG4KRLXTI2INRP6FY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:47Y4XQMXTJG4KRLXTI2INRP6FY","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":"94c6eb4d1cbe16ab20ec0479f51f31e88bfb5c9170f4584f681de02a4dc7a566","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-01-17T23:37:47Z","title_canon_sha256":"8a8935bd80f5fd502bbb5129c0611c2cbde4e05d7bb498572367e85a7b20916d"},"schema_version":"1.0","source":{"id":"1301.4272","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.4272","created_at":"2026-05-18T03:36:05Z"},{"alias_kind":"arxiv_version","alias_value":"1301.4272v1","created_at":"2026-05-18T03:36:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.4272","created_at":"2026-05-18T03:36:05Z"},{"alias_kind":"pith_short_12","alias_value":"47Y4XQMXTJG4","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"47Y4XQMXTJG4KRLX","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"47Y4XQMX","created_at":"2026-05-18T12:27:32Z"}],"graph_snapshots":[{"event_id":"sha256:1cadd4a5b1a9fb2fc9ef701a7233fc017b71e5fbe247da0ea7b593eaf3527105","target":"graph","created_at":"2026-05-18T03:36:05Z","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":"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","authors_text":"Marco Correia, Pedro Barahona","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-01-17T23:37:47Z","title":"View-based propagation of decomposable constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.4272","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:291ae129018115c8f98f49e6bcc8230acc35296cf4a9e1c09de23876c7005430","target":"record","created_at":"2026-05-18T03:36:05Z","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":"94c6eb4d1cbe16ab20ec0479f51f31e88bfb5c9170f4584f681de02a4dc7a566","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-01-17T23:37:47Z","title_canon_sha256":"8a8935bd80f5fd502bbb5129c0611c2cbde4e05d7bb498572367e85a7b20916d"},"schema_version":"1.0","source":{"id":"1301.4272","kind":"arxiv","version":1}},"canonical_sha256":"e7f1cbc1979a4dc545779a3486c5fe2e218f4b6f3b214664f4e1845bff04a8e2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e7f1cbc1979a4dc545779a3486c5fe2e218f4b6f3b214664f4e1845bff04a8e2","first_computed_at":"2026-05-18T03:36:05.750136Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:36:05.750136Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Sw2fESgV/lBZPok0Uztw2ydFle8/mxcCNpyWduEChfZXr1YCdkujMrcyAeLXCVLJc5F4c1WI/ATF5QvA4pHXDw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:36:05.750792Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.4272","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:291ae129018115c8f98f49e6bcc8230acc35296cf4a9e1c09de23876c7005430","sha256:1cadd4a5b1a9fb2fc9ef701a7233fc017b71e5fbe247da0ea7b593eaf3527105"],"state_sha256":"dc8534e545f2ca0a50f816c9114be3fc969cc9adaf118b64c67b35bd236bd785"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J5CO0B1t0C2/4rdKsyNaaR55in0Oi0TsRboUXvokTxlzVpiSVZXXuIcLmZWtKmfTIQGE3+uAPtxEejoAuiKwAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T04:31:22.313109Z","bundle_sha256":"cd4854f962cf8ffe18c951461c4bb0f724f3f81292d513c4d94e6d70781c96ee"}}