{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:GVGDLPOR3EEO6OCRSFPLD2622D","short_pith_number":"pith:GVGDLPOR","canonical_record":{"source":{"id":"1902.06852","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.CC","submitted_at":"2019-02-19T00:47:31Z","cross_cats_sorted":["quant-ph"],"title_canon_sha256":"3e1d489df786e05d8516b60a87012d4ddeede3cc368315ad3add04e3406a49e2","abstract_canon_sha256":"13ad72893f5c46e8a2be146b449f22b6b9e03c363b7a40c546b24d2e4cf850ba"},"schema_version":"1.0"},"canonical_sha256":"354c35bdd1d908ef3851915eb1ebdad0d3dae445eae16b4f7a1080ebf44b9f52","source":{"kind":"arxiv","id":"1902.06852","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.06852","created_at":"2026-05-17T23:39:45Z"},{"alias_kind":"arxiv_version","alias_value":"1902.06852v1","created_at":"2026-05-17T23:39:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.06852","created_at":"2026-05-17T23:39:45Z"},{"alias_kind":"pith_short_12","alias_value":"GVGDLPOR3EEO","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"GVGDLPOR3EEO6OCR","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"GVGDLPOR","created_at":"2026-05-18T12:33:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:GVGDLPOR3EEO6OCRSFPLD2622D","target":"record","payload":{"canonical_record":{"source":{"id":"1902.06852","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.CC","submitted_at":"2019-02-19T00:47:31Z","cross_cats_sorted":["quant-ph"],"title_canon_sha256":"3e1d489df786e05d8516b60a87012d4ddeede3cc368315ad3add04e3406a49e2","abstract_canon_sha256":"13ad72893f5c46e8a2be146b449f22b6b9e03c363b7a40c546b24d2e4cf850ba"},"schema_version":"1.0"},"canonical_sha256":"354c35bdd1d908ef3851915eb1ebdad0d3dae445eae16b4f7a1080ebf44b9f52","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:45.297191Z","signature_b64":"JiRpLgK7Z9j9KsPQ7mIqxYdL4hxaSKPSuf4f/3aVXDDcR2Po+a5dGxA5CnbtMGoaUdHKOrkyL7xy7xNm8g5LBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"354c35bdd1d908ef3851915eb1ebdad0d3dae445eae16b4f7a1080ebf44b9f52","last_reissued_at":"2026-05-17T23:39:45.296388Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:45.296388Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1902.06852","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:39:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BZphIwTsYTRB9j79rs7TlplfeZt5nsORgTeroX7s3fdxh7YLHtgmH/YaGdy40kOD1gD1Xkd1iVPY+nNy5v+CDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T07:14:24.052422Z"},"content_sha256":"4462a02e90a74c6480dc7726870e9e0133b9a59054fc7fdb2771c285eb56b94c","schema_version":"1.0","event_id":"sha256:4462a02e90a74c6480dc7726870e9e0133b9a59054fc7fdb2771c285eb56b94c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:GVGDLPOR3EEO6OCRSFPLD2622D","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Error reduction of quantum algorithms","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["quant-ph"],"primary_cat":"cs.CC","authors_text":"Debajyoti Bera, Tharrmashastha P.V","submitted_at":"2019-02-19T00:47:31Z","abstract_excerpt":"We give a technique to reduce the error probability of quantum algorithms that determine whether its input has a specified property of interest. The standard process of reducing this error is statistical processing of the results of multiple independent executions of an algorithm. Denoting by $\\rho$ an upper bound of this probability (wlog., assume $\\rho \\le \\frac{1}{2}$), classical techniques require $O(\\frac{\\rho}{[(1-\\rho) - \\rho]^2})$ executions to reduce the error to a negligible constant. We investigated when and how quantum algorithmic techniques like amplitude amplification and estimat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.06852","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:39:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TQWEsatV70HJ8jcyVHhCduV8x1izdkYEoC2oZ9MQIh7bKzd97JFiRrw0nmF8eHrYUF9KHDpyD/2iyH5fdgDxCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T07:14:24.052783Z"},"content_sha256":"a17c3abe21587ccb87361b256a4034c2cb9d930f8d8c536cefc05896aad83038","schema_version":"1.0","event_id":"sha256:a17c3abe21587ccb87361b256a4034c2cb9d930f8d8c536cefc05896aad83038"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GVGDLPOR3EEO6OCRSFPLD2622D/bundle.json","state_url":"https://pith.science/pith/GVGDLPOR3EEO6OCRSFPLD2622D/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GVGDLPOR3EEO6OCRSFPLD2622D/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-30T07:14:24Z","links":{"resolver":"https://pith.science/pith/GVGDLPOR3EEO6OCRSFPLD2622D","bundle":"https://pith.science/pith/GVGDLPOR3EEO6OCRSFPLD2622D/bundle.json","state":"https://pith.science/pith/GVGDLPOR3EEO6OCRSFPLD2622D/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GVGDLPOR3EEO6OCRSFPLD2622D/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:GVGDLPOR3EEO6OCRSFPLD2622D","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":"13ad72893f5c46e8a2be146b449f22b6b9e03c363b7a40c546b24d2e4cf850ba","cross_cats_sorted":["quant-ph"],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.CC","submitted_at":"2019-02-19T00:47:31Z","title_canon_sha256":"3e1d489df786e05d8516b60a87012d4ddeede3cc368315ad3add04e3406a49e2"},"schema_version":"1.0","source":{"id":"1902.06852","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.06852","created_at":"2026-05-17T23:39:45Z"},{"alias_kind":"arxiv_version","alias_value":"1902.06852v1","created_at":"2026-05-17T23:39:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.06852","created_at":"2026-05-17T23:39:45Z"},{"alias_kind":"pith_short_12","alias_value":"GVGDLPOR3EEO","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"GVGDLPOR3EEO6OCR","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"GVGDLPOR","created_at":"2026-05-18T12:33:18Z"}],"graph_snapshots":[{"event_id":"sha256:a17c3abe21587ccb87361b256a4034c2cb9d930f8d8c536cefc05896aad83038","target":"graph","created_at":"2026-05-17T23:39:45Z","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 give a technique to reduce the error probability of quantum algorithms that determine whether its input has a specified property of interest. The standard process of reducing this error is statistical processing of the results of multiple independent executions of an algorithm. Denoting by $\\rho$ an upper bound of this probability (wlog., assume $\\rho \\le \\frac{1}{2}$), classical techniques require $O(\\frac{\\rho}{[(1-\\rho) - \\rho]^2})$ executions to reduce the error to a negligible constant. We investigated when and how quantum algorithmic techniques like amplitude amplification and estimat","authors_text":"Debajyoti Bera, Tharrmashastha P.V","cross_cats":["quant-ph"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.CC","submitted_at":"2019-02-19T00:47:31Z","title":"Error reduction of quantum algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.06852","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:4462a02e90a74c6480dc7726870e9e0133b9a59054fc7fdb2771c285eb56b94c","target":"record","created_at":"2026-05-17T23:39:45Z","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":"13ad72893f5c46e8a2be146b449f22b6b9e03c363b7a40c546b24d2e4cf850ba","cross_cats_sorted":["quant-ph"],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.CC","submitted_at":"2019-02-19T00:47:31Z","title_canon_sha256":"3e1d489df786e05d8516b60a87012d4ddeede3cc368315ad3add04e3406a49e2"},"schema_version":"1.0","source":{"id":"1902.06852","kind":"arxiv","version":1}},"canonical_sha256":"354c35bdd1d908ef3851915eb1ebdad0d3dae445eae16b4f7a1080ebf44b9f52","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"354c35bdd1d908ef3851915eb1ebdad0d3dae445eae16b4f7a1080ebf44b9f52","first_computed_at":"2026-05-17T23:39:45.296388Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:39:45.296388Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JiRpLgK7Z9j9KsPQ7mIqxYdL4hxaSKPSuf4f/3aVXDDcR2Po+a5dGxA5CnbtMGoaUdHKOrkyL7xy7xNm8g5LBQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:39:45.297191Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.06852","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4462a02e90a74c6480dc7726870e9e0133b9a59054fc7fdb2771c285eb56b94c","sha256:a17c3abe21587ccb87361b256a4034c2cb9d930f8d8c536cefc05896aad83038"],"state_sha256":"4f6bd61fb1812107dc3e0b1235bfaefc4153a43ad628a5c0475c5fa19a64c20b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SEWGEz/qBFylmCyQeV+vouxYk4X7ue1n+l9EZmRe+8zEkcHImtT5tP+GcelMuTD4qMd+X/0tRT3l3MN70STAAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T07:14:24.055066Z","bundle_sha256":"c7215f767758662ecec03e6de4c20e82cf86a5c07a5e1adfe5607a6ec8741c90"}}