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: "consistency in non transactional distributed storage systems"
  Abstract: Over the years, different meanings have been associated to the word consistency in the distributed systems community. While in the ’80s “consistency” typically meant strong consistency, later defined also as linearizability, in recent years, with the advent of highly available and scalable systems, the notion of “consistency” has been at the same time both weakened and blurred. In this paper we aim to fill the void in literature, by providing a structured and comprehensive overview of different consistency notions that appeared in distributed systems, and in particular storage systems research, in the last four decades. We overview more than 50 different consistency notions, ranging from linearizability to eventual and weak consistency, defining precisely many of these, in particular where the previous definitions were ambiguous. We further provide a partial order among different consistency predicates, ordering them by their semantic “strength”, which we believe will reveal useful in future research. Finally, we map the consistency semantics to different practical systems and research prototypes. The scope of this paper is restricted to non-transactional semantics, i.e., those that apply to single storage object operations. As such, our paper complements the existing surveys done in the context of transactional, database consistency semantics. ar X iv :1 51 2. 00 16 8v 4 [ cs .D C ] 1 2 A pr 2 01 6

Connected through hyperedge HE-1 (induced by source paper "hermes a fast fault tolerant and linearizable replication protocol"):
  with members:
    - "harmonia near linear scalability for replicated storage with in network conflict detection"
    - "exploiting commutativity for practical fast replication"
    - "a fault tolerant sequentially consistent dsm with a compositional correctness proof"

Connected through hyperedge HE-2 (induced by source paper "fine grained analysis on fast implementations of multi writer atomic registers"):
  with members:
    - "oh ram one and a half round atomic memory"

Connected through hyperedge HE-3 (induced by source paper "linearizable state machine replication of state based crdts without logs"):
  with members:
    - "linearizable replicated state machines with lattice agreement"
    - "set constrained delivery broadcast definition abstraction power and computability limits"
    - "efficient state based crdts by delta mutation"
    - "abstract unordered and ordered trees crdt"

Connected through hyperedge HE-4 (induced by source paper "consistency models in distributed systems a survey on definitions disciplines challenges and applications"):
  with members:
    - "worlds of events deduction with partial knowledge about causality"
    - "a critique of the cap theorem"

Connected through hyperedge HE-5 (induced by source paper "causal consistency and latency optimality friend or foe"):
  with members:
    - "unobtrusive deferred update stabilization for efficient geo replication"
    - "characterizing and adapting the consistency latency tradeoff in distributed key value stores"

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)