human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "a new algorithm for two stage group testing"):
  Abstract: Group testing is a well-known search problem that consists in detecting of $s$ defective members of a set of $t$ samples by carrying out tests on properly chosen subsets of samples. In classical group testing the goal is to find all defective elements by using the minimal possible number of tests in the worst case. In this work, two-stage group testing is considered. Using the hypergraph approach we design a new search algorithm, which allows improving the known results for fixed $s$ and $t\to\infty$. For the case $s=2$ this algorithm achieves information-theoretic lower bound $2\log_2t(1+o(1))$ on the number of tests in the worst case. Also, the problem of finding $m$ out of $s$ defectives is considered.

Includes members:
  Member "performance of group testing algorithms with near constant tests per item":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "on the all or nothing behavior of bernoulli group testing")
  Member "on a hypergraph approach to multistage group testing problems":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "optimal multistage group testing algorithm for 3 defectives")
  Member "lectures on designing screening experiments":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "optimal multistage group testing algorithm for 3 defectives")
  Member "bounds on the rate of disjunctive codes":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "optimal multistage group testing algorithm for 3 defectives")
  Member "group testing with random pools optimal two stage algorithms":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "optimal multistage group testing algorithm for 3 defectives")

Question: Please tell me which class the source paper belongs to. The 40 classes are: cs.NA(Numerical Analysis), cs.MM(Multimedia), cs.LO(Logic in Computer Science), cs.CY(Computers and Society), cs.CR(Cryptography and Security), cs.DC(Distributed, Parallel, and Cluster Computing), cs.HC(Human-Computer Interaction), cs.CE(Computational Engineering, Finance, and Science), cs.NI(Networking and Internet Architecture), cs.CC(Computational Complexity), cs.AI(Artificial Intelligence), cs.MA(Multiagent Systems), cs.GL(General Literature), cs.NE(Neural and Evolutionary Computing), cs.SC(Symbolic Computation), cs.AR(Hardware Architecture), cs.CV(Computer Vision and Pattern Recognition), cs.GR(Graphics), cs.ET(Emerging Technologies), cs.SY(Systems and Control), cs.CG(Computational Geometry), cs.OH(Other Computer Science), cs.PL(Programming Languages), cs.SE(Software Engineering), cs.LG(Machine Learning), cs.SD(Sound), cs.SI(Social and Information Networks), cs.RO(Robotics), cs.IT(Information Theory), cs.PF(Performance), cs.CL(Computation and Language), cs.IR(Information Retrieval), cs.MS(Mathematical Software), cs.FL(Formal Languages and Automata Theory), cs.DS(Data Structures and Algorithms), cs.OS(Operating Systems), cs.GT(Computer Science and Game Theory), cs.DB(Databases), cs.DL(Digital Libraries), cs.DM(Discrete Mathematics). Directly output the class name.

gpt: cs.IT(Information Theory)