{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:SANLPXAJZLSG3JWN4TDMP4BARR","short_pith_number":"pith:SANLPXAJ","schema_version":"1.0","canonical_sha256":"901ab7dc09cae46da6cde4c6c7f0208c47310d51d4b5fbb40e09cbcf58ca19cc","source":{"kind":"arxiv","id":"2205.11878","version":1},"attestation_state":"computed","paper":{"title":"Distributed Randomness from Approximate Agreement","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Andrei Tonkikh, Luciano Freitas, Petr Kuznetsov","submitted_at":"2022-05-24T07:54:54Z","abstract_excerpt":"Randomisation is a critical tool in designing distributed systems. The common coin primitive, enabling the system members to agree on an unpredictable random number, has proven to be particularly useful. We observe, however, that it is impossible to implement a truly random common coin protocol in a fault-prone asynchronous system.\n  To circumvent this impossibility, we introduce two relaxations of the perfect common coin: (1) approximate common coin generating random numbers that are close to each other; and (2) Monte Carlo common coin generating a common random number with an arbitrarily sma"},"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":"2205.11878","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2022-05-24T07:54:54Z","cross_cats_sorted":[],"title_canon_sha256":"4a5eb33fb9175f8e244097f7ee080d1585f15c8786585a586b68a6a16eb469fa","abstract_canon_sha256":"cbb40ff97ab31cc3c1ff113a3dea4a484dec385e0685577d4e7d5654cc4e23ed"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:26:09.263654Z","signature_b64":"nYNGxnMr4TsPshez8OPCiNe64na8QPsP4irAxf71bto5Dbn+Y1DtR7wUzw9dN8lNq70+nR9+VKQCBPBYagejAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"901ab7dc09cae46da6cde4c6c7f0208c47310d51d4b5fbb40e09cbcf58ca19cc","last_reissued_at":"2026-07-05T04:26:09.263234Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:26:09.263234Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distributed Randomness from Approximate Agreement","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Andrei Tonkikh, Luciano Freitas, Petr Kuznetsov","submitted_at":"2022-05-24T07:54:54Z","abstract_excerpt":"Randomisation is a critical tool in designing distributed systems. The common coin primitive, enabling the system members to agree on an unpredictable random number, has proven to be particularly useful. We observe, however, that it is impossible to implement a truly random common coin protocol in a fault-prone asynchronous system.\n  To circumvent this impossibility, we introduce two relaxations of the perfect common coin: (1) approximate common coin generating random numbers that are close to each other; and (2) Monte Carlo common coin generating a common random number with an arbitrarily sma"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2205.11878","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2205.11878/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":"2205.11878","created_at":"2026-07-05T04:26:09.263284+00:00"},{"alias_kind":"arxiv_version","alias_value":"2205.11878v1","created_at":"2026-07-05T04:26:09.263284+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2205.11878","created_at":"2026-07-05T04:26:09.263284+00:00"},{"alias_kind":"pith_short_12","alias_value":"SANLPXAJZLSG","created_at":"2026-07-05T04:26:09.263284+00:00"},{"alias_kind":"pith_short_16","alias_value":"SANLPXAJZLSG3JWN","created_at":"2026-07-05T04:26:09.263284+00:00"},{"alias_kind":"pith_short_8","alias_value":"SANLPXAJ","created_at":"2026-07-05T04:26:09.263284+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/SANLPXAJZLSG3JWN4TDMP4BARR","json":"https://pith.science/pith/SANLPXAJZLSG3JWN4TDMP4BARR.json","graph_json":"https://pith.science/api/pith-number/SANLPXAJZLSG3JWN4TDMP4BARR/graph.json","events_json":"https://pith.science/api/pith-number/SANLPXAJZLSG3JWN4TDMP4BARR/events.json","paper":"https://pith.science/paper/SANLPXAJ"},"agent_actions":{"view_html":"https://pith.science/pith/SANLPXAJZLSG3JWN4TDMP4BARR","download_json":"https://pith.science/pith/SANLPXAJZLSG3JWN4TDMP4BARR.json","view_paper":"https://pith.science/paper/SANLPXAJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2205.11878&json=true","fetch_graph":"https://pith.science/api/pith-number/SANLPXAJZLSG3JWN4TDMP4BARR/graph.json","fetch_events":"https://pith.science/api/pith-number/SANLPXAJZLSG3JWN4TDMP4BARR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SANLPXAJZLSG3JWN4TDMP4BARR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SANLPXAJZLSG3JWN4TDMP4BARR/action/storage_attestation","attest_author":"https://pith.science/pith/SANLPXAJZLSG3JWN4TDMP4BARR/action/author_attestation","sign_citation":"https://pith.science/pith/SANLPXAJZLSG3JWN4TDMP4BARR/action/citation_signature","submit_replication":"https://pith.science/pith/SANLPXAJZLSG3JWN4TDMP4BARR/action/replication_record"}},"created_at":"2026-07-05T04:26:09.263284+00:00","updated_at":"2026-07-05T04:26:09.263284+00:00"}