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 the optimality of some group testing algorithms"):
  Abstract: We consider Bernoulli nonadaptive group testing with k = Θ(ηθ) defectives, for θ ∊ (0,1). The practical definite defectives (DD) detection algorithm is known to be optimal for θ > 1/2. We give a new upper bound on the rate of DD, showing that DD is strictly suboptimal for θ < 0.41. We also show that the SCOMP algorithm and algorithms based on linear programming achieve a rate at least as high as DD, so in particular are also optimal for θ ≥ 1/2.

Includes members:
  Member "the capacity of bernoulli nonadaptive group testing":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "on the all or nothing behavior of bernoulli group testing")
  Member "limits on support recovery with probabilistic models an information theoretic framework":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "group testing an information theory perspective")
  Member "group testing algorithms bounds and simulations":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "serial quantization for sparse time sequences")
  Member "the capacity of adaptive group testing":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "on the all or nothing behavior of bernoulli group testing")
  Member "efficient probabilistic group testing based on traitor tracing":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "asymptotics of fingerprinting and group testing capacity achieving log likelihood decoders")
  Member "non adaptive group testing explicit bounds and novel algorithms":
    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")

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)