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: "space bounds for reliable storage fundamental limits of coding"
  Abstract: We study the inherent space requirements of shared storage algorithms in asynchronous fault-prone systems. Previous works use codes to achieve a better storage cost than the well-known replication approach. However, a closer look reveals that they incur extra costs somewhere else: Some use unbounded storage in communication links, while others assume bounded concurrency or synchronous periods. We prove here that this is inherent, and indeed, if there is no bound on the concurrency level, then the storage cost of any reliable storage algorithm is at least f+1 times the data size, where f is the number of tolerated failures. We further present a technique for combining erasure-codes with full replication so as to obtain the best of both. We present a storage algorithm whose storage cost is close to the lower bound in the worst case, and adapts to the concurrency level.

Connected through hyperedge HE-1 (induced by source paper "auditable register emulations"):
  with members:
    - "integrated bounds for disintegrated storage"
    - "information theoretic lower bounds on the storage cost of shared memory emulation"

Connected through hyperedge HE-2 (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"
    - "multi version coding an information theoretic perspective of consistent distributed storage"

Connected through hyperedge HE-3 (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"
    - "storage optimized data atomic algorithms for handling erasures and errors in distributed storage systems"
    - "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"

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"
    - "erasure coded byzantine storage with separate metadata"
    - "a coded shared atomic memory algorithm for message passing architectures"

Connected through hyperedge HE-5 (induced by source paper "radon repairable atomic data object in networks"):
  with members:
    - "on liveness of dynamic storage"
    - "xoring elephants novel erasure codes for big data"
    - "a survey on network codes for distributed storage"

Connected through hyperedge HE-6 (induced by source paper "storage optimized data atomic algorithms for handling erasures and errors in distributed storage systems"):
  with members:
    - "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.DC(Distributed, Parallel, and Cluster Computing)