{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:VKVDVMPESEDYCJUXETTQIJFYTE","short_pith_number":"pith:VKVDVMPE","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"},"canonical_sha256":"aaaa3ab1e4910781269724e70424b89914a3fc9b14ab72989658664e3dac1aab","source":{"kind":"arxiv","id":"2603.02071","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2603.02071","created_at":"2026-06-23T02:13:21Z"},{"alias_kind":"arxiv_version","alias_value":"2603.02071v2","created_at":"2026-06-23T02:13:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2603.02071","created_at":"2026-06-23T02:13:21Z"},{"alias_kind":"pith_short_12","alias_value":"VKVDVMPESEDY","created_at":"2026-06-23T02:13:21Z"},{"alias_kind":"pith_short_16","alias_value":"VKVDVMPESEDYCJUX","created_at":"2026-06-23T02:13:21Z"},{"alias_kind":"pith_short_8","alias_value":"VKVDVMPE","created_at":"2026-06-23T02:13:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:VKVDVMPESEDYCJUXETTQIJFYTE","target":"record","payload":{"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"},"canonical_sha256":"aaaa3ab1e4910781269724e70424b89914a3fc9b14ab72989658664e3dac1aab","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"},"source_kind":"arxiv","source_id":"2603.02071","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-23T02:13:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P9hMW1OGVKWWluZoCqc9tSe5zH/GyJ+UpoP8wYdU+DmKu005tjQd1rH4mL7Md5NG2zdmOwIpwUzYQVRimGkLBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T07:21:36.504692Z"},"content_sha256":"b7d9106eaded3c1bf8f6d54b64797dd91f45fbfab0799bf8c8f71800c5a4e4f3","schema_version":"1.0","event_id":"sha256:b7d9106eaded3c1bf8f6d54b64797dd91f45fbfab0799bf8c8f71800c5a4e4f3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:VKVDVMPESEDYCJUXETTQIJFYTE","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-23T02:13:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lPm6Z1qbw087OayOnblzS7WGrhaAD3aO0PFmDZIYHGaR1OwpVQoe12nJUpSh6HDUllzRPCJSPvxYqGB5wAIYAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T07:21:36.505205Z"},"content_sha256":"bd4f3e9d2252f909dbc56772f86b134de925cc5f58802b1b58eab0e4522cce2b","schema_version":"1.0","event_id":"sha256:bd4f3e9d2252f909dbc56772f86b134de925cc5f58802b1b58eab0e4522cce2b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VKVDVMPESEDYCJUXETTQIJFYTE/bundle.json","state_url":"https://pith.science/pith/VKVDVMPESEDYCJUXETTQIJFYTE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VKVDVMPESEDYCJUXETTQIJFYTE/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-20T07:21:36Z","links":{"resolver":"https://pith.science/pith/VKVDVMPESEDYCJUXETTQIJFYTE","bundle":"https://pith.science/pith/VKVDVMPESEDYCJUXETTQIJFYTE/bundle.json","state":"https://pith.science/pith/VKVDVMPESEDYCJUXETTQIJFYTE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VKVDVMPESEDYCJUXETTQIJFYTE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:VKVDVMPESEDYCJUXETTQIJFYTE","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"23dd027849d5f0b70bd3f077fd1a384b4a3c5a91df805bca7a671c029b5a5e9b","cross_cats_sorted":["cs.CR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2026-03-02T16:58:44Z","title_canon_sha256":"cecc0814873f8a8671568de79f95555fb08a52d13b97ec4220e882a5489cb098"},"schema_version":"1.0","source":{"id":"2603.02071","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2603.02071","created_at":"2026-06-23T02:13:21Z"},{"alias_kind":"arxiv_version","alias_value":"2603.02071v2","created_at":"2026-06-23T02:13:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2603.02071","created_at":"2026-06-23T02:13:21Z"},{"alias_kind":"pith_short_12","alias_value":"VKVDVMPESEDY","created_at":"2026-06-23T02:13:21Z"},{"alias_kind":"pith_short_16","alias_value":"VKVDVMPESEDYCJUX","created_at":"2026-06-23T02:13:21Z"},{"alias_kind":"pith_short_8","alias_value":"VKVDVMPE","created_at":"2026-06-23T02:13:21Z"}],"graph_snapshots":[{"event_id":"sha256:bd4f3e9d2252f909dbc56772f86b134de925cc5f58802b1b58eab0e4522cce2b","target":"graph","created_at":"2026-06-23T02:13:21Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2603.02071/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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 >","authors_text":"Mose Mizrahi, Roger Wattenhofer","cross_cats":["cs.CR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2026-03-02T16:58:44Z","title":"Subcubic Coin Tossing in Asynchrony without PKI"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2603.02071","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:b7d9106eaded3c1bf8f6d54b64797dd91f45fbfab0799bf8c8f71800c5a4e4f3","target":"record","created_at":"2026-06-23T02:13:21Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"23dd027849d5f0b70bd3f077fd1a384b4a3c5a91df805bca7a671c029b5a5e9b","cross_cats_sorted":["cs.CR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2026-03-02T16:58:44Z","title_canon_sha256":"cecc0814873f8a8671568de79f95555fb08a52d13b97ec4220e882a5489cb098"},"schema_version":"1.0","source":{"id":"2603.02071","kind":"arxiv","version":2}},"canonical_sha256":"aaaa3ab1e4910781269724e70424b89914a3fc9b14ab72989658664e3dac1aab","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"aaaa3ab1e4910781269724e70424b89914a3fc9b14ab72989658664e3dac1aab","first_computed_at":"2026-06-23T02:13:21.691363Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-23T02:13:21.691363Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+60wwZiRwuo34vsGvNpbK9drR/8msSscHgaFkgE+ReUrp1yprwmJJG0grtYJOnogo24Ec4bcVg8TO1XCkVwODQ==","signature_status":"signed_v1","signed_at":"2026-06-23T02:13:21.691792Z","signed_message":"canonical_sha256_bytes"},"source_id":"2603.02071","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b7d9106eaded3c1bf8f6d54b64797dd91f45fbfab0799bf8c8f71800c5a4e4f3","sha256:bd4f3e9d2252f909dbc56772f86b134de925cc5f58802b1b58eab0e4522cce2b"],"state_sha256":"b552f089b25465053f058b05511143423eb5215cde7e28bb258ec71c73f153bd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"clwMJ0Yd1vU/gkfJOMkwIn18J1Azir2Ev8nwdKvM0sjJuU0qWLN5ys+adaU21+5R5kqqZ1n7LH/+KQBjKxJKCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-20T07:21:36.509030Z","bundle_sha256":"5d3ec3ce505dc8b8b4c01737e012edca6ee6c8d507eb47de6130ee1d6d8dadce"}}