{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:SPYINKKHKUMX4BG4HFPQWZKZ5C","short_pith_number":"pith:SPYINKKH","schema_version":"1.0","canonical_sha256":"93f086a94755197e04dc395f0b6559e88e8e6fbb5394d89fc878e665d27dd2e4","source":{"kind":"arxiv","id":"1504.04217","version":1},"attestation_state":"computed","paper":{"title":"Quantum and classical coin-flipping protocols based on bit-commitment and their point games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","math.OC"],"primary_cat":"quant-ph","authors_text":"Ashwin Nayak, Jamie Sikora, Levent Tun\\c{c}el","submitted_at":"2015-04-16T13:07:23Z","abstract_excerpt":"We focus on a family of quantum coin-flipping protocols based on bit-commitment. We discuss how the semidefinite programming formulations of cheating strategies can be reduced to optimizing a linear combination of fidelity functions over a polytope. These turn out to be much simpler semidefinite programs which can be modelled using second-order cone programming problems. We then use these simplifications to construct their point games as developed by Kitaev. We also study the classical version of these protocols and use linear optimization to formulate optimal cheating strategies. We then cons"},"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":"1504.04217","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2015-04-16T13:07:23Z","cross_cats_sorted":["cs.CR","math.OC"],"title_canon_sha256":"b3af2e40e6ff9b660291fd94111c6b1492ab9bedf7a18f46ffd87567bfe6451b","abstract_canon_sha256":"e55399eb349c7530916f6a3cacfa446ff25d8e599bcb31ff2290109601e9e192"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:20:32.637522Z","signature_b64":"SpgV1Q3fomw497m5lm31GvUbP+UM8c6pQ5ETGVnnjCFsMDjPPMMHoRrHHbXXQD8y7vY4jIOFvUVtLEmSbUkXBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"93f086a94755197e04dc395f0b6559e88e8e6fbb5394d89fc878e665d27dd2e4","last_reissued_at":"2026-05-18T00:20:32.636916Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:20:32.636916Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum and classical coin-flipping protocols based on bit-commitment and their point games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","math.OC"],"primary_cat":"quant-ph","authors_text":"Ashwin Nayak, Jamie Sikora, Levent Tun\\c{c}el","submitted_at":"2015-04-16T13:07:23Z","abstract_excerpt":"We focus on a family of quantum coin-flipping protocols based on bit-commitment. We discuss how the semidefinite programming formulations of cheating strategies can be reduced to optimizing a linear combination of fidelity functions over a polytope. These turn out to be much simpler semidefinite programs which can be modelled using second-order cone programming problems. We then use these simplifications to construct their point games as developed by Kitaev. We also study the classical version of these protocols and use linear optimization to formulate optimal cheating strategies. We then cons"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.04217","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":"1504.04217","created_at":"2026-05-18T00:20:32.636985+00:00"},{"alias_kind":"arxiv_version","alias_value":"1504.04217v1","created_at":"2026-05-18T00:20:32.636985+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.04217","created_at":"2026-05-18T00:20:32.636985+00:00"},{"alias_kind":"pith_short_12","alias_value":"SPYINKKHKUMX","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_16","alias_value":"SPYINKKHKUMX4BG4","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_8","alias_value":"SPYINKKH","created_at":"2026-05-18T12:29:42.218222+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/SPYINKKHKUMX4BG4HFPQWZKZ5C","json":"https://pith.science/pith/SPYINKKHKUMX4BG4HFPQWZKZ5C.json","graph_json":"https://pith.science/api/pith-number/SPYINKKHKUMX4BG4HFPQWZKZ5C/graph.json","events_json":"https://pith.science/api/pith-number/SPYINKKHKUMX4BG4HFPQWZKZ5C/events.json","paper":"https://pith.science/paper/SPYINKKH"},"agent_actions":{"view_html":"https://pith.science/pith/SPYINKKHKUMX4BG4HFPQWZKZ5C","download_json":"https://pith.science/pith/SPYINKKHKUMX4BG4HFPQWZKZ5C.json","view_paper":"https://pith.science/paper/SPYINKKH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1504.04217&json=true","fetch_graph":"https://pith.science/api/pith-number/SPYINKKHKUMX4BG4HFPQWZKZ5C/graph.json","fetch_events":"https://pith.science/api/pith-number/SPYINKKHKUMX4BG4HFPQWZKZ5C/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SPYINKKHKUMX4BG4HFPQWZKZ5C/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SPYINKKHKUMX4BG4HFPQWZKZ5C/action/storage_attestation","attest_author":"https://pith.science/pith/SPYINKKHKUMX4BG4HFPQWZKZ5C/action/author_attestation","sign_citation":"https://pith.science/pith/SPYINKKHKUMX4BG4HFPQWZKZ5C/action/citation_signature","submit_replication":"https://pith.science/pith/SPYINKKHKUMX4BG4HFPQWZKZ5C/action/replication_record"}},"created_at":"2026-05-18T00:20:32.636985+00:00","updated_at":"2026-05-18T00:20:32.636985+00:00"}