{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:UFBPG4VSCETEYO5LEHAN5DBEYR","short_pith_number":"pith:UFBPG4VS","canonical_record":{"source":{"id":"1907.03315","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-07-07T16:36:21Z","cross_cats_sorted":[],"title_canon_sha256":"878b97f1c401fb09b1505b8b71bcb0a4b1620369ef4dc1471d430b4c8e6de835","abstract_canon_sha256":"d49ec45402d8c5aaa71cb527f4d00a82c0f5f8564572ad52bf561314713b0371"},"schema_version":"1.0"},"canonical_sha256":"a142f372b211264c3bab21c0de8c24c4624fa190ddb098203b22f0a6413e7454","source":{"kind":"arxiv","id":"1907.03315","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.03315","created_at":"2026-05-17T23:41:16Z"},{"alias_kind":"arxiv_version","alias_value":"1907.03315v1","created_at":"2026-05-17T23:41:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.03315","created_at":"2026-05-17T23:41:16Z"},{"alias_kind":"pith_short_12","alias_value":"UFBPG4VSCETE","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"UFBPG4VSCETEYO5L","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"UFBPG4VS","created_at":"2026-05-18T12:33:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:UFBPG4VSCETEYO5LEHAN5DBEYR","target":"record","payload":{"canonical_record":{"source":{"id":"1907.03315","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-07-07T16:36:21Z","cross_cats_sorted":[],"title_canon_sha256":"878b97f1c401fb09b1505b8b71bcb0a4b1620369ef4dc1471d430b4c8e6de835","abstract_canon_sha256":"d49ec45402d8c5aaa71cb527f4d00a82c0f5f8564572ad52bf561314713b0371"},"schema_version":"1.0"},"canonical_sha256":"a142f372b211264c3bab21c0de8c24c4624fa190ddb098203b22f0a6413e7454","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:41:16.604752Z","signature_b64":"ICHmQmlVz19EAkA+Ve9Y3FeJRu2eTeyYho7nMCDJaUOgFp30QARhHD0jX96qoiHu3lEqXc8wtSwrjhSxB/AVAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a142f372b211264c3bab21c0de8c24c4624fa190ddb098203b22f0a6413e7454","last_reissued_at":"2026-05-17T23:41:16.604113Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:41:16.604113Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1907.03315","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-05-17T23:41:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"p6dEXD8QA9G2QtooXUw3zvzK3ZSdNXx9xFWVDYeFwSozdQbht/iaPSVx2H2jupsj6ddOejD2UTQ3UWu+VFC7CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T21:40:29.625996Z"},"content_sha256":"d181ad81760b4f484298579e1d0b920281bad20879d592fefbbbdeeb62d7a2eb","schema_version":"1.0","event_id":"sha256:d181ad81760b4f484298579e1d0b920281bad20879d592fefbbbdeeb62d7a2eb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:UFBPG4VSCETEYO5LEHAN5DBEYR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Quantum Algorithm for Finding $k$-Minima","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Kohei Miyamoto, Koichi Kise, Masakazu Iwamura","submitted_at":"2019-07-07T16:36:21Z","abstract_excerpt":"We propose a new finding $k$-minima algorithm and prove that its query complexity is $\\mathcal{O}(\\sqrt{kN})$, where $N$ is the number of data indices. Though the complexity is equivalent to that of an existing method, the proposed is simpler. The main idea of the proposed algorithm is to search a good threshold that is near the $k$-th smallest data. Then, by using the generalization of amplitude amplification, all $k$ data are found out of order and the query complexity is $\\mathcal{O}(\\sqrt{kN})$. This generalization of amplitude amplification is also not well discussed and we briefly prove "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.03315","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"},"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-05-17T23:41:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5JgmszYDkHy9KX0s2Agv3v2bZKHXQeNbdJQ0HpRF0Tmg+V7vE4e71T9jF9kT59gF2PBHmAbXlJPIomM5xcL4BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T21:40:29.626400Z"},"content_sha256":"dc178de5f6b5827fc0bfbbf5317818d71fada7f5435e7c0bbc6e53314fa1f610","schema_version":"1.0","event_id":"sha256:dc178de5f6b5827fc0bfbbf5317818d71fada7f5435e7c0bbc6e53314fa1f610"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UFBPG4VSCETEYO5LEHAN5DBEYR/bundle.json","state_url":"https://pith.science/pith/UFBPG4VSCETEYO5LEHAN5DBEYR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UFBPG4VSCETEYO5LEHAN5DBEYR/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-05-25T21:40:29Z","links":{"resolver":"https://pith.science/pith/UFBPG4VSCETEYO5LEHAN5DBEYR","bundle":"https://pith.science/pith/UFBPG4VSCETEYO5LEHAN5DBEYR/bundle.json","state":"https://pith.science/pith/UFBPG4VSCETEYO5LEHAN5DBEYR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UFBPG4VSCETEYO5LEHAN5DBEYR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:UFBPG4VSCETEYO5LEHAN5DBEYR","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":"d49ec45402d8c5aaa71cb527f4d00a82c0f5f8564572ad52bf561314713b0371","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-07-07T16:36:21Z","title_canon_sha256":"878b97f1c401fb09b1505b8b71bcb0a4b1620369ef4dc1471d430b4c8e6de835"},"schema_version":"1.0","source":{"id":"1907.03315","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.03315","created_at":"2026-05-17T23:41:16Z"},{"alias_kind":"arxiv_version","alias_value":"1907.03315v1","created_at":"2026-05-17T23:41:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.03315","created_at":"2026-05-17T23:41:16Z"},{"alias_kind":"pith_short_12","alias_value":"UFBPG4VSCETE","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"UFBPG4VSCETEYO5L","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"UFBPG4VS","created_at":"2026-05-18T12:33:30Z"}],"graph_snapshots":[{"event_id":"sha256:dc178de5f6b5827fc0bfbbf5317818d71fada7f5435e7c0bbc6e53314fa1f610","target":"graph","created_at":"2026-05-17T23:41:16Z","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":"We propose a new finding $k$-minima algorithm and prove that its query complexity is $\\mathcal{O}(\\sqrt{kN})$, where $N$ is the number of data indices. Though the complexity is equivalent to that of an existing method, the proposed is simpler. The main idea of the proposed algorithm is to search a good threshold that is near the $k$-th smallest data. Then, by using the generalization of amplitude amplification, all $k$ data are found out of order and the query complexity is $\\mathcal{O}(\\sqrt{kN})$. This generalization of amplitude amplification is also not well discussed and we briefly prove ","authors_text":"Kohei Miyamoto, Koichi Kise, Masakazu Iwamura","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-07-07T16:36:21Z","title":"A Quantum Algorithm for Finding $k$-Minima"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.03315","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:d181ad81760b4f484298579e1d0b920281bad20879d592fefbbbdeeb62d7a2eb","target":"record","created_at":"2026-05-17T23:41:16Z","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":"d49ec45402d8c5aaa71cb527f4d00a82c0f5f8564572ad52bf561314713b0371","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-07-07T16:36:21Z","title_canon_sha256":"878b97f1c401fb09b1505b8b71bcb0a4b1620369ef4dc1471d430b4c8e6de835"},"schema_version":"1.0","source":{"id":"1907.03315","kind":"arxiv","version":1}},"canonical_sha256":"a142f372b211264c3bab21c0de8c24c4624fa190ddb098203b22f0a6413e7454","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a142f372b211264c3bab21c0de8c24c4624fa190ddb098203b22f0a6413e7454","first_computed_at":"2026-05-17T23:41:16.604113Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:41:16.604113Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ICHmQmlVz19EAkA+Ve9Y3FeJRu2eTeyYho7nMCDJaUOgFp30QARhHD0jX96qoiHu3lEqXc8wtSwrjhSxB/AVAg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:41:16.604752Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.03315","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d181ad81760b4f484298579e1d0b920281bad20879d592fefbbbdeeb62d7a2eb","sha256:dc178de5f6b5827fc0bfbbf5317818d71fada7f5435e7c0bbc6e53314fa1f610"],"state_sha256":"73924713e2273e193e998f0f4c59696ecf3ba4854d1ebb382b45594126e6000d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WjN0S3IZKt8iT8c6Xgg8A82O8teHlTnKdFnYKWDW+hnFYIzpwaR5t1AAdIXq+ctKWlqdfxO4jU62Vuhv/Gt9CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T21:40:29.628639Z","bundle_sha256":"78890e599e8dd75d2684fcbf429858546e3ce59c6a83def1f0f57561c69872ea"}}