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: "radon repairable atomic data object in networks"
  Abstract: Erasure codes offer an efficient way to decrease storage and communication costs while implementing atomic memory service in asynchronous distributed storage systems. In this paper, we provide erasure-code-based algorithms having the additional ability to perform background repair of crashed nodes. A repair operation of a node in the crashed state is triggered externally, and is carried out by the concerned node via message exchanges with other active nodes in the system. Upon completion of repair, the node re-enters active state, and resumes participation in ongoing and future read, write, and repair operations. To guarantee liveness and atomicity simultaneously, existing works assume either the presence of nodes with stable storage, or presence of nodes that never crash during the execution. We demand neither of these; instead we consider a natural, yet practical network stability condition $N1$ that only restricts the number of nodes in the crashed/repair state during broadcast of any message. #R##N#We present an erasure-code based algorithm $RADON_C$ that is always live, and guarantees atomicity as long as condition $N1$ holds. In situations when the number of concurrent writes is limited, $RADON_C$ has significantly improved storage and communication cost over a replication-based algorithm $RADON_R$, which also works under $N1$. We further show how a slightly stronger network stability condition $N2$ can be used to construct algorithms that never violate atomicity. The guarantee of atomicity comes at the expense of having an additional phase during the read and write operations.

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"
    - "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"

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"
    - "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"
    - "space bounds for reliable storage fundamental limits of coding"

Connected through hyperedge HE-3 (induced by source paper "a layered architecture for erasure coded consistent distributed storage"):
  with members:
    - "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"
    - "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"

Connected through hyperedge HE-4 (induced by source paper "multi version coding an information theoretic perspective of consistent distributed storage"):
  with members:
    - "a layered architecture for erasure coded consistent distributed storage"
    - "communication cost for updating linear functions when message updates are sparse connections to maximally recoverable codes"
    - "information theoretic lower bounds on the storage cost of shared memory emulation"
    - "content type coding"
    - "compressed differential erasure codes for efficient archival of versioned data"
    - "synchronizing edits in distributed storage networks"
    - "fundamental limits on communication for oblivious updates in storage networks"
    - "characterizing the rate region of the 4 3 3 exact repair regenerating codes"

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)