{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:C4DJKD5P6MA5N7RS3F7TXB3XXN","short_pith_number":"pith:C4DJKD5P","canonical_record":{"source":{"id":"1508.05108","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2015-08-20T20:14:26Z","cross_cats_sorted":[],"title_canon_sha256":"f61e64a8c9b0b5cc952f8bd1510e3eee00f374c28e96efea2c0ddc86b457b60f","abstract_canon_sha256":"e1969db26c609ad38c36b67340faa0b7df568555a9010bcc2e48ebc8c03b26bb"},"schema_version":"1.0"},"canonical_sha256":"1706950faff301d6fe32d97f3b8777bb6c24ac8c074fe761f904bc4e42d26ab7","source":{"kind":"arxiv","id":"1508.05108","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.05108","created_at":"2026-05-18T01:34:56Z"},{"alias_kind":"arxiv_version","alias_value":"1508.05108v1","created_at":"2026-05-18T01:34:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.05108","created_at":"2026-05-18T01:34:56Z"},{"alias_kind":"pith_short_12","alias_value":"C4DJKD5P6MA5","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"C4DJKD5P6MA5N7RS","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"C4DJKD5P","created_at":"2026-05-18T12:29:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:C4DJKD5P6MA5N7RS3F7TXB3XXN","target":"record","payload":{"canonical_record":{"source":{"id":"1508.05108","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2015-08-20T20:14:26Z","cross_cats_sorted":[],"title_canon_sha256":"f61e64a8c9b0b5cc952f8bd1510e3eee00f374c28e96efea2c0ddc86b457b60f","abstract_canon_sha256":"e1969db26c609ad38c36b67340faa0b7df568555a9010bcc2e48ebc8c03b26bb"},"schema_version":"1.0"},"canonical_sha256":"1706950faff301d6fe32d97f3b8777bb6c24ac8c074fe761f904bc4e42d26ab7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:34:56.718958Z","signature_b64":"UitRPVADatNnU4DH24Rgwe2DnDq0jJYo6ceyUDdHvkcim7GNeKwJgAPf+JknEp07aAMZ2D53p2CXTfVPnSuNBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1706950faff301d6fe32d97f3b8777bb6c24ac8c074fe761f904bc4e42d26ab7","last_reissued_at":"2026-05-18T01:34:56.718426Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:34:56.718426Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1508.05108","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-18T01:34:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rTPRB27SyYaqPiVJN753i1wl+5w67F4a2thfj7y014sVC0fCwjtjQvm1tl7lcei8odPNoWDYJsMJiU/BGu6wDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T04:49:42.961045Z"},"content_sha256":"26ee52deccf28866ebf0e34a97d0c4ef142897c7b69a43b34032acf6183c2466","schema_version":"1.0","event_id":"sha256:26ee52deccf28866ebf0e34a97d0c4ef142897c7b69a43b34032acf6183c2466"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:C4DJKD5P6MA5N7RS3F7TXB3XXN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Grover's search with faults on some marked elements","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Alexander Rivosh, Dmitry Kravchenko, Nikolajs Nahimovs","submitted_at":"2015-08-20T20:14:26Z","abstract_excerpt":"Grover's algorithm is a quantum query algorithm solving the unstructured search problem of size $N$ using $O(\\sqrt{N})$ queries. It provides a significant speed-up over any classical algorithm \\cite{Gro96}.\n  The running time of the algorithm, however, is very sensitive to errors in queries. It is known that if query may fail (report all marked elements as unmarked) the algorithm needs $\\Omega(N)$ queries to find a marked element \\cite{RS08}. \\cite{AB+13} have proved the same result for the model where each marked element has its own probability to be reported as unmarked.\n  We study the behav"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.05108","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-18T01:34:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3x7TS+lvBXDWb7bRiPcOeB5OmvfUBlNqZelg4nweZNOFH2xR5vYy3d4FIgCotjvqSJRFDU9/zZqTg1OYn2H/Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T04:49:42.961398Z"},"content_sha256":"defaae480a4917af2f22937cdb9ba8eee23c6a2cf974afde31f79ad058d98598","schema_version":"1.0","event_id":"sha256:defaae480a4917af2f22937cdb9ba8eee23c6a2cf974afde31f79ad058d98598"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/C4DJKD5P6MA5N7RS3F7TXB3XXN/bundle.json","state_url":"https://pith.science/pith/C4DJKD5P6MA5N7RS3F7TXB3XXN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/C4DJKD5P6MA5N7RS3F7TXB3XXN/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-06-27T04:49:42Z","links":{"resolver":"https://pith.science/pith/C4DJKD5P6MA5N7RS3F7TXB3XXN","bundle":"https://pith.science/pith/C4DJKD5P6MA5N7RS3F7TXB3XXN/bundle.json","state":"https://pith.science/pith/C4DJKD5P6MA5N7RS3F7TXB3XXN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/C4DJKD5P6MA5N7RS3F7TXB3XXN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:C4DJKD5P6MA5N7RS3F7TXB3XXN","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":"e1969db26c609ad38c36b67340faa0b7df568555a9010bcc2e48ebc8c03b26bb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2015-08-20T20:14:26Z","title_canon_sha256":"f61e64a8c9b0b5cc952f8bd1510e3eee00f374c28e96efea2c0ddc86b457b60f"},"schema_version":"1.0","source":{"id":"1508.05108","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.05108","created_at":"2026-05-18T01:34:56Z"},{"alias_kind":"arxiv_version","alias_value":"1508.05108v1","created_at":"2026-05-18T01:34:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.05108","created_at":"2026-05-18T01:34:56Z"},{"alias_kind":"pith_short_12","alias_value":"C4DJKD5P6MA5","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_16","alias_value":"C4DJKD5P6MA5N7RS","created_at":"2026-05-18T12:29:14Z"},{"alias_kind":"pith_short_8","alias_value":"C4DJKD5P","created_at":"2026-05-18T12:29:14Z"}],"graph_snapshots":[{"event_id":"sha256:defaae480a4917af2f22937cdb9ba8eee23c6a2cf974afde31f79ad058d98598","target":"graph","created_at":"2026-05-18T01:34:56Z","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":"Grover's algorithm is a quantum query algorithm solving the unstructured search problem of size $N$ using $O(\\sqrt{N})$ queries. It provides a significant speed-up over any classical algorithm \\cite{Gro96}.\n  The running time of the algorithm, however, is very sensitive to errors in queries. It is known that if query may fail (report all marked elements as unmarked) the algorithm needs $\\Omega(N)$ queries to find a marked element \\cite{RS08}. \\cite{AB+13} have proved the same result for the model where each marked element has its own probability to be reported as unmarked.\n  We study the behav","authors_text":"Alexander Rivosh, Dmitry Kravchenko, Nikolajs Nahimovs","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2015-08-20T20:14:26Z","title":"Grover's search with faults on some marked elements"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.05108","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:26ee52deccf28866ebf0e34a97d0c4ef142897c7b69a43b34032acf6183c2466","target":"record","created_at":"2026-05-18T01:34:56Z","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":"e1969db26c609ad38c36b67340faa0b7df568555a9010bcc2e48ebc8c03b26bb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2015-08-20T20:14:26Z","title_canon_sha256":"f61e64a8c9b0b5cc952f8bd1510e3eee00f374c28e96efea2c0ddc86b457b60f"},"schema_version":"1.0","source":{"id":"1508.05108","kind":"arxiv","version":1}},"canonical_sha256":"1706950faff301d6fe32d97f3b8777bb6c24ac8c074fe761f904bc4e42d26ab7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1706950faff301d6fe32d97f3b8777bb6c24ac8c074fe761f904bc4e42d26ab7","first_computed_at":"2026-05-18T01:34:56.718426Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:34:56.718426Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UitRPVADatNnU4DH24Rgwe2DnDq0jJYo6ceyUDdHvkcim7GNeKwJgAPf+JknEp07aAMZ2D53p2CXTfVPnSuNBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:34:56.718958Z","signed_message":"canonical_sha256_bytes"},"source_id":"1508.05108","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:26ee52deccf28866ebf0e34a97d0c4ef142897c7b69a43b34032acf6183c2466","sha256:defaae480a4917af2f22937cdb9ba8eee23c6a2cf974afde31f79ad058d98598"],"state_sha256":"7c2ad764425ed0a252183b1ecbb02d250eaedba6502a9637339a167e5bcfdb87"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KkVB8e3+v7bR0vkTOrv8VTnFT62sBeiGC70tlL5dosvPW18O9RRn08uKkLECGNyI26DRdFtXrTlhil55KjgOBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T04:49:42.963399Z","bundle_sha256":"c3fcccc6a92104fbf97006c737a3065523dfe69dc59e6840bf2638fa6a3ce71e"}}