{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:I3L6DUSTCEN4MLQEPZZYKNJRF3","short_pith_number":"pith:I3L6DUST","canonical_record":{"source":{"id":"1705.05704","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-05-16T13:48:49Z","cross_cats_sorted":[],"title_canon_sha256":"c84c973140386a234383cbce109c7d4dc4674f23aa7413018d6bfbccd7d85366","abstract_canon_sha256":"6fbcce262619c95cdd8f016333e916abe5b5986f36aede787d6f86b5661b38ad"},"schema_version":"1.0"},"canonical_sha256":"46d7e1d253111bc62e047e738535312eccedc8cd38fe68055edb0a9b58a9c615","source":{"kind":"arxiv","id":"1705.05704","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.05704","created_at":"2026-05-18T00:44:20Z"},{"alias_kind":"arxiv_version","alias_value":"1705.05704v1","created_at":"2026-05-18T00:44:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.05704","created_at":"2026-05-18T00:44:20Z"},{"alias_kind":"pith_short_12","alias_value":"I3L6DUSTCEN4","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"I3L6DUSTCEN4MLQE","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"I3L6DUST","created_at":"2026-05-18T12:31:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:I3L6DUSTCEN4MLQEPZZYKNJRF3","target":"record","payload":{"canonical_record":{"source":{"id":"1705.05704","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-05-16T13:48:49Z","cross_cats_sorted":[],"title_canon_sha256":"c84c973140386a234383cbce109c7d4dc4674f23aa7413018d6bfbccd7d85366","abstract_canon_sha256":"6fbcce262619c95cdd8f016333e916abe5b5986f36aede787d6f86b5661b38ad"},"schema_version":"1.0"},"canonical_sha256":"46d7e1d253111bc62e047e738535312eccedc8cd38fe68055edb0a9b58a9c615","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:20.387332Z","signature_b64":"+pmvmRcvdi8uElTABpNxSUj1JonXnLnRCtPU2W1Efhwz4HzWMo24iM6H5/yQ33lKbJKO8c2FROW6RYqWhe2tDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"46d7e1d253111bc62e047e738535312eccedc8cd38fe68055edb0a9b58a9c615","last_reissued_at":"2026-05-18T00:44:20.386918Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:20.386918Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.05704","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-18T00:44:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Y3lX07LYlf7Ol2w7kLKq+rrKYbCemhX6IjURcPQu5diYyCF9iI7acqugLEgysP8pnSAMDWE9zAvOQgQHN/y1Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T14:06:15.057445Z"},"content_sha256":"27a793c5f32cc12a0229d2f87965a9a19cc209495c920f32c7d9dc27412ae1d5","schema_version":"1.0","event_id":"sha256:27a793c5f32cc12a0229d2f87965a9a19cc209495c920f32c7d9dc27412ae1d5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:I3L6DUSTCEN4MLQEPZZYKNJRF3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Parallel Search with no Coordination","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Amos Korman (IRIF, GANG), Yoav Rodeh","submitted_at":"2017-05-16T13:48:49Z","abstract_excerpt":"We consider a parallel version of a classical Bayesian search problem. $k$ agents are looking for a treasure that is placed in one of the boxes indexed by $\\mathbb{N}^+$ according to a known distribution $p$. The aim is to minimize the expected time until the first agent finds it. Searchers run in parallel where at each time step each searcher can \"peek\" into a box. A basic family of algorithms which are inherently robust is  \\emph{non-coordinating} algorithms. Such algorithms act independently at each searcher, differing only by their probabilistic choices. We are interested in the price incu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.05704","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-18T00:44:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cxXUGqzi9YtzBYlgTB30sW2MAspP+CTdRfYL21CfS9j685HVAA1b04mbXCVP7R+UVDzoMJ0PqH9bvF1VSg2ZBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T14:06:15.057794Z"},"content_sha256":"04833d2c78d2000c63b53661bdd2c4b153765258c9c68912d0f48c8eb59c60d8","schema_version":"1.0","event_id":"sha256:04833d2c78d2000c63b53661bdd2c4b153765258c9c68912d0f48c8eb59c60d8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/I3L6DUSTCEN4MLQEPZZYKNJRF3/bundle.json","state_url":"https://pith.science/pith/I3L6DUSTCEN4MLQEPZZYKNJRF3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/I3L6DUSTCEN4MLQEPZZYKNJRF3/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-05T14:06:15Z","links":{"resolver":"https://pith.science/pith/I3L6DUSTCEN4MLQEPZZYKNJRF3","bundle":"https://pith.science/pith/I3L6DUSTCEN4MLQEPZZYKNJRF3/bundle.json","state":"https://pith.science/pith/I3L6DUSTCEN4MLQEPZZYKNJRF3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/I3L6DUSTCEN4MLQEPZZYKNJRF3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:I3L6DUSTCEN4MLQEPZZYKNJRF3","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":"6fbcce262619c95cdd8f016333e916abe5b5986f36aede787d6f86b5661b38ad","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-05-16T13:48:49Z","title_canon_sha256":"c84c973140386a234383cbce109c7d4dc4674f23aa7413018d6bfbccd7d85366"},"schema_version":"1.0","source":{"id":"1705.05704","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.05704","created_at":"2026-05-18T00:44:20Z"},{"alias_kind":"arxiv_version","alias_value":"1705.05704v1","created_at":"2026-05-18T00:44:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.05704","created_at":"2026-05-18T00:44:20Z"},{"alias_kind":"pith_short_12","alias_value":"I3L6DUSTCEN4","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"I3L6DUSTCEN4MLQE","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"I3L6DUST","created_at":"2026-05-18T12:31:21Z"}],"graph_snapshots":[{"event_id":"sha256:04833d2c78d2000c63b53661bdd2c4b153765258c9c68912d0f48c8eb59c60d8","target":"graph","created_at":"2026-05-18T00:44:20Z","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 consider a parallel version of a classical Bayesian search problem. $k$ agents are looking for a treasure that is placed in one of the boxes indexed by $\\mathbb{N}^+$ according to a known distribution $p$. The aim is to minimize the expected time until the first agent finds it. Searchers run in parallel where at each time step each searcher can \"peek\" into a box. A basic family of algorithms which are inherently robust is  \\emph{non-coordinating} algorithms. Such algorithms act independently at each searcher, differing only by their probabilistic choices. We are interested in the price incu","authors_text":"Amos Korman (IRIF, GANG), Yoav Rodeh","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-05-16T13:48:49Z","title":"Parallel Search with no Coordination"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.05704","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:27a793c5f32cc12a0229d2f87965a9a19cc209495c920f32c7d9dc27412ae1d5","target":"record","created_at":"2026-05-18T00:44:20Z","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":"6fbcce262619c95cdd8f016333e916abe5b5986f36aede787d6f86b5661b38ad","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-05-16T13:48:49Z","title_canon_sha256":"c84c973140386a234383cbce109c7d4dc4674f23aa7413018d6bfbccd7d85366"},"schema_version":"1.0","source":{"id":"1705.05704","kind":"arxiv","version":1}},"canonical_sha256":"46d7e1d253111bc62e047e738535312eccedc8cd38fe68055edb0a9b58a9c615","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"46d7e1d253111bc62e047e738535312eccedc8cd38fe68055edb0a9b58a9c615","first_computed_at":"2026-05-18T00:44:20.386918Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:44:20.386918Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+pmvmRcvdi8uElTABpNxSUj1JonXnLnRCtPU2W1Efhwz4HzWMo24iM6H5/yQ33lKbJKO8c2FROW6RYqWhe2tDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:44:20.387332Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.05704","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:27a793c5f32cc12a0229d2f87965a9a19cc209495c920f32c7d9dc27412ae1d5","sha256:04833d2c78d2000c63b53661bdd2c4b153765258c9c68912d0f48c8eb59c60d8"],"state_sha256":"fa67f85d503973f14e8c76304c1f5555c5c37001510f315fd89afa34e1339a56"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lWeqOlnjyDAPKdf7jYYA+UC/2OWf/XAE0bj8iscaCg3wmAu4IXLMGJzyU+uc0xqLlBTGVZEcVqzljI4yTCAnAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T14:06:15.059797Z","bundle_sha256":"ee13d6fc9f615716d5d1d6d2d29a7238975aa777c8e3d955f30fefaae2c7f1e0"}}