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 "from discrepancy to majority"):
  Abstract: We show how to select an item with the majority color from n two-colored items, given access to the items only through an oracle that returns the discrepancy of subsets of k items (the absolute value of the difference between the numbers of items with each color). We use \(n/\lfloor \tfrac{k}{2}\rfloor +O(k)\) queries, improving a previous method by De Marco and Kranakis that used \(n-k+k^2/2\) queries. We also prove a lower bound of \(n/(k-1)-O (n^{1/3})\) on the number of queries needed, both for discrepancy queries and to queries that return the partition of items into monochromatic subsets. This improves a lower bound of \(\lfloor n/k\rfloor \) by De Marco and Kranakis.

Includes members:
  Member "combinatorial pair testing distinguishing workers from slackers":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "conscious and controlling elements in combinatorial group testing problems")
  Member "computing majority with triple queries":
    also connected through other hyperedges:
      (none)
  Member "improved combinatorial group testing algorithms for real world problem sizes":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "noisy adaptive group testing bounds and algorithms")

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.DS(Data Structures and Algorithms)