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 "load balancing performance in distributed storage with regular balanced redundancy"):
  Abstract: Contention at the storage nodes is the main cause of long and variable data access times in distributed storage systems. Offered load on the system must be balanced across the storage nodes in order to minimize contention, and load balance in the system should be robust against the skews and fluctuations in content popularities. Data objects are replicated across multiple nodes in practice to allow for load balancing. However redundancy increases the storage requirement and should be used efficiently. We evaluate load balancing performance of natural storage schemes in which each data object is stored at $d$ different nodes and each node stores the same number of objects. We find that load balance in a system of $n$ nodes improves multiplicatively with $d$ as long as $d = o\left(\log(n)\right)$, and improves exponentially as soon as $d = \Theta\left(\log(n)\right)$. We show that the load balance in the system improves the same way with $d$ when the service choices are created with XOR's of $r$ objects rather than object replicas, which also reduces the storage overhead multiplicatively by $r$. However, unlike accessing an object replica, access through a recovery set composed by an XOR'ed object copy requires downloading content from $r$ nodes, which increases the load imbalance in the system additively by $r$.

Includes members:
  Member "redundancy scheduling in systems with bi modal job service time distribution":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "scheduling in the presence of data intensivecompute jobs")
  Member "service rate region of content access from erasure coded storage":
    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 "optimal combinatorial batch codes based on block designs":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "constructions of batch codes via finite geometry")
  Member "interactive analytical processing in big data systems a cross industry study of mapreduce workloads":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "vat asymptotic cost analysis for multi level key value stores")
  Member "memory allocation in distributed storage networks":
    also connected through other hyperedges:
      - Hyperedge HE-6 (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 "balanced allocation on graphs":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "storage communication and load balancing trade off in distributed cache networks")

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)