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 "multi version coding an information theoretic perspective of consistent distributed storage"):
  Abstract: In applications of distributed storage systems to distributed computing and implementation of key- value stores, the following property, usually referred to as consistency in computer science and engineering, is an important requirement: as the data stored changes, the latest version of the data must be accessible to a client that connects to the storage system. An information theoretic formulation called multi-version coding is introduced in the paper, in order to study storage costs of consistent distributed storage systems. Multi-version coding is characterized by {\nu} totally ordered versions of a message, and a storage system with n servers. At each server, values corresponding to an arbitrary subset of the {\nu} versions are received and encoded. For any subset of c servers in the storage system, the value corresponding to the latest common version, or a later version as per the total ordering, among the c servers is required to be decodable. An achievable multi-version code construction via linear coding and a converse result that shows that the construction is approximately tight, are provided. An implication of the converse is that there is an inevitable price, in terms of storage cost, to ensure consistency in distributed storage systems.

Includes members:
  Member "a layered architecture for erasure coded consistent distributed storage":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "convertible codes efficient conversion of coded data in distributed storage")
  Member "radon repairable atomic data object in networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "fundamental limits of erasure coded key value stores with side information")
  Member "communication cost for updating linear functions when message updates are sparse connections to maximally recoverable codes":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "codes for updating linear functions over small fields")
  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 "content type coding":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "private pliable index coding")
  Member "compressed differential erasure codes for efficient archival of versioned data":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "harnessing correlations in distributed erasure coded key value stores")
  Member "synchronizing edits in distributed storage networks":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "harnessing correlations in distributed erasure coded key value stores")
  Member "fundamental limits on communication for oblivious updates in storage networks":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "codes for updating linear functions over small fields")

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)