{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:EIPIA6WTCVDSQZFNNBE4DY2REZ","short_pith_number":"pith:EIPIA6WT","schema_version":"1.0","canonical_sha256":"221e807ad315472864ad6849c1e351267c69e8dcd8bd26fe50c525c011098d3d","source":{"kind":"arxiv","id":"1008.4328","version":1},"attestation_state":"computed","paper":{"title":"Distributed solving through model splitting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Lars Kotthoff, Neil C.A. Moore","submitted_at":"2010-08-25T18:07:40Z","abstract_excerpt":"Constraint problems can be trivially solved in parallel by exploring different branches of the search tree concurrently. Previous approaches have focused on implementing this functionality in the solver, more or less transparently to the user. We propose a new approach, which modifies the constraint model of the problem. An existing model is split into new models with added constraints that partition the search space. Optionally, additional constraints are imposed that rule out the search already done. The advantages of our approach are that it can be implemented easily, computations can be st"},"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":"1008.4328","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2010-08-25T18:07:40Z","cross_cats_sorted":[],"title_canon_sha256":"0401015043b1c99e7f927c639e7f7f65e5571d6b0e79d6ab90bc918bb86518c0","abstract_canon_sha256":"9970f17baa70ce69a7ad252fee6270d5c5fa371e56e98149720ff9aa1e65b330"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:41:53.169737Z","signature_b64":"0bHO6Nw0P1KIJ+cTMs8ojF61lA15Uw1rYmTst+zslelAtYI9HQlb8jGiMVCl75HAFnIwTZyaARch3GLVPfvkAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"221e807ad315472864ad6849c1e351267c69e8dcd8bd26fe50c525c011098d3d","last_reissued_at":"2026-05-18T04:41:53.169068Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:41:53.169068Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distributed solving through model splitting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Lars Kotthoff, Neil C.A. Moore","submitted_at":"2010-08-25T18:07:40Z","abstract_excerpt":"Constraint problems can be trivially solved in parallel by exploring different branches of the search tree concurrently. Previous approaches have focused on implementing this functionality in the solver, more or less transparently to the user. We propose a new approach, which modifies the constraint model of the problem. An existing model is split into new models with added constraints that partition the search space. Optionally, additional constraints are imposed that rule out the search already done. The advantages of our approach are that it can be implemented easily, computations can be st"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1008.4328","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":"1008.4328","created_at":"2026-05-18T04:41:53.169146+00:00"},{"alias_kind":"arxiv_version","alias_value":"1008.4328v1","created_at":"2026-05-18T04:41:53.169146+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.4328","created_at":"2026-05-18T04:41:53.169146+00:00"},{"alias_kind":"pith_short_12","alias_value":"EIPIA6WTCVDS","created_at":"2026-05-18T12:26:06.534383+00:00"},{"alias_kind":"pith_short_16","alias_value":"EIPIA6WTCVDSQZFN","created_at":"2026-05-18T12:26:06.534383+00:00"},{"alias_kind":"pith_short_8","alias_value":"EIPIA6WT","created_at":"2026-05-18T12:26:06.534383+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/EIPIA6WTCVDSQZFNNBE4DY2REZ","json":"https://pith.science/pith/EIPIA6WTCVDSQZFNNBE4DY2REZ.json","graph_json":"https://pith.science/api/pith-number/EIPIA6WTCVDSQZFNNBE4DY2REZ/graph.json","events_json":"https://pith.science/api/pith-number/EIPIA6WTCVDSQZFNNBE4DY2REZ/events.json","paper":"https://pith.science/paper/EIPIA6WT"},"agent_actions":{"view_html":"https://pith.science/pith/EIPIA6WTCVDSQZFNNBE4DY2REZ","download_json":"https://pith.science/pith/EIPIA6WTCVDSQZFNNBE4DY2REZ.json","view_paper":"https://pith.science/paper/EIPIA6WT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1008.4328&json=true","fetch_graph":"https://pith.science/api/pith-number/EIPIA6WTCVDSQZFNNBE4DY2REZ/graph.json","fetch_events":"https://pith.science/api/pith-number/EIPIA6WTCVDSQZFNNBE4DY2REZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EIPIA6WTCVDSQZFNNBE4DY2REZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EIPIA6WTCVDSQZFNNBE4DY2REZ/action/storage_attestation","attest_author":"https://pith.science/pith/EIPIA6WTCVDSQZFNNBE4DY2REZ/action/author_attestation","sign_citation":"https://pith.science/pith/EIPIA6WTCVDSQZFNNBE4DY2REZ/action/citation_signature","submit_replication":"https://pith.science/pith/EIPIA6WTCVDSQZFNNBE4DY2REZ/action/replication_record"}},"created_at":"2026-05-18T04:41:53.169146+00:00","updated_at":"2026-05-18T04:41:53.169146+00:00"}