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: "storage optimized data atomic algorithms for handling erasures and errors in distributed storage systems"
  Abstract: Erasure codes are increasingly being studied in the context of implementing atomic memory objects in large scale asynchronous distributed storage systems. When compared with the traditional replication based schemes, erasure codes have the potential of significantly lowering storage and communication costs while simultaneously guaranteeing the desired resiliency levels. In this work, we propose the Storage-Optimized Data-Atomic (SODA) algorithm for implementing atomic memory objects in the multi-writer multi-reader setting. SODA uses Maximum Distance Separable (MDS) codes, and is specifically designed to optimize the total storage cost for a given fault-tolerance requirement. For tolerating f server crashes in an n-server system, SODA uses an [n, k] MDS code with k = n - f, and incurs a total storage cost of n/n-f. SODA is designed under the assumption of reliable point-to-point communication channels. The communication cost of a write and a read operation are respectively given by O(f2) and n/n-f(&#x03B4;w+1), where &#x03B4;w denotes the number of writes that are concurrent with the particular read. In comparison with the recent CASGC algorithm [1], which also uses MDS codes, SODA offers lower storage cost while pays more on the communication cost. We also present a modification of SODA, called SODAerr, to handle the case where some of the servers can return erroneous coded elements during a read operation. Specifically, in order to tolerate f server failures and e error-prone coded elements, the SODAerr algorithm uses an [n, k] MDS code such that k = n - 2e - f. SODAerr also guarantees liveness and atomicity, while maintaining an optimized total storage cost of n/n-f-2e.

Connected through hyperedge HE-1 (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"
    - "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"

Connected through hyperedge HE-2 (induced by source paper "self stabilizing and private distributed shared atomic memory in seldomly fair message passing networks"):
  with members:
    - "a layered architecture for erasure coded consistent distributed storage"
    - "practically self stabilizing vector clocks in the absence of execution fairness"
    - "erasure coded byzantine storage with separate metadata"
    - "a coded shared atomic memory algorithm for message passing architectures"
    - "dijkstra s self stabilizing algorithm in unsupportive environments"

Connected through hyperedge HE-3 (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"
    - "multi version coding an information theoretic perspective of consistent distributed storage"
    - "space bounds for reliable storage fundamental limits of coding"

Connected through hyperedge HE-4 (induced by source paper "a layered architecture for erasure coded consistent distributed storage"):
  with members:
    - "radon repairable atomic data object in networks"
    - "information theoretic lower bounds on the storage cost of shared memory emulation"
    - "space bounds for reliable storage fundamental limits of coding"
    - "evaluation of codes with inherent double replication for hadoop"
    - "a coded shared atomic memory algorithm for message passing architectures"
    - "xoring elephants novel erasure codes for big data"
    - "optimal exact regenerating codes for distributed storage at the msr and mbr points via a product matrix construction"
    - "a survey on network codes for distributed storage"

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.DC(Distributed, Parallel, and Cluster Computing)