{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:6CTWGJG3JNQRPXTKETSOMPDZNB","short_pith_number":"pith:6CTWGJG3","canonical_record":{"source":{"id":"2003.11777","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2020-03-26T07:42:05Z","cross_cats_sorted":["cs.DS","cs.LG"],"title_canon_sha256":"96426dca37ef4a06409ad7346814d6a8f553a47b05cc757de9cab72571e07c22","abstract_canon_sha256":"39d158508919f0cc22d9f0563479ae2c1e7be7b35346e4fb36db86bbb6fcef4d"},"schema_version":"1.0"},"canonical_sha256":"f0a76324db4b6117de6a24e4e63c796864a7cb4bd2479bca009d0e94519d2581","source":{"kind":"arxiv","id":"2003.11777","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2003.11777","created_at":"2026-07-05T00:51:08Z"},{"alias_kind":"arxiv_version","alias_value":"2003.11777v1","created_at":"2026-07-05T00:51:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2003.11777","created_at":"2026-07-05T00:51:08Z"},{"alias_kind":"pith_short_12","alias_value":"6CTWGJG3JNQR","created_at":"2026-07-05T00:51:08Z"},{"alias_kind":"pith_short_16","alias_value":"6CTWGJG3JNQRPXTK","created_at":"2026-07-05T00:51:08Z"},{"alias_kind":"pith_short_8","alias_value":"6CTWGJG3","created_at":"2026-07-05T00:51:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:6CTWGJG3JNQRPXTKETSOMPDZNB","target":"record","payload":{"canonical_record":{"source":{"id":"2003.11777","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2020-03-26T07:42:05Z","cross_cats_sorted":["cs.DS","cs.LG"],"title_canon_sha256":"96426dca37ef4a06409ad7346814d6a8f553a47b05cc757de9cab72571e07c22","abstract_canon_sha256":"39d158508919f0cc22d9f0563479ae2c1e7be7b35346e4fb36db86bbb6fcef4d"},"schema_version":"1.0"},"canonical_sha256":"f0a76324db4b6117de6a24e4e63c796864a7cb4bd2479bca009d0e94519d2581","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:51:08.034755Z","signature_b64":"7dkGVZRz8erJx3whgWOIGcEhtCcElZHjdW5x7lAv8cqESLd60R/SQx8OwD+BsnPoJfzjYeGjSyv8XcryRTsJCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f0a76324db4b6117de6a24e4e63c796864a7cb4bd2479bca009d0e94519d2581","last_reissued_at":"2026-07-05T00:51:08.034191Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:51:08.034191Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2003.11777","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-05T00:51:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"h6/b9bmRVVybPrUX1v5huIKflJG4Igz/FihPBt29ueMSx+S8PMy1MdehrodMffpZwjuIdVCuxaSOQGKZsZbsBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T07:41:58.348425Z"},"content_sha256":"32b3f41dfd6e2f7a9954fa70cc5b1b09167c43c053a0d488472ff53f9ec2414b","schema_version":"1.0","event_id":"sha256:32b3f41dfd6e2f7a9954fa70cc5b1b09167c43c053a0d488472ff53f9ec2414b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:6CTWGJG3JNQRPXTKETSOMPDZNB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Robust quantum minimum finding with an application to hypothesis selection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.LG"],"primary_cat":"quant-ph","authors_text":"Clement Canonne, Patrick Rebentrost, Yihui Quek","submitted_at":"2020-03-26T07:42:05Z","abstract_excerpt":"We consider the problem of finding the minimum element in a list of length $N$ using a noisy comparator. The noise is modelled as follows: given two elements to compare, if the values of the elements differ by at least $\\alpha$ by some metric defined on the elements, then the comparison will be made correctly; if the values of the elements are closer than $\\alpha$, the outcome of the comparison is not subject to any guarantees. We demonstrate a quantum algorithm for noisy quantum minimum-finding that preserves the quadratic speedup of the noiseless case: our algorithm runs in time $\\tilde O(\\s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2003.11777","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/2003.11777/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-05T00:51:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Lu9e9yenZRG6ad1lhvFCZUtZTxmx7wVFG4CtWKDOgMIoBM2dYlAmJ3/tBgevJ7cX016E0ke3QAgre1x7oRXsAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T07:41:58.348810Z"},"content_sha256":"c8dd34a2644bd148d23d9a226ba8bbd0bf32113cc8ef2e9f0d0db5d12745038f","schema_version":"1.0","event_id":"sha256:c8dd34a2644bd148d23d9a226ba8bbd0bf32113cc8ef2e9f0d0db5d12745038f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6CTWGJG3JNQRPXTKETSOMPDZNB/bundle.json","state_url":"https://pith.science/pith/6CTWGJG3JNQRPXTKETSOMPDZNB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6CTWGJG3JNQRPXTKETSOMPDZNB/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-07-05T07:41:58Z","links":{"resolver":"https://pith.science/pith/6CTWGJG3JNQRPXTKETSOMPDZNB","bundle":"https://pith.science/pith/6CTWGJG3JNQRPXTKETSOMPDZNB/bundle.json","state":"https://pith.science/pith/6CTWGJG3JNQRPXTKETSOMPDZNB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6CTWGJG3JNQRPXTKETSOMPDZNB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:6CTWGJG3JNQRPXTKETSOMPDZNB","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":"39d158508919f0cc22d9f0563479ae2c1e7be7b35346e4fb36db86bbb6fcef4d","cross_cats_sorted":["cs.DS","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2020-03-26T07:42:05Z","title_canon_sha256":"96426dca37ef4a06409ad7346814d6a8f553a47b05cc757de9cab72571e07c22"},"schema_version":"1.0","source":{"id":"2003.11777","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2003.11777","created_at":"2026-07-05T00:51:08Z"},{"alias_kind":"arxiv_version","alias_value":"2003.11777v1","created_at":"2026-07-05T00:51:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2003.11777","created_at":"2026-07-05T00:51:08Z"},{"alias_kind":"pith_short_12","alias_value":"6CTWGJG3JNQR","created_at":"2026-07-05T00:51:08Z"},{"alias_kind":"pith_short_16","alias_value":"6CTWGJG3JNQRPXTK","created_at":"2026-07-05T00:51:08Z"},{"alias_kind":"pith_short_8","alias_value":"6CTWGJG3","created_at":"2026-07-05T00:51:08Z"}],"graph_snapshots":[{"event_id":"sha256:c8dd34a2644bd148d23d9a226ba8bbd0bf32113cc8ef2e9f0d0db5d12745038f","target":"graph","created_at":"2026-07-05T00:51:08Z","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/2003.11777/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We consider the problem of finding the minimum element in a list of length $N$ using a noisy comparator. The noise is modelled as follows: given two elements to compare, if the values of the elements differ by at least $\\alpha$ by some metric defined on the elements, then the comparison will be made correctly; if the values of the elements are closer than $\\alpha$, the outcome of the comparison is not subject to any guarantees. We demonstrate a quantum algorithm for noisy quantum minimum-finding that preserves the quadratic speedup of the noiseless case: our algorithm runs in time $\\tilde O(\\s","authors_text":"Clement Canonne, Patrick Rebentrost, Yihui Quek","cross_cats":["cs.DS","cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2020-03-26T07:42:05Z","title":"Robust quantum minimum finding with an application to hypothesis selection"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2003.11777","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:32b3f41dfd6e2f7a9954fa70cc5b1b09167c43c053a0d488472ff53f9ec2414b","target":"record","created_at":"2026-07-05T00:51:08Z","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":"39d158508919f0cc22d9f0563479ae2c1e7be7b35346e4fb36db86bbb6fcef4d","cross_cats_sorted":["cs.DS","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2020-03-26T07:42:05Z","title_canon_sha256":"96426dca37ef4a06409ad7346814d6a8f553a47b05cc757de9cab72571e07c22"},"schema_version":"1.0","source":{"id":"2003.11777","kind":"arxiv","version":1}},"canonical_sha256":"f0a76324db4b6117de6a24e4e63c796864a7cb4bd2479bca009d0e94519d2581","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f0a76324db4b6117de6a24e4e63c796864a7cb4bd2479bca009d0e94519d2581","first_computed_at":"2026-07-05T00:51:08.034191Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:51:08.034191Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7dkGVZRz8erJx3whgWOIGcEhtCcElZHjdW5x7lAv8cqESLd60R/SQx8OwD+BsnPoJfzjYeGjSyv8XcryRTsJCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T00:51:08.034755Z","signed_message":"canonical_sha256_bytes"},"source_id":"2003.11777","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:32b3f41dfd6e2f7a9954fa70cc5b1b09167c43c053a0d488472ff53f9ec2414b","sha256:c8dd34a2644bd148d23d9a226ba8bbd0bf32113cc8ef2e9f0d0db5d12745038f"],"state_sha256":"f51c8eafe098b3ea32f553fba4b981795628108f35d8f36bb966a4c0713d091e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TIqgs4yIsvi65CY8wUVzjSd9000iH4h/00ogjozpbAH6ANHKOYAtMmMd5oPQEoS+6OyyfBkNzUlqkOyOxhfUAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-05T07:41:58.350929Z","bundle_sha256":"60637ff8b9e5dab338c245f7725e50a327f79e444b0c7aaa09c70850853e68ad"}}