{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:CLDNQ7AHFLSQDJNDZLFHH6NSD5","short_pith_number":"pith:CLDNQ7AH","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"},"canonical_sha256":"12c6d87c072ae501a5a3caca73f9b21f6069f09f4942975fd413addf25e2cce7","source":{"kind":"arxiv","id":"1811.08811","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.08811","created_at":"2026-05-17T23:57:02Z"},{"alias_kind":"arxiv_version","alias_value":"1811.08811v3","created_at":"2026-05-17T23:57:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.08811","created_at":"2026-05-17T23:57:02Z"},{"alias_kind":"pith_short_12","alias_value":"CLDNQ7AHFLSQ","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"CLDNQ7AHFLSQDJND","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"CLDNQ7AH","created_at":"2026-05-18T12:32:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:CLDNQ7AHFLSQDJNDZLFHH6NSD5","target":"record","payload":{"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"},"canonical_sha256":"12c6d87c072ae501a5a3caca73f9b21f6069f09f4942975fd413addf25e2cce7","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"},"source_kind":"arxiv","source_id":"1811.08811","source_version":3,"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-17T23:57:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EHn1twG+07t5xn9Edq+7AueVm5cuvxIgPm3ErzdJtYxZ73U5mzAIjhteu8M/F5cCprSam+NO4jolo9GXNWYVAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T19:22:13.200407Z"},"content_sha256":"1520cefa89a0ac9364a31284bc01bd0cb51f8f4388e4ee5442f676568e5d006e","schema_version":"1.0","event_id":"sha256:1520cefa89a0ac9364a31284bc01bd0cb51f8f4388e4ee5442f676568e5d006e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:CLDNQ7AHFLSQDJNDZLFHH6NSD5","target":"graph","payload":{"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"},"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-17T23:57:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wM6smu4lEpu0EuycNzRE4Q8LyfOiVWyTAYlsJRfAtLp8x53rNy6y8ddE0ckMBhESTokXBQYvt16N0zQa777gAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T19:22:13.200748Z"},"content_sha256":"485f69e81b121ff7bac0f4c72873d5d319100a130b02e2d82823edb255ba6dd3","schema_version":"1.0","event_id":"sha256:485f69e81b121ff7bac0f4c72873d5d319100a130b02e2d82823edb255ba6dd3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CLDNQ7AHFLSQDJNDZLFHH6NSD5/bundle.json","state_url":"https://pith.science/pith/CLDNQ7AHFLSQDJNDZLFHH6NSD5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CLDNQ7AHFLSQDJNDZLFHH6NSD5/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-06-24T19:22:13Z","links":{"resolver":"https://pith.science/pith/CLDNQ7AHFLSQDJNDZLFHH6NSD5","bundle":"https://pith.science/pith/CLDNQ7AHFLSQDJNDZLFHH6NSD5/bundle.json","state":"https://pith.science/pith/CLDNQ7AHFLSQDJNDZLFHH6NSD5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CLDNQ7AHFLSQDJNDZLFHH6NSD5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:CLDNQ7AHFLSQDJNDZLFHH6NSD5","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":"047965a113ec1ad2118d17d9d1b34e923f7d0091e4e56d0d4e205e1698f245ea","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-21T16:26:33Z","title_canon_sha256":"8abd0d6b02de0fa2eeb55aa1c0032801507ed48a9902c99ae98e1d93e742f42f"},"schema_version":"1.0","source":{"id":"1811.08811","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.08811","created_at":"2026-05-17T23:57:02Z"},{"alias_kind":"arxiv_version","alias_value":"1811.08811v3","created_at":"2026-05-17T23:57:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.08811","created_at":"2026-05-17T23:57:02Z"},{"alias_kind":"pith_short_12","alias_value":"CLDNQ7AHFLSQ","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"CLDNQ7AHFLSQDJND","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"CLDNQ7AH","created_at":"2026-05-18T12:32:16Z"}],"graph_snapshots":[{"event_id":"sha256:485f69e81b121ff7bac0f4c72873d5d319100a130b02e2d82823edb255ba6dd3","target":"graph","created_at":"2026-05-17T23:57:02Z","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 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","authors_text":"Mayuri Sridhar, Ronald L. Rivest","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-21T16:26:33Z","title":"$k$-Cut: A Simple Approximately-Uniform Method for Sampling Ballots in Post-Election Audits"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.08811","kind":"arxiv","version":3},"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:1520cefa89a0ac9364a31284bc01bd0cb51f8f4388e4ee5442f676568e5d006e","target":"record","created_at":"2026-05-17T23:57:02Z","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":"047965a113ec1ad2118d17d9d1b34e923f7d0091e4e56d0d4e205e1698f245ea","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-21T16:26:33Z","title_canon_sha256":"8abd0d6b02de0fa2eeb55aa1c0032801507ed48a9902c99ae98e1d93e742f42f"},"schema_version":"1.0","source":{"id":"1811.08811","kind":"arxiv","version":3}},"canonical_sha256":"12c6d87c072ae501a5a3caca73f9b21f6069f09f4942975fd413addf25e2cce7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"12c6d87c072ae501a5a3caca73f9b21f6069f09f4942975fd413addf25e2cce7","first_computed_at":"2026-05-17T23:57:02.454515Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:57:02.454515Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4dac5v39B9PJ+pWbNthxkFmZnomLLsNaP0MxMOH8251/AOZBBuHSB2+hs5FCks+r/RkCAXIvFJ6LG1b8bJUODQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:57:02.454932Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.08811","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1520cefa89a0ac9364a31284bc01bd0cb51f8f4388e4ee5442f676568e5d006e","sha256:485f69e81b121ff7bac0f4c72873d5d319100a130b02e2d82823edb255ba6dd3"],"state_sha256":"53f5ec5f25ce732df0512a841e149115a3d218b62eb4cd47eb5e9180453c1d5b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ORF6rbfu6jfPpxl72K5yVSOo0WFj9p1stftB+xHYqKI1/lQ0MmDyiSx1YCPxJApzF5mroH8EnZxt5lk6/7lVAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T19:22:13.202672Z","bundle_sha256":"60c1ff306340535728b9dccf74b4235e95e449eb41c3b2f577981fda3fe50a3a"}}