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: "psi calculi a framework for mobile processes with nominal data and logic"
  Abstract: The framework of psi-calculi extends the pi-calculus with nominal datatypes for data structures and for logical assertions and conditions. These can be transmitted between processes and their names ...

Connected through hyperedge HE-1 (induced by source paper "a formal approach to the engineering of domain specific distributed systems"):
  with members:
    - "on the power of attribute based communication"
    - "a rigorous framework for specification analysis and enforcement of access control policies"
    - "tracing where iot data are collected and aggregated"
    - "a concurrent pattern calculus"
    - "blind date conversation joining"

Connected through hyperedge HE-2 (induced by source paper "ensuring liveness properties of distributed systems open problems"):
  with members:
    - "progress justness and fairness"
    - "reward testing equivalences for processes"
    - "justness a completeness criterion for capturing liveness properties"
    - "analysing mutual exclusion using process algebra with signals"
    - "lean and full congruence formats for recursion"
    - "structure preserving bisimilarity supporting an operational petri net semantics of ccsp"
    - "ccs it s not fair fair schedulers cannot be implemented in ccs like languages even under progress and certain fairness assumptions"
    - "progress fairness and justness in process algebra"

Connected through hyperedge HE-3 (induced by source paper "modal logics for nominal transition systems"):
  with members:
    - "a characterisation of open bisimulation using an intuitionistic modal logic"
    - "distinguishing between communicating transactions"
    - "general bindings and alpha equivalence in nominal isabelle"

Connected through hyperedge HE-4 (induced by source paper "a computational framework for adaptive systems and its verification"):
  with members:
    - "a behavioural theory for interactions in collective adaptive systems"
    - "dynamic input output automata"

Connected through hyperedge HE-5 (induced by source paper "psi calculi revisited connectivity and compositionality"):
  with members:
    - "session types for broadcasting"
    - "comparing the expressive power of the synchronous and asynchronous pi calculi"

Connected through hyperedge HE-6 (induced by source paper "context free session types for applied pi calculus"):
  with members:
    - "the applied pi calculus mobile values new names and secure communication"

Connected through hyperedge HE-7 (induced by source paper "ensuring liveness properties of distributed systems a research agenda"):
  with members:
    - "structure preserving bisimilarity supporting an operational petri net semantics of ccsp"
    - "automated analysis of aodv using uppaal"
    - "a process algebra for wireless mesh networks"
    - "a process algebra for wireless mesh networks used for modelling verifying and analysing aodv"
    - "sequence numbers do not guarantee loop freedom aodv can yield routing loops"
    - "on characterising distributability"
    - "branching bisimilarity with explicit divergence"

Connected through hyperedge HE-8 (induced by source paper "reactive turing machines with infinite alphabets"):
  with members:
    - "on the executability of interactive computation"
    - "executable behaviour and the pi calculus"
    - "reactive turing machines"
    - "branching bisimilarity with explicit divergence"

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)