{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:AXFJICDER6ANNUG2SNHGNA5SWZ","short_pith_number":"pith:AXFJICDE","schema_version":"1.0","canonical_sha256":"05ca9408648f80d6d0da934e6683b2b6453b2b8e1c20118de95d207c60e11352","source":{"kind":"arxiv","id":"1402.1732","version":3},"attestation_state":"computed","paper":{"title":"Dining Cryptographers with 0.924 Verifiable Collision Resolution","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Christian Franck","submitted_at":"2014-02-07T18:53:40Z","abstract_excerpt":"The dining cryptographers protocol implements a multiple access channel in which senders and recipients are anonymous. A problem is that a malicious participant can disrupt communication by deliberately creating collisions. We propose a computationally secure dining cryptographers protocol with collision resolution that achieves a maximum stable throughput of 0.924 messages per round and which allows to easily detect disruptors."},"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":"1402.1732","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2014-02-07T18:53:40Z","cross_cats_sorted":[],"title_canon_sha256":"69cecf05101982fbf0398b53934b5726aeb085ea8cf04a981d94b1869fe42926","abstract_canon_sha256":"4b52a85a220a0242356e5a4eba62b962480ede23d10222b8f6999e89a3f6e71e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:30:08.464580Z","signature_b64":"GEnW/w5d5lvt5yXyCxh36ty8Ob/N4s3qay9XOAxT00K/wmOy6XZ6kABFD32KZY2FXnczDS2PeDHo2kcOZB96DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"05ca9408648f80d6d0da934e6683b2b6453b2b8e1c20118de95d207c60e11352","last_reissued_at":"2026-05-18T02:30:08.464011Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:30:08.464011Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Dining Cryptographers with 0.924 Verifiable Collision Resolution","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Christian Franck","submitted_at":"2014-02-07T18:53:40Z","abstract_excerpt":"The dining cryptographers protocol implements a multiple access channel in which senders and recipients are anonymous. A problem is that a malicious participant can disrupt communication by deliberately creating collisions. We propose a computationally secure dining cryptographers protocol with collision resolution that achieves a maximum stable throughput of 0.924 messages per round and which allows to easily detect disruptors."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.1732","kind":"arxiv","version":3},"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":"1402.1732","created_at":"2026-05-18T02:30:08.464080+00:00"},{"alias_kind":"arxiv_version","alias_value":"1402.1732v3","created_at":"2026-05-18T02:30:08.464080+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.1732","created_at":"2026-05-18T02:30:08.464080+00:00"},{"alias_kind":"pith_short_12","alias_value":"AXFJICDER6AN","created_at":"2026-05-18T12:28:19.803747+00:00"},{"alias_kind":"pith_short_16","alias_value":"AXFJICDER6ANNUG2","created_at":"2026-05-18T12:28:19.803747+00:00"},{"alias_kind":"pith_short_8","alias_value":"AXFJICDE","created_at":"2026-05-18T12:28:19.803747+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/AXFJICDER6ANNUG2SNHGNA5SWZ","json":"https://pith.science/pith/AXFJICDER6ANNUG2SNHGNA5SWZ.json","graph_json":"https://pith.science/api/pith-number/AXFJICDER6ANNUG2SNHGNA5SWZ/graph.json","events_json":"https://pith.science/api/pith-number/AXFJICDER6ANNUG2SNHGNA5SWZ/events.json","paper":"https://pith.science/paper/AXFJICDE"},"agent_actions":{"view_html":"https://pith.science/pith/AXFJICDER6ANNUG2SNHGNA5SWZ","download_json":"https://pith.science/pith/AXFJICDER6ANNUG2SNHGNA5SWZ.json","view_paper":"https://pith.science/paper/AXFJICDE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1402.1732&json=true","fetch_graph":"https://pith.science/api/pith-number/AXFJICDER6ANNUG2SNHGNA5SWZ/graph.json","fetch_events":"https://pith.science/api/pith-number/AXFJICDER6ANNUG2SNHGNA5SWZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AXFJICDER6ANNUG2SNHGNA5SWZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AXFJICDER6ANNUG2SNHGNA5SWZ/action/storage_attestation","attest_author":"https://pith.science/pith/AXFJICDER6ANNUG2SNHGNA5SWZ/action/author_attestation","sign_citation":"https://pith.science/pith/AXFJICDER6ANNUG2SNHGNA5SWZ/action/citation_signature","submit_replication":"https://pith.science/pith/AXFJICDER6ANNUG2SNHGNA5SWZ/action/replication_record"}},"created_at":"2026-05-18T02:30:08.464080+00:00","updated_at":"2026-05-18T02:30:08.464080+00:00"}