human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "storage efficient shared memory emulation"):
  Abstract: We study the design of storage-efficient algorithms for emulating atomic shared memory over an asynchronous, distributed message-passing network. Our first algorithm is an atomic single-writer multi-reader algorithm based on a novel erasure-coding technique, termed multi-version code. Next, we propose an extension of our single-writer algorithm to a multi-writer multi-reader environment. Our second algorithm combines replication and multi-version code, and is suitable in situations where we expect a large number of concurrent writes. Moreover, when the number of concurrent writes is bounded, we propose a simplified variant of the second algorithm that has a simple structure similar to the single-writer algorithm. #R##N#Let $N$ be the number of servers, and the shared memory variable be of size 1 unit. Our algorithms have the following properties: (i) The algorithms guarantee liveness of the read as long as the number of writes concurrent with the read is smaller than a design parameter $\nu$, and the number of server failures is bounded by a parameter $f$. Moreover, our algorithms satisfy finite-write termination if we allow readers to retry. (ii) The storage size for the first algorithm, and the steady-state storage size for the second algorithm, are all $1/\lceil \frac{N-2f}{\nu} \rceil$ unit per server. Moreover, our simplified variant of the second algorithm achieves the worst-case storage cost of $1/\lceil \frac{N-2f}{\nu} \rceil$, asymptotically matching a lower bound by Cadambe et al. for $N \gg f, \nu \gg 1$. (iii) The write and read operations only consist of a small number (2 to 3) of communication rounds. (iv) For all algorithms, the server maintains a simple data structure. A server only needs to store the information associated with the latest value it observes, similar to replication-based algorithms.

Includes members:
  Member "a layered architecture for erasure coded consistent distributed storage":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "convertible codes efficient conversion of coded data in distributed storage")
  Member "radon repairable atomic data object in networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "fundamental limits of erasure coded key value stores with side information")
  Member "information theoretic lower bounds on the storage cost of shared memory emulation":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "coded state machine scaling state machine execution under byzantine faults")
  Member "storage optimized data atomic algorithms for handling erasures and errors in distributed storage systems":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "fundamental limits of erasure coded key value stores with side information")
  Member "multi version coding an information theoretic perspective of consistent distributed storage":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "convertible codes efficient conversion of coded data in distributed storage")
  Member "space bounds for reliable storage fundamental limits of coding":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "auditable register emulations")

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