{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2002:E6NWML27Z35MUZMNIWIOVUJJGJ","short_pith_number":"pith:E6NWML27","canonical_record":{"source":{"id":"quant-ph/0204022","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2002-04-04T21:00:35Z","cross_cats_sorted":["cs.CR"],"title_canon_sha256":"88680f08e2338c7ce4f2f83291f16ba8627b2d28daa821c3020c50737047e5c8","abstract_canon_sha256":"8dcd4e6fe4620901c96dc52f0c9b2bc96f4821f297587ddd3583eb2c603e814c"},"schema_version":"1.0"},"canonical_sha256":"279b662f5fcefaca658d4590ead12932781e039e74322463660a4e593a867cb3","source":{"kind":"arxiv","id":"quant-ph/0204022","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"quant-ph/0204022","created_at":"2026-07-04T15:11:28Z"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0204022v1","created_at":"2026-07-04T15:11:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0204022","created_at":"2026-07-04T15:11:28Z"},{"alias_kind":"pith_short_12","alias_value":"E6NWML27Z35M","created_at":"2026-07-04T15:11:28Z"},{"alias_kind":"pith_short_16","alias_value":"E6NWML27Z35MUZMN","created_at":"2026-07-04T15:11:28Z"},{"alias_kind":"pith_short_8","alias_value":"E6NWML27","created_at":"2026-07-04T15:11:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2002:E6NWML27Z35MUZMNIWIOVUJJGJ","target":"record","payload":{"canonical_record":{"source":{"id":"quant-ph/0204022","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2002-04-04T21:00:35Z","cross_cats_sorted":["cs.CR"],"title_canon_sha256":"88680f08e2338c7ce4f2f83291f16ba8627b2d28daa821c3020c50737047e5c8","abstract_canon_sha256":"8dcd4e6fe4620901c96dc52f0c9b2bc96f4821f297587ddd3583eb2c603e814c"},"schema_version":"1.0"},"canonical_sha256":"279b662f5fcefaca658d4590ead12932781e039e74322463660a4e593a867cb3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T15:11:28.975891Z","signature_b64":"Nzh5z5Wi9B0l0aTeO918Q6AePYZ5L7LC5mm+BxSVn64wtHMa2e5tvM/usOWgSy/987QGGBf4srW6+SeGPyx2AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"279b662f5fcefaca658d4590ead12932781e039e74322463660a4e593a867cb3","last_reissued_at":"2026-07-04T15:11:28.975439Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T15:11:28.975439Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"quant-ph/0204022","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-07-04T15:11:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FznISY8h49DF4JgOJssqKu4P7C5X3MjWeUnhCLomvXB6s9hvFJPDCiS9IzQQtiOZiUiXzLMRQMex21Vwg7vDBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T07:02:36.754728Z"},"content_sha256":"f9a597b00d6bafd3a6a176f533186207aa2fd4f6db4af4333fe7a21c3f02d6be","schema_version":"1.0","event_id":"sha256:f9a597b00d6bafd3a6a176f533186207aa2fd4f6db4af4333fe7a21c3f02d6be"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2002:E6NWML27Z35MUZMNIWIOVUJJGJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A New Protocol and Lower Bounds for Quantum Coin Flipping","license":"","headline":"","cross_cats":["cs.CR"],"primary_cat":"quant-ph","authors_text":"Andris Ambainis","submitted_at":"2002-04-04T21:00:35Z","abstract_excerpt":"We present a new protocol and two lower bounds for quantum coin flipping. In our protocol, no dishonest party can achieve one outcome with probability more than 0.75. Then, we show that our protocol is optimal for a certain type of quantum protocols.\n  For arbitrary quantum protocols, we show that if a protocol achieves a bias of at most $\\epsilon$, it must use at least $\\Omega(\\log \\log \\frac{1}{\\epsilon})$ rounds of communication. This implies that the parallel repetition fails for quantum coin flipping. (The bias of a protocol cannot be arbitrarily decreased by running several copies of it "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0204022","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/0204022/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"},"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-07-04T15:11:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OJGzYyQ9My+0OSMEuAOlt+c3KcmNI0kbDMsltW1EVLFJTMH6DN7VSW+eQOyr+E8RN1BAdtE/lz4FwM77d9eqCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T07:02:36.755631Z"},"content_sha256":"c786d822a749ff0f67dfc7b70f3042d71b6733263389a99ef43d1b07b583885a","schema_version":"1.0","event_id":"sha256:c786d822a749ff0f67dfc7b70f3042d71b6733263389a99ef43d1b07b583885a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/E6NWML27Z35MUZMNIWIOVUJJGJ/bundle.json","state_url":"https://pith.science/pith/E6NWML27Z35MUZMNIWIOVUJJGJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/E6NWML27Z35MUZMNIWIOVUJJGJ/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-08-10T07:02:36Z","links":{"resolver":"https://pith.science/pith/E6NWML27Z35MUZMNIWIOVUJJGJ","bundle":"https://pith.science/pith/E6NWML27Z35MUZMNIWIOVUJJGJ/bundle.json","state":"https://pith.science/pith/E6NWML27Z35MUZMNIWIOVUJJGJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/E6NWML27Z35MUZMNIWIOVUJJGJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2002:E6NWML27Z35MUZMNIWIOVUJJGJ","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":"8dcd4e6fe4620901c96dc52f0c9b2bc96f4821f297587ddd3583eb2c603e814c","cross_cats_sorted":["cs.CR"],"license":"","primary_cat":"quant-ph","submitted_at":"2002-04-04T21:00:35Z","title_canon_sha256":"88680f08e2338c7ce4f2f83291f16ba8627b2d28daa821c3020c50737047e5c8"},"schema_version":"1.0","source":{"id":"quant-ph/0204022","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"quant-ph/0204022","created_at":"2026-07-04T15:11:28Z"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0204022v1","created_at":"2026-07-04T15:11:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0204022","created_at":"2026-07-04T15:11:28Z"},{"alias_kind":"pith_short_12","alias_value":"E6NWML27Z35M","created_at":"2026-07-04T15:11:28Z"},{"alias_kind":"pith_short_16","alias_value":"E6NWML27Z35MUZMN","created_at":"2026-07-04T15:11:28Z"},{"alias_kind":"pith_short_8","alias_value":"E6NWML27","created_at":"2026-07-04T15:11:28Z"}],"graph_snapshots":[{"event_id":"sha256:c786d822a749ff0f67dfc7b70f3042d71b6733263389a99ef43d1b07b583885a","target":"graph","created_at":"2026-07-04T15:11:28Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/quant-ph/0204022/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We present a new protocol and two lower bounds for quantum coin flipping. In our protocol, no dishonest party can achieve one outcome with probability more than 0.75. Then, we show that our protocol is optimal for a certain type of quantum protocols.\n  For arbitrary quantum protocols, we show that if a protocol achieves a bias of at most $\\epsilon$, it must use at least $\\Omega(\\log \\log \\frac{1}{\\epsilon})$ rounds of communication. This implies that the parallel repetition fails for quantum coin flipping. (The bias of a protocol cannot be arbitrarily decreased by running several copies of it ","authors_text":"Andris Ambainis","cross_cats":["cs.CR"],"headline":"","license":"","primary_cat":"quant-ph","submitted_at":"2002-04-04T21:00:35Z","title":"A New Protocol and Lower Bounds for Quantum Coin Flipping"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0204022","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:f9a597b00d6bafd3a6a176f533186207aa2fd4f6db4af4333fe7a21c3f02d6be","target":"record","created_at":"2026-07-04T15:11:28Z","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":"8dcd4e6fe4620901c96dc52f0c9b2bc96f4821f297587ddd3583eb2c603e814c","cross_cats_sorted":["cs.CR"],"license":"","primary_cat":"quant-ph","submitted_at":"2002-04-04T21:00:35Z","title_canon_sha256":"88680f08e2338c7ce4f2f83291f16ba8627b2d28daa821c3020c50737047e5c8"},"schema_version":"1.0","source":{"id":"quant-ph/0204022","kind":"arxiv","version":1}},"canonical_sha256":"279b662f5fcefaca658d4590ead12932781e039e74322463660a4e593a867cb3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"279b662f5fcefaca658d4590ead12932781e039e74322463660a4e593a867cb3","first_computed_at":"2026-07-04T15:11:28.975439Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T15:11:28.975439Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Nzh5z5Wi9B0l0aTeO918Q6AePYZ5L7LC5mm+BxSVn64wtHMa2e5tvM/usOWgSy/987QGGBf4srW6+SeGPyx2AA==","signature_status":"signed_v1","signed_at":"2026-07-04T15:11:28.975891Z","signed_message":"canonical_sha256_bytes"},"source_id":"quant-ph/0204022","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f9a597b00d6bafd3a6a176f533186207aa2fd4f6db4af4333fe7a21c3f02d6be","sha256:c786d822a749ff0f67dfc7b70f3042d71b6733263389a99ef43d1b07b583885a"],"state_sha256":"f32bf4b517823f1d44a3a8740e3e5afc3e433851cb97c24259b209ade5aff6c3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lMHvqTQV5eumeDa/6nJJbB/F2XlWWF1ROVF0wrusAo3o76th4gLWPTRqGRolLTbmQLOoyUXr/MzWt1syk2yeBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-10T07:02:36.761352Z","bundle_sha256":"423dfc3aa0f3ea7ab10b68e51425735f3dd6a7cc3f6bcaac8d20c6718a716742"}}