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 "fundamental limits of erasure coded key value stores with side information"):
  Abstract: In applications of distributed storage systems to modern key-value stores, the stored data is highly dynamic due to frequent updates. The multi-version coding problem was formulated to study the cost of storing dynamic data in distributed storage systems. Previous work on multi-version coding considered a completely decentralized and asynchronous system assuming that the servers are not aware of which versions of the data are received by the other servers. In this paper, we relax this assumption and study a system where a server may acquire side information of the data versions propagated to some other servers based on the network topology. Specifically, we study a storage system with $n$ servers over a directed graph that store $\nu$ totally ordered versions of a message. Each server receives a subset of these $\nu$ versions. A server is aware of which versions have been received by its neighbors in the network graph. We show that the side information can result in a better storage cost as compared with the case where there is no side information for some regimes at the expense of the additional latency associated with exchanging the side information. Through an information-theoretic converse, we identify surprising scenarios where the side information may not help in improving the worst-case storage cost beyond the case where servers have no side information. Finally, we present a case study over Amazon web services (AWS) that demonstrates the potential cost reductions that may be obtained by our constructions.

Includes members:
  Member "multi version coding with side information":
    also connected through other hyperedges:
      (none)
  Member "harnessing correlations in distributed erasure coded key value stores":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "multi version coding with side information")
  Member "storage efficient shared memory emulation":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "harnessing correlations in distributed erasure coded key value stores")
  Member "radon repairable atomic data object in networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "storage efficient shared memory emulation")
  Member "information theoretic lower bounds on the storage cost of shared memory emulation":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "coded state machine scaling state machine execution under byzantine faults")
  Member "storage optimized data atomic algorithms for handling erasures and errors in distributed storage systems":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "self stabilizing and private distributed shared atomic memory in seldomly fair message passing networks")
  Member "multi version coding an information theoretic perspective of consistent distributed storage":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "convertible codes efficient conversion of coded data in distributed storage")
  Member "erasure coded byzantine storage with separate metadata":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "self stabilizing and private distributed shared atomic memory in seldomly fair message passing 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.IT(Information Theory)