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 "group testing algorithms bounds and simulations"):
  Abstract: We consider the problem of nonadaptive noiseless group testing of    $N$    items of which    $K$    are defective. We describe four detection algorithms, the    ${\tt COMP}$    algorithm of Chan  et al.  , two new algorithms,    ${\tt DD}$    and    ${\tt SCOMP}$   , which require stronger evidence to declare an item defective, and an essentially optimal but computationally difficult algorithm called    ${\tt SSS}$   . We consider an important class of designs for the group testing problem, namely those in which the test structure is given via a Bernoulli random process. In this class of Bernoulli designs, by considering the asymptotic rate of these algorithms, we show that    ${\tt DD}$    outperforms    ${\tt COMP}$   , that    ${\tt DD}$    is essentially optimal in regimes where    $K\geq\sqrt N$   , and that no algorithm can perform as well as the best nonrandom adaptive algorithms when    $K>N^{0.35}$   . In simulations, we see that    ${\tt DD}$    and    ${\tt SCOMP}$    far outperform    ${\tt COMP}$   , with    ${\tt SCOMP}$    very close to the optimal    ${\tt SSS}$   , especially in cases with larger    $K$   .

Includes members:
  Member "non adaptive group testing based on sparse pooling graphs":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "group testing with prior statistics")
  Member "sparse signal processing with linear and non linear observations a unified shannon theoretic approach":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "information theoretic lower bounds for compressive sensing with generative models")
  Member "the capacity of adaptive group testing":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on the all or nothing behavior of bernoulli group testing")
  Member "non adaptive group testing explicit bounds and novel algorithms":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "serial quantization for sparse time sequences")
  Member "adaptive group testing as channel coding with feedback":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "secure adaptive group testing")
  Member "boolean compressed sensing and noisy group testing":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "serial quantization for sparse time sequences")
  Member "non adaptive probabilistic group testing with noisy measurements near optimal bounds with efficient algorithms":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "serial quantization for sparse time sequences")
  Member "note on noisy group testing asymptotic bounds and belief propagation reconstruction":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "serial quantization for sparse time sequences")

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)