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 with side information"
  Abstract: In applications of storage systems to modern key-value stores, the stored data is highly dynamic due to frequent updates from the system write clients. The multi-version coding problem has been formulated to study the cost of storing dynamic data in asynchronous distributed storage systems. In this problem, previous work considered a completely decentralized system where a server is 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 versions propagated to some other servers. In particular, we study a storage system with $n$ servers that store $\nu$ totally ordered independent versions of a message. Each server receives a subset of these $\nu$ versions that defines the state of that server. #R##N#Assuming that the servers are distributed in a ring, a server is aware of which versions have been received by its $h$-hop neighbors. If the server is aware of the states of $(n-2)$ other servers, we show that this side information can result in a better storage cost as compared with the case where there is no side information. Through an information-theoretic converse, we identify scenarios where, even if the server is aware of the states of $(n-3)/2$ other servers, the side information may not help in improving the worst-case storage cost beyond the case where servers have no side information.

Connected through hyperedge HE-1 (induced by source paper "fundamental limits of erasure coded key value stores with side information"):
  with members:
    - "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"
    - "multi version coding an information theoretic perspective of consistent distributed storage"
    - "erasure coded byzantine storage with separate metadata"
    - "a coded shared atomic memory algorithm for message passing architectures"

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)