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 "noise resilient group testing limitations and constructions"):
  Abstract: We study combinatorial group testing schemes for learning d-sparse boolean vectors using highly unreliable disjunctive measurements. We consider an adversarial noise model that only limits the number of false observations, and show that any noise-resilient scheme in this model can only approximately reconstruct the sparse vector. On the positive side, we give a general framework for construction of highly noise-resilient group testing schemes using randomness condensers. Simple randomized instantiations of this construction give non-adaptive measurement schemes, with m = O(d log n) measurements, that allow efficient reconstruction of d-sparse vectors up to O(d) false positives even in the presence of δm false positives and Ω(m/d) false negatives within the measurement outcomes, for any constant δ < 1. None of these parameters can be substantially improved without dramatically affecting the others. Furthermore, we obtain several explicit (and incomparable) constructions, in particular one matching the randomized trade-off but using m = O(d1+o(1) log n) measurements. We also obtain explicit constructions that allow fast reconstruction in time poly(m), which would be sublinear in n for sufficiently sparse vectors.

Includes members:
  Member "folded codes from function field towers and improved optimal rate list decoding":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "linear time erasure list decoding of expander codes")
  Member "linear algebraic list decoding of folded reed solomon codes":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "beyond the guruswami sudan and parvaresh vardy radii folded reed solomon multiplicity and derivative codes")
  Member "subspace evasive sets":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "beyond the guruswami sudan and parvaresh vardy radii folded reed solomon multiplicity and derivative codes")
  Member "applications of derandomization theory in coding":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "nearly optimal deterministic algorithm for sparse walsh hadamard transform")
  Member "efficient and robust compressed sensing using high quality expander graphs":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "vanishingly sparse matrices and expander graphs with application to compressed sensing")
  Member "improved combinatorial group testing algorithms for real world problem sizes":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "noisy adaptive group testing bounds and algorithms")
  Member "explicit codes achieving list decoding capacity error correction with optimal redundancy":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "beyond the guruswami sudan and parvaresh vardy radii folded reed solomon multiplicity and derivative codes")

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.DM(Discrete Mathematics)