{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:FXOAN55R3WO4OGXRXO3EVAZLYA","short_pith_number":"pith:FXOAN55R","canonical_record":{"source":{"id":"1803.10981","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-03-29T09:34:09Z","cross_cats_sorted":[],"title_canon_sha256":"48cb1a6b76bd3730624f7e762f84f3bad5aacef009e9bd3258649b5de9d65cee","abstract_canon_sha256":"893dff04a44fa940d7f8766dda395cdd44e55a2276bc97d71a06abd479cdc533"},"schema_version":"1.0"},"canonical_sha256":"2ddc06f7b1dd9dc71af1bbb64a832bc03401def94eef62cde701e540178b5d79","source":{"kind":"arxiv","id":"1803.10981","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.10981","created_at":"2026-05-18T00:19:49Z"},{"alias_kind":"arxiv_version","alias_value":"1803.10981v1","created_at":"2026-05-18T00:19:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.10981","created_at":"2026-05-18T00:19:49Z"},{"alias_kind":"pith_short_12","alias_value":"FXOAN55R3WO4","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"FXOAN55R3WO4OGXR","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"FXOAN55R","created_at":"2026-05-18T12:32:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:FXOAN55R3WO4OGXRXO3EVAZLYA","target":"record","payload":{"canonical_record":{"source":{"id":"1803.10981","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-03-29T09:34:09Z","cross_cats_sorted":[],"title_canon_sha256":"48cb1a6b76bd3730624f7e762f84f3bad5aacef009e9bd3258649b5de9d65cee","abstract_canon_sha256":"893dff04a44fa940d7f8766dda395cdd44e55a2276bc97d71a06abd479cdc533"},"schema_version":"1.0"},"canonical_sha256":"2ddc06f7b1dd9dc71af1bbb64a832bc03401def94eef62cde701e540178b5d79","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:19:49.626145Z","signature_b64":"TX7YWSBpU4f1oS9mAZJQC/wwVxT9G8uZF3MlSr2wxa+nhHlGTbRkUoI2vznQYMZrF4e0zap7PZzOc2sVjVIkAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2ddc06f7b1dd9dc71af1bbb64a832bc03401def94eef62cde701e540178b5d79","last_reissued_at":"2026-05-18T00:19:49.625444Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:19:49.625444Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1803.10981","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-18T00:19:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MKVcynPJfGX8T/LsYXghOizsy9i4hnQGzZHjVVoqGaQigCm2uC2/l2KF8Pqza5BnFuXvJKfYP6w9xyiOL4UlAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T18:13:36.890825Z"},"content_sha256":"14f77b65b2016584d5b3e455a1150cf41644d32b3ed8a347a0d1708b582954f7","schema_version":"1.0","event_id":"sha256:14f77b65b2016584d5b3e455a1150cf41644d32b3ed8a347a0d1708b582954f7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:FXOAN55R3WO4OGXRXO3EVAZLYA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Review of Literature on Parallel Constraint Solving","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Chris Unsworth, Ciaran McCreesh, Ian Miguel, Ian P. Gent, Neil C.A. Moore, Patrick Prosser, Peter Nightingale","submitted_at":"2018-03-29T09:34:09Z","abstract_excerpt":"As multicore computing is now standard, it seems irresponsible for constraints researchers to ignore the implications of it. Researchers need to address a number of issues to exploit parallelism, such as: investigating which constraint algorithms are amenable to parallelisation; whether to use shared memory or distributed computation; whether to use static or dynamic decomposition; and how to best exploit portfolios and cooperating search. We review the literature, and see that we can sometimes do quite well, some of the time, on some instances, but we are far from a general solution. Yet ther"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.10981","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-18T00:19:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qZtGfT938fPoMQJ3MpIeaj4VUrV9f5vuV/AkK6is5Tt4sUuvSQgsrnXm0HZn51WqiPnLqKSJJnx6aVjVKkFYBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T18:13:36.891630Z"},"content_sha256":"716763d20e3218260ed780a885f5554f691c55fc5324f7f618b190413f7da308","schema_version":"1.0","event_id":"sha256:716763d20e3218260ed780a885f5554f691c55fc5324f7f618b190413f7da308"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FXOAN55R3WO4OGXRXO3EVAZLYA/bundle.json","state_url":"https://pith.science/pith/FXOAN55R3WO4OGXRXO3EVAZLYA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FXOAN55R3WO4OGXRXO3EVAZLYA/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-09T18:13:36Z","links":{"resolver":"https://pith.science/pith/FXOAN55R3WO4OGXRXO3EVAZLYA","bundle":"https://pith.science/pith/FXOAN55R3WO4OGXRXO3EVAZLYA/bundle.json","state":"https://pith.science/pith/FXOAN55R3WO4OGXRXO3EVAZLYA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FXOAN55R3WO4OGXRXO3EVAZLYA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:FXOAN55R3WO4OGXRXO3EVAZLYA","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":"893dff04a44fa940d7f8766dda395cdd44e55a2276bc97d71a06abd479cdc533","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-03-29T09:34:09Z","title_canon_sha256":"48cb1a6b76bd3730624f7e762f84f3bad5aacef009e9bd3258649b5de9d65cee"},"schema_version":"1.0","source":{"id":"1803.10981","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.10981","created_at":"2026-05-18T00:19:49Z"},{"alias_kind":"arxiv_version","alias_value":"1803.10981v1","created_at":"2026-05-18T00:19:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.10981","created_at":"2026-05-18T00:19:49Z"},{"alias_kind":"pith_short_12","alias_value":"FXOAN55R3WO4","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"FXOAN55R3WO4OGXR","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"FXOAN55R","created_at":"2026-05-18T12:32:25Z"}],"graph_snapshots":[{"event_id":"sha256:716763d20e3218260ed780a885f5554f691c55fc5324f7f618b190413f7da308","target":"graph","created_at":"2026-05-18T00:19:49Z","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":"As multicore computing is now standard, it seems irresponsible for constraints researchers to ignore the implications of it. Researchers need to address a number of issues to exploit parallelism, such as: investigating which constraint algorithms are amenable to parallelisation; whether to use shared memory or distributed computation; whether to use static or dynamic decomposition; and how to best exploit portfolios and cooperating search. We review the literature, and see that we can sometimes do quite well, some of the time, on some instances, but we are far from a general solution. Yet ther","authors_text":"Chris Unsworth, Ciaran McCreesh, Ian Miguel, Ian P. Gent, Neil C.A. Moore, Patrick Prosser, Peter Nightingale","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-03-29T09:34:09Z","title":"A Review of Literature on Parallel Constraint Solving"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.10981","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:14f77b65b2016584d5b3e455a1150cf41644d32b3ed8a347a0d1708b582954f7","target":"record","created_at":"2026-05-18T00:19:49Z","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":"893dff04a44fa940d7f8766dda395cdd44e55a2276bc97d71a06abd479cdc533","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-03-29T09:34:09Z","title_canon_sha256":"48cb1a6b76bd3730624f7e762f84f3bad5aacef009e9bd3258649b5de9d65cee"},"schema_version":"1.0","source":{"id":"1803.10981","kind":"arxiv","version":1}},"canonical_sha256":"2ddc06f7b1dd9dc71af1bbb64a832bc03401def94eef62cde701e540178b5d79","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2ddc06f7b1dd9dc71af1bbb64a832bc03401def94eef62cde701e540178b5d79","first_computed_at":"2026-05-18T00:19:49.625444Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:19:49.625444Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TX7YWSBpU4f1oS9mAZJQC/wwVxT9G8uZF3MlSr2wxa+nhHlGTbRkUoI2vznQYMZrF4e0zap7PZzOc2sVjVIkAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:19:49.626145Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.10981","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:14f77b65b2016584d5b3e455a1150cf41644d32b3ed8a347a0d1708b582954f7","sha256:716763d20e3218260ed780a885f5554f691c55fc5324f7f618b190413f7da308"],"state_sha256":"1e253eae7b1ff3dcf7132b7c293348b1f9fa73650584ace1518db9edc3213de9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SYhy0j9y5Ydw7aJsUgTqrkpaaNnmcz6BixN2XL4O8D+oePdwTmBhowdXj7WQlGmTvHbisy7SqDVWtxfXQziEBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T18:13:36.895750Z","bundle_sha256":"2b8cd5c9d667ca0a4c925333de5a3adb04732e8d62207b92a9a5aa8f2e4186f0"}}