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 the asynchronous pi calculus"
  Abstract: We study the relation between process calculi that differ in their either synchronous or asynchronous interaction mechanism. Concretely, we are interested in the conditions under which synchronous interaction can be implemented using just asynchronous interactions in the p-calculus. We assume a number of minimal conditions referring to the work of Gorla: a “good” encoding must be compositional and preserve and reflect computations, deadlocks, divergence, and success. Under these conditions, we show that it is not possible to encode synchronous interactions without introducing additional causal dependencies in the translation.

Connected through hyperedge HE-1 (induced by source paper "on characterising distributability"):
  with members:
    - "on distributability of petri nets"
    - "synchrony vs causality in asynchronous petri nets"
    - "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 asynchronous petri nets"
    - "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 "musings on encodings and expressiveness"):
  with members:
    - "is it a"
    - "comparing the expressive power of the synchronous and asynchronous pi calculi"

Connected through hyperedge HE-4 (induced by source paper "is it a good encoding of mixed choice technical report"):
  with members:
    - "comparing the expressive power of the synchronous and asynchronous pi calculi"

Connected through hyperedge HE-5 (induced by source paper "synchrony vs causality in asynchronous petri nets"):
  with members:
    - "on synchronous and asynchronous interaction in distributed systems"

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.LO(Logic in Computer Science)