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 "on a hypergraph approach to multistage group testing problems"):
  Abstract: Group testing is a well known search problem that consists in detecting up to s, s ≪ t, defective elements of the set [t] = {1, …, t} by carrying out tests on properly chosen subsets of [t]. In classical group testing the goal is to find all defective elements by using the minimal possible number of tests. In this paper we consider multistage group testing. We propose a general idea how to use a hypergraph approach to searching defective elements. For the case s = 2 and t → 8, we design an explicit construction, which makes use of 2 log 2  t(1 + o(1)) tests in the worst case and consists of 4 stages. For the general case of fixed s > 2 and t → ∞, we provide an explicit construction, which uses (2s − 1) log 2  t(1+o(1)) tests and consists of 2s − 1 rounds.

Includes members:
  Member "bounds on the rate of disjunctive codes in russian":
    also connected through other hyperedges:
      (none)
  Member "lectures on designing screening experiments":
    also connected through other hyperedges:
      - Hyperedge HE-1 (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-2 (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-3 (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)