{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:SCX5P4W6WABIZ2GMY2C4G6YFJC","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"67b0feee8d412664f8817a41bf9025948e34d51d81f46b994fd414b7400ae1f0","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-06-21T03:19:26Z","title_canon_sha256":"262359b16498755f83372f00719c4d21f70c2180a2d2ed730657fdefea0c44f0"},"schema_version":"1.0","source":{"id":"1306.5039","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1306.5039","created_at":"2026-05-18T03:20:19Z"},{"alias_kind":"arxiv_version","alias_value":"1306.5039v1","created_at":"2026-05-18T03:20:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.5039","created_at":"2026-05-18T03:20:19Z"},{"alias_kind":"pith_short_12","alias_value":"SCX5P4W6WABI","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_16","alias_value":"SCX5P4W6WABIZ2GM","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_8","alias_value":"SCX5P4W6","created_at":"2026-05-18T12:27:59Z"}],"graph_snapshots":[{"event_id":"sha256:53c185abb515d228e44bd5e76e80099ef5c5fce1b6c88d212b7549a7cad30072","target":"graph","created_at":"2026-05-18T03:20:19Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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.","authors_text":"I.V.Volovich, M.Ohya, S.Iriyama","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-06-21T03:19:26Z","title":"On Quantum Algorithm for Binary Search and Its Computational Complexity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.5039","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:50a63084f6289045f3cc05822c52428fdb610cd0f06cac56eca240b9f4e2d067","target":"record","created_at":"2026-05-18T03:20:19Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"67b0feee8d412664f8817a41bf9025948e34d51d81f46b994fd414b7400ae1f0","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-06-21T03:19:26Z","title_canon_sha256":"262359b16498755f83372f00719c4d21f70c2180a2d2ed730657fdefea0c44f0"},"schema_version":"1.0","source":{"id":"1306.5039","kind":"arxiv","version":1}},"canonical_sha256":"90afd7f2deb0028ce8ccc685c37b05489718fbbd1474019b4d660e4a67353508","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"90afd7f2deb0028ce8ccc685c37b05489718fbbd1474019b4d660e4a67353508","first_computed_at":"2026-05-18T03:20:19.929892Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:20:19.929892Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+5LjFFIB4JAYWBPadHOgQ92UKGcmmIq1zMzM6lzx/eRGrioeN091rke5ZfHDjhMXP6D1NuK0OEWZHMaXmNPYCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:20:19.930569Z","signed_message":"canonical_sha256_bytes"},"source_id":"1306.5039","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:50a63084f6289045f3cc05822c52428fdb610cd0f06cac56eca240b9f4e2d067","sha256:53c185abb515d228e44bd5e76e80099ef5c5fce1b6c88d212b7549a7cad30072"],"state_sha256":"8ecb7e0a0ff90f8275447023f388dbc300d2ea3eafe5675f4bb8d9251835b2da"}