{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:1999:U7DEMYTE725C7XVCQLU7JLK3IV","short_pith_number":"pith:U7DEMYTE","schema_version":"1.0","canonical_sha256":"a7c6466264feba2fdea282e9f4ad5b4541b8d1b9d7a110860b0e98daf4f546e6","source":{"kind":"arxiv","id":"quant-ph/9904078","version":2},"attestation_state":"computed","paper":{"title":"Unconditionally Secure Quantum Coin Tossing","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Dominic Mayers, Louis Salvail, Yoshie Chiba-Kohno","submitted_at":"1999-04-22T22:43:38Z","abstract_excerpt":"In coin tossing two remote participants want to share a uniformly distributed random bit. At the least in the quantum version, each participant test whether or not the other has attempted to create a bias on this bit. It is requested that, for b = 0,1, the probability that Alice gets bit b and pass the test is smaller than 1/2 whatever she does, and similarly for Bob. If the bound 1/2 holds perfectly against any of the two participants, the task realised is called an exact coin tossing. If the bound is actually $1/2 + \\xi$ where the bias $\\xi$ vanishes when a security parameter m defined by th"},"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/9904078","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"1999-04-22T22:43:38Z","cross_cats_sorted":[],"title_canon_sha256":"0b98817f09f8491d78288340bf0fc08937cb95f669ca65881ab4759c0a299b87","abstract_canon_sha256":"deed59ffc1e9b78c692e78b56dc6e9143eb3b51fca41e4d412570f564b709103"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:30.200251Z","signature_b64":"2Xab9OMF8+dhhaqgNTwdlRZDkniENTl/DXRd/LX+qoMC+t/hYUbAD57KJYiaU+vH5EpFVr30B+n34ScH//okCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a7c6466264feba2fdea282e9f4ad5b4541b8d1b9d7a110860b0e98daf4f546e6","last_reissued_at":"2026-05-18T00:22:30.199554Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:30.199554Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Unconditionally Secure Quantum Coin Tossing","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Dominic Mayers, Louis Salvail, Yoshie Chiba-Kohno","submitted_at":"1999-04-22T22:43:38Z","abstract_excerpt":"In coin tossing two remote participants want to share a uniformly distributed random bit. At the least in the quantum version, each participant test whether or not the other has attempted to create a bias on this bit. It is requested that, for b = 0,1, the probability that Alice gets bit b and pass the test is smaller than 1/2 whatever she does, and similarly for Bob. If the bound 1/2 holds perfectly against any of the two participants, the task realised is called an exact coin tossing. If the bound is actually $1/2 + \\xi$ where the bias $\\xi$ vanishes when a security parameter m defined by th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/9904078","kind":"arxiv","version":2},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"quant-ph/9904078","created_at":"2026-05-18T00:22:30.199668+00:00"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/9904078v2","created_at":"2026-05-18T00:22:30.199668+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/9904078","created_at":"2026-05-18T00:22:30.199668+00:00"},{"alias_kind":"pith_short_12","alias_value":"U7DEMYTE725C","created_at":"2026-05-18T12:25:49.631198+00:00"},{"alias_kind":"pith_short_16","alias_value":"U7DEMYTE725C7XVC","created_at":"2026-05-18T12:25:49.631198+00:00"},{"alias_kind":"pith_short_8","alias_value":"U7DEMYTE","created_at":"2026-05-18T12:25:49.631198+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/U7DEMYTE725C7XVCQLU7JLK3IV","json":"https://pith.science/pith/U7DEMYTE725C7XVCQLU7JLK3IV.json","graph_json":"https://pith.science/api/pith-number/U7DEMYTE725C7XVCQLU7JLK3IV/graph.json","events_json":"https://pith.science/api/pith-number/U7DEMYTE725C7XVCQLU7JLK3IV/events.json","paper":"https://pith.science/paper/U7DEMYTE"},"agent_actions":{"view_html":"https://pith.science/pith/U7DEMYTE725C7XVCQLU7JLK3IV","download_json":"https://pith.science/pith/U7DEMYTE725C7XVCQLU7JLK3IV.json","view_paper":"https://pith.science/paper/U7DEMYTE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=quant-ph/9904078&json=true","fetch_graph":"https://pith.science/api/pith-number/U7DEMYTE725C7XVCQLU7JLK3IV/graph.json","fetch_events":"https://pith.science/api/pith-number/U7DEMYTE725C7XVCQLU7JLK3IV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/U7DEMYTE725C7XVCQLU7JLK3IV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/U7DEMYTE725C7XVCQLU7JLK3IV/action/storage_attestation","attest_author":"https://pith.science/pith/U7DEMYTE725C7XVCQLU7JLK3IV/action/author_attestation","sign_citation":"https://pith.science/pith/U7DEMYTE725C7XVCQLU7JLK3IV/action/citation_signature","submit_replication":"https://pith.science/pith/U7DEMYTE725C7XVCQLU7JLK3IV/action/replication_record"}},"created_at":"2026-05-18T00:22:30.199668+00:00","updated_at":"2026-05-18T00:22:30.199668+00:00"}