{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:C2EKU2AEEQQVMJAJB4MXVGSMML","short_pith_number":"pith:C2EKU2AE","schema_version":"1.0","canonical_sha256":"1688aa680424215624090f197a9a4c62c4a676c2bd09a74ad9029b5e30a8a219","source":{"kind":"arxiv","id":"1403.0505","version":1},"attestation_state":"computed","paper":{"title":"A search for quantum coin-flipping protocols using optimization techniques","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","quant-ph"],"primary_cat":"math.OC","authors_text":"Ashwin Nayak, Jamie Sikora, Levent Tun\\c{c}el","submitted_at":"2014-03-03T18:09:36Z","abstract_excerpt":"Coin-flipping is a cryptographic task in which two physically separated, mistrustful parties wish to generate a fair coin-flip by communicating with each other. Chailloux and Kerenidis (2009) designed quantum protocols that guarantee coin-flips with near optimal bias. The probability of any outcome in these protocols is provably at most $1/\\sqrt{2} + \\delta$ for any given $\\delta > 0$. However, no explicit description of these protocols is known, and the number of rounds in the protocols tends to infinity as $\\delta$ goes to 0. In fact, the smallest bias achieved by known explicit protocols is"},"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":"1403.0505","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-03-03T18:09:36Z","cross_cats_sorted":["cs.CR","quant-ph"],"title_canon_sha256":"c842d6d78a2c97aff2a8764ccf6f6c562faaa356649c4c27ab6b6ed6de5a346b","abstract_canon_sha256":"cde936b573ff35634a8efee95a0cad593be8167240442664f7200edb6daacc6b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:20:32.723223Z","signature_b64":"f20nA67j/20A15Bv9s8/pP9OzzbvanEl+F08V6tb32bNNYYKwAWJYRomkSLcZFWd7JQhf3d7iQqRhUzz9OYtDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1688aa680424215624090f197a9a4c62c4a676c2bd09a74ad9029b5e30a8a219","last_reissued_at":"2026-05-18T00:20:32.722700Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:20:32.722700Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A search for quantum coin-flipping protocols using optimization techniques","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","quant-ph"],"primary_cat":"math.OC","authors_text":"Ashwin Nayak, Jamie Sikora, Levent Tun\\c{c}el","submitted_at":"2014-03-03T18:09:36Z","abstract_excerpt":"Coin-flipping is a cryptographic task in which two physically separated, mistrustful parties wish to generate a fair coin-flip by communicating with each other. Chailloux and Kerenidis (2009) designed quantum protocols that guarantee coin-flips with near optimal bias. The probability of any outcome in these protocols is provably at most $1/\\sqrt{2} + \\delta$ for any given $\\delta > 0$. However, no explicit description of these protocols is known, and the number of rounds in the protocols tends to infinity as $\\delta$ goes to 0. In fact, the smallest bias achieved by known explicit protocols is"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.0505","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1403.0505","created_at":"2026-05-18T00:20:32.722783+00:00"},{"alias_kind":"arxiv_version","alias_value":"1403.0505v1","created_at":"2026-05-18T00:20:32.722783+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.0505","created_at":"2026-05-18T00:20:32.722783+00:00"},{"alias_kind":"pith_short_12","alias_value":"C2EKU2AEEQQV","created_at":"2026-05-18T12:28:22.404517+00:00"},{"alias_kind":"pith_short_16","alias_value":"C2EKU2AEEQQVMJAJ","created_at":"2026-05-18T12:28:22.404517+00:00"},{"alias_kind":"pith_short_8","alias_value":"C2EKU2AE","created_at":"2026-05-18T12:28:22.404517+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/C2EKU2AEEQQVMJAJB4MXVGSMML","json":"https://pith.science/pith/C2EKU2AEEQQVMJAJB4MXVGSMML.json","graph_json":"https://pith.science/api/pith-number/C2EKU2AEEQQVMJAJB4MXVGSMML/graph.json","events_json":"https://pith.science/api/pith-number/C2EKU2AEEQQVMJAJB4MXVGSMML/events.json","paper":"https://pith.science/paper/C2EKU2AE"},"agent_actions":{"view_html":"https://pith.science/pith/C2EKU2AEEQQVMJAJB4MXVGSMML","download_json":"https://pith.science/pith/C2EKU2AEEQQVMJAJB4MXVGSMML.json","view_paper":"https://pith.science/paper/C2EKU2AE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1403.0505&json=true","fetch_graph":"https://pith.science/api/pith-number/C2EKU2AEEQQVMJAJB4MXVGSMML/graph.json","fetch_events":"https://pith.science/api/pith-number/C2EKU2AEEQQVMJAJB4MXVGSMML/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/C2EKU2AEEQQVMJAJB4MXVGSMML/action/timestamp_anchor","attest_storage":"https://pith.science/pith/C2EKU2AEEQQVMJAJB4MXVGSMML/action/storage_attestation","attest_author":"https://pith.science/pith/C2EKU2AEEQQVMJAJB4MXVGSMML/action/author_attestation","sign_citation":"https://pith.science/pith/C2EKU2AEEQQVMJAJB4MXVGSMML/action/citation_signature","submit_replication":"https://pith.science/pith/C2EKU2AEEQQVMJAJB4MXVGSMML/action/replication_record"}},"created_at":"2026-05-18T00:20:32.722783+00:00","updated_at":"2026-05-18T00:20:32.722783+00:00"}