{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:1997:3N62TT3GW3JDV2OYCET7VIXMM5","short_pith_number":"pith:3N62TT3G","schema_version":"1.0","canonical_sha256":"db7da9cf66b6d23ae9d81127faa2ec677791734e2d6807b65d09e95c77629b40","source":{"kind":"arxiv","id":"quant-ph/9712023","version":1},"attestation_state":"computed","paper":{"title":"A brief review on the impossibility of quantum bit commitment","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Claude Cr\\'epeau, Dominic Mayers, Gilles Brassard, Louis Salvail","submitted_at":"1997-12-10T20:16:27Z","abstract_excerpt":"The desire to obtain an unconditionally secure bit commitment protocol in quantum cryptography was expressed for the first time thirteen years ago. Bit commitment is sufficient in quantum cryptography to realize a variety of applications with unconditional security. In 1993, a quantum bit commitment protocol was proposed together with a security proof. However, a basic flaw in the protocol was discovered by Mayers in 1995 and subsequently by Lo and Chau. Later the result was generalized by Mayers who showed that unconditionally secure bit commitment is impossible. A brief review on quantum bit"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"quant-ph/9712023","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"1997-12-10T20:16:27Z","cross_cats_sorted":[],"title_canon_sha256":"53a63b154b7c6fe1b27031ceb135326e2d0ba4fc55d4a192143bfb710360122a","abstract_canon_sha256":"1cd9ed110e8d0e96b8d5fe126c5ec6fcd79d4c662a2b36b62f5cfbe885fe7709"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:47:09.824769Z","signature_b64":"ArfmmAVSd+BN+UH0L3trcwSKjMixGlqRfQyiVGEtd41HcoH3ELKUHeVJhoj1+qn7JaD7335yo4RoIjJ4096rBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"db7da9cf66b6d23ae9d81127faa2ec677791734e2d6807b65d09e95c77629b40","last_reissued_at":"2026-07-04T14:47:09.824363Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:47:09.824363Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A brief review on the impossibility of quantum bit commitment","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Claude Cr\\'epeau, Dominic Mayers, Gilles Brassard, Louis Salvail","submitted_at":"1997-12-10T20:16:27Z","abstract_excerpt":"The desire to obtain an unconditionally secure bit commitment protocol in quantum cryptography was expressed for the first time thirteen years ago. Bit commitment is sufficient in quantum cryptography to realize a variety of applications with unconditional security. In 1993, a quantum bit commitment protocol was proposed together with a security proof. However, a basic flaw in the protocol was discovered by Mayers in 1995 and subsequently by Lo and Chau. Later the result was generalized by Mayers who showed that unconditionally secure bit commitment is impossible. A brief review on quantum bit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/9712023","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/quant-ph/9712023/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"quant-ph/9712023","created_at":"2026-07-04T14:47:09.824423+00:00"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/9712023v1","created_at":"2026-07-04T14:47:09.824423+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/9712023","created_at":"2026-07-04T14:47:09.824423+00:00"},{"alias_kind":"pith_short_12","alias_value":"3N62TT3GW3JD","created_at":"2026-07-04T14:47:09.824423+00:00"},{"alias_kind":"pith_short_16","alias_value":"3N62TT3GW3JDV2OY","created_at":"2026-07-04T14:47:09.824423+00:00"},{"alias_kind":"pith_short_8","alias_value":"3N62TT3G","created_at":"2026-07-04T14:47:09.824423+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2504.15343","citing_title":"The Hardness of Learning Quantum Circuits and its Cryptographic Applications","ref_index":13,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3N62TT3GW3JDV2OYCET7VIXMM5","json":"https://pith.science/pith/3N62TT3GW3JDV2OYCET7VIXMM5.json","graph_json":"https://pith.science/api/pith-number/3N62TT3GW3JDV2OYCET7VIXMM5/graph.json","events_json":"https://pith.science/api/pith-number/3N62TT3GW3JDV2OYCET7VIXMM5/events.json","paper":"https://pith.science/paper/3N62TT3G"},"agent_actions":{"view_html":"https://pith.science/pith/3N62TT3GW3JDV2OYCET7VIXMM5","download_json":"https://pith.science/pith/3N62TT3GW3JDV2OYCET7VIXMM5.json","view_paper":"https://pith.science/paper/3N62TT3G","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=quant-ph/9712023&json=true","fetch_graph":"https://pith.science/api/pith-number/3N62TT3GW3JDV2OYCET7VIXMM5/graph.json","fetch_events":"https://pith.science/api/pith-number/3N62TT3GW3JDV2OYCET7VIXMM5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3N62TT3GW3JDV2OYCET7VIXMM5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3N62TT3GW3JDV2OYCET7VIXMM5/action/storage_attestation","attest_author":"https://pith.science/pith/3N62TT3GW3JDV2OYCET7VIXMM5/action/author_attestation","sign_citation":"https://pith.science/pith/3N62TT3GW3JDV2OYCET7VIXMM5/action/citation_signature","submit_replication":"https://pith.science/pith/3N62TT3GW3JDV2OYCET7VIXMM5/action/replication_record"}},"created_at":"2026-07-04T14:47:09.824423+00:00","updated_at":"2026-07-04T14:47:09.824423+00:00"}