{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:DUVEDGFYWMQQLUXCXTUMXDKOZS","short_pith_number":"pith:DUVEDGFY","schema_version":"1.0","canonical_sha256":"1d2a4198b8b32105d2e2bce8cb8d4ecc84319563d54003d4adaefe15c333029c","source":{"kind":"arxiv","id":"1711.01334","version":1},"attestation_state":"computed","paper":{"title":"Two Error Bounds of Imperfect Binary Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Haoze Wu","submitted_at":"2017-10-31T22:28:27Z","abstract_excerpt":"Suppose we know that an object is in a sorted table and we want to determine the index of that object. To achieve this goal we could perform a binary search. However, suppose it is time-consuming to determine the relative position of that object to any other objects in the table. In this scenario, we might want to resort to an incomplete solution: we could device an algorithm that quickly predicts the result of comparing two objects, and replace the actual comparison with this algorithm during a binary search. The question then is how far away are the results yielded by the imperfect binary se"},"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":"1711.01334","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-10-31T22:28:27Z","cross_cats_sorted":[],"title_canon_sha256":"3c5a4c6e9d0169ab10685ed169927517f175435d26535a7ffdb0c26883455c61","abstract_canon_sha256":"9c64aba898297b13925e07e1f4bda9b820b95e85159b8bba173d5d3171ed1aa4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:18.152382Z","signature_b64":"f2gvzsZPRyElVCCIsq7uarIFJsnbBfqEDSKWBwEHD0wxUkMvkEzQHDu3/wVObyNySvJ7t6eYts59myzNAaNkBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1d2a4198b8b32105d2e2bce8cb8d4ecc84319563d54003d4adaefe15c333029c","last_reissued_at":"2026-05-18T00:31:18.151768Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:18.151768Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Two Error Bounds of Imperfect Binary Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Haoze Wu","submitted_at":"2017-10-31T22:28:27Z","abstract_excerpt":"Suppose we know that an object is in a sorted table and we want to determine the index of that object. To achieve this goal we could perform a binary search. However, suppose it is time-consuming to determine the relative position of that object to any other objects in the table. In this scenario, we might want to resort to an incomplete solution: we could device an algorithm that quickly predicts the result of comparing two objects, and replace the actual comparison with this algorithm during a binary search. The question then is how far away are the results yielded by the imperfect binary se"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.01334","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":"1711.01334","created_at":"2026-05-18T00:31:18.151869+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.01334v1","created_at":"2026-05-18T00:31:18.151869+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.01334","created_at":"2026-05-18T00:31:18.151869+00:00"},{"alias_kind":"pith_short_12","alias_value":"DUVEDGFYWMQQ","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_16","alias_value":"DUVEDGFYWMQQLUXC","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_8","alias_value":"DUVEDGFY","created_at":"2026-05-18T12:31:12.930513+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/DUVEDGFYWMQQLUXCXTUMXDKOZS","json":"https://pith.science/pith/DUVEDGFYWMQQLUXCXTUMXDKOZS.json","graph_json":"https://pith.science/api/pith-number/DUVEDGFYWMQQLUXCXTUMXDKOZS/graph.json","events_json":"https://pith.science/api/pith-number/DUVEDGFYWMQQLUXCXTUMXDKOZS/events.json","paper":"https://pith.science/paper/DUVEDGFY"},"agent_actions":{"view_html":"https://pith.science/pith/DUVEDGFYWMQQLUXCXTUMXDKOZS","download_json":"https://pith.science/pith/DUVEDGFYWMQQLUXCXTUMXDKOZS.json","view_paper":"https://pith.science/paper/DUVEDGFY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.01334&json=true","fetch_graph":"https://pith.science/api/pith-number/DUVEDGFYWMQQLUXCXTUMXDKOZS/graph.json","fetch_events":"https://pith.science/api/pith-number/DUVEDGFYWMQQLUXCXTUMXDKOZS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DUVEDGFYWMQQLUXCXTUMXDKOZS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DUVEDGFYWMQQLUXCXTUMXDKOZS/action/storage_attestation","attest_author":"https://pith.science/pith/DUVEDGFYWMQQLUXCXTUMXDKOZS/action/author_attestation","sign_citation":"https://pith.science/pith/DUVEDGFYWMQQLUXCXTUMXDKOZS/action/citation_signature","submit_replication":"https://pith.science/pith/DUVEDGFYWMQQLUXCXTUMXDKOZS/action/replication_record"}},"created_at":"2026-05-18T00:31:18.151869+00:00","updated_at":"2026-05-18T00:31:18.151869+00:00"}