{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:VKVDVMPESEDYCJUXETTQIJFYTE","short_pith_number":"pith:VKVDVMPE","schema_version":"1.0","canonical_sha256":"aaaa3ab1e4910781269724e70424b89914a3fc9b14ab72989658664e3dac1aab","source":{"kind":"arxiv","id":"2603.02071","version":2},"attestation_state":"computed","paper":{"title":"Subcubic Coin Tossing in Asynchrony without PKI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"cs.DC","authors_text":"Mose Mizrahi, Roger Wattenhofer","submitted_at":"2026-03-02T16:58:44Z","abstract_excerpt":"We consider an asynchronous network of $n$ parties connected to each other via secure channels, up to $t$ of which are byzantine. We study common coin tossing, a task where the parties try to agree on an unpredictable random value, with some chance of failure due to the byzantine parties' influence. Coin tossing is a well-known and often-studied task due to its use in byzantine agreement.\n  In this work, we present a committee-based method to transform strong (rarely failing) binary common coins into weaker ones that asymptotically require less communication. For any $k > 2$ and $\\varepsilon >"},"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":"2603.02071","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2026-03-02T16:58:44Z","cross_cats_sorted":["cs.CR"],"title_canon_sha256":"cecc0814873f8a8671568de79f95555fb08a52d13b97ec4220e882a5489cb098","abstract_canon_sha256":"23dd027849d5f0b70bd3f077fd1a384b4a3c5a91df805bca7a671c029b5a5e9b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-23T02:13:21.691792Z","signature_b64":"+60wwZiRwuo34vsGvNpbK9drR/8msSscHgaFkgE+ReUrp1yprwmJJG0grtYJOnogo24Ec4bcVg8TO1XCkVwODQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aaaa3ab1e4910781269724e70424b89914a3fc9b14ab72989658664e3dac1aab","last_reissued_at":"2026-06-23T02:13:21.691363Z","signature_status":"signed_v1","first_computed_at":"2026-06-23T02:13:21.691363Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Subcubic Coin Tossing in Asynchrony without PKI","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"cs.DC","authors_text":"Mose Mizrahi, Roger Wattenhofer","submitted_at":"2026-03-02T16:58:44Z","abstract_excerpt":"We consider an asynchronous network of $n$ parties connected to each other via secure channels, up to $t$ of which are byzantine. We study common coin tossing, a task where the parties try to agree on an unpredictable random value, with some chance of failure due to the byzantine parties' influence. Coin tossing is a well-known and often-studied task due to its use in byzantine agreement.\n  In this work, we present a committee-based method to transform strong (rarely failing) binary common coins into weaker ones that asymptotically require less communication. For any $k > 2$ and $\\varepsilon >"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2603.02071","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2603.02071/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2603.02071","created_at":"2026-06-23T02:13:21.691423+00:00"},{"alias_kind":"arxiv_version","alias_value":"2603.02071v2","created_at":"2026-06-23T02:13:21.691423+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2603.02071","created_at":"2026-06-23T02:13:21.691423+00:00"},{"alias_kind":"pith_short_12","alias_value":"VKVDVMPESEDY","created_at":"2026-06-23T02:13:21.691423+00:00"},{"alias_kind":"pith_short_16","alias_value":"VKVDVMPESEDYCJUX","created_at":"2026-06-23T02:13:21.691423+00:00"},{"alias_kind":"pith_short_8","alias_value":"VKVDVMPE","created_at":"2026-06-23T02:13:21.691423+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/VKVDVMPESEDYCJUXETTQIJFYTE","json":"https://pith.science/pith/VKVDVMPESEDYCJUXETTQIJFYTE.json","graph_json":"https://pith.science/api/pith-number/VKVDVMPESEDYCJUXETTQIJFYTE/graph.json","events_json":"https://pith.science/api/pith-number/VKVDVMPESEDYCJUXETTQIJFYTE/events.json","paper":"https://pith.science/paper/VKVDVMPE"},"agent_actions":{"view_html":"https://pith.science/pith/VKVDVMPESEDYCJUXETTQIJFYTE","download_json":"https://pith.science/pith/VKVDVMPESEDYCJUXETTQIJFYTE.json","view_paper":"https://pith.science/paper/VKVDVMPE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2603.02071&json=true","fetch_graph":"https://pith.science/api/pith-number/VKVDVMPESEDYCJUXETTQIJFYTE/graph.json","fetch_events":"https://pith.science/api/pith-number/VKVDVMPESEDYCJUXETTQIJFYTE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VKVDVMPESEDYCJUXETTQIJFYTE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VKVDVMPESEDYCJUXETTQIJFYTE/action/storage_attestation","attest_author":"https://pith.science/pith/VKVDVMPESEDYCJUXETTQIJFYTE/action/author_attestation","sign_citation":"https://pith.science/pith/VKVDVMPESEDYCJUXETTQIJFYTE/action/citation_signature","submit_replication":"https://pith.science/pith/VKVDVMPESEDYCJUXETTQIJFYTE/action/replication_record"}},"created_at":"2026-06-23T02:13:21.691423+00:00","updated_at":"2026-06-23T02:13:21.691423+00:00"}