{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:SNJLTNLZOJYMKU5NJMRY6FWZAU","short_pith_number":"pith:SNJLTNLZ","canonical_record":{"source":{"id":"1511.00486","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-11-02T13:16:30Z","cross_cats_sorted":[],"title_canon_sha256":"e9288c7ae9f20d61db0fc21805c2a66596e1738079942ddf46cc980e37fc7435","abstract_canon_sha256":"62456d9a27a3c1423ff36b8cd097103ffad4c14488fcb41b36638050caf89a1c"},"schema_version":"1.0"},"canonical_sha256":"9352b9b5797270c553ad4b238f16d90507edd2e7c220ac2764cda9e1fab0b020","source":{"kind":"arxiv","id":"1511.00486","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.00486","created_at":"2026-05-18T01:28:12Z"},{"alias_kind":"arxiv_version","alias_value":"1511.00486v1","created_at":"2026-05-18T01:28:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.00486","created_at":"2026-05-18T01:28:12Z"},{"alias_kind":"pith_short_12","alias_value":"SNJLTNLZOJYM","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_16","alias_value":"SNJLTNLZOJYMKU5N","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_8","alias_value":"SNJLTNLZ","created_at":"2026-05-18T12:29:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:SNJLTNLZOJYMKU5NJMRY6FWZAU","target":"record","payload":{"canonical_record":{"source":{"id":"1511.00486","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-11-02T13:16:30Z","cross_cats_sorted":[],"title_canon_sha256":"e9288c7ae9f20d61db0fc21805c2a66596e1738079942ddf46cc980e37fc7435","abstract_canon_sha256":"62456d9a27a3c1423ff36b8cd097103ffad4c14488fcb41b36638050caf89a1c"},"schema_version":"1.0"},"canonical_sha256":"9352b9b5797270c553ad4b238f16d90507edd2e7c220ac2764cda9e1fab0b020","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:28:12.190453Z","signature_b64":"eOcW/ZnkeBl3CWuI4OJTAEdVWtF3ZWMMT0ms7+YmvaVQJMbj5BKWL4sVfRSGcNggcH1c+/PNJu6XZA09dd0VDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9352b9b5797270c553ad4b238f16d90507edd2e7c220ac2764cda9e1fab0b020","last_reissued_at":"2026-05-18T01:28:12.189588Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:28:12.189588Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1511.00486","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-18T01:28:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c9SbC6p/iBmNrwwpBh2mh14MGvI9Qq2w5xwJx+d3HidPPJmGt3Q3+94LvSaXbPz4iJ9aJukdhqVFeQ+mADEqDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T11:03:06.989712Z"},"content_sha256":"d5c6308f0a9577ab052b5b8580e14f9037a3f7a3f45e262ccc38c22409ac9947","schema_version":"1.0","event_id":"sha256:d5c6308f0a9577ab052b5b8580e14f9037a3f7a3f45e262ccc38c22409ac9947"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:SNJLTNLZOJYMKU5NJMRY6FWZAU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Parallel Exhaustive Search without Coordination","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Amos Korman, Pierre Fraigniaud, Yoav Rodeh","submitted_at":"2015-11-02T13:16:30Z","abstract_excerpt":"We analyze parallel algorithms in the context of exhaustive search over totally ordered sets. Imagine an infinite list of \"boxes\", with a \"treasure\" hidden in one of them, where the boxes' order reflects the importance of finding the treasure in a given box. At each time step, a search protocol executed by a searcher has the ability to peek into one box, and see whether the treasure is present or not. By equally dividing the workload between them, $k$ searchers can find the treasure $k$ times faster than one searcher. However, this straightforward strategy is very sensitive to failures (e.g., "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.00486","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-18T01:28:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5J7dxk9/6FPLMOCqPbZ0lPXXrSu6TQ7c4NoXIwUSfCWJAuZf5qkmK8mP8gYkjL8cEj6CkHFcxkWUgl45uGC/CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T11:03:06.990050Z"},"content_sha256":"b6a7e98996021d7368a489deadbe5ae08904277508e291f29a5e97200cfa691f","schema_version":"1.0","event_id":"sha256:b6a7e98996021d7368a489deadbe5ae08904277508e291f29a5e97200cfa691f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SNJLTNLZOJYMKU5NJMRY6FWZAU/bundle.json","state_url":"https://pith.science/pith/SNJLTNLZOJYMKU5NJMRY6FWZAU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SNJLTNLZOJYMKU5NJMRY6FWZAU/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-09T11:03:06Z","links":{"resolver":"https://pith.science/pith/SNJLTNLZOJYMKU5NJMRY6FWZAU","bundle":"https://pith.science/pith/SNJLTNLZOJYMKU5NJMRY6FWZAU/bundle.json","state":"https://pith.science/pith/SNJLTNLZOJYMKU5NJMRY6FWZAU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SNJLTNLZOJYMKU5NJMRY6FWZAU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:SNJLTNLZOJYMKU5NJMRY6FWZAU","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":"62456d9a27a3c1423ff36b8cd097103ffad4c14488fcb41b36638050caf89a1c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-11-02T13:16:30Z","title_canon_sha256":"e9288c7ae9f20d61db0fc21805c2a66596e1738079942ddf46cc980e37fc7435"},"schema_version":"1.0","source":{"id":"1511.00486","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.00486","created_at":"2026-05-18T01:28:12Z"},{"alias_kind":"arxiv_version","alias_value":"1511.00486v1","created_at":"2026-05-18T01:28:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.00486","created_at":"2026-05-18T01:28:12Z"},{"alias_kind":"pith_short_12","alias_value":"SNJLTNLZOJYM","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_16","alias_value":"SNJLTNLZOJYMKU5N","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_8","alias_value":"SNJLTNLZ","created_at":"2026-05-18T12:29:42Z"}],"graph_snapshots":[{"event_id":"sha256:b6a7e98996021d7368a489deadbe5ae08904277508e291f29a5e97200cfa691f","target":"graph","created_at":"2026-05-18T01:28:12Z","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":"We analyze parallel algorithms in the context of exhaustive search over totally ordered sets. Imagine an infinite list of \"boxes\", with a \"treasure\" hidden in one of them, where the boxes' order reflects the importance of finding the treasure in a given box. At each time step, a search protocol executed by a searcher has the ability to peek into one box, and see whether the treasure is present or not. By equally dividing the workload between them, $k$ searchers can find the treasure $k$ times faster than one searcher. However, this straightforward strategy is very sensitive to failures (e.g., ","authors_text":"Amos Korman, Pierre Fraigniaud, Yoav Rodeh","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-11-02T13:16:30Z","title":"Parallel Exhaustive Search without Coordination"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.00486","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:d5c6308f0a9577ab052b5b8580e14f9037a3f7a3f45e262ccc38c22409ac9947","target":"record","created_at":"2026-05-18T01:28:12Z","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":"62456d9a27a3c1423ff36b8cd097103ffad4c14488fcb41b36638050caf89a1c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-11-02T13:16:30Z","title_canon_sha256":"e9288c7ae9f20d61db0fc21805c2a66596e1738079942ddf46cc980e37fc7435"},"schema_version":"1.0","source":{"id":"1511.00486","kind":"arxiv","version":1}},"canonical_sha256":"9352b9b5797270c553ad4b238f16d90507edd2e7c220ac2764cda9e1fab0b020","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9352b9b5797270c553ad4b238f16d90507edd2e7c220ac2764cda9e1fab0b020","first_computed_at":"2026-05-18T01:28:12.189588Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:28:12.189588Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"eOcW/ZnkeBl3CWuI4OJTAEdVWtF3ZWMMT0ms7+YmvaVQJMbj5BKWL4sVfRSGcNggcH1c+/PNJu6XZA09dd0VDA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:28:12.190453Z","signed_message":"canonical_sha256_bytes"},"source_id":"1511.00486","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d5c6308f0a9577ab052b5b8580e14f9037a3f7a3f45e262ccc38c22409ac9947","sha256:b6a7e98996021d7368a489deadbe5ae08904277508e291f29a5e97200cfa691f"],"state_sha256":"1869c99aa2a10bdf80ef91c86a3c2edf6fd2fea2aa6c897334cae336c2c34bbb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qb5E/nZMTpywDwFp5kYzwf+gcciz8S5qLg9vNm8bFIMuttmtamLqY2KXVYJv7hDKfs/IY2FN6+oviwobBK5ZDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T11:03:06.991830Z","bundle_sha256":"8ac3e75b15485536661167869dc814addf332a30f0791fb4036d8617d512fa93"}}