{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:356N7XGUUVVERVTTUYTBSB7ZVB","short_pith_number":"pith:356N7XGU","schema_version":"1.0","canonical_sha256":"df7cdfdcd4a56a48d673a6261907f9a84205e5aac1623d76d04f1d611615b27a","source":{"kind":"arxiv","id":"1604.06484","version":1},"attestation_state":"computed","paper":{"title":"Parallel Strategies Selection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Anthony Palmieri, Jean-Charles R\\'egin, Pierre Schaus","submitted_at":"2016-04-21T20:40:35Z","abstract_excerpt":"We consider the problem of selecting the best variable-value strategy for solving a given problem in constraint programming. We show that the recent Embarrassingly Parallel Search method (EPS) can be used for this purpose. EPS proposes to solve a problem by decomposing it in a lot of subproblems and to give them on-demand to workers which run in parallel. Our method uses a part of these subproblems as a simple sample as defined in statistics for comparing some strategies in order to select the most promising one that will be used for solving the remaining subproblems. For each subproblem of th"},"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":"1604.06484","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-04-21T20:40:35Z","cross_cats_sorted":[],"title_canon_sha256":"5f9015a927a2b5f06f7482220e15c7a2f3b9307727eb85b6be1a4098c86b084c","abstract_canon_sha256":"8d9df6e943cf00ccbe43b2aae88abd3ba3dabc8c8fdc6b6cfd60b785a26bb537"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:16:28.953489Z","signature_b64":"/V7pb9snfamTB0TYMYmsQDZpIYSR1PucIpXshOfwJRi0yI7rufdU85Z7Je3+KGsIlIpRXLdj/7+8ziJ4TWYeBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"df7cdfdcd4a56a48d673a6261907f9a84205e5aac1623d76d04f1d611615b27a","last_reissued_at":"2026-05-18T01:16:28.953002Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:16:28.953002Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Parallel Strategies Selection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Anthony Palmieri, Jean-Charles R\\'egin, Pierre Schaus","submitted_at":"2016-04-21T20:40:35Z","abstract_excerpt":"We consider the problem of selecting the best variable-value strategy for solving a given problem in constraint programming. We show that the recent Embarrassingly Parallel Search method (EPS) can be used for this purpose. EPS proposes to solve a problem by decomposing it in a lot of subproblems and to give them on-demand to workers which run in parallel. Our method uses a part of these subproblems as a simple sample as defined in statistics for comparing some strategies in order to select the most promising one that will be used for solving the remaining subproblems. For each subproblem of th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.06484","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":"1604.06484","created_at":"2026-05-18T01:16:28.953077+00:00"},{"alias_kind":"arxiv_version","alias_value":"1604.06484v1","created_at":"2026-05-18T01:16:28.953077+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.06484","created_at":"2026-05-18T01:16:28.953077+00:00"},{"alias_kind":"pith_short_12","alias_value":"356N7XGUUVVE","created_at":"2026-05-18T12:29:55.572404+00:00"},{"alias_kind":"pith_short_16","alias_value":"356N7XGUUVVERVTT","created_at":"2026-05-18T12:29:55.572404+00:00"},{"alias_kind":"pith_short_8","alias_value":"356N7XGU","created_at":"2026-05-18T12:29:55.572404+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/356N7XGUUVVERVTTUYTBSB7ZVB","json":"https://pith.science/pith/356N7XGUUVVERVTTUYTBSB7ZVB.json","graph_json":"https://pith.science/api/pith-number/356N7XGUUVVERVTTUYTBSB7ZVB/graph.json","events_json":"https://pith.science/api/pith-number/356N7XGUUVVERVTTUYTBSB7ZVB/events.json","paper":"https://pith.science/paper/356N7XGU"},"agent_actions":{"view_html":"https://pith.science/pith/356N7XGUUVVERVTTUYTBSB7ZVB","download_json":"https://pith.science/pith/356N7XGUUVVERVTTUYTBSB7ZVB.json","view_paper":"https://pith.science/paper/356N7XGU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1604.06484&json=true","fetch_graph":"https://pith.science/api/pith-number/356N7XGUUVVERVTTUYTBSB7ZVB/graph.json","fetch_events":"https://pith.science/api/pith-number/356N7XGUUVVERVTTUYTBSB7ZVB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/356N7XGUUVVERVTTUYTBSB7ZVB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/356N7XGUUVVERVTTUYTBSB7ZVB/action/storage_attestation","attest_author":"https://pith.science/pith/356N7XGUUVVERVTTUYTBSB7ZVB/action/author_attestation","sign_citation":"https://pith.science/pith/356N7XGUUVVERVTTUYTBSB7ZVB/action/citation_signature","submit_replication":"https://pith.science/pith/356N7XGUUVVERVTTUYTBSB7ZVB/action/replication_record"}},"created_at":"2026-05-18T01:16:28.953077+00:00","updated_at":"2026-05-18T01:16:28.953077+00:00"}