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: "on the latency of erasure coded cloud storage systems"
  Abstract: Distributed (Cloud) Storage Systems (DSS) exhibit heterogeneity in several dimensions such as the volume (size) of data, frequency of data access and the desired degree of reliability. Ultimately, the complex interplay between these dimensions impacts the latency performance of cloud storage systems. To this end, we propose and analyze a heterogeneous distributed storage model in which $n$ storage servers (disks) store the data of $R$ distinct classes. Data of class $i$ is encoded using a $(n,k_{i})$ erasure code and the (random) data retrieval requests can also vary from class to class. We present a queuing theoretic analysis of the proposed model and establish upper and lower bounds on the average latency for each data class under various scheduling policies for data retrieval. Using simulations, we verify the accuracy of the proposed bounds and present qualitative insights which reveal the impact of heterogeneity and scheduling policies on the mean latency of different data classes. Lastly, we conclude with a discussion on per-class fairness in heterogeneous DSS.

Connected through hyperedge HE-1 (induced by source paper "differentiated latency in data center networks with erasure coded files through traffic engineering"):
  with members:
    - "joint latency and cost optimization for erasure coded data center storage"
    - "layered exact repair regenerating codes via embedded error correction and block designs"
    - "distributed data storage systems with opportunistic repair"
    - "when queueing meets coding optimal latency data retrieving scheme in storage clouds"
    - "on the delay storage trade off in content download from coded distributed storage systems"

Connected through hyperedge HE-2 (induced by source paper "joint latency and cost optimization for erasure coded data center storage"):
  with members:
    - "when queueing meets coding optimal latency data retrieving scheme in storage clouds"
    - "xoring elephants novel erasure codes for big data"
    - "tofec achieving optimal throughput delay trade off of cloud storage using erasure codes"
    - "fast cloud pushing the envelope on delay performance of cloud storage with coding"
    - "on the delay storage trade off in content download from coded distributed storage systems"
    - "the mds queue analysing the latency performance of erasure codes"
    - "enabling node repair in any erasure code for distributed storage"
    - "a survey on network codes for distributed storage"

Connected through hyperedge HE-3 (induced by source paper "tail index for a distributed storage system with pareto file size distribution"):
  with members:
    - "when queueing meets coding optimal latency data retrieving scheme in storage clouds"
    - "xoring elephants novel erasure codes for big data"
    - "tofec achieving optimal throughput delay trade off of cloud storage using erasure codes"
    - "fast cloud pushing the envelope on delay performance of cloud storage with coding"
    - "on the delay storage trade off in content download from coded distributed storage systems"
    - "the mds queue analysing the latency performance of erasure codes"

Connected through hyperedge HE-4 (induced by source paper "provably delay efficient data retrieving in storage clouds"):
  with members:
    - "when queueing meets coding optimal latency data retrieving scheme in storage clouds"
    - "when do redundant requests reduce latency"
    - "tofec achieving optimal throughput delay trade off of cloud storage using erasure codes"
    - "fast cloud pushing the envelope on delay performance of cloud storage with coding"
    - "a solution to the network challenges of data recovery in erasure coded distributed storage systems a study on the facebook warehouse cluster"
    - "on the delay storage trade off in content download from coded distributed storage systems"
    - "the mds queue analysing the latency performance of erasure codes"
    - "online scheduling on identical machines using srpt"

Connected through hyperedge HE-5 (induced by source paper "when do redundant requests reduce latency"):
  with members:
    - "provably delay efficient data retrieving in storage clouds"
    - "locality and availability in distributed storage"
    - "fast cloud pushing the envelope on delay performance of cloud storage with coding"
    - "regenerating codes for errors and erasures in distributed storage"
    - "coding for fast content download"
    - "the mds queue analysing the latency performance of erasure codes"

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)