{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:VYY64XG4INWMCRK2BYBT6OWEXM","short_pith_number":"pith:VYY64XG4","canonical_record":{"source":{"id":"1908.07943","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-08-21T15:47:34Z","cross_cats_sorted":[],"title_canon_sha256":"643371b976f406218196050b7eae09f4d6dd5a4ec160133b07ec754b3d1b0707","abstract_canon_sha256":"ac41a38ca8b9ec4c2a960a9475809f9ebb5a5b9eb0a3edff72ab5b27e1376863"},"schema_version":"1.0"},"canonical_sha256":"ae31ee5cdc436cc1455a0e033f3ac4bb341ec8d0c10d041383b033e2f072ae4d","source":{"kind":"arxiv","id":"1908.07943","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.07943","created_at":"2026-07-04T23:59:02Z"},{"alias_kind":"arxiv_version","alias_value":"1908.07943v1","created_at":"2026-07-04T23:59:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.07943","created_at":"2026-07-04T23:59:02Z"},{"alias_kind":"pith_short_12","alias_value":"VYY64XG4INWM","created_at":"2026-07-04T23:59:02Z"},{"alias_kind":"pith_short_16","alias_value":"VYY64XG4INWMCRK2","created_at":"2026-07-04T23:59:02Z"},{"alias_kind":"pith_short_8","alias_value":"VYY64XG4","created_at":"2026-07-04T23:59:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:VYY64XG4INWMCRK2BYBT6OWEXM","target":"record","payload":{"canonical_record":{"source":{"id":"1908.07943","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-08-21T15:47:34Z","cross_cats_sorted":[],"title_canon_sha256":"643371b976f406218196050b7eae09f4d6dd5a4ec160133b07ec754b3d1b0707","abstract_canon_sha256":"ac41a38ca8b9ec4c2a960a9475809f9ebb5a5b9eb0a3edff72ab5b27e1376863"},"schema_version":"1.0"},"canonical_sha256":"ae31ee5cdc436cc1455a0e033f3ac4bb341ec8d0c10d041383b033e2f072ae4d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T23:59:02.756800Z","signature_b64":"KDRI3s5INfKHrsu/zPfubwVi9J3NSh4jHXzG6Lx+CSF5PrGGUXjbxeCY3O3m2fY+oGLMm5PV9bb7ZORz+inwBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ae31ee5cdc436cc1455a0e033f3ac4bb341ec8d0c10d041383b033e2f072ae4d","last_reissued_at":"2026-07-04T23:59:02.756405Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T23:59:02.756405Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1908.07943","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-04T23:59:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZvKoXMKh+d3KCKRkYHr1OOh3QS1XVfYzBDuON/lysShzkibYINl1lMj8W2nW5Fukt6rvEkIN1i7tG+Q8fxe/BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T08:37:22.124544Z"},"content_sha256":"a3a7378f14f2e0e0db057202ef574c51a2f6644b36ed054a4d25315b58e06c66","schema_version":"1.0","event_id":"sha256:a3a7378f14f2e0e0db057202ef574c51a2f6644b36ed054a4d25315b58e06c66"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:VYY64XG4INWMCRK2BYBT6OWEXM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Optimized Quantum Maximum or Minimum Searching Algorithm and its Circuits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Cen Wang, Hongxiang Guo, Jian Wu, ShiJie Wei, Xiong Gao, Yanhu Chen","submitted_at":"2019-08-21T15:47:34Z","abstract_excerpt":"Finding a maximum or minimum is a fundamental building block in many mathematical models. Compared with classical algorithms, Durr, Hoyer's quantum algorithm (DHA) achieves quadratic speed. However, its key step, the quantum exponential searching algorithm (QESA), which is based on Grover algorithm, is not a sure-success algorithm. Meanwhile, quantum circuits encounter the gate decomposition problem due to variation of the scale of data. In this paper, we propose an optimized quantum algorithm for searching maximum and minimum, based on DHA and the optimal quantum exact search algorithm. Furth"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.07943","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1908.07943/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-04T23:59:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LiFj9oVMtuLhOE/Sn77LHntOrtMWHpXMXCvzPHJCgyai7GPv095SoTiopAjfviL6886zjjnu6md43Sine0XcAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T08:37:22.125056Z"},"content_sha256":"c2f203c64a5eb3499d498a2d98ffe0e68227565f1ba1c328c72929945e9b1a24","schema_version":"1.0","event_id":"sha256:c2f203c64a5eb3499d498a2d98ffe0e68227565f1ba1c328c72929945e9b1a24"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VYY64XG4INWMCRK2BYBT6OWEXM/bundle.json","state_url":"https://pith.science/pith/VYY64XG4INWMCRK2BYBT6OWEXM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VYY64XG4INWMCRK2BYBT6OWEXM/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-15T08:37:22Z","links":{"resolver":"https://pith.science/pith/VYY64XG4INWMCRK2BYBT6OWEXM","bundle":"https://pith.science/pith/VYY64XG4INWMCRK2BYBT6OWEXM/bundle.json","state":"https://pith.science/pith/VYY64XG4INWMCRK2BYBT6OWEXM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VYY64XG4INWMCRK2BYBT6OWEXM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:VYY64XG4INWMCRK2BYBT6OWEXM","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":"ac41a38ca8b9ec4c2a960a9475809f9ebb5a5b9eb0a3edff72ab5b27e1376863","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-08-21T15:47:34Z","title_canon_sha256":"643371b976f406218196050b7eae09f4d6dd5a4ec160133b07ec754b3d1b0707"},"schema_version":"1.0","source":{"id":"1908.07943","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.07943","created_at":"2026-07-04T23:59:02Z"},{"alias_kind":"arxiv_version","alias_value":"1908.07943v1","created_at":"2026-07-04T23:59:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.07943","created_at":"2026-07-04T23:59:02Z"},{"alias_kind":"pith_short_12","alias_value":"VYY64XG4INWM","created_at":"2026-07-04T23:59:02Z"},{"alias_kind":"pith_short_16","alias_value":"VYY64XG4INWMCRK2","created_at":"2026-07-04T23:59:02Z"},{"alias_kind":"pith_short_8","alias_value":"VYY64XG4","created_at":"2026-07-04T23:59:02Z"}],"graph_snapshots":[{"event_id":"sha256:c2f203c64a5eb3499d498a2d98ffe0e68227565f1ba1c328c72929945e9b1a24","target":"graph","created_at":"2026-07-04T23:59:02Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1908.07943/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Finding a maximum or minimum is a fundamental building block in many mathematical models. Compared with classical algorithms, Durr, Hoyer's quantum algorithm (DHA) achieves quadratic speed. However, its key step, the quantum exponential searching algorithm (QESA), which is based on Grover algorithm, is not a sure-success algorithm. Meanwhile, quantum circuits encounter the gate decomposition problem due to variation of the scale of data. In this paper, we propose an optimized quantum algorithm for searching maximum and minimum, based on DHA and the optimal quantum exact search algorithm. Furth","authors_text":"Cen Wang, Hongxiang Guo, Jian Wu, ShiJie Wei, Xiong Gao, Yanhu Chen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-08-21T15:47:34Z","title":"An Optimized Quantum Maximum or Minimum Searching Algorithm and its Circuits"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.07943","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:a3a7378f14f2e0e0db057202ef574c51a2f6644b36ed054a4d25315b58e06c66","target":"record","created_at":"2026-07-04T23:59:02Z","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":"ac41a38ca8b9ec4c2a960a9475809f9ebb5a5b9eb0a3edff72ab5b27e1376863","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-08-21T15:47:34Z","title_canon_sha256":"643371b976f406218196050b7eae09f4d6dd5a4ec160133b07ec754b3d1b0707"},"schema_version":"1.0","source":{"id":"1908.07943","kind":"arxiv","version":1}},"canonical_sha256":"ae31ee5cdc436cc1455a0e033f3ac4bb341ec8d0c10d041383b033e2f072ae4d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ae31ee5cdc436cc1455a0e033f3ac4bb341ec8d0c10d041383b033e2f072ae4d","first_computed_at":"2026-07-04T23:59:02.756405Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T23:59:02.756405Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KDRI3s5INfKHrsu/zPfubwVi9J3NSh4jHXzG6Lx+CSF5PrGGUXjbxeCY3O3m2fY+oGLMm5PV9bb7ZORz+inwBw==","signature_status":"signed_v1","signed_at":"2026-07-04T23:59:02.756800Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.07943","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a3a7378f14f2e0e0db057202ef574c51a2f6644b36ed054a4d25315b58e06c66","sha256:c2f203c64a5eb3499d498a2d98ffe0e68227565f1ba1c328c72929945e9b1a24"],"state_sha256":"466c15e486bb9821c594ee79aec793b42a57ce69c12412c2d87d4b70800584a6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DElqn9kOH3Ihilzs2SVSTYWlwki9/m/9xR7ATc9mWUZus27HVhCDkHE/zEf1JFu7PbFEMeVY4H8fkMcZWIrmCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-15T08:37:22.128578Z","bundle_sha256":"22517a1cd773f452a34fcc560aa727d6a46208e69c4137bc05f155330c8fb0e6"}}