{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:YGAARM6SN5REMHUQCONKMEWDXM","short_pith_number":"pith:YGAARM6S","schema_version":"1.0","canonical_sha256":"c18008b3d26f62461e90139aa612c3bb10fba6e8f9f822acf795e2483b67399e","source":{"kind":"arxiv","id":"1602.04952","version":2},"attestation_state":"computed","paper":{"title":"Parallel Linear Search with no Coordination for a Randomly Placed Treasure","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Amos Korman, Yoav Rodeh","submitted_at":"2016-02-16T09:12:12Z","abstract_excerpt":"In STOC'16, Fraigniaud et al. consider the problem of finding a treasure hidden in one of many boxes that are ordered by importance. That is, if a treasure is in a more important box, then one would like to find it faster. Assuming there are many searchers, the authors suggest that using an algorithm that requires no coordination between searchers can be highly beneficial. Indeed, besides saving the need for a communication and coordination mechanism, such algorithms enjoy inherent robustness. The authors proceed to solve this linear search problem in the case of countably many boxes and an ad"},"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":"1602.04952","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-02-16T09:12:12Z","cross_cats_sorted":[],"title_canon_sha256":"7713ea779173d5f45da5315066d65fe781111a62fd67ceec224a564f80661ff1","abstract_canon_sha256":"1a002a447d1895ab165eda6c4935901efb9d2c370834bbf21f48d7d15f74b4bd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:16:59.548305Z","signature_b64":"D/+Gb6TbGZ38+W7BHCeEt/RzBjRAcMcjNRYtLOK5z56CEAi9JIRRBvOr0TxzAfrQ7fWvss7Ljshjt6DEmexyBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c18008b3d26f62461e90139aa612c3bb10fba6e8f9f822acf795e2483b67399e","last_reissued_at":"2026-05-18T01:16:59.547593Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:16:59.547593Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Parallel Linear Search with no Coordination for a Randomly Placed Treasure","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Amos Korman, Yoav Rodeh","submitted_at":"2016-02-16T09:12:12Z","abstract_excerpt":"In STOC'16, Fraigniaud et al. consider the problem of finding a treasure hidden in one of many boxes that are ordered by importance. That is, if a treasure is in a more important box, then one would like to find it faster. Assuming there are many searchers, the authors suggest that using an algorithm that requires no coordination between searchers can be highly beneficial. Indeed, besides saving the need for a communication and coordination mechanism, such algorithms enjoy inherent robustness. The authors proceed to solve this linear search problem in the case of countably many boxes and an ad"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.04952","kind":"arxiv","version":2},"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":"1602.04952","created_at":"2026-05-18T01:16:59.547710+00:00"},{"alias_kind":"arxiv_version","alias_value":"1602.04952v2","created_at":"2026-05-18T01:16:59.547710+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.04952","created_at":"2026-05-18T01:16:59.547710+00:00"},{"alias_kind":"pith_short_12","alias_value":"YGAARM6SN5RE","created_at":"2026-05-18T12:30:53.716459+00:00"},{"alias_kind":"pith_short_16","alias_value":"YGAARM6SN5REMHUQ","created_at":"2026-05-18T12:30:53.716459+00:00"},{"alias_kind":"pith_short_8","alias_value":"YGAARM6S","created_at":"2026-05-18T12:30:53.716459+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/YGAARM6SN5REMHUQCONKMEWDXM","json":"https://pith.science/pith/YGAARM6SN5REMHUQCONKMEWDXM.json","graph_json":"https://pith.science/api/pith-number/YGAARM6SN5REMHUQCONKMEWDXM/graph.json","events_json":"https://pith.science/api/pith-number/YGAARM6SN5REMHUQCONKMEWDXM/events.json","paper":"https://pith.science/paper/YGAARM6S"},"agent_actions":{"view_html":"https://pith.science/pith/YGAARM6SN5REMHUQCONKMEWDXM","download_json":"https://pith.science/pith/YGAARM6SN5REMHUQCONKMEWDXM.json","view_paper":"https://pith.science/paper/YGAARM6S","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1602.04952&json=true","fetch_graph":"https://pith.science/api/pith-number/YGAARM6SN5REMHUQCONKMEWDXM/graph.json","fetch_events":"https://pith.science/api/pith-number/YGAARM6SN5REMHUQCONKMEWDXM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YGAARM6SN5REMHUQCONKMEWDXM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YGAARM6SN5REMHUQCONKMEWDXM/action/storage_attestation","attest_author":"https://pith.science/pith/YGAARM6SN5REMHUQCONKMEWDXM/action/author_attestation","sign_citation":"https://pith.science/pith/YGAARM6SN5REMHUQCONKMEWDXM/action/citation_signature","submit_replication":"https://pith.science/pith/YGAARM6SN5REMHUQCONKMEWDXM/action/replication_record"}},"created_at":"2026-05-18T01:16:59.547710+00:00","updated_at":"2026-05-18T01:16:59.547710+00:00"}