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: "reactive turing machines"
  Abstract: We propose reactive Turing machines (RTMs), extending classical Turing machines with a process-theoretical notion of interaction, and use it to define a notion of executable transition system. We show that every computable transition system with a bounded branching degree is simulated modulo divergence-preserving branching bisimilarity by an RTM, and that every effective transition system is simulated modulo the variant of branching bisimilarity that does not require divergence preservation. We conclude from these results that the parallel composition of (communicating) RTMs can be simulated by a single RTM. We prove that there exist universal RTMs modulo branching bisimilarity, but these essentially employ divergence to be able to simulate an RTM of arbitrary branching degree. We also prove that modulo divergence-preserving branching bisimilarity there are RTMs that are universal up to their own branching degree. Finally, we establish a correspondence between executability and finite definability in a simple process calculus.

Connected through hyperedge HE-1 (induced by source paper "toward a uniform theory of effectful state machines"):
  with members:
    - "presenting distributive laws"
    - "towards a coalgebraic chomsky hierarchy"
    - "sound and complete axiomatizations of coalgebraic language equivalence"
    - "coalgebraic characterizations of context free languages"
    - "generalizing determinization from automata to coalgebras"
    - "non deterministic kleene coalgebras"

Connected through hyperedge HE-2 (induced by source paper "sequential composition in the presence of intermediate termination extended abstract"):
  with members:
    - "sequential composition in the presence of intermediate termination"
    - "on the executability of interactive computation"
    - "expressiveness modulo bisimilarity of regular expressions with parallel composition"
    - "computation tree logic with deadlock detection"
    - "branching bisimilarity with explicit divergence"

Connected through hyperedge HE-3 (induced by source paper "reactive turing machines with infinite alphabets"):
  with members:
    - "on the executability of interactive computation"
    - "executable behaviour and the pi calculus"
    - "psi calculi a framework for mobile processes with nominal data and logic"
    - "branching bisimilarity with explicit divergence"

Connected through hyperedge HE-4 (induced by source paper "on the executability of interactive computation"):
  with members:
    - "branching bisimilarity with explicit divergence"

Connected through hyperedge HE-5 (induced by source paper "ccs it s not fair fair schedulers cannot be implemented in ccs like languages even under progress and certain fairness assumptions"):
  with members:
    - "progress fairness and justness in process algebra"
    - "a process algebra for wireless mesh networks used for modelling verifying and analysing aodv"
    - "musings on encodings and expressiveness"
    - "abstract processes of place transition systems"

Connected through hyperedge HE-6 (induced by source paper "executable behaviour and the pi calculus"):
  with members:
    - "branching bisimilarity with explicit divergence"

Connected through hyperedge HE-7 (induced by source paper "computational complexity of interactive behaviors"):
  with members:
    - "introduction to clarithmetic ii"

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)