{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2004:OAK6IQX5FFETS7TFF44KSL6DFJ","short_pith_number":"pith:OAK6IQX5","canonical_record":{"source":{"id":"quant-ph/0403069","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2004-03-09T09:58:11Z","cross_cats_sorted":["cs.CR"],"title_canon_sha256":"0c05892949fc438ae662a4d3cc11a6c588f55bb64195f4ed63bb3f1549331b62","abstract_canon_sha256":"88d202dc3774d79584e418fb764b2fbf3423d0e0ff40d5d6602bdc28e75efe20"},"schema_version":"1.0"},"canonical_sha256":"7015e442fd2949397e652f38a92fc32a6dfa5eb35ca2feee03a62ff1eefc55f8","source":{"kind":"arxiv","id":"quant-ph/0403069","version":6},"source_aliases":[{"alias_kind":"arxiv","alias_value":"quant-ph/0403069","created_at":"2026-05-18T01:13:45Z"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0403069v6","created_at":"2026-05-18T01:13:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0403069","created_at":"2026-05-18T01:13:45Z"},{"alias_kind":"pith_short_12","alias_value":"OAK6IQX5FFET","created_at":"2026-05-18T12:25:52Z"},{"alias_kind":"pith_short_16","alias_value":"OAK6IQX5FFETS7TF","created_at":"2026-05-18T12:25:52Z"},{"alias_kind":"pith_short_8","alias_value":"OAK6IQX5","created_at":"2026-05-18T12:25:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2004:OAK6IQX5FFETS7TFF44KSL6DFJ","target":"record","payload":{"canonical_record":{"source":{"id":"quant-ph/0403069","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2004-03-09T09:58:11Z","cross_cats_sorted":["cs.CR"],"title_canon_sha256":"0c05892949fc438ae662a4d3cc11a6c588f55bb64195f4ed63bb3f1549331b62","abstract_canon_sha256":"88d202dc3774d79584e418fb764b2fbf3423d0e0ff40d5d6602bdc28e75efe20"},"schema_version":"1.0"},"canonical_sha256":"7015e442fd2949397e652f38a92fc32a6dfa5eb35ca2feee03a62ff1eefc55f8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:13:45.605796Z","signature_b64":"icyxTmlYCynBGUq24p+AXvPNwGoHtz3/J6AU/jSXgoF9OtPsv2mb7BSz6CCWZUBmmNlVHkbwhjyVStcMdZblAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7015e442fd2949397e652f38a92fc32a6dfa5eb35ca2feee03a62ff1eefc55f8","last_reissued_at":"2026-05-18T01:13:45.605066Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:13:45.605066Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"quant-ph/0403069","source_version":6,"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:13:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FxSEwD9r92iPlGbbQT1DJOAb5OhRWEhtv6F+HmgijqP6jGPkpZLW3lvV50LRl4FwSZgJ1mMyWM2UttPNOoebCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T11:02:22.454676Z"},"content_sha256":"3beef280504c876e0f867af434c9ccb6fa6f3d5be828cbfa9b74828deb8b0733","schema_version":"1.0","event_id":"sha256:3beef280504c876e0f867af434c9ccb6fa6f3d5be828cbfa9b74828deb8b0733"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2004:OAK6IQX5FFETS7TFF44KSL6DFJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Computational Indistinguishability between Quantum States and Its Cryptographic Application","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"quant-ph","authors_text":"Akinori Kawachi, Harumichi Nishimura, Takeshi Koshiba, Tomoyuki Yamakami","submitted_at":"2004-03-09T09:58:11Z","abstract_excerpt":"We introduce a computational problem of distinguishing between two specific quantum states as a new cryptographic problem to design a quantum cryptographic scheme that is \"secure\" against any polynomial-time quantum adversary. Our problem, QSCDff, is to distinguish between two types of random coset states with a hidden permutation over the symmetric group of finite degree. This naturally generalizes the commonly-used distinction problem between two probability distributions in computational cryptography. As our major contribution, we show that QSCDff has three properties of cryptographic inter"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0403069","kind":"arxiv","version":6},"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:13:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sJIiutv7zvB4SYIrJ0W2vayfw0XsdBcU31qC/LyAdv7jlc933So2g/Fjo6Vs1PGs5ioPn1NzCOYE2H1NHtprBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T11:02:22.455273Z"},"content_sha256":"5446565f21f88a44714283121213352652bea745ea0479d878ee7b02add141f0","schema_version":"1.0","event_id":"sha256:5446565f21f88a44714283121213352652bea745ea0479d878ee7b02add141f0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OAK6IQX5FFETS7TFF44KSL6DFJ/bundle.json","state_url":"https://pith.science/pith/OAK6IQX5FFETS7TFF44KSL6DFJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OAK6IQX5FFETS7TFF44KSL6DFJ/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-26T11:02:22Z","links":{"resolver":"https://pith.science/pith/OAK6IQX5FFETS7TFF44KSL6DFJ","bundle":"https://pith.science/pith/OAK6IQX5FFETS7TFF44KSL6DFJ/bundle.json","state":"https://pith.science/pith/OAK6IQX5FFETS7TFF44KSL6DFJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OAK6IQX5FFETS7TFF44KSL6DFJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2004:OAK6IQX5FFETS7TFF44KSL6DFJ","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":"88d202dc3774d79584e418fb764b2fbf3423d0e0ff40d5d6602bdc28e75efe20","cross_cats_sorted":["cs.CR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2004-03-09T09:58:11Z","title_canon_sha256":"0c05892949fc438ae662a4d3cc11a6c588f55bb64195f4ed63bb3f1549331b62"},"schema_version":"1.0","source":{"id":"quant-ph/0403069","kind":"arxiv","version":6}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"quant-ph/0403069","created_at":"2026-05-18T01:13:45Z"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0403069v6","created_at":"2026-05-18T01:13:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0403069","created_at":"2026-05-18T01:13:45Z"},{"alias_kind":"pith_short_12","alias_value":"OAK6IQX5FFET","created_at":"2026-05-18T12:25:52Z"},{"alias_kind":"pith_short_16","alias_value":"OAK6IQX5FFETS7TF","created_at":"2026-05-18T12:25:52Z"},{"alias_kind":"pith_short_8","alias_value":"OAK6IQX5","created_at":"2026-05-18T12:25:52Z"}],"graph_snapshots":[{"event_id":"sha256:5446565f21f88a44714283121213352652bea745ea0479d878ee7b02add141f0","target":"graph","created_at":"2026-05-18T01:13: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 introduce a computational problem of distinguishing between two specific quantum states as a new cryptographic problem to design a quantum cryptographic scheme that is \"secure\" against any polynomial-time quantum adversary. Our problem, QSCDff, is to distinguish between two types of random coset states with a hidden permutation over the symmetric group of finite degree. This naturally generalizes the commonly-used distinction problem between two probability distributions in computational cryptography. As our major contribution, we show that QSCDff has three properties of cryptographic inter","authors_text":"Akinori Kawachi, Harumichi Nishimura, Takeshi Koshiba, Tomoyuki Yamakami","cross_cats":["cs.CR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2004-03-09T09:58:11Z","title":"Computational Indistinguishability between Quantum States and Its Cryptographic Application"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0403069","kind":"arxiv","version":6},"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:3beef280504c876e0f867af434c9ccb6fa6f3d5be828cbfa9b74828deb8b0733","target":"record","created_at":"2026-05-18T01:13: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":"88d202dc3774d79584e418fb764b2fbf3423d0e0ff40d5d6602bdc28e75efe20","cross_cats_sorted":["cs.CR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2004-03-09T09:58:11Z","title_canon_sha256":"0c05892949fc438ae662a4d3cc11a6c588f55bb64195f4ed63bb3f1549331b62"},"schema_version":"1.0","source":{"id":"quant-ph/0403069","kind":"arxiv","version":6}},"canonical_sha256":"7015e442fd2949397e652f38a92fc32a6dfa5eb35ca2feee03a62ff1eefc55f8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7015e442fd2949397e652f38a92fc32a6dfa5eb35ca2feee03a62ff1eefc55f8","first_computed_at":"2026-05-18T01:13:45.605066Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:13:45.605066Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"icyxTmlYCynBGUq24p+AXvPNwGoHtz3/J6AU/jSXgoF9OtPsv2mb7BSz6CCWZUBmmNlVHkbwhjyVStcMdZblAg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:13:45.605796Z","signed_message":"canonical_sha256_bytes"},"source_id":"quant-ph/0403069","source_kind":"arxiv","source_version":6}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3beef280504c876e0f867af434c9ccb6fa6f3d5be828cbfa9b74828deb8b0733","sha256:5446565f21f88a44714283121213352652bea745ea0479d878ee7b02add141f0"],"state_sha256":"7b7e135da223d1b0a5d6402a1aab73118c083b4f4c63913f0673acd628562139"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Buzc7Gjoi2rs3SNRIp8pCbOoBfiqHPDfdoiERnJJfS1QZlaTahnJGB4ojGxfVACkgJvDkRAB4rkmL3F70WKKBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T11:02:22.458489Z","bundle_sha256":"95a149d90859d702039a4c386e69af23cd8c1ccf16433163aa15bbdeb403853c"}}