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: "a unified approach to truthful scheduling on related machines"
  Abstract: We present a unified framework for designing deterministic monotone polynomial time approximation schemes (PTAS's) for a wide class of scheduling problems on uniformly related machines. This class includes (among others) minimizing the makespan, maximizing the minimum load, and minimizing the l_p norm of the machine loads vector. Previously, this kind of result was only known for the makespan objective. Monotone algorithms have the property that an increase in the speed of a machine cannot decrease the amount of work assigned to it. The key idea of our novel method is to show that for goal functions that are sufficiently well-behaved functions of the machine loads, it is possible to compute in polynomial time a highly structured nearly optimal schedule. Monotone approximation schemes have an important role in the emerging area of algorithmic mechanism design. In the game-theoretical setting of these scheduling problems there is a social goal, which is one of the objective functions that we study. Each machine is controlled by a selfish single-parameter agent, where its private information is its cost of processing a unit sized job, which is also the inverse of the speed of its machine. Each agent wishes to maximize its own profit, defined as the payment it receives from the mechanism minus its cost for processing all jobs assigned to it, and places a bid which corresponds to its private information. For each one of the problems, we show that we can calculate payments that guarantee truthfulness in an efficient manner. Thus, there exists a dominant strategy where agents report their true speeds, and we show the existence of a truthful mechanism which can be implemented in polynomial time, where the social goal is approximated within a factor of 1+epsilon for every epsilon>0.

Connected through hyperedge HE-1 (induced by source paper "on the nisan ronen conjecture for submodular valuations"):
  with members:
    - "no truthful mechanism can be better than n approximate for two natural problems"
    - "breaking the logarithmic barrier for truthful combinatorial auctions with submodular bidders"
    - "setting lower bounds on truthfulness"
    - "the vcg mechanism for bayesian scheduling"
    - "bayesian truthful mechanisms for job scheduling from bi criterion approximation algorithms"
    - "copula based randomized mechanisms for truthful scheduling on two unrelated machines"
    - "multi unit auctions beyond roberts"
    - "a deterministic truthful ptas for scheduling related machines"

Connected through hyperedge HE-2 (induced by source paper "the vcg mechanism for bayesian scheduling"):
  with members:
    - "bayesian truthful mechanisms for job scheduling from bi criterion approximation algorithms"
    - "prophet inequalities with limited information"
    - "prior independent mechanisms for scheduling"
    - "a deterministic truthful ptas for scheduling related machines"
    - "an improved randomized truthful mechanism for scheduling unrelated machines"
    - "computationally feasible vcg mechanisms"

Connected through hyperedge HE-3 (induced by source paper "a unified heuristic and an annotated bibliography for a large class of earliness tardiness scheduling problems"):
  with members:
    - "efficient local search limitation strategy for single machine total weighted tardiness scheduling with sequence dependent setup times"
    - "iterated local search and very large neighborhoods for the parallel machines total tardiness problem"

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)