human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "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.

Connected through hyperedge HE-1 (induced by source paper "convertible codes efficient conversion of coded data in distributed storage"):
  with members:
    - "an exponential lower bound on the sub packetization of msr codes"
    - "combinatorial alphabet dependent bounds for locally recoverable codes"
    - "capacity of locally recoverable codes"
    - "a layered architecture for erasure coded consistent distributed storage"
    - "product matrix msr codes with bandwidth adaptive exact repair"
    - "bandwidth adaptive error resilient mbr exact repair regenerating codes"
    - "the storage vs repair bandwidth trade off for multiple failures in clustered storage networks"
    - "locally recoverable codes from algebraic curves and surfaces"

Connected through hyperedge HE-2 (induced by source paper "coded state machine scaling state machine execution under byzantine faults"):
  with members:
    - "interpol information theoretically verifiable polynomial evaluation"
    - "speeding up distributed machine learning using codes"
    - "lagrange coded computing optimal design for resiliency security and privacy"
    - "polynomial codes an optimal design for high dimensional coded matrix multiplication"
    - "short dot computing large linear transforms distributedly using coded short dot products"
    - "a fundamental tradeoff between computation and communication in distributed computing"
    - "a unified coding framework for distributed computing with straggling servers"
    - "information theoretic lower bounds on the storage cost of shared memory emulation"

Connected through hyperedge HE-3 (induced by source paper "codes for updating linear functions over small fields"):
  with members:
    - "updating content in cache aided coded multicast"
    - "multi version coding for consistent distributed storage of correlated data updates"
    - "communication cost for updating linear functions when message updates are sparse connections to maximally recoverable codes"
    - "vector network coding based on subspace codes outperforms scalar linear network coding"
    - "error correcting functional index codes generalized exclusive laws and graph coloring"
    - "index coding with coded side information"
    - "fundamental limits on communication for oblivious updates in storage networks"
    - "coding for errors and erasures in random network coding"

Connected through hyperedge HE-4 (induced by source paper "harnessing correlations in distributed erasure coded key value stores"):
  with members:
    - "on coding for cache aided delivery of dynamic correlated content"
    - "storage efficient shared memory emulation"
    - "a layered architecture for erasure coded consistent distributed storage"
    - "multi version coding for consistent distributed storage of correlated data updates"
    - "communication cost for updating linear functions when message updates are sparse connections to maximally recoverable codes"
    - "correlation aware distributed caching and coded delivery"
    - "information theoretic lower bounds on the storage cost of shared memory emulation"
    - "compressed differential erasure codes for efficient archival of versioned data"

Connected through hyperedge HE-5 (induced by source paper "fundamental limits of erasure coded key value stores with side information"):
  with members:
    - "multi version coding with side information"
    - "harnessing correlations in distributed erasure coded key value stores"
    - "storage efficient shared memory emulation"
    - "radon repairable atomic data object in networks"
    - "information theoretic lower bounds on the storage cost of shared memory emulation"
    - "storage optimized data atomic algorithms for handling erasures and errors in distributed storage systems"
    - "erasure coded byzantine storage with separate metadata"
    - "a coded shared atomic memory algorithm for message passing architectures"

Connected through hyperedge HE-6 (induced by source paper "storage efficient shared memory emulation"):
  with members:
    - "a layered architecture for erasure coded consistent distributed storage"
    - "radon repairable atomic data object in networks"
    - "information theoretic lower bounds on the storage cost of shared memory emulation"
    - "storage optimized data atomic algorithms for handling erasures and errors in distributed storage systems"
    - "space bounds for reliable storage fundamental limits of coding"

Connected through hyperedge HE-7 (induced by source paper "multi version coding with side information"):
  with members:
    - "harnessing correlations in distributed erasure coded key value stores"
    - "multi version coding for consistent distributed storage of correlated data updates"

Connected through hyperedge HE-8 (induced by source paper "multi version coding for consistent distributed storage of correlated data updates"):
  with members:
    - "correlation aware distributed caching and coded delivery"
    - "file updates under random arbitrary insertions and deletions"
    - "fundamental limits on communication for oblivious updates in storage networks"
    - "a family of optimal locally recoverable codes"
    - "is non unique decoding necessary"
    - "simultaneous nonunique decoding is rate optimal"
    - "a compression algorithm using mis aligned side information"

Question: Please tell me which class the center node 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)