{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,5]],"date-time":"2025-11-05T21:18:19Z","timestamp":1762377499489,"version":"3.40.3"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031488054"},{"type":"electronic","value":"9783031488061"}],"license":[{"start":{"date-parts":[[2023,12,5]],"date-time":"2023-12-05T00:00:00Z","timestamp":1701734400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,12,5]],"date-time":"2023-12-05T00:00:00Z","timestamp":1701734400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-48806-1_7","type":"book-chapter","created":{"date-parts":[[2023,12,4]],"date-time":"2023-12-04T17:02:12Z","timestamp":1701709332000},"page":"95-109","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["COBRA: Comparison-Optimal Betting for\u00a0Risk-Limiting Audits"],"prefix":"10.1007","author":[{"given":"Jacob V.","family":"Spertus","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,12,5]]},"reference":[{"key":"7_CR1","unstructured":"Blom, M., Stuckey, P., Teague, V.: RAIRE: risk-limiting audits for IRV elections (2019). https:\/\/arxiv.org\/abs\/1903.08804"},{"key":"7_CR2","doi-asserted-by":"publisher","unstructured":"Glazer, A.K., Spertus, J.V., Stark, P.B.: More style, less work: card-style data decrease risk-limiting audit sample sizes. Digit. Threats 2(4), 1\u201315 (2021). ISSN: 2692-1626. https:\/\/doi.org\/10.1145\/3457907","DOI":"10.1145\/3457907"},{"key":"7_CR3","doi-asserted-by":"publisher","unstructured":"Kelly Jr., J.L.: A new interpretation of information rate. Bell Syst. Tech. J. 35(4), 917\u2013926 (1956). ISSN 1538-7305. https:\/\/doi.org\/10.1002\/j.1538-7305.1956.tb03809.x","DOI":"10.1002\/j.1538-7305.1956.tb03809.x"},{"key":"7_CR4","doi-asserted-by":"crossref","unstructured":"Lindeman, M., Stark, P.: A gentle introduction to risk-limiting audits. IEEE Secur. Priv. 10, 42\u201349 (2012). https:\/\/ieeexplore.ieee.org\/document\/6175884","DOI":"10.1109\/MSP.2012.56"},{"key":"7_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1007\/978-3-030-00419-4_12","volume-title":"Electronic Voting","author":"K Ottoboni","year":"2018","unstructured":"Ottoboni, K., Stark, P.B., Lindeman, M., McBurnett, N.: Risk-limiting audits by stratified union-intersection tests of elections (SUITE). In: Krimmer, R., et al. (eds.) E-Vote-ID 2018. LNCS, vol. 11143, pp. 174\u2013188. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-00419-4_12"},{"key":"7_CR6","doi-asserted-by":"crossref","unstructured":"Stark, P.: Conservative statistical post-election audits. Ann. Appl. Stat. 2, 550\u2013581 (2008). http:\/\/arxiv.org\/abs\/0807.4005","DOI":"10.1214\/08-AOAS161"},{"key":"7_CR7","doi-asserted-by":"publisher","first-page":"1005","DOI":"10.1109\/TIFS.2009.2034190","volume":"4","author":"P Stark","year":"2009","unstructured":"Stark, P.: Risk-limiting post-election audits: $$P$$-values from common probability inequalities. IEEE Trans. Inf. Forensics Secur. 4, 1005\u20131014 (2009)","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"7_CR8","doi-asserted-by":"crossref","unstructured":"Stark, P.: Efficient post-election audits of multiple contests: 2009 California tests. In: 2009 Conference on Empirical Legal Studies (2009). http:\/\/ssrn.com\/abstract=1443314","DOI":"10.2139\/ssrn.1443314"},{"key":"7_CR9","unstructured":"Stark, P.: Super-simple simultaneous single-ballot risk-limiting audits. In: Proceedings of the 2010 Electronic Voting Technology Workshop\/Workshop on Trustworthy Elections (EVT\/WOTE 2010). USENIX (2010). http:\/\/www.usenix.org\/events\/evtwote10\/tech\/full_papers\/Stark.pdf"},{"key":"7_CR10","doi-asserted-by":"publisher","unstructured":"Stark, P.B.: Sets of half-average nulls generate risk-limiting audits: SHANGRLA. In: Bernhard, M., et al. (eds.) FC 2020. LNCS, vol. 12063, pp. 319\u2013336. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-54455-3_23. Preprint: http:\/\/arxiv.org\/abs\/1911.10035","DOI":"10.1007\/978-3-030-54455-3_23"},{"key":"7_CR11","doi-asserted-by":"crossref","unstructured":"Stark, P.: ALPHA: audit that learns from previously hand-audited ballots. Ann. Appl. Stat. 17(1), 641\u2013679 (2023). Preprint: https:\/\/arxiv.org\/abs\/2201.02707","DOI":"10.1214\/22-AOAS1646"},{"key":"7_CR12","unstructured":"Ville, J.: \u00c9tude critique de la notion de collectif (1939). http:\/\/eudml.org\/doc\/192893"},{"key":"7_CR13","unstructured":"Waudby-Smith, I., Ramdas, A.: Estimating means of bounded random variables by betting (2020). https:\/\/arxiv.org\/abs\/2010.09686. https:\/\/rss.org.uk\/RSS\/media\/File-library\/Events\/Discussion%20meetings\/Estimating-means-of-bounded-random-variables-by-betting.pdf"},{"key":"7_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1007\/978-3-030-86942-7_9","volume-title":"Electronic Voting","author":"I Waudby-Smith","year":"2021","unstructured":"Waudby-Smith, I., Stark, P.B., Ramdas, A.: RiLACS: risk limiting audits via confidence sequences. In: Krimmer, R., et al. (eds.) E-Vote-ID 2021. LNCS, vol. 12900, pp. 124\u2013139. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-86942-7_9"}],"container-title":["Lecture Notes in Computer Science","Financial Cryptography and Data Security. FC 2023 International Workshops"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-48806-1_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,4]],"date-time":"2023-12-04T17:02:56Z","timestamp":1701709376000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-48806-1_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,5]]},"ISBN":["9783031488054","9783031488061"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-48806-1_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023,12,5]]},"assertion":[{"value":"5 December 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"Code implementing our simulations and generating our figures and tables is available on Github at .","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Code"}},{"value":"FC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Financial Cryptography and Data Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bol, Bra\u010d","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Croatia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 May 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 May 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"fc2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/fc23.ifca.ai\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"HotCRP","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"182","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"39","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"21% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.5","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"For the workshops 7 full papers have been accepted from 18 submissions.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}