{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:3E6QC6F3LHBNWNYHL5WAYL6N4P","short_pith_number":"pith:3E6QC6F3","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"},"canonical_sha256":"d93d0178bb59c2db37075f6c0c2fcde3f949d35ef6af30d26b08da97d1014b95","source":{"kind":"arxiv","id":"1106.5269","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1106.5269","created_at":"2026-05-18T04:19:13Z"},{"alias_kind":"arxiv_version","alias_value":"1106.5269v1","created_at":"2026-05-18T04:19:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.5269","created_at":"2026-05-18T04:19:13Z"},{"alias_kind":"pith_short_12","alias_value":"3E6QC6F3LHBN","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_16","alias_value":"3E6QC6F3LHBNWNYH","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_8","alias_value":"3E6QC6F3","created_at":"2026-05-18T12:26:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:3E6QC6F3LHBNWNYHL5WAYL6N4P","target":"record","payload":{"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"},"canonical_sha256":"d93d0178bb59c2db37075f6c0c2fcde3f949d35ef6af30d26b08da97d1014b95","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"},"source_kind":"arxiv","source_id":"1106.5269","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-18T04:19:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J3F5o4uHksQdKV0f8mTIzEFYH+GbYD/8mnIVMUf5IRDEgFUdyw57eO+GtSk70f7pA4rIjW0+UKqYsaWmff8FDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T00:59:12.655248Z"},"content_sha256":"75eedf9322bc26839784433e610ac75c699c55078640019afded973712385083","schema_version":"1.0","event_id":"sha256:75eedf9322bc26839784433e610ac75c699c55078640019afded973712385083"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:3E6QC6F3LHBNWNYHL5WAYL6N4P","target":"graph","payload":{"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"},"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-18T04:19:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"esM3pAaZ089sMJcBNEbjij81il9FG0rGh5YtoOCAfOMWZn7Lro04MRNGnLrnlY9akxGWA/e/GkNO6LcL3OchBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T00:59:12.655627Z"},"content_sha256":"fd0282f557f7666275c2a00952965190b4435023641ea31d93004c9958fc1d18","schema_version":"1.0","event_id":"sha256:fd0282f557f7666275c2a00952965190b4435023641ea31d93004c9958fc1d18"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3E6QC6F3LHBNWNYHL5WAYL6N4P/bundle.json","state_url":"https://pith.science/pith/3E6QC6F3LHBNWNYHL5WAYL6N4P/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3E6QC6F3LHBNWNYHL5WAYL6N4P/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-25T00:59:12Z","links":{"resolver":"https://pith.science/pith/3E6QC6F3LHBNWNYHL5WAYL6N4P","bundle":"https://pith.science/pith/3E6QC6F3LHBNWNYHL5WAYL6N4P/bundle.json","state":"https://pith.science/pith/3E6QC6F3LHBNWNYHL5WAYL6N4P/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3E6QC6F3LHBNWNYHL5WAYL6N4P/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:3E6QC6F3LHBNWNYHL5WAYL6N4P","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":"179b2106a15b41ce4ce341ebe20b60c8bf14e36891095819617229fe4210c95a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-06-26T21:08:20Z","title_canon_sha256":"e6a863778c7bf768413db406832dca4d2b037b703f9fb7203e9685088655b9cb"},"schema_version":"1.0","source":{"id":"1106.5269","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1106.5269","created_at":"2026-05-18T04:19:13Z"},{"alias_kind":"arxiv_version","alias_value":"1106.5269v1","created_at":"2026-05-18T04:19:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.5269","created_at":"2026-05-18T04:19:13Z"},{"alias_kind":"pith_short_12","alias_value":"3E6QC6F3LHBN","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_16","alias_value":"3E6QC6F3LHBNWNYH","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_8","alias_value":"3E6QC6F3","created_at":"2026-05-18T12:26:18Z"}],"graph_snapshots":[{"event_id":"sha256:fd0282f557f7666275c2a00952965190b4435023641ea31d93004c9958fc1d18","target":"graph","created_at":"2026-05-18T04:19:13Z","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":"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","authors_text":"E. Rivlin, L. Finkelstein, S. Markovitch","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-06-26T21:08:20Z","title":"Optimal Schedules for Parallelizing Anytime Algorithms: The Case of Shared Resources"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.5269","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:75eedf9322bc26839784433e610ac75c699c55078640019afded973712385083","target":"record","created_at":"2026-05-18T04:19:13Z","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":"179b2106a15b41ce4ce341ebe20b60c8bf14e36891095819617229fe4210c95a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2011-06-26T21:08:20Z","title_canon_sha256":"e6a863778c7bf768413db406832dca4d2b037b703f9fb7203e9685088655b9cb"},"schema_version":"1.0","source":{"id":"1106.5269","kind":"arxiv","version":1}},"canonical_sha256":"d93d0178bb59c2db37075f6c0c2fcde3f949d35ef6af30d26b08da97d1014b95","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d93d0178bb59c2db37075f6c0c2fcde3f949d35ef6af30d26b08da97d1014b95","first_computed_at":"2026-05-18T04:19:13.920323Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:19:13.920323Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pNSTKu/IvAwI7636g8Fmq7ZRlLUNMMTlONOrt4UyayYpnxnsardeY34ga6Bg5Hc/1vVoa+2eIbEWulSsJ5syAg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:19:13.920739Z","signed_message":"canonical_sha256_bytes"},"source_id":"1106.5269","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:75eedf9322bc26839784433e610ac75c699c55078640019afded973712385083","sha256:fd0282f557f7666275c2a00952965190b4435023641ea31d93004c9958fc1d18"],"state_sha256":"d0d600acf28c4ff0d34cc0bf0734c37700d3c5d13e8ad80de84daba0b5284630"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vOAVnB1pj1W01KteHEAN9PdYEjwAEq5eBtZo/TLOm9zBbzGSMXl1vYW0MEReCwhEkV6aBR+5CuE1ddoxObPJDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T00:59:12.657634Z","bundle_sha256":"1989ffcff0e3bd2743a7f74005f0ee960a033ac179028d902f65fdecb53ba658"}}