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 "non adaptive pooling strategies for detection of rare faulty items"):
  Abstract: We study non-adaptive pooling strategies for detection of rare faulty items. Given a binary sparse N dimensional signal x, how to construct a sparse binary M × N pooling matrix F such that the signal can be reconstructed from the smallest possible number M of measurements y = Fx? We show that a very small number of measurements is possible for random spatially coupled design of pools F. Our design might find application in genetic screening or compressed genotyping. We show that our results are robust with respect to the uncertainty in the matrix F when some elements are mistaken.

Includes members:
  Member "compressed sensing under matrix uncertainty optimum thresholds and robust approximate message passing":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "bilinear adaptive generalized vector approximate message passing")
  Member "non adaptive group testing explicit bounds and novel algorithms":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "serial quantization for sparse time sequences")
  Member "compressed sensing of approximately sparse signals phase transitions and optimal reconstruction":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "approximate message passing decoder and capacity achieving sparse superposition codes")
  Member "boolean compressed sensing and noisy group testing":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "serial quantization for sparse time sequences")
  Member "compressed sensing with sparse structured matrices":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "approximate message passing with universal denoising")
  Member "information theoretically optimal compressed sensing via spatial coupling and approximate message passing":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "capacity achieving spatially coupled sparse superposition codes with amp decoding")
  Member "threshold saturation via spatial coupling why convolutional ldpc ensembles perform so well over the bec":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "capacity achieving spatially coupled sparse superposition codes with amp decoding")
  Member "multiple access demodulation in the lifted signal graph with spatial coupling":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "universal sparse superposition codes with spatial coupling and gamp decoding")

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)