{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:OMP3PERSXDOYURYKIFOA2BGTFF","short_pith_number":"pith:OMP3PERS","schema_version":"1.0","canonical_sha256":"731fb79232b8dd8a470a415c0d04d32965dbdedb09e2cbead913dc6310a196d7","source":{"kind":"arxiv","id":"1503.00805","version":3},"attestation_state":"computed","paper":{"title":"Deterministic and Probabilistic Binary Search in Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"David Kempe, Ehsan Emamjomeh-Zadeh, Vikrant Singhal","submitted_at":"2015-03-03T02:19:23Z","abstract_excerpt":"We consider the following natural generalization of Binary Search: in a given undirected, positively weighted graph, one vertex is a target. The algorithm's task is to identify the target by adaptively querying vertices. In response to querying a node $q$, the algorithm learns either that $q$ is the target, or is given an edge out of $q$ that lies on a shortest path from $q$ to the target. We study this problem in a general noisy model in which each query independently receives a correct answer with probability $p > \\frac{1}{2}$ (a known constant), and an (adversarial) incorrect one with proba"},"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":"1503.00805","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-03-03T02:19:23Z","cross_cats_sorted":[],"title_canon_sha256":"a748d56ce62b5f8ef1450f8fd2866392afe9f381bcc8542354d648d3b16ff314","abstract_canon_sha256":"c7ebbd93a41254d354d9ebb4c3387a99770b0a9b1131c9967396e7187f938ee5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:39:13.936668Z","signature_b64":"1V1pUISAqiWad7InZYxtQ977X9SSxvlgHpC9ejl3085HcwzJ+53WGOByz8mftxkArDlF4e4mHuB+thc8y9tYDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"731fb79232b8dd8a470a415c0d04d32965dbdedb09e2cbead913dc6310a196d7","last_reissued_at":"2026-05-18T00:39:13.936190Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:39:13.936190Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Deterministic and Probabilistic Binary Search in Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"David Kempe, Ehsan Emamjomeh-Zadeh, Vikrant Singhal","submitted_at":"2015-03-03T02:19:23Z","abstract_excerpt":"We consider the following natural generalization of Binary Search: in a given undirected, positively weighted graph, one vertex is a target. The algorithm's task is to identify the target by adaptively querying vertices. In response to querying a node $q$, the algorithm learns either that $q$ is the target, or is given an edge out of $q$ that lies on a shortest path from $q$ to the target. We study this problem in a general noisy model in which each query independently receives a correct answer with probability $p > \\frac{1}{2}$ (a known constant), and an (adversarial) incorrect one with proba"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.00805","kind":"arxiv","version":3},"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":"1503.00805","created_at":"2026-05-18T00:39:13.936267+00:00"},{"alias_kind":"arxiv_version","alias_value":"1503.00805v3","created_at":"2026-05-18T00:39:13.936267+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.00805","created_at":"2026-05-18T00:39:13.936267+00:00"},{"alias_kind":"pith_short_12","alias_value":"OMP3PERSXDOY","created_at":"2026-05-18T12:29:34.919912+00:00"},{"alias_kind":"pith_short_16","alias_value":"OMP3PERSXDOYURYK","created_at":"2026-05-18T12:29:34.919912+00:00"},{"alias_kind":"pith_short_8","alias_value":"OMP3PERS","created_at":"2026-05-18T12:29:34.919912+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/OMP3PERSXDOYURYKIFOA2BGTFF","json":"https://pith.science/pith/OMP3PERSXDOYURYKIFOA2BGTFF.json","graph_json":"https://pith.science/api/pith-number/OMP3PERSXDOYURYKIFOA2BGTFF/graph.json","events_json":"https://pith.science/api/pith-number/OMP3PERSXDOYURYKIFOA2BGTFF/events.json","paper":"https://pith.science/paper/OMP3PERS"},"agent_actions":{"view_html":"https://pith.science/pith/OMP3PERSXDOYURYKIFOA2BGTFF","download_json":"https://pith.science/pith/OMP3PERSXDOYURYKIFOA2BGTFF.json","view_paper":"https://pith.science/paper/OMP3PERS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1503.00805&json=true","fetch_graph":"https://pith.science/api/pith-number/OMP3PERSXDOYURYKIFOA2BGTFF/graph.json","fetch_events":"https://pith.science/api/pith-number/OMP3PERSXDOYURYKIFOA2BGTFF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OMP3PERSXDOYURYKIFOA2BGTFF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OMP3PERSXDOYURYKIFOA2BGTFF/action/storage_attestation","attest_author":"https://pith.science/pith/OMP3PERSXDOYURYKIFOA2BGTFF/action/author_attestation","sign_citation":"https://pith.science/pith/OMP3PERSXDOYURYKIFOA2BGTFF/action/citation_signature","submit_replication":"https://pith.science/pith/OMP3PERSXDOYURYKIFOA2BGTFF/action/replication_record"}},"created_at":"2026-05-18T00:39:13.936267+00:00","updated_at":"2026-05-18T00:39:13.936267+00:00"}