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: "competitive algorithms from competitive equilibria non clairvoyant scheduling under polyhedral constraints"
  Abstract: We introduce and study a general scheduling problem that we term the Packing Scheduling problem. In this problem, jobs can have different arrival times and sizes; a scheduler can process job $j$ at rate $x_j$, subject to arbitrary packing constraints over the set of rates ($\vec{x}$) of the outstanding jobs. The PSP framework captures a variety of scheduling problems, including the classical problems of unrelated machines scheduling, broadcast scheduling, and scheduling jobs of different parallelizability. It also captures scheduling constraints arising in diverse modern environments ranging from individual computer architectures to data centers. More concretely, PSP models multidimensional resource requirements and parallelizability, as well as network bandwidth requirements found in data center scheduling. #R##N#In this paper, we design non-clairvoyant online algorithms for PSP and its special cases -- in this setting, the scheduler is unaware of the sizes of jobs. Our two main results are, 1) a constant competitive algorithm for minimizing total weighted completion time for PSP and 2)a scalable algorithm for minimizing the total flow-time on unrelated machines, which is a special case of PSP.

Connected through hyperedge HE-1 (induced by source paper "dynamic weighted fairness with minimal disruptions"):
  with members:
    - "dynamic fair division problem with general valuations"
    - "dominant resource fairness in cloud computing systems with heterogeneous servers"

Connected through hyperedge HE-2 (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"
    - "selfishmigrate a scalable algorithm for non clairvoyantly scheduling heterogeneous processors"
    - "the geometry of scheduling"

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"
    - "selfishmigrate a scalable algorithm for non clairvoyantly scheduling heterogeneous processors"
    - "the geometry of scheduling"

Connected through hyperedge HE-4 (induced by source paper "the fair division of hereditary set systems"):
  with members:
    - "approximation algorithms for computing maximin share allocations"
    - "fair division of a graph"

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"
    - "when queueing meets coding optimal latency data retrieving scheme in storage clouds"
    - "selfishmigrate a scalable algorithm for non clairvoyantly scheduling heterogeneous processors"
    - "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 "approximating k forest with resource augmentation a primal dual approach"):
  with members:
    - "rejecting jobs to minimize load and maximum flow time"
    - "selfishmigrate a scalable algorithm for non clairvoyantly scheduling heterogeneous processors"
    - "clustering is difficult only when it does not matter"
    - "dial a ride from k forest"
    - "on line paging against adversarially biased random inputs"

Connected through hyperedge HE-7 (induced by source paper "computing equilibria in markets with budget additive utilities"):
  with members:
    - "an improved combinatorial polynomial algorithm for the linear arrow debreu market"

Connected through hyperedge HE-8 (induced by source paper "ascending price algorithms for unknown markets"):
  with members:
    - "approximating the nash social welfare with budget additive valuations"
    - "convex program duality fisher markets and nash social welfare"
    - "nash social welfare for indivisible items under separable piecewise linear concave utilities"
    - "an improved combinatorial polynomial algorithm for the linear arrow debreu market"
    - "convergence of tâtonnement in fisher markets"
    - "a rational convex program for linear arrow debreu markets"
    - "tatonnement in ongoing markets of complementary goods"
    - "the complexity of non monotone markets"

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)