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: "distributed execution of bigraphical reactive systems"
  Abstract: The bigraph embedding problem is crucial for many results and tools about bigraphs and bigraphical reactive systems (BRS). Current algorithms for computing bigraphical embeddings are centralized, i.e. designed to run locally with a complete view of the guest and host bigraphs. In order to deal with large bigraphs, and to parallelize reactions, we present a decentralized algorithm, which distributes both state and computation over several concurrent processes. This allows for distributed, parallel simulations where non-interfering reactions can be carried out concurrently; nevertheless, even in the worst case the complexity of this distributed algorithm is no worse than that of a centralized algorithm.

Connected through hyperedge HE-1 (induced by source paper "towards a formal model for composable container systems"):
  with members:
    - "a csp implementation of the bigraph embedding problem"
    - "bigraphical models for protein and membrane interactions"

Connected through hyperedge HE-2 (induced by source paper "loose graph simulations"):
  with members:
    - "a csp implementation of the bigraph embedding problem"

Connected through hyperedge HE-3 (induced by source paper "a specification of open transactional memory for haskell"):
  with members:
    - "open transactions on shared memory"
    - "a csp implementation of the bigraph embedding problem"

Connected through hyperedge HE-4 (induced by source paper "well stratified linked data for well behaved data citation"):
  with members:
    - "a csp implementation of the bigraph embedding problem"
    - "gsos for non deterministic processes with quantitative aspects"
    - "structural operational semantics for non deterministic processes with quantitative aspects"

Connected through hyperedge HE-5 (induced by source paper "open transactions on shared memory"):
  with members:
    - "a formally verified compiler back end"
    - "consensus on transaction commit"

Connected through hyperedge HE-6 (induced by source paper "a csp implementation of the bigraph embedding problem"):
  with members:
    - "bigraphical models for protein and membrane interactions"

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)