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: "scalable system scheduling for hpc and big data"
  Abstract: Abstract   In the rapidly expanding field of parallel processing, job schedulers are the “operating systems” of modern big data architectures and supercomputing systems. Job schedulers allocate computing resources and control the execution of processes on those resources. Historically, job schedulers were the domain of supercomputers, and job schedulers were designed to run massive, long-running computations over days and weeks. More recently, big data workloads have created a need for a new class of computations consisting of many short computations taking seconds or minutes that process enormous quantities of data. For both supercomputers and big data systems, the efficiency of the job scheduler represents a fundamental limit on the efficiency of the system. Detailed measurement and modeling of the performance of schedulers are critical for maximizing the performance of a large-scale computing system. This paper presents a detailed feature analysis of 15 supercomputing and big data schedulers. For big data workloads, the scheduler latency is the most important performance characteristic of the scheduler. A theoretical model of the latency of these schedulers is developed and used to design experiments targeted at measuring scheduler latency. Detailed benchmarking of four of the most popular schedulers (Slurm, Son of Grid Engine, Mesos, and Hadoop YARN) is conducted. The theoretical model is compared with data and demonstrates that scheduler performance can be characterized by two key parameters: the marginal latency of the scheduler      t    s      and a nonlinear exponent      α    s     . For all four schedulers, the utilization of the computing system decreases to  90% for all four of the schedulers that were tested.

Connected through hyperedge HE-1 (induced by source paper "interactive launch of 16 000 microsoft windows instances on a supercomputer"):
  with members:
    - "the lustre storage architecture"
    - "interactive supercomputing on 40 000 cores for machine learning and data analysis"
    - "llmapreduce multi level map reduce for high performance data analysis"
    - "scheduler technologies in support of high performance data analysis"
    - "scalability of vm provisioning systems"
    - "enabling on demand database computing with mit supercloud database management system"
    - "big data strategies for data center infrastructure management using a 3d gaming platform"
    - "d4m bringing associative arrays to database engines"

Connected through hyperedge HE-2 (induced by source paper "tabularosa tabular operating system architecture for massively parallel heterogeneous compute engines"):
  with members:
    - "polystore mathematics of relational algebra"
    - "enabling massive deep neural networks with the graphblas"
    - "novel graph processor architecture prototype system and results"
    - "associative array model of sql nosql and newsql databases"
    - "julia implementation of the dynamic distributed dimensional data model"
    - "graphulo implementation of server side sparse matrix multiply in the accumulo database"
    - "graphulo linear algebra graph kernels for nosql databases"
    - "cudnn efficient primitives for deep learning"

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.DC(Distributed, Parallel, and Cluster Computing)