human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "optimal server selection for straggler mitigation"):
  Abstract: The performance of large-scale distributed compute systems is adversely impacted by stragglers when the execution time of a job is uncertain. To manage stragglers, we consider a multi-fork approach for job scheduling, where additional parallel servers are added at forking instants. In terms of the forking instants and the number of additional servers, we compute the job completion time and the cost of server utilization when the task processing times are assumed to have a shifted exponential distribution. We use this study to provide insights into the scheduling design of the forking instants and the associated number of additional servers to be started. Numerical results demonstrate orders of magnitude improvement in cost in the regime of low completion times as compared to the prior works.

Includes members:
  Member "speeding up distributed machine learning using codes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "gcsa codes with noise alignment for secure coded multi party batch matrix multiplication")
  Member "straggler mitigation by delayed relaunch of tasks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "codenet training large scale neural networks in presence of soft errors")
  Member "video streaming in distributed erasure coded storage systems stall duration analysis":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "capacity of distributed storage systems with clusters and separate nodes")
  Member "joint latency and cost optimization for erasure coded data center storage":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "grand challenges of resilience autonomous system resilience through design and runtime measures")
  Member "using straggler replication to reduce latency in large scale parallel computing extended version":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "contrasting effects of replication in parallel systems from overload to underload and back")
  Member "when do redundant requests reduce latency":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "straggler resistant distributed matrix computation via coding theory")
  Member "on the delay storage trade off in content download from coded distributed storage systems":
    also connected through other hyperedges:
      - Hyperedge HE-7 (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")

Question: Please tell me which class the source paper 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.NI(Networking and Internet Architecture)