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: "the mds queue analysing the latency performance of erasure codes"
  Abstract: In order to scale economically, data centers are increasingly evolving their data storage methods from the use of simple data replication to the use of more powerful erasure codes, which provide the same level of reliability as replication but at a significantly lower storage cost. In particular, it is well known that Maximum-Distance-Separable (MDS) codes, such as Reed-Solomon codes, provide the maximum storage efficiency. While the use of codes for providing improved reliability in archival storage systems, where the data is less frequently accessed (or so-called "cold data"), is well understood, the role of codes in the storage of more frequently accessed and active "hot data", where latency is the key metric, is less clear. #R##N#In this paper, we study data storage systems based on MDS codes through the lens of queueing theory, and term this the "MDS queue." We analytically characterize the (average) latency performance of MDS queues, for which we present insightful scheduling policies that form upper and lower bounds to performance, and are observed to be quite tight. Extensive simulations are also provided and used to validate our theoretical analysis. We also employ the framework of the MDS queue to analyse different methods of performing so-called degraded reads (reading of partial data) in distributed data storage.

Connected through hyperedge HE-1 (induced by source paper "a combinatorial view of the service rates of codes problem its equivalence to fractional matching and its connection with batch codes"):
  with members:
    - "a geometric view of the service rates of codes problem and its application to the service rate of the first order reed muller codes"
    - "load balancing performance in distributed storage with regular balanced redundancy"
    - "analyzing the download time of availability codes"
    - "service rate region of content access from erasure coded storage"
    - "simplex queues for hot data download"
    - "batch and pir codes and their connections to locally repairable codes"
    - "on distributed storage allocations of large files for maximum service rate"
    - "on the service capacity region of accessing erasure coded content"

Connected through hyperedge HE-2 (induced by source paper "analyzing the download time of availability codes"):
  with members:
    - "straggler mitigation at scale"
    - "simplex queues for hot data download"
    - "on the service capacity region of accessing erasure coded content"
    - "rate optimal binary linear locally repairable codes with small availability"
    - "efficient redundancy techniques for latency reduction in cloud systems"
    - "provably delay efficient data retrieving in storage clouds"
    - "repair locality with multiple erasure tolerance"
    - "locality and availability in distributed storage"

Connected through hyperedge HE-3 (induced by source paper "multi tier caching analysis in cdn based over the top video streaming systems"):
  with members:
    - "fasttrack minimizing stalls for cdn based over the top video streaming systems"
    - "optimized video streaming over cloud a stall quality trade off"
    - "generalization of lru cache replacement policy with applications to video streaming"
    - "video streaming in distributed erasure coded storage systems stall duration analysis"
    - "joint latency and cost optimization for erasure coded data center storage"
    - "sprout a functional caching approach to minimize service latency in erasure coded storage"
    - "a unified approach to the performance analysis of caching systems"
    - "fast cloud pushing the envelope on delay performance of cloud storage with coding"

Connected through hyperedge HE-4 (induced by source paper "mds coding is better than replication for job completion times"):
  with members:
    - "gradient coding with clustering and multi message communication"
    - "speeding up distributed machine learning using codes"
    - "speeding up distributed gradient descent by utilizing non persistent stragglers"
    - "improving distributed gradient descent using reed solomon codes"
    - "when do redundant requests reduce latency"
    - "on the delay storage trade off in content download from coded distributed storage systems"
    - "network coding meets tcp"

Connected through hyperedge HE-5 (induced by source paper "optimized video streaming over cloud a stall quality trade off"):
  with members:
    - "video streaming in distributed erasure coded storage systems stall duration analysis"
    - "parallel and distributed methods for nonconvex optimization part i theory"
    - "when queueing meets coding optimal latency data retrieving scheme in storage clouds"
    - "xoring elephants novel erasure codes for big data"
    - "on the delay storage trade off in content download from coded distributed storage systems"

Connected through hyperedge HE-6 (induced by source paper "on the service capacity region of accessing erasure coded content"):
  with members:
    - "simplex queues for hot data download"
    - "on storage allocation for maximum service rate in distributed storage systems"
    - "repair locality with multiple erasure tolerance"
    - "locality and availability in distributed storage"
    - "bounds on locally recoverable codes with multiple recovering sets"
    - "fast cloud pushing the envelope on delay performance of cloud storage with coding"
    - "coding for fast content download"
    - "on the locality of codeword symbols"

Connected through hyperedge HE-7 (induced by source paper "video streaming in distributed erasure coded storage systems stall duration analysis"):
  with members:
    - "optimized video streaming over cloud a stall quality trade off"
    - "lbp robust rate adaptation algorithm for svc video streaming"
    - "joint latency and cost optimization for erasure coded data center storage"
    - "when queueing meets coding optimal latency data retrieving scheme in storage clouds"
    - "xoring elephants novel erasure codes for big data"
    - "on the delay storage trade off in content download from coded distributed storage systems"

Connected through hyperedge HE-8 (induced by source paper "delay asymptotics and bounds for multi task parallel jobs"):
  with members:
    - "delay comparison of delivery and coding policies in data clusters"
    - "joint latency and cost optimization for erasure coded data center storage"
    - "when do redundant requests reduce latency"
    - "interactive analytical processing in big data systems a cross industry study of mapreduce workloads"

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.IT(Information Theory)