On Accelerated Testing for COVID-19 Using Group Testing

Anoosheh Heidarzadeh; Krishna R. Narayanan; Ramanan Laxminarayan

On Accelerated Testing for COVID-19 Using Group Testing

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2004.04785 v1 pith:H6KRN4UK submitted 2020-04-09 cs.IT math.IT

Krishna R. Narayanan , Anoosheh Heidarzadeh , Ramanan Laxminarayan This is my paper · ORCID

classification cs.ITmath.IT

keywords testingcovid-19currentdraftformulationsgroupideasaccelerate

verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments

read the original abstract

COVID-19 has resulted in a global health crisis that may become even more acute over the upcoming months. One of the main reasons behind the current rapid growth of COVID-19 in the U.S. population is the limited availability of testing kits and the relatively-high cost of screening tests. In this draft, we demonstrate the effectiveness of group testing (pooling) ideas to accelerate testing for COVID-19. This draft is semi-tutorial in nature and is written for a broad audience with interest in mathematical formulations relevant to COVID-19 testing. Therefore, ideas are presented through illustrative examples rather than through purely theoretical formulations. The focus is also on pools of size less than 64 such as what is practical with current RT-PCR technology.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

Group Testing with General Correlation Using Hypergraphs
cs.IT 2024-12 conditional novelty 6.0 of 10

A greedy adaptive algorithm identifies the infected subset in O(H(X)+mu) expected tests for any correlated infection distribution over a hypergraph, with extensions to semi-non-adaptive and noisy settings.

Pith tools