{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:I3L6DUSTCEN4MLQEPZZYKNJRF3","short_pith_number":"pith:I3L6DUST","schema_version":"1.0","canonical_sha256":"46d7e1d253111bc62e047e738535312eccedc8cd38fe68055edb0a9b58a9c615","source":{"kind":"arxiv","id":"1705.05704","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1705.05704","created_at":"2026-05-18T00:44:20.386981+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.05704v1","created_at":"2026-05-18T00:44:20.386981+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.05704","created_at":"2026-05-18T00:44:20.386981+00:00"},{"alias_kind":"pith_short_12","alias_value":"I3L6DUSTCEN4","created_at":"2026-05-18T12:31:21.493067+00:00"},{"alias_kind":"pith_short_16","alias_value":"I3L6DUSTCEN4MLQE","created_at":"2026-05-18T12:31:21.493067+00:00"},{"alias_kind":"pith_short_8","alias_value":"I3L6DUST","created_at":"2026-05-18T12:31:21.493067+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/I3L6DUSTCEN4MLQEPZZYKNJRF3","json":"https://pith.science/pith/I3L6DUSTCEN4MLQEPZZYKNJRF3.json","graph_json":"https://pith.science/api/pith-number/I3L6DUSTCEN4MLQEPZZYKNJRF3/graph.json","events_json":"https://pith.science/api/pith-number/I3L6DUSTCEN4MLQEPZZYKNJRF3/events.json","paper":"https://pith.science/paper/I3L6DUST"},"agent_actions":{"view_html":"https://pith.science/pith/I3L6DUSTCEN4MLQEPZZYKNJRF3","download_json":"https://pith.science/pith/I3L6DUSTCEN4MLQEPZZYKNJRF3.json","view_paper":"https://pith.science/paper/I3L6DUST","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.05704&json=true","fetch_graph":"https://pith.science/api/pith-number/I3L6DUSTCEN4MLQEPZZYKNJRF3/graph.json","fetch_events":"https://pith.science/api/pith-number/I3L6DUSTCEN4MLQEPZZYKNJRF3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/I3L6DUSTCEN4MLQEPZZYKNJRF3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/I3L6DUSTCEN4MLQEPZZYKNJRF3/action/storage_attestation","attest_author":"https://pith.science/pith/I3L6DUSTCEN4MLQEPZZYKNJRF3/action/author_attestation","sign_citation":"https://pith.science/pith/I3L6DUSTCEN4MLQEPZZYKNJRF3/action/citation_signature","submit_replication":"https://pith.science/pith/I3L6DUSTCEN4MLQEPZZYKNJRF3/action/replication_record"}},"created_at":"2026-05-18T00:44:20.386981+00:00","updated_at":"2026-05-18T00:44:20.386981+00:00"}