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: "automata theory in nominal sets"
  Abstract: We study languages over infinite alphabets equipped with some structure that#N#can be tested by recognizing automata. We develop a framework for studying such#N#alphabets and the ensuing automata theory, where the key role is played by an#N#automorphism group of the alphabet. In the process, we generalize nominal sets#N#due to Gabbay and Pitts.

Connected through hyperedge HE-1 (induced by source paper "beyond sets with atoms definability in first order logic"):
  with members:
    - "single use register automata for data words"
    - "smt solving for functional programming over infinite structures"
    - "nominal logic programming"

Connected through hyperedge HE-2 (induced by source paper "equivariant zfa and the foundations of nominal techniques"):
  with members:
    - "pnl to hol from the logic of nominal sets to the logic of higher order functions"
    - "nominal unification from a higher order perspective"
    - "finite and infinite support in nominal algebra and logic nominal completeness theorems for free"

Connected through hyperedge HE-3 (induced by source paper "automata learning an algebraic approach"):
  with members:
    - "tree automata as algebras minimisation and determinisation"
    - "coalgebra learning via duality"
    - "generic partition refinement and weighted tree automata"
    - "efficient coalgebraic partition refinement"
    - "learning nominal automata"
    - "calf categorical automata learning framework"
    - "learning automata with side effects"
    - "eilenberg theorems for free"

Connected through hyperedge HE-4 (induced by source paper "residual nominal automata"):
  with members:
    - "the containment problem for unambiguous register automata"
    - "learning nominal automata"
    - "smt solving for functional programming over infinite structures"
    - "a robust class of data languages and an application to learning"
    - "runtime verification based on register automata"

Connected through hyperedge HE-5 (induced by source paper "varieties of data languages"):
  with members:
    - "equational axiomatization of algebras with structure"
    - "unveiling eilenberg type correspondences birkhoff s theorem for finite algebras duality"
    - "eilenberg theorems for free"
    - "regular behaviours with names"
    - "generalized eilenberg theorem i local varieties of languages"

Connected through hyperedge HE-6 (induced by source paper "fast computations on ordered nominal sets"):
  with members:
    - "learning nominal automata"
    - "history register automata"
    - "smt solving for functional programming over infinite structures"

Connected through hyperedge HE-7 (induced by source paper "separation and renaming in nominal sets"):
  with members:
    - "learning nominal automata"
    - "coalgebraic trace semantics via forgetful logics"
    - "generalizing determinization from automata to coalgebras"

Connected through hyperedge HE-8 (induced by source paper "reductions for safety proofs extended version"):
  with members:
    - "the inverse method implements the automata approach for modal satisfiability"

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)