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: "erasure coded byzantine storage with separate metadata"
  Abstract: Although many distributed storage protocols have been introduced, a solution that combines the strongest properties in terms of availability, consistency, fault-tolerance, storage complexity and the supported level of concurrency, has been elusive for a long time. Combining these properties is difficult, especially if the resulting solution is required to be efficient and incur low cost. We present AWE, the first erasure-coded distributed implementation of a multi-writer multi-reader read/write storage object that is, at the same time: (1) asynchronous, (2) wait-free, (3) atomic, (4) amnesic, (i.e., with data nodes storing a bounded number of values) and (5) Byzantine fault-tolerant (BFT) using the optimal number of nodes. Furthermore, AWE is efficient since it does not use public-key cryptography and requires data nodes that support only reads and writes, further reducing the cost of deployment and ownership of a distributed storage solution. Notably, AWE stores metadata separately from $k$-out-of-$n$ erasure-coded fragments. This enables AWE to be the first BFT protocol that uses as few as $2t+k$ data nodes to tolerate $t$ Byzantine nodes, for any $k \ge 1$.

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"
    - "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"
    - "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"
    - "storage optimized data atomic algorithms for handling erasures and errors in distributed storage systems"
    - "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 "integrated bounds for disintegrated storage"):
  with members:
    - "space complexity of implementing large shared registers"
    - "information theoretic lower bounds on the storage cost of shared memory emulation"

Connected through hyperedge HE-4 (induced by source paper "information theoretic lower bounds on the storage cost of shared memory emulation"):
  with members:
    - "multi version coding an information theoretic perspective of consistent distributed storage"
    - "space bounds for reliable multi writer data store inherent cost of read write primitives"
    - "space bounds for reliable storage fundamental limits of coding"
    - "a coded shared atomic memory algorithm for message passing architectures"

Connected through hyperedge HE-5 (induced by source paper "a coded shared atomic memory algorithm for message passing architectures"):
  with members:
    - "an overview of codes tailor made for better repairability in networked distributed storage systems"

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)