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: "a unified theory of shared memory consistency"
  Abstract: Memory consistency models have been developed to specify what values may be returned by a read given that, in a distributed system, memory operations may only be partially ordered. Before this work, consistency models were defined independently. Each model followed a set of rules which was separate from the rules of every other model. In our work we have defined a set of four consistency properties. Any subset of the four properties yields a set of rules which constitute a consistency model. Every consistency model previously described in the literature can be defined based on our four properties. Therefore, we present these properties as a unfied theory of shared memory consistency.

Connected through hyperedge HE-1 (induced by source paper "consistency in non transactional distributed storage systems"):
  with members:
    - "don t trust the cloud verify integrity and consistency for cloud object stores"
    - "blazes coordination analysis for distributed programs"
    - "probabilistically bounded staleness for practical partial quorums"
    - "toward a principled framework for benchmarking consistency"
    - "using paxos to build a scalable consistent and highly available datastore"
    - "fork sequential consistency is blocking"

Connected through hyperedge HE-2 (induced by source paper "herding cats modelling simulation testing and data mining for weak memory"):
  with members:
    - "relaxed operational semantics of concurrent programming languages"
    - "software verification for weak memory via program transformation"
    - "checking robustness against tso"

Connected through hyperedge HE-3 (induced by source paper "memory consistency conditions for self assembly programming"):
  with members:
    - "simulation of self assembly in the abstract tile assembly model with isu tas"
    - "a time lower bound for multiple nucleation on a surface"
    - "distributed agreement in tile self assembly"
    - "a domain specific language for programming in the tile assembly model"
    - "self assembling systems are distributed systems"
    - "complexity of self assembled shapes"

Connected through hyperedge HE-4 (induced by source paper "global clock physical time order and pending period analysis in multiprocessor systems"):
  with members:
    - "fast and generalized polynomial time memory consistency verification"

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)