{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:F7MAFEJB4YNQIDMRJAYIXEAUOB","short_pith_number":"pith:F7MAFEJB","canonical_record":{"source":{"id":"1011.5242","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2010-11-23T21:33:50Z","cross_cats_sorted":[],"title_canon_sha256":"42e51e264ddff560927c5210435eb2abdefd094c618d10eac10fcb1fd3b392c7","abstract_canon_sha256":"eeea6e761c708169bf5028d07812f2a256d91bf76f9c6e0810facf586455b741"},"schema_version":"1.0"},"canonical_sha256":"2fd8029121e61b040d9148308b901470699d6376a5c1a79751bcc8aad1427c07","source":{"kind":"arxiv","id":"1011.5242","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.5242","created_at":"2026-05-18T04:34:47Z"},{"alias_kind":"arxiv_version","alias_value":"1011.5242v1","created_at":"2026-05-18T04:34:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.5242","created_at":"2026-05-18T04:34:47Z"},{"alias_kind":"pith_short_12","alias_value":"F7MAFEJB4YNQ","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_16","alias_value":"F7MAFEJB4YNQIDMR","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_8","alias_value":"F7MAFEJB","created_at":"2026-05-18T12:26:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:F7MAFEJB4YNQIDMRJAYIXEAUOB","target":"record","payload":{"canonical_record":{"source":{"id":"1011.5242","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2010-11-23T21:33:50Z","cross_cats_sorted":[],"title_canon_sha256":"42e51e264ddff560927c5210435eb2abdefd094c618d10eac10fcb1fd3b392c7","abstract_canon_sha256":"eeea6e761c708169bf5028d07812f2a256d91bf76f9c6e0810facf586455b741"},"schema_version":"1.0"},"canonical_sha256":"2fd8029121e61b040d9148308b901470699d6376a5c1a79751bcc8aad1427c07","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:34:47.713762Z","signature_b64":"3EZc72XdIHj4UiKIC85FF9PhQpYgcOJWUOwtGhKJ1J2Z+ostbjPp1zLR4RFe4xCHHdvF5KXwdXk85uZguOhPBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2fd8029121e61b040d9148308b901470699d6376a5c1a79751bcc8aad1427c07","last_reissued_at":"2026-05-18T04:34:47.713257Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:34:47.713257Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1011.5242","source_version":1,"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-05-18T04:34:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"D4FcIqYZvih9ewrFzafC5ba8eP4NKL8slN1PocKx2//JOPQBdd6bjpQjuhU2sFwKVtj//MWEGnx9O+N4eO1yBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T20:41:10.420443Z"},"content_sha256":"e2ad561d414215970f20d29eec8484e3f04b480e25ac097068380ba25edc9844","schema_version":"1.0","event_id":"sha256:e2ad561d414215970f20d29eec8484e3f04b480e25ac097068380ba25edc9844"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:F7MAFEJB4YNQIDMRJAYIXEAUOB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Exact, Efficient and Information-Theoretically Secure Voting with an Arbitrary Number of Cheaters","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Alain Tapp, Anne Broadbent, Stacey Jeffery","submitted_at":"2010-11-23T21:33:50Z","abstract_excerpt":"We present three voting protocols with unconditional privacy and correctness, without assuming any bound on the number of corrupt participants. All protocols have polynomial complexity and require private channels and a simultaneous broadcast channel. Unlike previously proposed protocols in this model, the protocols that we present deterministically output the exact tally. Our first protocol is a basic voting scheme which allows voters to interact in order to compute the tally. Privacy of the ballot is unconditional in the sense that regardless of the behavior of the dishonest participants not"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.5242","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":""},"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-05-18T04:34:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gnhQeC6EZi4MMEgLahBo/WYZdKxp762NL/KXnXIhU4/GndB+QJQOljoZ940+GQ53PPcFguAMYsPcC4yUzJfrAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T20:41:10.421117Z"},"content_sha256":"71ef7eb88ee29c18a66258690fbe72fea14fb18252f6b906452bd4f0f98fad36","schema_version":"1.0","event_id":"sha256:71ef7eb88ee29c18a66258690fbe72fea14fb18252f6b906452bd4f0f98fad36"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/F7MAFEJB4YNQIDMRJAYIXEAUOB/bundle.json","state_url":"https://pith.science/pith/F7MAFEJB4YNQIDMRJAYIXEAUOB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/F7MAFEJB4YNQIDMRJAYIXEAUOB/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-05-27T20:41:10Z","links":{"resolver":"https://pith.science/pith/F7MAFEJB4YNQIDMRJAYIXEAUOB","bundle":"https://pith.science/pith/F7MAFEJB4YNQIDMRJAYIXEAUOB/bundle.json","state":"https://pith.science/pith/F7MAFEJB4YNQIDMRJAYIXEAUOB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/F7MAFEJB4YNQIDMRJAYIXEAUOB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:F7MAFEJB4YNQIDMRJAYIXEAUOB","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":"eeea6e761c708169bf5028d07812f2a256d91bf76f9c6e0810facf586455b741","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2010-11-23T21:33:50Z","title_canon_sha256":"42e51e264ddff560927c5210435eb2abdefd094c618d10eac10fcb1fd3b392c7"},"schema_version":"1.0","source":{"id":"1011.5242","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.5242","created_at":"2026-05-18T04:34:47Z"},{"alias_kind":"arxiv_version","alias_value":"1011.5242v1","created_at":"2026-05-18T04:34:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.5242","created_at":"2026-05-18T04:34:47Z"},{"alias_kind":"pith_short_12","alias_value":"F7MAFEJB4YNQ","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_16","alias_value":"F7MAFEJB4YNQIDMR","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_8","alias_value":"F7MAFEJB","created_at":"2026-05-18T12:26:06Z"}],"graph_snapshots":[{"event_id":"sha256:71ef7eb88ee29c18a66258690fbe72fea14fb18252f6b906452bd4f0f98fad36","target":"graph","created_at":"2026-05-18T04:34:47Z","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"},"paper":{"abstract_excerpt":"We present three voting protocols with unconditional privacy and correctness, without assuming any bound on the number of corrupt participants. All protocols have polynomial complexity and require private channels and a simultaneous broadcast channel. Unlike previously proposed protocols in this model, the protocols that we present deterministically output the exact tally. Our first protocol is a basic voting scheme which allows voters to interact in order to compute the tally. Privacy of the ballot is unconditional in the sense that regardless of the behavior of the dishonest participants not","authors_text":"Alain Tapp, Anne Broadbent, Stacey Jeffery","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2010-11-23T21:33:50Z","title":"Exact, Efficient and Information-Theoretically Secure Voting with an Arbitrary Number of Cheaters"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.5242","kind":"arxiv","version":1},"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:e2ad561d414215970f20d29eec8484e3f04b480e25ac097068380ba25edc9844","target":"record","created_at":"2026-05-18T04:34:47Z","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":"eeea6e761c708169bf5028d07812f2a256d91bf76f9c6e0810facf586455b741","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2010-11-23T21:33:50Z","title_canon_sha256":"42e51e264ddff560927c5210435eb2abdefd094c618d10eac10fcb1fd3b392c7"},"schema_version":"1.0","source":{"id":"1011.5242","kind":"arxiv","version":1}},"canonical_sha256":"2fd8029121e61b040d9148308b901470699d6376a5c1a79751bcc8aad1427c07","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2fd8029121e61b040d9148308b901470699d6376a5c1a79751bcc8aad1427c07","first_computed_at":"2026-05-18T04:34:47.713257Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:34:47.713257Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3EZc72XdIHj4UiKIC85FF9PhQpYgcOJWUOwtGhKJ1J2Z+ostbjPp1zLR4RFe4xCHHdvF5KXwdXk85uZguOhPBg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:34:47.713762Z","signed_message":"canonical_sha256_bytes"},"source_id":"1011.5242","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e2ad561d414215970f20d29eec8484e3f04b480e25ac097068380ba25edc9844","sha256:71ef7eb88ee29c18a66258690fbe72fea14fb18252f6b906452bd4f0f98fad36"],"state_sha256":"66230493f273a561c36a2cdb3d3996f0b1f670f37869cef78d0b92f8e86ae6bd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XzS7/Jpbes0G72kkO/JjQa7V5+22KjloURDWlzWf0yidQCshEmXTXT/eU2xuj/qnElO5uY6yLgOoHd9HU0E4DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T20:41:10.424572Z","bundle_sha256":"d4b0b542a303b6404623b24f52bf0ed0b669ff65c8ac84b98b1ab86ddcffebf4"}}