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: "selfishmigrate a scalable algorithm for non clairvoyantly scheduling heterogeneous processors"
  Abstract: We consider the classical problem of minimizing the total weighted flow-time for unrelated machines in the online \emph{non-clairvoyant} setting. In this problem, a set of jobs $J$ arrive over time to be scheduled on a set of $M$ machines. Each job $j$ has processing length $p_j$, weight $w_j$, and is processed at a rate of $\ell_{ij}$ when scheduled on machine $i$. The online scheduler knows the values of $w_j$ and $\ell_{ij}$ upon arrival of the job, but is not aware of the quantity $p_j$. We present the {\em first} online algorithm that is {\em scalable} ($(1+\eps)$-speed $O(\frac{1}{\epsilon^2})$-competitive for any constant $\eps > 0$) for the total weighted flow-time objective. No non-trivial results were known for this setting, except for the most basic case of identical machines. Our result resolves a major open problem in online scheduling theory. Moreover, we also show that no job needs more than a logarithmic number of migrations. We further extend our result and give a scalable algorithm for the objective of minimizing total weighted flow-time plus energy cost for the case of unrelated machines and obtain a scalable algorithm. The key algorithmic idea is to let jobs migrate selfishly until they converge to an equilibrium. Towards this end, we define a game where each job's utility which is closely tied to the instantaneous increase in the objective the job is responsible for, and each machine declares a policy that assigns priorities to jobs based on when they migrate to it, and the execution speeds. This has a spirit similar to coordination mechanisms that attempt to achieve near optimum welfare in the presence of selfish agents (jobs). To the best our knowledge, this is the first work that demonstrates the usefulness of ideas from coordination mechanisms and Nash equilibria for designing and analyzing online algorithms.

Connected through hyperedge HE-1 (induced by source paper "a unifying optimal control framework for online job scheduling with general cost functions"):
  with members:
    - "scheduling to approximate minimization objectives on identical machines"
    - "stochastic online scheduling on unrelated machines"
    - "competitive algorithms from competitive equilibria non clairvoyant scheduling under polyhedral constraints"
    - "the geometry of scheduling"

Connected through hyperedge HE-2 (induced by source paper "non clairvoyant precedence constrained scheduling"):
  with members:
    - "flow time optimization for concurrent open shop and precedence constrained scheduling models"
    - "scheduling to minimize total weighted completion time via time indexed linear programming relaxations"

Connected through hyperedge HE-3 (induced by source paper "flow time optimization for concurrent open shop and precedence constrained scheduling models"):
  with members:
    - "scheduling to minimize total weighted completion time via time indexed linear programming relaxations"
    - "an improved bound for minimizing the total weighted completion time of coflows in datacenters"
    - "almost polynomial ratio eth hardness of approximating densest k subgraph"
    - "a 1 epsilon approximation for makespan scheduling with precedence constraints using lp hierarchies"
    - "competitive algorithms from competitive equilibria non clairvoyant scheduling under polyhedral constraints"
    - "the geometry of scheduling"

Connected through hyperedge HE-4 (induced by source paper "online primal dual algorithms with configuration linear programs"):
  with members:
    - "online covering with sum of ell_q norm objectives"
    - "online submodular maximization with preemption"
    - "online contention resolution schemes"
    - "welfare maximization with production costs a primal dual approach"
    - "tight bounds for online vector scheduling"
    - "optimal approximation for submodular and supermodular optimization with bounded curvature"
    - "online primal dual for non linear optimization with applications to speed scaling"
    - "welfare and profit maximization with production costs"

Connected through hyperedge HE-5 (induced by source paper "online job scheduling with redundancy and opportunistic checkpointing a speedup function based analysis"):
  with members:
    - "task cloning algorithms in a mapreduce cluster with competitive performance bounds"
    - "optimization for speculative execution of multiple jobs in a mapreduce like cluster"
    - "competitive algorithms from competitive equilibria non clairvoyant scheduling under polyhedral constraints"
    - "when queueing meets coding optimal latency data retrieving scheme in storage clouds"
    - "when do redundant requests reduce latency"
    - "online primal dual for non linear optimization with applications to speed scaling"
    - "online scheduling on identical machines using srpt"

Connected through hyperedge HE-6 (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"
    - "lift and round to improve weighted completion time on unrelated machines"
    - "inner product spaces for minsum coordination mechanisms"

Connected through hyperedge HE-7 (induced by source paper "convex program duality fisher markets and nash social welfare"):
  with members:
    - "when does the price of anarchy tend to 1 in large walrasian auctions and fisher markets"
    - "apx hardness of maximizing nash social welfare with indivisible items"
    - "welfare maximization with production costs a primal dual approach"
    - "online packing and covering framework with convex objectives"
    - "a rational convex program for linear arrow debreu markets"
    - "market equilibrium with transaction costs"

Connected through hyperedge HE-8 (induced by source paper "approximating k forest with resource augmentation a primal dual approach"):
  with members:
    - "competitive algorithms from competitive equilibria non clairvoyant scheduling under polyhedral constraints"
    - "rejecting jobs to minimize load and maximum flow time"
    - "clustering is difficult only when it does not matter"
    - "dial a ride from k forest"
    - "on line paging against adversarially biased random inputs"

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)