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: "synchrony vs causality in asynchronous petri nets"
  Abstract: Given a synchronous system, we study the question whether the behaviour of that system can be exhibited by a (non-trivially) distributed and hence async hronous implementation. In this paper we show, by counterexample, that synchronous systems cannot in general be implemented in an asynchronous fashion without either introducing an infinit e implementation or changing the causal structure of the system behaviour.

Connected through hyperedge HE-1 (induced by source paper "on characterising distributability"):
  with members:
    - "on distributability of petri nets"
    - "synchrony vs causality in the asynchronous pi calculus"
    - "abstract processes of place transition systems"
    - "on synchronous and asynchronous interaction in distributed systems"
    - "branching bisimilarity with explicit divergence"
    - "comparing the expressive power of the synchronous and asynchronous pi calculi"

Connected through hyperedge HE-2 (induced by source paper "on distributability of petri nets"):
  with members:
    - "synchrony vs causality in the asynchronous pi calculus"
    - "abstract processes of place transition systems"
    - "on synchronous and asynchronous interaction in distributed systems"
    - "branching bisimilarity with explicit divergence"

Connected through hyperedge HE-3 (induced by source paper "an operational petri net semantics for the join calculus"):
  with members:
    - "on distributability of petri nets"
    - "on synchronous and asynchronous interaction in distributed systems"
    - "symmetric and asymmetric asynchronous interaction"

Connected through hyperedge HE-4 (induced by source paper "synchrony vs causality in the asynchronous pi calculus"):
  with members:
    - "comparing the expressive power of the synchronous and asynchronous pi calculi"

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)