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 "harnessing correlations in distributed erasure coded key value stores"):
  Abstract: Motivated by applications of distributed storage systems to cloud-based key-value stores, the multi-version coding problem has been recently formulated to efficiently store frequently updated data in asynchronous decentralized storage systems. Inspired by consistency requirements in distributed systems, the main goal in multi-version coding is to ensure that the latest possible version of the data is decodable, even if the data updates have not reached some servers in the system. In this paper, we study the storage cost of ensuring consistency for the case where the data versions are correlated, in contrast to previous work where data versions were treated as being independent. We provide multi-version code constructions that show that the storage cost can be significantly smaller than the previous constructions depending on the degree of correlation between the different versions of the data. Our achievability results are based on Reed-Solomon codes and random binning. Through an information-theoretic converse, we show that our multi-version codes are nearly-optimal in certain regimes.

Includes members:
  Member "on coding for cache aided delivery of dynamic correlated content":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "rate distortion memory trade offs in heterogeneous caching networks")
  Member "storage efficient shared memory emulation":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "fundamental limits of erasure coded key value stores with side information")
  Member "a layered architecture for erasure coded consistent distributed storage":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "convertible codes efficient conversion of coded data in distributed storage")
  Member "multi version coding for consistent distributed storage of correlated data updates":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "codes for updating linear functions over small fields")
  Member "communication cost for updating linear functions when message updates are sparse connections to maximally recoverable codes":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "codes for updating linear functions over small fields")
  Member "correlation aware distributed caching and coded delivery":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "rate memory trade off for caching and delivery of correlated sources")
  Member "information theoretic lower bounds on the storage cost of shared memory emulation":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "coded state machine scaling state machine execution under byzantine faults")
  Member "multi version coding an information theoretic perspective of consistent distributed storage":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "convertible codes efficient conversion of coded data in distributed storage")

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)