human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "improved combinatorial group testing algorithms for real world problem sizes"
  Abstract: We study practically efficient methods for performing combinatorial group testing. We present efficient nonadaptive and two-stage combinatorial group testing algorithms, which identify the at most $d$ items out of a given set of $n$ items that are defective, using fewer tests for all practical set sizes. For example, our two-stage algorithm matches the information-theoretic lower bound for the number of tests in a combinatorial group testing regimen.

Connected through hyperedge HE-1 (induced by source paper "noisy adaptive group testing bounds and algorithms"):
  with members:
    - "novel impossibility results for group testing"
    - "individual testing is optimal for nonadaptive group testing in the linear regime"
    - "the capacity of bernoulli nonadaptive group testing"
    - "converse bounds for noisy group testing with arbitrary measurement matrices"
    - "the capacity of adaptive group testing"
    - "non adaptive group testing explicit bounds and novel algorithms"
    - "boolean compressed sensing and noisy group testing"
    - "non adaptive probabilistic group testing with noisy measurements near optimal bounds with efficient algorithms"

Connected through hyperedge HE-2 (induced by source paper "from discrepancy to majority"):
  with members:
    - "combinatorial pair testing distinguishing workers from slackers"
    - "computing majority with triple queries"

Connected through hyperedge HE-3 (induced by source paper "exact learning from an honest teacher that answers membership queries"):
  with members:
    - "exact learning of juntas from membership queries"
    - "almost optimal cover free families"
    - "progress on polynomial identity testing ii"
    - "linear time constructions of some d restriction problems"
    - "on exact learning monotone dnf from membership queries"
    - "learning boolean halfspaces with small weights from membership queries"
    - "bounds on the rate of disjunctive codes"
    - "efficient computation of representative sets with applications in parameterized and exact algorithms"

Connected through hyperedge HE-4 (induced by source paper "probabilistic group testing under sum observations a parallelizable 2 approximation for entropy loss"):
  with members:
    - "group testing with prior statistics"
    - "info greedy sequential adaptive compressed sensing"
    - "quantitative group testing for heavy hitter detection"
    - "active testing for face detection and localization"
    - "an informational approach to the global optimization of expensive to evaluate functions"

Connected through hyperedge HE-5 (induced by source paper "combinatorial pair testing distinguishing workers from slackers"):
  with members:
    - "pipelined algorithms to detect cheating in long term grid computations"

Connected through hyperedge HE-6 (induced by source paper "single photon sampling architecture for solid state imaging sensors"):
  with members:
    - "explicit non adaptive combinatorial group testing schemes"

Connected through hyperedge HE-7 (induced by source paper "applications of derandomization theory in coding"):
  with members:
    - "graph constrained group testing"
    - "almost uniform sampling of points on high dimensional algebraic varieties"
    - "compressed sensing with probabilistic measurements a group testing solution"
    - "bit precision analysis for compressed sensing"
    - "noise resilient group testing limitations and constructions"
    - "capacity achieving codes from randomness condensers"
    - "channel polarization a method for constructing capacity achieving codes for symmetric binary input memoryless channels"
    - "invertible extractors and wiretap protocols"

Connected through hyperedge HE-8 (induced by source paper "superselectors efficient constructions and applications"):
  with members:
    - "noise resilient group testing limitations and constructions"
    - "explicit non adaptive combinatorial group testing schemes"

Question: Please tell me which class the center node 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.DS(Data Structures and Algorithms)