{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:3E6QC6F3LHBNWNYHL5WAYL6N4P","short_pith_number":"pith:3E6QC6F3","schema_version":"1.0","canonical_sha256":"d93d0178bb59c2db37075f6c0c2fcde3f949d35ef6af30d26b08da97d1014b95","source":{"kind":"arxiv","id":"1106.5269","version":1},"attestation_state":"computed","paper":{"title":"Optimal Schedules for Parallelizing Anytime Algorithms: The Case of Shared Resources","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"E. Rivlin, L. Finkelstein, S. Markovitch","submitted_at":"2011-06-26T21:08:20Z","abstract_excerpt":"The performance of anytime algorithms can be improved by simultaneously solving several instances of algorithm-problem pairs. These pairs may include different instances of a problem (such as starting from a different initial state), different algorithms (if several alternatives exist), or several runs of the same algorithm (for non-deterministic algorithms). In this paper we present a methodology for designing an optimal scheduling policy based on the statistical characteristics of the algorithms involved. We formally analyze the case where the processes share resources (a single-processor mo"},"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":"1106.5269","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-06-26T21:08:20Z","cross_cats_sorted":[],"title_canon_sha256":"e6a863778c7bf768413db406832dca4d2b037b703f9fb7203e9685088655b9cb","abstract_canon_sha256":"179b2106a15b41ce4ce341ebe20b60c8bf14e36891095819617229fe4210c95a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:19:13.920739Z","signature_b64":"pNSTKu/IvAwI7636g8Fmq7ZRlLUNMMTlONOrt4UyayYpnxnsardeY34ga6Bg5Hc/1vVoa+2eIbEWulSsJ5syAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d93d0178bb59c2db37075f6c0c2fcde3f949d35ef6af30d26b08da97d1014b95","last_reissued_at":"2026-05-18T04:19:13.920323Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:19:13.920323Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal Schedules for Parallelizing Anytime Algorithms: The Case of Shared Resources","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"E. Rivlin, L. Finkelstein, S. Markovitch","submitted_at":"2011-06-26T21:08:20Z","abstract_excerpt":"The performance of anytime algorithms can be improved by simultaneously solving several instances of algorithm-problem pairs. These pairs may include different instances of a problem (such as starting from a different initial state), different algorithms (if several alternatives exist), or several runs of the same algorithm (for non-deterministic algorithms). In this paper we present a methodology for designing an optimal scheduling policy based on the statistical characteristics of the algorithms involved. We formally analyze the case where the processes share resources (a single-processor mo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.5269","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":"1106.5269","created_at":"2026-05-18T04:19:13.920381+00:00"},{"alias_kind":"arxiv_version","alias_value":"1106.5269v1","created_at":"2026-05-18T04:19:13.920381+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.5269","created_at":"2026-05-18T04:19:13.920381+00:00"},{"alias_kind":"pith_short_12","alias_value":"3E6QC6F3LHBN","created_at":"2026-05-18T12:26:18.847500+00:00"},{"alias_kind":"pith_short_16","alias_value":"3E6QC6F3LHBNWNYH","created_at":"2026-05-18T12:26:18.847500+00:00"},{"alias_kind":"pith_short_8","alias_value":"3E6QC6F3","created_at":"2026-05-18T12:26:18.847500+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/3E6QC6F3LHBNWNYHL5WAYL6N4P","json":"https://pith.science/pith/3E6QC6F3LHBNWNYHL5WAYL6N4P.json","graph_json":"https://pith.science/api/pith-number/3E6QC6F3LHBNWNYHL5WAYL6N4P/graph.json","events_json":"https://pith.science/api/pith-number/3E6QC6F3LHBNWNYHL5WAYL6N4P/events.json","paper":"https://pith.science/paper/3E6QC6F3"},"agent_actions":{"view_html":"https://pith.science/pith/3E6QC6F3LHBNWNYHL5WAYL6N4P","download_json":"https://pith.science/pith/3E6QC6F3LHBNWNYHL5WAYL6N4P.json","view_paper":"https://pith.science/paper/3E6QC6F3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1106.5269&json=true","fetch_graph":"https://pith.science/api/pith-number/3E6QC6F3LHBNWNYHL5WAYL6N4P/graph.json","fetch_events":"https://pith.science/api/pith-number/3E6QC6F3LHBNWNYHL5WAYL6N4P/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3E6QC6F3LHBNWNYHL5WAYL6N4P/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3E6QC6F3LHBNWNYHL5WAYL6N4P/action/storage_attestation","attest_author":"https://pith.science/pith/3E6QC6F3LHBNWNYHL5WAYL6N4P/action/author_attestation","sign_citation":"https://pith.science/pith/3E6QC6F3LHBNWNYHL5WAYL6N4P/action/citation_signature","submit_replication":"https://pith.science/pith/3E6QC6F3LHBNWNYHL5WAYL6N4P/action/replication_record"}},"created_at":"2026-05-18T04:19:13.920381+00:00","updated_at":"2026-05-18T04:19:13.920381+00:00"}