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: "when queueing meets coding optimal latency data retrieving scheme in storage clouds"
  Abstract: In this paper, we study the problem of reducing the delay of downloading data from cloud storage systems by leveraging multiple parallel threads, assuming that the data has been encoded and stored in the clouds using fixed rate forward error correction (FEC) codes with parameters (n, k). That is, each file is divided into k equal-sized chunks, which are then expanded into n chunks such that any k chunks out of the n are sufficient to successfully restore the original file. The model can be depicted as a multiple-server queue with arrivals of data retrieving requests and a server corresponding to a thread. However, this is not a typical queueing model because a server can terminate its operation, depending on when other servers complete their service (due to the redundancy that is spread across the threads). Hence, to the best of our knowledge, the analysis of this queueing model remains quite uncharted. #R##N#Recent traces from Amazon S3 show that the time to retrieve a fixed size chunk is random and can be approximated as a constant delay plus an i.i.d. exponentially distributed random variable. For the tractability of the theoretical analysis, we assume that the chunk downloading time is i.i.d. exponentially distributed. Under this assumption, we show that any work-conserving scheme is delay-optimal among all on-line scheduling schemes when k = 1. When k > 1, we find that a simple greedy scheme, which allocates all available threads to the head of line request, is delay optimal among all on-line scheduling schemes. We also provide some numerical results that point to the limitations of the exponential assumption, and suggest further research directions.

Connected through hyperedge HE-1 (induced by source paper "delay optimal policies in partial fork join systems with redundancy and random slowdowns"):
  with members:
    - "mds coding is better than replication for job completion times"
    - "delay comparison of delivery and coding policies in data clusters"
    - "on delay optimal scheduling in queueing systems with replications"
    - "contrasting effects of replication in parallel systems from overload to underload and back"
    - "efficient redundancy techniques for latency reduction in cloud systems"
    - "using straggler replication to reduce latency in large scale parallel computing"
    - "efficient task replication for fast response times in parallel computation"
    - "when do redundant requests reduce latency"

Connected through hyperedge HE-2 (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"
    - "on the latency of erasure coded cloud storage systems"
    - "on the delay storage trade off in content download from coded distributed storage systems"

Connected through hyperedge HE-3 (induced by source paper "on distributed storage allocations of large files for maximum service rate"):
  with members:
    - "on the service capacity region of accessing erasure coded content"
    - "on storage allocation for maximum service rate in distributed storage systems"
    - "distributed storage allocations"
    - "coding for fast content download"
    - "distributed storage allocations for optimal delay"
    - "memory allocation in distributed storage networks"

Connected through hyperedge HE-4 (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"
    - "xoring elephants novel erasure codes for big data"
    - "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-5 (induced by source paper "joint information freshness and completion time optimization for vehicular networks"):
  with members:
    - "optimizing age of information in wireless networks with perfect channel state information"
    - "joint latency and cost optimization for erasure coded data center storage"
    - "update or wait how to keep your data fresh"
    - "age of information in the presence of error"
    - "optimizing data freshness throughput and delay in multi server information update systems"

Connected through hyperedge HE-6 (induced by source paper "minimizing the age of the information through queues"):
  with members:
    - "the power of waiting for more than one response in minimizing the age of information"
    - "age optimal information updates in multihop networks"
    - "remote estimation of the wiener process over a channel with random delay"
    - "on delay optimal scheduling in queueing systems with replications"
    - "update or wait how to keep your data fresh"
    - "age of information in the presence of error"
    - "optimizing data freshness throughput and delay in multi server information update systems"
    - "age of information the gamma awakening"

Connected through hyperedge HE-7 (induced by source paper "online job scheduling with redundancy and opportunistic checkpointing a speedup function based analysis"):
  with members:
    - "task cloning algorithms in a mapreduce cluster with competitive performance bounds"
    - "optimization for speculative execution of multiple jobs in a mapreduce like cluster"
    - "competitive algorithms from competitive equilibria non clairvoyant scheduling under polyhedral constraints"
    - "selfishmigrate a scalable algorithm for non clairvoyantly scheduling heterogeneous processors"
    - "when do redundant requests reduce latency"
    - "online primal dual for non linear optimization with applications to speed scaling"
    - "online scheduling on identical machines using srpt"

Connected through hyperedge HE-8 (induced by source paper "taming tail latency for erasure coded distributed storage systems"):
  with members:
    - "joint latency and cost optimization for erasure coded data center storage"
    - "sprout a functional caching approach to minimize service latency in erasure coded storage"
    - "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"

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)