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 "analyzing the download time of availability codes"):
  Abstract: Availability codes have recently been proposed to facilitate efficient storage, management, and retrieval of frequently accessed data in distributed storage systems. Such codes provide multiple disjoint recovery groups for each data object, which makes it possible for multiple users to access the same object in a non-overlapping way. However in the presence of server-side performance variability, downloading an object using a recovery group takes longer than using a single server hosting the object. Therefore it is not immediately clear whether availability codes reduce latency to access hot data. Accordingly, the goal of this paper is to analyze, using a queuing theoretical approach, the download time in storage systems that employ availability codes. For data access, we consider the widely adopted Fork-Join model with redundancy. In this model, each request arrival splits into multiple copies and completes as soon as any one of the copies finishes service. We first carry out the analysis under the low-traffic regime in which case the system consists of at most one download request at any time. In this setting, we compare the download time in systems with availability, maximum distance separable (MDS), and replication codes. Our results indicate that availability codes can reduce download time in some settings, but are not always optimal. When the low-traffic assumption does not hold, system consists of multiple inter-dependent Fork-Join queues operating in parallel, which makes the exact analysis intractable. For this case we present upper and lower bounds on the download time. These bounds yield insight on system performance with respect to varying popularities over the stored objects. We also derive an M/G/1 queue approximation for the system, and show with simulations that it performs well in estimating the actual system performance.

Includes members:
  Member "straggler mitigation at scale":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "timely distributed computation with stragglers")
  Member "simplex queues for hot data download":
    also connected through other hyperedges:
      - Hyperedge HE-2 (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")
  Member "on the service capacity region of accessing erasure coded content":
    also connected through other hyperedges:
      - Hyperedge HE-3 (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")
  Member "rate optimal binary linear locally repairable codes with small availability":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "erasure codes for distributed storage tight bounds and matching constructions")
  Member "efficient redundancy techniques for latency reduction in cloud systems":
    also connected through other hyperedges:
      - Hyperedge HE-5 (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")
  Member "provably delay efficient data retrieving in storage clouds":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "speeding up distributed machine learning using codes")
  Member "repair locality with multiple erasure tolerance":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "on optimal locally repairable codes and generalized sector disk codes")
  Member "locality and availability in distributed storage":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "on optimal locally repairable codes and generalized sector disk 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.PF(Performance)