{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:E775LZW2LQ3T7JZSCMCOWEJ345","short_pith_number":"pith:E775LZW2","schema_version":"1.0","canonical_sha256":"27ffd5e6da5c373fa7321304eb113be77342ee91e04f0e769c94dc14e06bd1f8","source":{"kind":"arxiv","id":"1202.0206","version":5},"attestation_state":"computed","paper":{"title":"Non-adaptive Group Testing: Explicit bounds and novel algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Chun Lam Chan, Samar Agnihotri, Sidharth Jaggi, Venkatesh Saligrama","submitted_at":"2012-02-01T16:35:39Z","abstract_excerpt":"We consider some computationally efficient and provably correct algorithms with near-optimal sample-complexity for the problem of noisy non-adaptive group testing. Group testing involves grouping arbitrary subsets of items into pools. Each pool is then tested to identify the defective items, which are usually assumed to be \"sparse\". We consider non-adaptive randomly pooling measurements, where pools are selected randomly and independently of the test outcomes. We also consider a model where noisy measurements allow for both some false negative and some false positive test outcomes (and also al"},"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":"1202.0206","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-02-01T16:35:39Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"7b7f6c63ee71704d8529d685b641d5eadcf0bf080d2a096eba73c7814a02ec96","abstract_canon_sha256":"d340a1762e79271b5c25a0e3e4c9c70eb70e002e36bb40c158452ae06af2f3a6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:57:57.095615Z","signature_b64":"V2GuZkVEt9570VY+HUFDDKZz5A6nYLuDYS/2UI8KogFDRM5AXM7a0rvgTG+Wg0kjXEf46b4B2eVhq8J8+lIEDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"27ffd5e6da5c373fa7321304eb113be77342ee91e04f0e769c94dc14e06bd1f8","last_reissued_at":"2026-05-18T00:57:57.095071Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:57:57.095071Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Non-adaptive Group Testing: Explicit bounds and novel algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Chun Lam Chan, Samar Agnihotri, Sidharth Jaggi, Venkatesh Saligrama","submitted_at":"2012-02-01T16:35:39Z","abstract_excerpt":"We consider some computationally efficient and provably correct algorithms with near-optimal sample-complexity for the problem of noisy non-adaptive group testing. Group testing involves grouping arbitrary subsets of items into pools. Each pool is then tested to identify the defective items, which are usually assumed to be \"sparse\". We consider non-adaptive randomly pooling measurements, where pools are selected randomly and independently of the test outcomes. We also consider a model where noisy measurements allow for both some false negative and some false positive test outcomes (and also al"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.0206","kind":"arxiv","version":5},"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":"1202.0206","created_at":"2026-05-18T00:57:57.095154+00:00"},{"alias_kind":"arxiv_version","alias_value":"1202.0206v5","created_at":"2026-05-18T00:57:57.095154+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.0206","created_at":"2026-05-18T00:57:57.095154+00:00"},{"alias_kind":"pith_short_12","alias_value":"E775LZW2LQ3T","created_at":"2026-05-18T12:27:04.183437+00:00"},{"alias_kind":"pith_short_16","alias_value":"E775LZW2LQ3T7JZS","created_at":"2026-05-18T12:27:04.183437+00:00"},{"alias_kind":"pith_short_8","alias_value":"E775LZW2","created_at":"2026-05-18T12:27:04.183437+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/E775LZW2LQ3T7JZSCMCOWEJ345","json":"https://pith.science/pith/E775LZW2LQ3T7JZSCMCOWEJ345.json","graph_json":"https://pith.science/api/pith-number/E775LZW2LQ3T7JZSCMCOWEJ345/graph.json","events_json":"https://pith.science/api/pith-number/E775LZW2LQ3T7JZSCMCOWEJ345/events.json","paper":"https://pith.science/paper/E775LZW2"},"agent_actions":{"view_html":"https://pith.science/pith/E775LZW2LQ3T7JZSCMCOWEJ345","download_json":"https://pith.science/pith/E775LZW2LQ3T7JZSCMCOWEJ345.json","view_paper":"https://pith.science/paper/E775LZW2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1202.0206&json=true","fetch_graph":"https://pith.science/api/pith-number/E775LZW2LQ3T7JZSCMCOWEJ345/graph.json","fetch_events":"https://pith.science/api/pith-number/E775LZW2LQ3T7JZSCMCOWEJ345/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/E775LZW2LQ3T7JZSCMCOWEJ345/action/timestamp_anchor","attest_storage":"https://pith.science/pith/E775LZW2LQ3T7JZSCMCOWEJ345/action/storage_attestation","attest_author":"https://pith.science/pith/E775LZW2LQ3T7JZSCMCOWEJ345/action/author_attestation","sign_citation":"https://pith.science/pith/E775LZW2LQ3T7JZSCMCOWEJ345/action/citation_signature","submit_replication":"https://pith.science/pith/E775LZW2LQ3T7JZSCMCOWEJ345/action/replication_record"}},"created_at":"2026-05-18T00:57:57.095154+00:00","updated_at":"2026-05-18T00:57:57.095154+00:00"}