{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:7ZIKJUUBP6QL4NWTDRHOLGWQ6V","short_pith_number":"pith:7ZIKJUUB","schema_version":"1.0","canonical_sha256":"fe50a4d2817fa0be36d31c4ee59ad0f557cdbe2b670858e1330df93cc052c7ec","source":{"kind":"arxiv","id":"1307.2811","version":1},"attestation_state":"computed","paper":{"title":"GROTESQUE: Noisy Group Testing (Quick and Efficient)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Mayank Bakshi, Mohammad Jahangoshahi, Sheng Cai, Sidharth Jaggi","submitted_at":"2013-07-10T14:43:04Z","abstract_excerpt":"Group-testing refers to the problem of identifying (with high probability) a (small) subset of $D$ defectives from a (large) set of $N$ items via a \"small\" number of \"pooled\" tests. For ease of presentation in this work we focus on the regime when $D = \\cO{N^{1-\\gap}}$ for some $\\gap > 0$. The tests may be noiseless or noisy, and the testing procedure may be adaptive (the pool defining a test may depend on the outcome of a previous test), or non-adaptive (each test is performed independent of the outcome of other tests). A rich body of literature demonstrates that $\\Theta(D\\log(N))$ tests are "},"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":"1307.2811","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-07-10T14:43:04Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"f24925422f72980ab62934ec0f4a2b1c72dc0e85247583ffc8e1f647a13edfdb","abstract_canon_sha256":"24189e6112ced2cf8ff5a37cce0cf2c20395e8c9aac933fba0604c22cdbbfaab"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:18:50.374505Z","signature_b64":"YrKnr8iqUw8Q1yf25zvwUsW0rPV23nGb8yQyfL77k9YIBqQ62KB5Dt6+H5Lvwzb5gQv7Hlkxe6poTgT8hrc3Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fe50a4d2817fa0be36d31c4ee59ad0f557cdbe2b670858e1330df93cc052c7ec","last_reissued_at":"2026-05-18T03:18:50.373810Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:18:50.373810Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"GROTESQUE: Noisy Group Testing (Quick and Efficient)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Mayank Bakshi, Mohammad Jahangoshahi, Sheng Cai, Sidharth Jaggi","submitted_at":"2013-07-10T14:43:04Z","abstract_excerpt":"Group-testing refers to the problem of identifying (with high probability) a (small) subset of $D$ defectives from a (large) set of $N$ items via a \"small\" number of \"pooled\" tests. For ease of presentation in this work we focus on the regime when $D = \\cO{N^{1-\\gap}}$ for some $\\gap > 0$. The tests may be noiseless or noisy, and the testing procedure may be adaptive (the pool defining a test may depend on the outcome of a previous test), or non-adaptive (each test is performed independent of the outcome of other tests). A rich body of literature demonstrates that $\\Theta(D\\log(N))$ tests are "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.2811","kind":"arxiv","version":1},"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":"1307.2811","created_at":"2026-05-18T03:18:50.373912+00:00"},{"alias_kind":"arxiv_version","alias_value":"1307.2811v1","created_at":"2026-05-18T03:18:50.373912+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.2811","created_at":"2026-05-18T03:18:50.373912+00:00"},{"alias_kind":"pith_short_12","alias_value":"7ZIKJUUBP6QL","created_at":"2026-05-18T12:27:38.830355+00:00"},{"alias_kind":"pith_short_16","alias_value":"7ZIKJUUBP6QL4NWT","created_at":"2026-05-18T12:27:38.830355+00:00"},{"alias_kind":"pith_short_8","alias_value":"7ZIKJUUB","created_at":"2026-05-18T12:27:38.830355+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/7ZIKJUUBP6QL4NWTDRHOLGWQ6V","json":"https://pith.science/pith/7ZIKJUUBP6QL4NWTDRHOLGWQ6V.json","graph_json":"https://pith.science/api/pith-number/7ZIKJUUBP6QL4NWTDRHOLGWQ6V/graph.json","events_json":"https://pith.science/api/pith-number/7ZIKJUUBP6QL4NWTDRHOLGWQ6V/events.json","paper":"https://pith.science/paper/7ZIKJUUB"},"agent_actions":{"view_html":"https://pith.science/pith/7ZIKJUUBP6QL4NWTDRHOLGWQ6V","download_json":"https://pith.science/pith/7ZIKJUUBP6QL4NWTDRHOLGWQ6V.json","view_paper":"https://pith.science/paper/7ZIKJUUB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1307.2811&json=true","fetch_graph":"https://pith.science/api/pith-number/7ZIKJUUBP6QL4NWTDRHOLGWQ6V/graph.json","fetch_events":"https://pith.science/api/pith-number/7ZIKJUUBP6QL4NWTDRHOLGWQ6V/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7ZIKJUUBP6QL4NWTDRHOLGWQ6V/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7ZIKJUUBP6QL4NWTDRHOLGWQ6V/action/storage_attestation","attest_author":"https://pith.science/pith/7ZIKJUUBP6QL4NWTDRHOLGWQ6V/action/author_attestation","sign_citation":"https://pith.science/pith/7ZIKJUUBP6QL4NWTDRHOLGWQ6V/action/citation_signature","submit_replication":"https://pith.science/pith/7ZIKJUUBP6QL4NWTDRHOLGWQ6V/action/replication_record"}},"created_at":"2026-05-18T03:18:50.373912+00:00","updated_at":"2026-05-18T03:18:50.373912+00:00"}