{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:XCPV2IWW7HUCDIRMUX7VGVLI5Z","short_pith_number":"pith:XCPV2IWW","schema_version":"1.0","canonical_sha256":"b89f5d22d6f9e821a22ca5ff535568ee5bf08cfe33e89c5fe8b637a3785cde9c","source":{"kind":"arxiv","id":"1712.10193","version":1},"attestation_state":"computed","paper":{"title":"A multi-candidate electronic voting scheme with unlimited participants","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Quanyu Zhao, Xi Zhao, Yong Ding","submitted_at":"2017-12-29T11:52:23Z","abstract_excerpt":"In this paper a new multi-candidate electronic voting scheme is constructed with unlimited participants. The main idea is to express a ballot to allow voting for up to k out of the m candidates and unlimited participants. The purpose of vote is to select more than one winner among $m$ candidates. Our result is complementary to the result by Sun peiyong$'$ s scheme, in the sense, their scheme is not amenable for large-scale electronic voting due to flaw of ballot structure. In our scheme the vote is split and hidden, and tallying is made for $G\\ddot{o}del$ encoding in decimal base without any t"},"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":"1712.10193","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2017-12-29T11:52:23Z","cross_cats_sorted":[],"title_canon_sha256":"8146c678926783b21fec26bfa6ef3c8506ee3bed57de8659393b0c58dbcef361","abstract_canon_sha256":"e6d55c63d7fca1df04bb9fa92ab38c20866e647d90e0bc0fc0d1acd9d0e186c9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:27:03.731647Z","signature_b64":"1g4b0p9UWqQOCPkweFnxNRnCFkUs3U1a5ixmU8tZa+V5w77dCKL5ERJRDj7Ij7cAvejil/1xgMSmEyYp8z2LBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b89f5d22d6f9e821a22ca5ff535568ee5bf08cfe33e89c5fe8b637a3785cde9c","last_reissued_at":"2026-05-18T00:27:03.731237Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:27:03.731237Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A multi-candidate electronic voting scheme with unlimited participants","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Quanyu Zhao, Xi Zhao, Yong Ding","submitted_at":"2017-12-29T11:52:23Z","abstract_excerpt":"In this paper a new multi-candidate electronic voting scheme is constructed with unlimited participants. The main idea is to express a ballot to allow voting for up to k out of the m candidates and unlimited participants. The purpose of vote is to select more than one winner among $m$ candidates. Our result is complementary to the result by Sun peiyong$'$ s scheme, in the sense, their scheme is not amenable for large-scale electronic voting due to flaw of ballot structure. In our scheme the vote is split and hidden, and tallying is made for $G\\ddot{o}del$ encoding in decimal base without any t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.10193","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1712.10193","created_at":"2026-05-18T00:27:03.731303+00:00"},{"alias_kind":"arxiv_version","alias_value":"1712.10193v1","created_at":"2026-05-18T00:27:03.731303+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.10193","created_at":"2026-05-18T00:27:03.731303+00:00"},{"alias_kind":"pith_short_12","alias_value":"XCPV2IWW7HUC","created_at":"2026-05-18T12:31:53.515858+00:00"},{"alias_kind":"pith_short_16","alias_value":"XCPV2IWW7HUCDIRM","created_at":"2026-05-18T12:31:53.515858+00:00"},{"alias_kind":"pith_short_8","alias_value":"XCPV2IWW","created_at":"2026-05-18T12:31:53.515858+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/XCPV2IWW7HUCDIRMUX7VGVLI5Z","json":"https://pith.science/pith/XCPV2IWW7HUCDIRMUX7VGVLI5Z.json","graph_json":"https://pith.science/api/pith-number/XCPV2IWW7HUCDIRMUX7VGVLI5Z/graph.json","events_json":"https://pith.science/api/pith-number/XCPV2IWW7HUCDIRMUX7VGVLI5Z/events.json","paper":"https://pith.science/paper/XCPV2IWW"},"agent_actions":{"view_html":"https://pith.science/pith/XCPV2IWW7HUCDIRMUX7VGVLI5Z","download_json":"https://pith.science/pith/XCPV2IWW7HUCDIRMUX7VGVLI5Z.json","view_paper":"https://pith.science/paper/XCPV2IWW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1712.10193&json=true","fetch_graph":"https://pith.science/api/pith-number/XCPV2IWW7HUCDIRMUX7VGVLI5Z/graph.json","fetch_events":"https://pith.science/api/pith-number/XCPV2IWW7HUCDIRMUX7VGVLI5Z/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XCPV2IWW7HUCDIRMUX7VGVLI5Z/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XCPV2IWW7HUCDIRMUX7VGVLI5Z/action/storage_attestation","attest_author":"https://pith.science/pith/XCPV2IWW7HUCDIRMUX7VGVLI5Z/action/author_attestation","sign_citation":"https://pith.science/pith/XCPV2IWW7HUCDIRMUX7VGVLI5Z/action/citation_signature","submit_replication":"https://pith.science/pith/XCPV2IWW7HUCDIRMUX7VGVLI5Z/action/replication_record"}},"created_at":"2026-05-18T00:27:03.731303+00:00","updated_at":"2026-05-18T00:27:03.731303+00:00"}