{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:JHYPESS2X4VUIMXIVVBZPDGP7D","short_pith_number":"pith:JHYPESS2","schema_version":"1.0","canonical_sha256":"49f0f24a5abf2b4432e8ad43978ccff8dca38f6e66f087803fc9752b180e91dc","source":{"kind":"arxiv","id":"1109.3401","version":2},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1109.3401","created_at":"2026-05-18T03:41:58.923710+00:00"},{"alias_kind":"arxiv_version","alias_value":"1109.3401v2","created_at":"2026-05-18T03:41:58.923710+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.3401","created_at":"2026-05-18T03:41:58.923710+00:00"},{"alias_kind":"pith_short_12","alias_value":"JHYPESS2X4VU","created_at":"2026-05-18T12:26:32.869790+00:00"},{"alias_kind":"pith_short_16","alias_value":"JHYPESS2X4VUIMXI","created_at":"2026-05-18T12:26:32.869790+00:00"},{"alias_kind":"pith_short_8","alias_value":"JHYPESS2","created_at":"2026-05-18T12:26:32.869790+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/JHYPESS2X4VUIMXIVVBZPDGP7D","json":"https://pith.science/pith/JHYPESS2X4VUIMXIVVBZPDGP7D.json","graph_json":"https://pith.science/api/pith-number/JHYPESS2X4VUIMXIVVBZPDGP7D/graph.json","events_json":"https://pith.science/api/pith-number/JHYPESS2X4VUIMXIVVBZPDGP7D/events.json","paper":"https://pith.science/paper/JHYPESS2"},"agent_actions":{"view_html":"https://pith.science/pith/JHYPESS2X4VUIMXIVVBZPDGP7D","download_json":"https://pith.science/pith/JHYPESS2X4VUIMXIVVBZPDGP7D.json","view_paper":"https://pith.science/paper/JHYPESS2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1109.3401&json=true","fetch_graph":"https://pith.science/api/pith-number/JHYPESS2X4VUIMXIVVBZPDGP7D/graph.json","fetch_events":"https://pith.science/api/pith-number/JHYPESS2X4VUIMXIVVBZPDGP7D/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JHYPESS2X4VUIMXIVVBZPDGP7D/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JHYPESS2X4VUIMXIVVBZPDGP7D/action/storage_attestation","attest_author":"https://pith.science/pith/JHYPESS2X4VUIMXIVVBZPDGP7D/action/author_attestation","sign_citation":"https://pith.science/pith/JHYPESS2X4VUIMXIVVBZPDGP7D/action/citation_signature","submit_replication":"https://pith.science/pith/JHYPESS2X4VUIMXIVVBZPDGP7D/action/replication_record"}},"created_at":"2026-05-18T03:41:58.923710+00:00","updated_at":"2026-05-18T03:41:58.923710+00:00"}