{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:JHYPESS2X4VUIMXIVVBZPDGP7D","short_pith_number":"pith:JHYPESS2","canonical_record":{"source":{"id":"1109.3401","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-09-15T16:58:28Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"c0b7382140e6fe3143a6e8f6d9734251a6358cafe7724915ef4f2177d0e4ab9e","abstract_canon_sha256":"e9b7730d005f29ebf658b962efea42ce5d1415f4362b56969fc55a6cf5359004"},"schema_version":"1.0"},"canonical_sha256":"49f0f24a5abf2b4432e8ad43978ccff8dca38f6e66f087803fc9752b180e91dc","source":{"kind":"arxiv","id":"1109.3401","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.3401","created_at":"2026-05-18T03:41:58Z"},{"alias_kind":"arxiv_version","alias_value":"1109.3401v2","created_at":"2026-05-18T03:41:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.3401","created_at":"2026-05-18T03:41:58Z"},{"alias_kind":"pith_short_12","alias_value":"JHYPESS2X4VU","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_16","alias_value":"JHYPESS2X4VUIMXI","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_8","alias_value":"JHYPESS2","created_at":"2026-05-18T12:26:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:JHYPESS2X4VUIMXIVVBZPDGP7D","target":"record","payload":{"canonical_record":{"source":{"id":"1109.3401","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-09-15T16:58:28Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"c0b7382140e6fe3143a6e8f6d9734251a6358cafe7724915ef4f2177d0e4ab9e","abstract_canon_sha256":"e9b7730d005f29ebf658b962efea42ce5d1415f4362b56969fc55a6cf5359004"},"schema_version":"1.0"},"canonical_sha256":"49f0f24a5abf2b4432e8ad43978ccff8dca38f6e66f087803fc9752b180e91dc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:41:58.924537Z","signature_b64":"9mB3+6NarG5FS1T4cg14+3estiec2hNHp7GeGfhkwUzhsLdOMlBP7Oz3OA8JeT9BMAlxEFI/htWnFzTDU/kjDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"49f0f24a5abf2b4432e8ad43978ccff8dca38f6e66f087803fc9752b180e91dc","last_reissued_at":"2026-05-18T03:41:58.923561Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:41:58.923561Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1109.3401","source_version":2,"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-18T03:41:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EHTpHp1ibKGXoNncDDYoeuUV3fIjWWbKomMXLbNkVHIlRyFeVHlicUu3b8eJz6lE2KnIH6UxrZIedo3FA7kpBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T08:33:58.370297Z"},"content_sha256":"d71ef1dc2dafa506ecdfed214f10d1c3ac6a2eb2fb835181efcaa0560bb4957b","schema_version":"1.0","event_id":"sha256:d71ef1dc2dafa506ecdfed214f10d1c3ac6a2eb2fb835181efcaa0560bb4957b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:JHYPESS2X4VUIMXIVVBZPDGP7D","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Max-Throughput for (Conservative) k-of-n Testing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Linda Sellie, Lisa Hellerstein, \\\"Ozg\\\"ur \\\"Ozkan","submitted_at":"2011-09-15T16:58:28Z","abstract_excerpt":"We define a variant of k-of-n testing that we call conservative k-of-n testing. We present a polynomial-time, combinatorial algorithm for the problem of maximizing throughput of conservative k-of-n testing, in a parallel setting. This extends previous work of Kodialam and Condon et al., who presented combinatorial algorithms for parallel pipelined filter ordering, which is the special case where k=1 (or k = n). We also consider the problem of maximizing throughput for standard k-of-n testing, and show how to obtain a polynomial-time algorithm based on the ellipsoid method using previous techni"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.3401","kind":"arxiv","version":2},"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-18T03:41:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kG+yrDerc+BBeNElo5AmezvQHh1nGyVhJ8A6M3/kB6BFNzB1qEGRmBh5neVMYspeMDZMFQ+K2XPKyhW6Jmm5CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T08:33:58.370663Z"},"content_sha256":"3844e40baade7a6fb2a0eb830924e40cdc3ae7b2c4fef83dd8095647db6e1061","schema_version":"1.0","event_id":"sha256:3844e40baade7a6fb2a0eb830924e40cdc3ae7b2c4fef83dd8095647db6e1061"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JHYPESS2X4VUIMXIVVBZPDGP7D/bundle.json","state_url":"https://pith.science/pith/JHYPESS2X4VUIMXIVVBZPDGP7D/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JHYPESS2X4VUIMXIVVBZPDGP7D/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-30T08:33:58Z","links":{"resolver":"https://pith.science/pith/JHYPESS2X4VUIMXIVVBZPDGP7D","bundle":"https://pith.science/pith/JHYPESS2X4VUIMXIVVBZPDGP7D/bundle.json","state":"https://pith.science/pith/JHYPESS2X4VUIMXIVVBZPDGP7D/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JHYPESS2X4VUIMXIVVBZPDGP7D/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:JHYPESS2X4VUIMXIVVBZPDGP7D","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":"e9b7730d005f29ebf658b962efea42ce5d1415f4362b56969fc55a6cf5359004","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-09-15T16:58:28Z","title_canon_sha256":"c0b7382140e6fe3143a6e8f6d9734251a6358cafe7724915ef4f2177d0e4ab9e"},"schema_version":"1.0","source":{"id":"1109.3401","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.3401","created_at":"2026-05-18T03:41:58Z"},{"alias_kind":"arxiv_version","alias_value":"1109.3401v2","created_at":"2026-05-18T03:41:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.3401","created_at":"2026-05-18T03:41:58Z"},{"alias_kind":"pith_short_12","alias_value":"JHYPESS2X4VU","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_16","alias_value":"JHYPESS2X4VUIMXI","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_8","alias_value":"JHYPESS2","created_at":"2026-05-18T12:26:32Z"}],"graph_snapshots":[{"event_id":"sha256:3844e40baade7a6fb2a0eb830924e40cdc3ae7b2c4fef83dd8095647db6e1061","target":"graph","created_at":"2026-05-18T03:41:58Z","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 define a variant of k-of-n testing that we call conservative k-of-n testing. We present a polynomial-time, combinatorial algorithm for the problem of maximizing throughput of conservative k-of-n testing, in a parallel setting. This extends previous work of Kodialam and Condon et al., who presented combinatorial algorithms for parallel pipelined filter ordering, which is the special case where k=1 (or k = n). We also consider the problem of maximizing throughput for standard k-of-n testing, and show how to obtain a polynomial-time algorithm based on the ellipsoid method using previous techni","authors_text":"Linda Sellie, Lisa Hellerstein, \\\"Ozg\\\"ur \\\"Ozkan","cross_cats":["cs.DC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-09-15T16:58:28Z","title":"Max-Throughput for (Conservative) k-of-n Testing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.3401","kind":"arxiv","version":2},"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:d71ef1dc2dafa506ecdfed214f10d1c3ac6a2eb2fb835181efcaa0560bb4957b","target":"record","created_at":"2026-05-18T03:41:58Z","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":"e9b7730d005f29ebf658b962efea42ce5d1415f4362b56969fc55a6cf5359004","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-09-15T16:58:28Z","title_canon_sha256":"c0b7382140e6fe3143a6e8f6d9734251a6358cafe7724915ef4f2177d0e4ab9e"},"schema_version":"1.0","source":{"id":"1109.3401","kind":"arxiv","version":2}},"canonical_sha256":"49f0f24a5abf2b4432e8ad43978ccff8dca38f6e66f087803fc9752b180e91dc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"49f0f24a5abf2b4432e8ad43978ccff8dca38f6e66f087803fc9752b180e91dc","first_computed_at":"2026-05-18T03:41:58.923561Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:41:58.923561Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9mB3+6NarG5FS1T4cg14+3estiec2hNHp7GeGfhkwUzhsLdOMlBP7Oz3OA8JeT9BMAlxEFI/htWnFzTDU/kjDg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:41:58.924537Z","signed_message":"canonical_sha256_bytes"},"source_id":"1109.3401","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d71ef1dc2dafa506ecdfed214f10d1c3ac6a2eb2fb835181efcaa0560bb4957b","sha256:3844e40baade7a6fb2a0eb830924e40cdc3ae7b2c4fef83dd8095647db6e1061"],"state_sha256":"e3d392143c1e8ba87f3f8a9f281e020b68c7db0a5a1df8e46bcef28ec1ff3b6b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ge/I9bYUXYeb0LtAuPurtYHgi1vLOOiJyXf7UWEZs9xNvTbq6zaFDwYMwajjVTOaYUkH3keo+nu5bM6fMFtZDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T08:33:58.372668Z","bundle_sha256":"3c0d63b87e08518f8b133f3d57186eb3efe598a7064a947dcb0c37fe41b43948"}}