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 "converse bounds for noisy group testing with arbitrary measurement matrices"):
  Abstract: We consider the group testing problem, in which one seeks to identify a subset of defective items within a larger set of items based on a number of noisy tests. While matching achievability and converse bounds are known in several cases of interest for i.i.d.~measurement matrices, less is known regarding converse bounds for arbitrary measurement matrices. We address this by presenting two converse bounds for arbitrary matrices and general noise models. First, we provide a strong converse bound ($\mathbb{P}[\mathrm{error}] \to 1$) that matches existing achievability bounds in several cases of interest. Second, we provide a weak converse bound ($\mathbb{P}[\mathrm{error}] \not\to 0$) that matches existing achievability bounds in greater generality.

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 "asymptotics of fingerprinting and group testing tight bounds from channel capacities":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "group testing an information theory perspective")
  Member "limits on support recovery with probabilistic models an information theoretic framework":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "group testing an information theory perspective")
  Member "strong converses for group testing in the finite blocklength regime":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "secure group testing")
  Member "the capacity of adaptive group testing":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "on the all or nothing behavior of bernoulli 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 "unbounded contention resolution in multiple access channels":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "singletons for simpletons revisiting windowed backoff using chernoff bounds")

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)