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 "information theoretic and algorithmic thresholds for group testing"):
  Abstract: In the group testing problem we aim to identify a small number of infected individuals within a large population. We avail ourselves to a procedure that can test a group of multiple individuals, with the test result coming out positive iff at least one individual in the group is infected. With all tests conducted in parallel, what is the least number of tests required to identify the status of all individuals? In a recent test design [Aldridge et al.\ 2016] the individuals are assigned to test groups randomly, with every individual joining an equal number of groups. We pinpoint the sharp threshold for the number of tests required in this randomised design so that it is information-theoretically possible to infer the infection status of every individual. Moreover, we analyse two efficient inference algorithms. These results settle conjectures from [Aldridge et al.\ 2014, Johnson et al.\ 2019].

Includes members:
  Member "performance of group testing algorithms with near constant tests per item":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "on the all or nothing behavior of bernoulli group testing")
  Member "individual testing is optimal for nonadaptive group testing in the linear regime":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "group testing an information theory perspective")
  Member "the capacity of bernoulli nonadaptive group testing":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on the all or nothing behavior of bernoulli group testing")
  Member "the computer science and physics of community detection landscapes phase transitions and hardness":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "mean field theory of graph neural networks in graph partitioning")
  Member "on the optimality of some group testing algorithms":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "group testing an information theory perspective")
  Member "improved group testing rates with constant column weight designs":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "quantitative group testing in the sublinear regime")
  Member "group testing algorithms bounds and simulations":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "serial quantization for sparse time sequences")

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)