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: "an intensional concurrent faithful encoding of turing machines"
  Abstract: The benchmark for computation is typically given as Turing computability; the ability for a computation to be performed by a Turing Machine. Many languages exploit (indirect) encodings of Turing Machines to demonstrate their ability to support arbitrary computation. However, these encodings are usually by simulating the entire Turing Machine within the language, or by encoding a language that does an encoding or simulation itself. This second category is typical for process calculi that show an encoding of lambda-calculus (often with restrictions) that in turn simulates a Turing Machine. Such approaches lead to indirect encodings of Turing Machines that are complex, unclear, and only weakly equivalent after computation. This paper presents an approach to encoding Turing Machines into intensional process calculi that is faithful, reduction preserving, and structurally equivalent. The encoding is demonstrated in a simple asymmetric concurrent pattern calculus before generalised to simplify infinite terms, and to show encodings into Concurrent Pattern Calculus and Psi Calculi.

Connected through hyperedge HE-1 (induced by source paper "on the expressiveness of joining"):
  with members:
    - "a concurrent pattern calculus"
    - "on the expressiveness of intensional communication"
    - "musings on encodings and expressiveness"
    - "psi calculi a framework for mobile processes with nominal data and logic"
    - "comparing the expressive power of the synchronous and asynchronous pi calculi"

Connected through hyperedge HE-2 (induced by source paper "on the expressiveness of intensional communication"):
  with members:
    - "a concurrent pattern calculus"
    - "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"
    - "comparing the expressive power of the synchronous and asynchronous pi calculi"

Connected through hyperedge HE-3 (induced by source paper "expressiveness via intensionality and concurrency"):
  with members:
    - "a concurrent pattern calculus"
    - "musings on encodings and expressiveness"
    - "psi calculi a framework for mobile processes with nominal data and logic"
    - "multiparty symmetric sum types"
    - "comparing the expressive power of the synchronous and asynchronous pi calculi"

Connected through hyperedge HE-4 (induced by source paper "confusion in the church turing thesis"):
  with members:
    - "a concurrent pattern calculus"

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.FL(Formal Languages and Automata Theory)