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: "hadoop performance models"
  Abstract: Hadoop MapReduce is now a popular choice for performing large-scale data analytics. This technical report describes a detailed set of mathematical performance models for describing the execution of a MapReduce job on Hadoop. The models describe dataflow and cost information at the fine granularity of phases within the map and reduce tasks of a job execution. The models can be used to estimate the performance of MapReduce jobs as well as to find the optimal configuration settings to use when running the jobs.

Connected through hyperedge HE-1 (induced by source paper "pmv pre partitioned generalized matrix vector multiplication for scalable graph mining"):
  with members:
    - "pregelix big ger graph analytics on a dataflow engine"
    - "distributed graphlab a framework for machine learning in the cloud"
    - "fast sparse matrix vector multiplication on gpus implications for graph mining"

Connected through hyperedge HE-2 (induced by source paper "the family of mapreduce and large scale data processing systems"):
  with members:
    - "distributed graphlab a framework for machine learning in the cloud"
    - "restore reusing results of mapreduce jobs"
    - "v smart join a scalable mapreduce framework for all pair similarity joins of multisets and vectors"
    - "stubby a transformation based optimizer for mapreduce workflows"
    - "automatic optimization for mapreduce programs"
    - "fast clustering using mapreduce"
    - "load balancing for mapreduce based entity resolution"
    - "social content matching in mapreduce"

Connected through hyperedge HE-3 (induced by source paper "complexity measures for map reduce and comparison to parallel computing"):
  with members:
    - "dimension independent similarity computation"

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)