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 "simple codes and sparse recovery with fast decoding"):
  Abstract: Construction of error-correcting codes achieving a designated minimum distance parameter is a central problem in coding theory. A classical and algebraic family of error-correcting codes studied for this purpose are the BCH codes. In this work, we study a very simple construction of linear codes that achieve a given distance parameter $K$. Moreover, we design a simple, nearly optimal syndrome decoder for the code as well. The running time of the decoder is only logarithmic in the block length of the code, and nearly linear in the distance parameter $K$. This decoder can be applied to exact for-all sparse recovery over any field, improving upon previous results with the same number of measurements. Furthermore, computation of the syndrome from a received word can be done in nearly linear time in the block length. We also demonstrate an application of these techniques in non-adaptive group testing, and construct simple explicit measurement schemes with $O(K^2 \log^2 N)$ tests and $O(K^3 \log^2 N)$ recovery time for identifying up to $K$ defectives in a population of size $N$.

Includes members:
  Member "nearly optimal deterministic algorithm for sparse walsh hadamard transform":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "sublinear time non adaptive group testing with o k log n tests via bit mixing coding")
  Member "saffron a fast efficient and robust framework for group testing based on sparse graph codes":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on the all or nothing behavior of bernoulli group testing")
  Member "for all sparse recovery in near optimal time":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "stronger l2 l2 compressed sensing without iterating")
  Member "noise resilient group testing limitations and constructions":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "on the all or nothing behavior of bernoulli group testing")
  Member "combining geometry and combinatorics a unified approach to sparse signal recovery":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "sublinear time non adaptive group testing with o k log n tests via bit mixing coding")
  Member "explicit non adaptive combinatorial group testing schemes":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "group testing with runlength constraints for topological molecular storage")
  Member "algorithmic linear dimension reduction in the l_1 norm for sparse vectors":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "group testing an information theory perspective")

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)