{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:33WIZKQFCFLT3UOJJC77DATV6C","short_pith_number":"pith:33WIZKQF","canonical_record":{"source":{"id":"1304.1628","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-04-05T07:43:51Z","cross_cats_sorted":["math.LO"],"title_canon_sha256":"bc4f775f1ffb666cf9a0f36202a95c9429aaec64a432c76b36633dbbe1d9d667","abstract_canon_sha256":"6645b2fc4d62ffd8469a7444577f97d2e4045c0eaf06b4569e0470d813d1504f"},"schema_version":"1.0"},"canonical_sha256":"deec8caa0511573dd1c948bff18275f0ae8021d37adc13e206c37cd6b8877723","source":{"kind":"arxiv","id":"1304.1628","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.1628","created_at":"2026-05-18T03:28:55Z"},{"alias_kind":"arxiv_version","alias_value":"1304.1628v1","created_at":"2026-05-18T03:28:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.1628","created_at":"2026-05-18T03:28:55Z"},{"alias_kind":"pith_short_12","alias_value":"33WIZKQFCFLT","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"33WIZKQFCFLT3UOJ","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"33WIZKQF","created_at":"2026-05-18T12:27:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:33WIZKQFCFLT3UOJJC77DATV6C","target":"record","payload":{"canonical_record":{"source":{"id":"1304.1628","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-04-05T07:43:51Z","cross_cats_sorted":["math.LO"],"title_canon_sha256":"bc4f775f1ffb666cf9a0f36202a95c9429aaec64a432c76b36633dbbe1d9d667","abstract_canon_sha256":"6645b2fc4d62ffd8469a7444577f97d2e4045c0eaf06b4569e0470d813d1504f"},"schema_version":"1.0"},"canonical_sha256":"deec8caa0511573dd1c948bff18275f0ae8021d37adc13e206c37cd6b8877723","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:28:55.145425Z","signature_b64":"KBsK/kRY2IS+GR2aJQMKEJ/8xeEnP0QNFMS58veZI0mjGCkLRewEYJzvp7GB3R9r/Ic+euKZ6bY/oxz/Le2tAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"deec8caa0511573dd1c948bff18275f0ae8021d37adc13e206c37cd6b8877723","last_reissued_at":"2026-05-18T03:28:55.144577Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:28:55.144577Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1304.1628","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:28:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wlZhqlLTx5D53o32sqe8rHFeDT1TXTKekwr84GdbeUdaKgkPbLU4ENnWB5hb5y+/26sfRkb70eAvxNZQG7kIBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T18:56:35.831026Z"},"content_sha256":"4f40dcabe100b14c0536982ff530c48daf233c2e9ffeaee72ef8297d30597a49","schema_version":"1.0","event_id":"sha256:4f40dcabe100b14c0536982ff530c48daf233c2e9ffeaee72ef8297d30597a49"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:33WIZKQFCFLT3UOJJC77DATV6C","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Pattern-Based Constraint Satisfaction and Logic Puzzles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.LO"],"primary_cat":"cs.AI","authors_text":"Denis Berthier (DSI)","submitted_at":"2013-04-05T07:43:51Z","abstract_excerpt":"Pattern-Based Constraint Satisfaction and Logic Puzzles develops a pure logic, pattern-based perspective of solving the finite Constraint Satisfaction Problem (CSP), with emphasis on finding the \"simplest\" solution. Different ways of reasoning with the constraints are formalised by various families of \"resolution rules\", each of them carrying its own notion of simplicity. A large part of the book illustrates the power of the approach by applying it to various popular logic puzzles. It provides a unified view of how to model and solve them, even though they involve very different types of const"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.1628","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:28:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JRSb/rAPODfYqkvlu/ITICgI7utLyAT7m/ur0P0MVb+N0N4aOGe6V1TBHthg45AEXBHFTagdYruXeLOzTZ46Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T18:56:35.831366Z"},"content_sha256":"3f65de237956ed032da0391dcc98d82fe105e165660f4469a74df7b87f048fac","schema_version":"1.0","event_id":"sha256:3f65de237956ed032da0391dcc98d82fe105e165660f4469a74df7b87f048fac"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/33WIZKQFCFLT3UOJJC77DATV6C/bundle.json","state_url":"https://pith.science/pith/33WIZKQFCFLT3UOJJC77DATV6C/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/33WIZKQFCFLT3UOJJC77DATV6C/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-08-03T18:56:35Z","links":{"resolver":"https://pith.science/pith/33WIZKQFCFLT3UOJJC77DATV6C","bundle":"https://pith.science/pith/33WIZKQFCFLT3UOJJC77DATV6C/bundle.json","state":"https://pith.science/pith/33WIZKQFCFLT3UOJJC77DATV6C/state.json","well_known_bundle":"https://pith.science/.well-known/pith/33WIZKQFCFLT3UOJJC77DATV6C/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:33WIZKQFCFLT3UOJJC77DATV6C","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":"6645b2fc4d62ffd8469a7444577f97d2e4045c0eaf06b4569e0470d813d1504f","cross_cats_sorted":["math.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-04-05T07:43:51Z","title_canon_sha256":"bc4f775f1ffb666cf9a0f36202a95c9429aaec64a432c76b36633dbbe1d9d667"},"schema_version":"1.0","source":{"id":"1304.1628","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.1628","created_at":"2026-05-18T03:28:55Z"},{"alias_kind":"arxiv_version","alias_value":"1304.1628v1","created_at":"2026-05-18T03:28:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.1628","created_at":"2026-05-18T03:28:55Z"},{"alias_kind":"pith_short_12","alias_value":"33WIZKQFCFLT","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"33WIZKQFCFLT3UOJ","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"33WIZKQF","created_at":"2026-05-18T12:27:32Z"}],"graph_snapshots":[{"event_id":"sha256:3f65de237956ed032da0391dcc98d82fe105e165660f4469a74df7b87f048fac","target":"graph","created_at":"2026-05-18T03:28:55Z","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":"Pattern-Based Constraint Satisfaction and Logic Puzzles develops a pure logic, pattern-based perspective of solving the finite Constraint Satisfaction Problem (CSP), with emphasis on finding the \"simplest\" solution. Different ways of reasoning with the constraints are formalised by various families of \"resolution rules\", each of them carrying its own notion of simplicity. A large part of the book illustrates the power of the approach by applying it to various popular logic puzzles. It provides a unified view of how to model and solve them, even though they involve very different types of const","authors_text":"Denis Berthier (DSI)","cross_cats":["math.LO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-04-05T07:43:51Z","title":"Pattern-Based Constraint Satisfaction and Logic Puzzles"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.1628","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:4f40dcabe100b14c0536982ff530c48daf233c2e9ffeaee72ef8297d30597a49","target":"record","created_at":"2026-05-18T03:28:55Z","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":"6645b2fc4d62ffd8469a7444577f97d2e4045c0eaf06b4569e0470d813d1504f","cross_cats_sorted":["math.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-04-05T07:43:51Z","title_canon_sha256":"bc4f775f1ffb666cf9a0f36202a95c9429aaec64a432c76b36633dbbe1d9d667"},"schema_version":"1.0","source":{"id":"1304.1628","kind":"arxiv","version":1}},"canonical_sha256":"deec8caa0511573dd1c948bff18275f0ae8021d37adc13e206c37cd6b8877723","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"deec8caa0511573dd1c948bff18275f0ae8021d37adc13e206c37cd6b8877723","first_computed_at":"2026-05-18T03:28:55.144577Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:28:55.144577Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KBsK/kRY2IS+GR2aJQMKEJ/8xeEnP0QNFMS58veZI0mjGCkLRewEYJzvp7GB3R9r/Ic+euKZ6bY/oxz/Le2tAg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:28:55.145425Z","signed_message":"canonical_sha256_bytes"},"source_id":"1304.1628","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4f40dcabe100b14c0536982ff530c48daf233c2e9ffeaee72ef8297d30597a49","sha256:3f65de237956ed032da0391dcc98d82fe105e165660f4469a74df7b87f048fac"],"state_sha256":"470c5e2e5eb97274de012085b94b916e7628c86a80b218db7bc06d42ebe72f5d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hoQrSGF9YoXUA9/eCqgnoAKe7Y+ASbJxCwFp39Zw27hkP0JhyxGb1mM5XSJlXU0e0Ya1xBg1C0BzWMCJDfDGBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-03T18:56:35.833582Z","bundle_sha256":"90df45e95c15fdfc443e6079e34bcbefe803e3791f082a018ca10fc97d8400e8"}}