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: "lift and round to improve weighted completion time on unrelated machines"
  Abstract: We consider the problem of scheduling jobs on unrelated machines so as to minimize the sum of weighted completion times. Our main result is a $(3/2-c)$-approximation algorithm for some fixed $c>0$, improving upon the long-standing bound of 3/2 (independently due to Skutella, Journal of the ACM, 2001, and Sethuraman & Squillante, SODA, 1999). To do this, we first introduce a new lift-and-project based SDP relaxation for the problem. This is necessary as the previous convex programming relaxations have an integrality gap of $3/2$. Second, we give a new general bipartite-rounding procedure that produces an assignment with certain strong negative correlation properties.

Connected through hyperedge HE-1 (induced by source paper "weighted completion time minimization for unrelated machines via iterative fair contention resolution"):
  with members:
    - "scheduling to minimize total weighted completion time via time indexed linear programming relaxations"
    - "unrelated machine scheduling of jobs with uniform smith ratios"
    - "better unrelated machine scheduling for weighted completion time via random offsets from non uniform distributions"
    - "minimizing flow time on unrelated machines"
    - "santa claus schedules jobs on unrelated machines"
    - "on allocating goods to maximize fairness"

Connected through hyperedge HE-2 (induced by source paper "a note on the asymptotic optimality of work conserving disciplines in completion time minimization"):
  with members:
    - "scheduling to minimize total weighted completion time via time indexed linear programming relaxations"
    - "better unrelated machine scheduling for weighted completion time via random offsets from non uniform distributions"
    - "a 2 542 approximation for precedence constrained single machine scheduling with release dates and total weighted completion time objective"

Connected through hyperedge HE-3 (induced by source paper "integrality gaps for bounded color matchings"):
  with members:
    - "a birthday repetition theorem and complexity of approximating dense csps"
    - "generalized hypergraph matching via iterated packing and local ratio"
    - "complexity results for rainbow matchings"
    - "on integrality ratios for asymmetric tsp in the sherali adams hierarchy"
    - "sparsest cut on bounded treewidth graphs algorithms and hardness results"
    - "iterative packing for demand and hypergraph matching"
    - "approximating sparsest cut in graphs of bounded treewidth"

Connected through hyperedge HE-4 (induced by source paper "scheduling to minimize total weighted completion time via time indexed linear programming relaxations"):
  with members:
    - "better unrelated machine scheduling for weighted completion time via random offsets from non uniform distributions"
    - "a 2 542 approximation for precedence constrained single machine scheduling with release dates and total weighted completion time objective"
    - "on the configuration lp of the restricted assignment problem"
    - "a 1 epsilon approximation for makespan scheduling with precedence constraints using lp hierarchies"
    - "towards tight lower bounds for scheduling problems"
    - "santa claus schedules jobs on unrelated machines"
    - "the geometry of scheduling"

Connected through hyperedge HE-5 (induced by source paper "stochastic online scheduling on unrelated machines"):
  with members:
    - "scheduling to minimize total weighted completion time via time indexed linear programming relaxations"
    - "better unrelated machine scheduling for weighted completion time via random offsets from non uniform distributions"
    - "selfishmigrate a scalable algorithm for non clairvoyantly scheduling heterogeneous processors"
    - "inner product spaces for minsum coordination mechanisms"

Connected through hyperedge HE-6 (induced by source paper "on the optimality of scheduling dependent mapreduce tasks on heterogeneous machines"):
  with members:
    - "better unrelated machine scheduling for weighted completion time via random offsets from non uniform distributions"
    - "scheduling distributed clusters of parallel machines primal dual and lp based approximation algorithms"
    - "scheduling mapreduce jobs under multi round precedences"

Connected through hyperedge HE-7 (induced by source paper "better unrelated machine scheduling for weighted completion time via random offsets from non uniform distributions"):
  with members:
    - "minimizing flow time on unrelated machines"
    - "santa claus schedules jobs on unrelated machines"
    - "new constructive aspects of the lovasz local lemma"
    - "on allocating goods to maximize fairness"

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)