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 "a quasi polynomial approximation for the restricted assignment problem"):
  Abstract: Scheduling jobs on unrelated machines and minimizing the makespan is a classical problem in combinatorial optimization. In this problem a job $j$ has a processing time $p_{ij}$ for every machine $i$. The best polynomial algorithm known goes back to Lenstra et al. and has an approximation ratio of $2$. In this paper we study the Restricted Assignment problem, which is the special case where $p_{ij}\in\{p_j,\infty\}$. We present an algorithm for this problem with an approximation ratio of $11/6 + \epsilon$ and quasi-polynomial running time $n^{\mathcal O(1/\epsilon \log(n))}$ for every $\epsilon > 0$. This closes the gap to the best estimation algorithm known for the problem with regard to quasi-polynomial running time.

Includes members:
  Member "on the configuration lp of the restricted assignment problem":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "simpler and better algorithms for minimum norm load balancing")
  Member "lazy local search meets machine scheduling":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "local search breaks 1 75 for graph balancing")
  Member "on 1 epsilon restricted assignment makespan minimization":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on 1 epsilon restricted max min fair allocation problem")
  Member "combinatorial algorithm for restricted max min fair allocation":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "approximating nash social welfare under submodular valuations through un matchings")
  Member "quasi polynomial local search for restricted max min fair allocation":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "restricted max min allocation approximation and integrality gap")
  Member "santa claus schedules jobs on unrelated machines":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "weighted completion time minimization for unrelated machines via iterative fair contention resolution")

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)