{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:SCX5P4W6WABIZ2GMY2C4G6YFJC","short_pith_number":"pith:SCX5P4W6","schema_version":"1.0","canonical_sha256":"90afd7f2deb0028ce8ccc685c37b05489718fbbd1474019b4d660e4a67353508","source":{"kind":"arxiv","id":"1306.5039","version":1},"attestation_state":"computed","paper":{"title":"On Quantum Algorithm for Binary Search and Its Computational Complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"quant-ph","authors_text":"I.V.Volovich, M.Ohya, S.Iriyama","submitted_at":"2013-06-21T03:19:26Z","abstract_excerpt":"A new quantum algorithm for a search problem and its computational complexity are discussed. It is shown in the search problem containing 2^n objects that our algorithm runs in polynomial time."},"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":"1306.5039","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-06-21T03:19:26Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"262359b16498755f83372f00719c4d21f70c2180a2d2ed730657fdefea0c44f0","abstract_canon_sha256":"67b0feee8d412664f8817a41bf9025948e34d51d81f46b994fd414b7400ae1f0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:20:19.930569Z","signature_b64":"+5LjFFIB4JAYWBPadHOgQ92UKGcmmIq1zMzM6lzx/eRGrioeN091rke5ZfHDjhMXP6D1NuK0OEWZHMaXmNPYCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"90afd7f2deb0028ce8ccc685c37b05489718fbbd1474019b4d660e4a67353508","last_reissued_at":"2026-05-18T03:20:19.929892Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:20:19.929892Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Quantum Algorithm for Binary Search and Its Computational Complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"quant-ph","authors_text":"I.V.Volovich, M.Ohya, S.Iriyama","submitted_at":"2013-06-21T03:19:26Z","abstract_excerpt":"A new quantum algorithm for a search problem and its computational complexity are discussed. It is shown in the search problem containing 2^n objects that our algorithm runs in polynomial time."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.5039","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":"1306.5039","created_at":"2026-05-18T03:20:19.930010+00:00"},{"alias_kind":"arxiv_version","alias_value":"1306.5039v1","created_at":"2026-05-18T03:20:19.930010+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.5039","created_at":"2026-05-18T03:20:19.930010+00:00"},{"alias_kind":"pith_short_12","alias_value":"SCX5P4W6WABI","created_at":"2026-05-18T12:27:59.945178+00:00"},{"alias_kind":"pith_short_16","alias_value":"SCX5P4W6WABIZ2GM","created_at":"2026-05-18T12:27:59.945178+00:00"},{"alias_kind":"pith_short_8","alias_value":"SCX5P4W6","created_at":"2026-05-18T12:27:59.945178+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/SCX5P4W6WABIZ2GMY2C4G6YFJC","json":"https://pith.science/pith/SCX5P4W6WABIZ2GMY2C4G6YFJC.json","graph_json":"https://pith.science/api/pith-number/SCX5P4W6WABIZ2GMY2C4G6YFJC/graph.json","events_json":"https://pith.science/api/pith-number/SCX5P4W6WABIZ2GMY2C4G6YFJC/events.json","paper":"https://pith.science/paper/SCX5P4W6"},"agent_actions":{"view_html":"https://pith.science/pith/SCX5P4W6WABIZ2GMY2C4G6YFJC","download_json":"https://pith.science/pith/SCX5P4W6WABIZ2GMY2C4G6YFJC.json","view_paper":"https://pith.science/paper/SCX5P4W6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1306.5039&json=true","fetch_graph":"https://pith.science/api/pith-number/SCX5P4W6WABIZ2GMY2C4G6YFJC/graph.json","fetch_events":"https://pith.science/api/pith-number/SCX5P4W6WABIZ2GMY2C4G6YFJC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SCX5P4W6WABIZ2GMY2C4G6YFJC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SCX5P4W6WABIZ2GMY2C4G6YFJC/action/storage_attestation","attest_author":"https://pith.science/pith/SCX5P4W6WABIZ2GMY2C4G6YFJC/action/author_attestation","sign_citation":"https://pith.science/pith/SCX5P4W6WABIZ2GMY2C4G6YFJC/action/citation_signature","submit_replication":"https://pith.science/pith/SCX5P4W6WABIZ2GMY2C4G6YFJC/action/replication_record"}},"created_at":"2026-05-18T03:20:19.930010+00:00","updated_at":"2026-05-18T03:20:19.930010+00:00"}