{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:UDSGGIOR7QC2ARH2UVEQOGNRQD","short_pith_number":"pith:UDSGGIOR","canonical_record":{"source":{"id":"1902.03660","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-02-10T19:48:27Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"100b240e3efba7a9330016e804e5f1c93e7ef2f258fa381cc756caa9b0e4acfd","abstract_canon_sha256":"8e5add6a8e98bdc7bc70cb0107796e982e7d6b1f3259fc3d9e336d08dc57f384"},"schema_version":"1.0"},"canonical_sha256":"a0e46321d1fc05a044faa5490719b180c7f89c2a3c5aab873f8917d3bec686b8","source":{"kind":"arxiv","id":"1902.03660","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.03660","created_at":"2026-05-17T23:54:20Z"},{"alias_kind":"arxiv_version","alias_value":"1902.03660v1","created_at":"2026-05-17T23:54:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.03660","created_at":"2026-05-17T23:54:20Z"},{"alias_kind":"pith_short_12","alias_value":"UDSGGIOR7QC2","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"UDSGGIOR7QC2ARH2","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"UDSGGIOR","created_at":"2026-05-18T12:33:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:UDSGGIOR7QC2ARH2UVEQOGNRQD","target":"record","payload":{"canonical_record":{"source":{"id":"1902.03660","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-02-10T19:48:27Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"100b240e3efba7a9330016e804e5f1c93e7ef2f258fa381cc756caa9b0e4acfd","abstract_canon_sha256":"8e5add6a8e98bdc7bc70cb0107796e982e7d6b1f3259fc3d9e336d08dc57f384"},"schema_version":"1.0"},"canonical_sha256":"a0e46321d1fc05a044faa5490719b180c7f89c2a3c5aab873f8917d3bec686b8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:54:20.005334Z","signature_b64":"imnUA2G773M/VtS9bMhZq8wRKzt9xckCNTABmFEAWWnXwTLCDlaBbl7ZecyjJ7UqQbWs7OdPF1nJKZTyhCFLAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a0e46321d1fc05a044faa5490719b180c7f89c2a3c5aab873f8917d3bec686b8","last_reissued_at":"2026-05-17T23:54:20.004423Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:54:20.004423Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1902.03660","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:54:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AE1Sjx8ap/6VdBSEH63ESHlZYM6jEaxiVIyyzwRC4sg7xcEXOz92u4+qMPBdL6IPGZsnNE75ftkagCCKvgKECQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T08:30:49.526889Z"},"content_sha256":"6a59b8fb1e0d34f4be4f35d8805fcf59554afbef4ecf6f353cdcb4ef47ea6998","schema_version":"1.0","event_id":"sha256:6a59b8fb1e0d34f4be4f35d8805fcf59554afbef4ecf6f353cdcb4ef47ea6998"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:UDSGGIOR7QC2ARH2UVEQOGNRQD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Quantum distinguishing complexity, zero-error algorithms, and statistical zero knowledge","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Robin Kothari, Shalev Ben-David","submitted_at":"2019-02-10T19:48:27Z","abstract_excerpt":"We define a new query measure we call quantum distinguishing complexity, denoted QD(f) for a Boolean function f. Unlike a quantum query algorithm, which must output a state close to |0> on a 0-input and a state close to |1> on a 1-input, a \"quantum distinguishing algorithm\" can output any state, as long as the output states for any 0-input and 1-input are distinguishable.\n  Using this measure, we establish a new relationship in query complexity: For all total functions f, Q_0(f)=O~(Q(f)^5), where Q_0(f) and Q(f) denote the zero-error and bounded-error quantum query complexity of f respectively"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.03660","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:54:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xx7D3qZ3PqKXbQCGb4MWsFC2ArLIe8+mizDFz2wS9XiOhUDdGPS2x+Flai5GDHOM95LdeA4C/AnxFg/lzKhvDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T08:30:49.527624Z"},"content_sha256":"bf72e134d554090c21061664ce7b6bc53aa00e7623225e3f206a3eb91e38882b","schema_version":"1.0","event_id":"sha256:bf72e134d554090c21061664ce7b6bc53aa00e7623225e3f206a3eb91e38882b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UDSGGIOR7QC2ARH2UVEQOGNRQD/bundle.json","state_url":"https://pith.science/pith/UDSGGIOR7QC2ARH2UVEQOGNRQD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UDSGGIOR7QC2ARH2UVEQOGNRQD/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-26T08:30:49Z","links":{"resolver":"https://pith.science/pith/UDSGGIOR7QC2ARH2UVEQOGNRQD","bundle":"https://pith.science/pith/UDSGGIOR7QC2ARH2UVEQOGNRQD/bundle.json","state":"https://pith.science/pith/UDSGGIOR7QC2ARH2UVEQOGNRQD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UDSGGIOR7QC2ARH2UVEQOGNRQD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:UDSGGIOR7QC2ARH2UVEQOGNRQD","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":"8e5add6a8e98bdc7bc70cb0107796e982e7d6b1f3259fc3d9e336d08dc57f384","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-02-10T19:48:27Z","title_canon_sha256":"100b240e3efba7a9330016e804e5f1c93e7ef2f258fa381cc756caa9b0e4acfd"},"schema_version":"1.0","source":{"id":"1902.03660","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.03660","created_at":"2026-05-17T23:54:20Z"},{"alias_kind":"arxiv_version","alias_value":"1902.03660v1","created_at":"2026-05-17T23:54:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.03660","created_at":"2026-05-17T23:54:20Z"},{"alias_kind":"pith_short_12","alias_value":"UDSGGIOR7QC2","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"UDSGGIOR7QC2ARH2","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"UDSGGIOR","created_at":"2026-05-18T12:33:30Z"}],"graph_snapshots":[{"event_id":"sha256:bf72e134d554090c21061664ce7b6bc53aa00e7623225e3f206a3eb91e38882b","target":"graph","created_at":"2026-05-17T23:54:20Z","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 define a new query measure we call quantum distinguishing complexity, denoted QD(f) for a Boolean function f. Unlike a quantum query algorithm, which must output a state close to |0> on a 0-input and a state close to |1> on a 1-input, a \"quantum distinguishing algorithm\" can output any state, as long as the output states for any 0-input and 1-input are distinguishable.\n  Using this measure, we establish a new relationship in query complexity: For all total functions f, Q_0(f)=O~(Q(f)^5), where Q_0(f) and Q(f) denote the zero-error and bounded-error quantum query complexity of f respectively","authors_text":"Robin Kothari, Shalev Ben-David","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-02-10T19:48:27Z","title":"Quantum distinguishing complexity, zero-error algorithms, and statistical zero knowledge"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.03660","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:6a59b8fb1e0d34f4be4f35d8805fcf59554afbef4ecf6f353cdcb4ef47ea6998","target":"record","created_at":"2026-05-17T23:54:20Z","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":"8e5add6a8e98bdc7bc70cb0107796e982e7d6b1f3259fc3d9e336d08dc57f384","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-02-10T19:48:27Z","title_canon_sha256":"100b240e3efba7a9330016e804e5f1c93e7ef2f258fa381cc756caa9b0e4acfd"},"schema_version":"1.0","source":{"id":"1902.03660","kind":"arxiv","version":1}},"canonical_sha256":"a0e46321d1fc05a044faa5490719b180c7f89c2a3c5aab873f8917d3bec686b8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a0e46321d1fc05a044faa5490719b180c7f89c2a3c5aab873f8917d3bec686b8","first_computed_at":"2026-05-17T23:54:20.004423Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:54:20.004423Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"imnUA2G773M/VtS9bMhZq8wRKzt9xckCNTABmFEAWWnXwTLCDlaBbl7ZecyjJ7UqQbWs7OdPF1nJKZTyhCFLAQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:54:20.005334Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.03660","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6a59b8fb1e0d34f4be4f35d8805fcf59554afbef4ecf6f353cdcb4ef47ea6998","sha256:bf72e134d554090c21061664ce7b6bc53aa00e7623225e3f206a3eb91e38882b"],"state_sha256":"ae44d7b60d2da9aa4b0a40d7998f8b7619acc18e6e58aa694f30d27f9457b3d4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QuCpkx+8UiMgj9WKNFEhxxtOwoa4E+tdBXjHT5J5kz2MXDotio0d22FSSFKTv3zz1NH9NjLiaZ2Z7zuhxQiXDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T08:30:49.531391Z","bundle_sha256":"e699182ee2ea1ce679a4a79634880aded4104e33cd283a2f09608c03cf904569"}}