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: "comparing the expressive power of the synchronous and asynchronous pi calculi"
  Abstract: The Asynchronous $\pi$-calculus, proposed in Honda and Tokoro (1991) and, independently, in Boudol (1992), is a subset of the $\pi$-calculus (Milner et al. 1992), which contains no explicit operators for choice and output prefixing. The communication mechanism of this calculus, however, is powerful enough to simulate output prefixing, as shown in Honda and Tokoro (1991) and Boudol (1992), and input-guarded choice, as shown in Nestmann and Pierce (2000). A natural question arises, then, as to whether or not it is as expressive as the full $\pi$-calculus. We show that this is not the case. More precisely, we show that there does not exist any uniform, fully distributed translation from the $\pi$-calculus into the asynchronous $\pi$-calculus, up to any ‘reasonable’ notion of equivalence. This result is based on the incapability of the asynchronous $\pi$-calculus to break certain symmetries that may be present in the initial communication graph. By similar arguments, we prove a separation result between the $\pi$-calculus and CCS, and between the $\pi$-calculus and the $\pi$-calculus with internal mobility, a subset of the $\pi$-calculus proposed by Sangiorgi where the output actions can only transmit private names.

Connected through hyperedge HE-1 (induced by source paper "comparing process calculi using encodings"):
  with members:
    - "encoding csp into ccs"
    - "analysing and comparing encodability criteria"
    - "musings on encodings and expressiveness"

Connected through hyperedge HE-2 (induced by source paper "psi calculi revisited connectivity and compositionality"):
  with members:
    - "session types for broadcasting"
    - "psi calculi a framework for mobile processes with nominal data and logic"

Connected through hyperedge HE-3 (induced by source paper "broadcast and aggregation in bbc"):
  with members:
    - "session types for broadcasting"

Connected through hyperedge HE-4 (induced by source paper "on the expressiveness of joining"):
  with members:
    - "a concurrent pattern calculus"
    - "an intensional concurrent faithful encoding of turing machines"
    - "on the expressiveness of intensional communication"
    - "musings on encodings and expressiveness"
    - "psi calculi a framework for mobile processes with nominal data and logic"

Connected through hyperedge HE-5 (induced by source paper "core higher order session processes tractable equivalences and relative expressiveness"):
  with members:
    - "musings on encodings and expressiveness"
    - "typing copyless message passing"
    - "contextual equivalence for higher order pi calculus revisited"

Connected through hyperedge HE-6 (induced by source paper "the name passing calculus"):
  with members:
    - "what are the fundamental structures of concurrency we still don t know"
    - "branching bisimilarity with explicit divergence"

Connected through hyperedge HE-7 (induced by source paper "analysing and comparing encodability criteria"):
  with members:
    - "encoding csp into ccs"
    - "musings on encodings and expressiveness"

Connected through hyperedge HE-8 (induced by source paper "on the expressiveness of intensional communication"):
  with members:
    - "a concurrent pattern calculus"
    - "an intensional concurrent faithful encoding of turing machines"
    - "expressiveness via intensionality and concurrency"
    - "musings on encodings and expressiveness"
    - "psi calculi a framework for mobile processes with nominal data and logic"
    - "multiparty symmetric sum types"
    - "formalising the pi calculus using nominal logic"

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)