{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:2ZK5CU37P2NJN7O5QNBODJ4WMG","short_pith_number":"pith:2ZK5CU37","schema_version":"1.0","canonical_sha256":"d655d1537f7e9a96fddd8342e1a7966198eb9a1b2af0a877a1057b6b9758ec0e","source":{"kind":"arxiv","id":"1503.01588","version":2},"attestation_state":"computed","paper":{"title":"Adaptively Secure Coin-Flipping, Revisited","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.CR","authors_text":"Shafi Goldwasser, Sunoo Park, Yael Tauman Kalai","submitted_at":"2015-03-05T09:47:33Z","abstract_excerpt":"The full-information model was introduced by Ben-Or and Linial in 1985 to study collective coin-flipping: the problem of generating a common bounded-bias bit in a network of $n$ players with $t=t(n)$ faults. They showed that the majority protocol can tolerate $t=O(\\sqrt n)$ adaptive corruptions, and conjectured that this is optimal in the adaptive setting. Lichtenstein, Linial, and Saks proved that the conjecture holds for protocols in which each player sends a single bit. Their result has been the main progress on the conjecture in the last 30 years.\n  In this work we revisit this question an"},"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":"1503.01588","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2015-03-05T09:47:33Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"2cbf9bcfa94441fe0c235faddcfd32a3cfebad1b3b71d27e30b6a9cb4a4d0b85","abstract_canon_sha256":"6c198106dfeb2f482c4662a345fc6dacead46eaa3ab691847ddb05c323b59690"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:17:00.343731Z","signature_b64":"mz1V5LwFfMem2i1YlsIlZSoxiiq+V0qRxu6/Ookn+YlQlZuMnmhZqx47yw7noD5Oce+6Y2/24tw1cj+gwiVhCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d655d1537f7e9a96fddd8342e1a7966198eb9a1b2af0a877a1057b6b9758ec0e","last_reissued_at":"2026-05-18T02:17:00.343095Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:17:00.343095Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Adaptively Secure Coin-Flipping, Revisited","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.CR","authors_text":"Shafi Goldwasser, Sunoo Park, Yael Tauman Kalai","submitted_at":"2015-03-05T09:47:33Z","abstract_excerpt":"The full-information model was introduced by Ben-Or and Linial in 1985 to study collective coin-flipping: the problem of generating a common bounded-bias bit in a network of $n$ players with $t=t(n)$ faults. They showed that the majority protocol can tolerate $t=O(\\sqrt n)$ adaptive corruptions, and conjectured that this is optimal in the adaptive setting. Lichtenstein, Linial, and Saks proved that the conjecture holds for protocols in which each player sends a single bit. Their result has been the main progress on the conjecture in the last 30 years.\n  In this work we revisit this question an"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.01588","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":"1503.01588","created_at":"2026-05-18T02:17:00.343192+00:00"},{"alias_kind":"arxiv_version","alias_value":"1503.01588v2","created_at":"2026-05-18T02:17:00.343192+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.01588","created_at":"2026-05-18T02:17:00.343192+00:00"},{"alias_kind":"pith_short_12","alias_value":"2ZK5CU37P2NJ","created_at":"2026-05-18T12:29:02.477457+00:00"},{"alias_kind":"pith_short_16","alias_value":"2ZK5CU37P2NJN7O5","created_at":"2026-05-18T12:29:02.477457+00:00"},{"alias_kind":"pith_short_8","alias_value":"2ZK5CU37","created_at":"2026-05-18T12:29:02.477457+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/2ZK5CU37P2NJN7O5QNBODJ4WMG","json":"https://pith.science/pith/2ZK5CU37P2NJN7O5QNBODJ4WMG.json","graph_json":"https://pith.science/api/pith-number/2ZK5CU37P2NJN7O5QNBODJ4WMG/graph.json","events_json":"https://pith.science/api/pith-number/2ZK5CU37P2NJN7O5QNBODJ4WMG/events.json","paper":"https://pith.science/paper/2ZK5CU37"},"agent_actions":{"view_html":"https://pith.science/pith/2ZK5CU37P2NJN7O5QNBODJ4WMG","download_json":"https://pith.science/pith/2ZK5CU37P2NJN7O5QNBODJ4WMG.json","view_paper":"https://pith.science/paper/2ZK5CU37","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1503.01588&json=true","fetch_graph":"https://pith.science/api/pith-number/2ZK5CU37P2NJN7O5QNBODJ4WMG/graph.json","fetch_events":"https://pith.science/api/pith-number/2ZK5CU37P2NJN7O5QNBODJ4WMG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2ZK5CU37P2NJN7O5QNBODJ4WMG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2ZK5CU37P2NJN7O5QNBODJ4WMG/action/storage_attestation","attest_author":"https://pith.science/pith/2ZK5CU37P2NJN7O5QNBODJ4WMG/action/author_attestation","sign_citation":"https://pith.science/pith/2ZK5CU37P2NJN7O5QNBODJ4WMG/action/citation_signature","submit_replication":"https://pith.science/pith/2ZK5CU37P2NJN7O5QNBODJ4WMG/action/replication_record"}},"created_at":"2026-05-18T02:17:00.343192+00:00","updated_at":"2026-05-18T02:17:00.343192+00:00"}