{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:4W2JX6D4PE4VZIE43CFHDDYGL2","short_pith_number":"pith:4W2JX6D4","schema_version":"1.0","canonical_sha256":"e5b49bf87c79395ca09cd88a718f065ea7989e60b25621d53bf3c59d9d14cad9","source":{"kind":"arxiv","id":"1304.6027","version":3},"attestation_state":"computed","paper":{"title":"Near-Optimal Stochastic Threshold Group Testing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Chun Lam Chan, Mayank Bakshi, Sheng Cai, Sidharth Jaggi, Venkatesh Saligrama","submitted_at":"2013-04-22T17:36:27Z","abstract_excerpt":"We formulate and analyze a stochastic threshold group testing problem motivated by biological applications. Here a set of $n$ items contains a subset of $d \\ll n$ defective items. Subsets (pools) of the $n$ items are tested -- the test outcomes are negative, positive, or stochastic (negative or positive with certain probabilities that might depend on the number of defectives being tested in the pool), depending on whether the number of defective items in the pool being tested are fewer than the {\\it lower threshold} $l$, greater than the {\\it upper threshold} $u$, or in between. The goal of a "},"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":"1304.6027","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-04-22T17:36:27Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"feab02b85e32c3a57522ff09ce7387a33d2c50a7dd3b65c1070823f01ba81dfb","abstract_canon_sha256":"d81e29746c3b687937ddaf2a3443c17c184df75c2cba516aa3e060c88637856b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:27:13.209392Z","signature_b64":"sP3E6tcCMplgvwoDPJs/OBJSIKsypmRAXj8lEqxIFd8LjwMS3up/laF5FYrsKMzV8CBhgwCFDj/MXHUrkuwkDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e5b49bf87c79395ca09cd88a718f065ea7989e60b25621d53bf3c59d9d14cad9","last_reissued_at":"2026-05-18T03:27:13.208669Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:27:13.208669Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Near-Optimal Stochastic Threshold Group Testing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Chun Lam Chan, Mayank Bakshi, Sheng Cai, Sidharth Jaggi, Venkatesh Saligrama","submitted_at":"2013-04-22T17:36:27Z","abstract_excerpt":"We formulate and analyze a stochastic threshold group testing problem motivated by biological applications. Here a set of $n$ items contains a subset of $d \\ll n$ defective items. Subsets (pools) of the $n$ items are tested -- the test outcomes are negative, positive, or stochastic (negative or positive with certain probabilities that might depend on the number of defectives being tested in the pool), depending on whether the number of defective items in the pool being tested are fewer than the {\\it lower threshold} $l$, greater than the {\\it upper threshold} $u$, or in between. The goal of a "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.6027","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":"1304.6027","created_at":"2026-05-18T03:27:13.208793+00:00"},{"alias_kind":"arxiv_version","alias_value":"1304.6027v3","created_at":"2026-05-18T03:27:13.208793+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.6027","created_at":"2026-05-18T03:27:13.208793+00:00"},{"alias_kind":"pith_short_12","alias_value":"4W2JX6D4PE4V","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_16","alias_value":"4W2JX6D4PE4VZIE4","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_8","alias_value":"4W2JX6D4","created_at":"2026-05-18T12:27:34.582898+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/4W2JX6D4PE4VZIE43CFHDDYGL2","json":"https://pith.science/pith/4W2JX6D4PE4VZIE43CFHDDYGL2.json","graph_json":"https://pith.science/api/pith-number/4W2JX6D4PE4VZIE43CFHDDYGL2/graph.json","events_json":"https://pith.science/api/pith-number/4W2JX6D4PE4VZIE43CFHDDYGL2/events.json","paper":"https://pith.science/paper/4W2JX6D4"},"agent_actions":{"view_html":"https://pith.science/pith/4W2JX6D4PE4VZIE43CFHDDYGL2","download_json":"https://pith.science/pith/4W2JX6D4PE4VZIE43CFHDDYGL2.json","view_paper":"https://pith.science/paper/4W2JX6D4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1304.6027&json=true","fetch_graph":"https://pith.science/api/pith-number/4W2JX6D4PE4VZIE43CFHDDYGL2/graph.json","fetch_events":"https://pith.science/api/pith-number/4W2JX6D4PE4VZIE43CFHDDYGL2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4W2JX6D4PE4VZIE43CFHDDYGL2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4W2JX6D4PE4VZIE43CFHDDYGL2/action/storage_attestation","attest_author":"https://pith.science/pith/4W2JX6D4PE4VZIE43CFHDDYGL2/action/author_attestation","sign_citation":"https://pith.science/pith/4W2JX6D4PE4VZIE43CFHDDYGL2/action/citation_signature","submit_replication":"https://pith.science/pith/4W2JX6D4PE4VZIE43CFHDDYGL2/action/replication_record"}},"created_at":"2026-05-18T03:27:13.208793+00:00","updated_at":"2026-05-18T03:27:13.208793+00:00"}