{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:CLDNQ7AHFLSQDJNDZLFHH6NSD5","short_pith_number":"pith:CLDNQ7AH","schema_version":"1.0","canonical_sha256":"12c6d87c072ae501a5a3caca73f9b21f6069f09f4942975fd413addf25e2cce7","source":{"kind":"arxiv","id":"1811.08811","version":3},"attestation_state":"computed","paper":{"title":"$k$-Cut: A Simple Approximately-Uniform Method for Sampling Ballots in Post-Election Audits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Mayuri Sridhar, Ronald L. Rivest","submitted_at":"2018-11-21T16:26:33Z","abstract_excerpt":"We present an approximate sampling framework and discuss how risk-limiting audits can compensate for these approximations, while maintaining their \"risk-limiting\" properties. Our framework is general and can compensate for counting mistakes made during audits.\n  Moreover, we present and analyze a simple approximate sampling method,\"$k$-cut\", for picking a ballot randomly from a stack, without counting. Our method involves doing $k$ \"cuts\", each involving moving a random portion of ballots from the top to the bottom of the stack, and then picking the ballot on top. Unlike conventional methods o"},"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":"1811.08811","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-21T16:26:33Z","cross_cats_sorted":[],"title_canon_sha256":"8abd0d6b02de0fa2eeb55aa1c0032801507ed48a9902c99ae98e1d93e742f42f","abstract_canon_sha256":"047965a113ec1ad2118d17d9d1b34e923f7d0091e4e56d0d4e205e1698f245ea"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:57:02.454932Z","signature_b64":"4dac5v39B9PJ+pWbNthxkFmZnomLLsNaP0MxMOH8251/AOZBBuHSB2+hs5FCks+r/RkCAXIvFJ6LG1b8bJUODQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"12c6d87c072ae501a5a3caca73f9b21f6069f09f4942975fd413addf25e2cce7","last_reissued_at":"2026-05-17T23:57:02.454515Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:57:02.454515Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"$k$-Cut: A Simple Approximately-Uniform Method for Sampling Ballots in Post-Election Audits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Mayuri Sridhar, Ronald L. Rivest","submitted_at":"2018-11-21T16:26:33Z","abstract_excerpt":"We present an approximate sampling framework and discuss how risk-limiting audits can compensate for these approximations, while maintaining their \"risk-limiting\" properties. Our framework is general and can compensate for counting mistakes made during audits.\n  Moreover, we present and analyze a simple approximate sampling method,\"$k$-cut\", for picking a ballot randomly from a stack, without counting. Our method involves doing $k$ \"cuts\", each involving moving a random portion of ballots from the top to the bottom of the stack, and then picking the ballot on top. Unlike conventional methods o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.08811","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":"1811.08811","created_at":"2026-05-17T23:57:02.454576+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.08811v3","created_at":"2026-05-17T23:57:02.454576+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.08811","created_at":"2026-05-17T23:57:02.454576+00:00"},{"alias_kind":"pith_short_12","alias_value":"CLDNQ7AHFLSQ","created_at":"2026-05-18T12:32:16.446611+00:00"},{"alias_kind":"pith_short_16","alias_value":"CLDNQ7AHFLSQDJND","created_at":"2026-05-18T12:32:16.446611+00:00"},{"alias_kind":"pith_short_8","alias_value":"CLDNQ7AH","created_at":"2026-05-18T12:32:16.446611+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/CLDNQ7AHFLSQDJNDZLFHH6NSD5","json":"https://pith.science/pith/CLDNQ7AHFLSQDJNDZLFHH6NSD5.json","graph_json":"https://pith.science/api/pith-number/CLDNQ7AHFLSQDJNDZLFHH6NSD5/graph.json","events_json":"https://pith.science/api/pith-number/CLDNQ7AHFLSQDJNDZLFHH6NSD5/events.json","paper":"https://pith.science/paper/CLDNQ7AH"},"agent_actions":{"view_html":"https://pith.science/pith/CLDNQ7AHFLSQDJNDZLFHH6NSD5","download_json":"https://pith.science/pith/CLDNQ7AHFLSQDJNDZLFHH6NSD5.json","view_paper":"https://pith.science/paper/CLDNQ7AH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.08811&json=true","fetch_graph":"https://pith.science/api/pith-number/CLDNQ7AHFLSQDJNDZLFHH6NSD5/graph.json","fetch_events":"https://pith.science/api/pith-number/CLDNQ7AHFLSQDJNDZLFHH6NSD5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CLDNQ7AHFLSQDJNDZLFHH6NSD5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CLDNQ7AHFLSQDJNDZLFHH6NSD5/action/storage_attestation","attest_author":"https://pith.science/pith/CLDNQ7AHFLSQDJNDZLFHH6NSD5/action/author_attestation","sign_citation":"https://pith.science/pith/CLDNQ7AHFLSQDJNDZLFHH6NSD5/action/citation_signature","submit_replication":"https://pith.science/pith/CLDNQ7AHFLSQDJNDZLFHH6NSD5/action/replication_record"}},"created_at":"2026-05-17T23:57:02.454576+00:00","updated_at":"2026-05-17T23:57:02.454576+00:00"}