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: "smt solving for functional programming over infinite structures"
  Abstract: We develop a simple functional programming language aimed at manipulating infinite, but first-order definable structures, such as the countably infinite clique graph or the set of all intervals with rational endpoints. Internally, such sets are represented by logical formulas that define them, and an external satisfiability modulo theories (SMT) solver is regularly run by the interpreter to check their basic properties. #R##N#The language is implemented as a Haskell module.

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"
    - "automata theory in nominal sets"
    - "nominal logic programming"

Connected through hyperedge HE-2 (induced by source paper "residual nominal automata"):
  with members:
    - "the containment problem for unambiguous register automata"
    - "learning nominal automata"
    - "automata theory in nominal sets"
    - "a robust class of data languages and an application to learning"
    - "runtime verification based on register automata"

Connected through hyperedge HE-3 (induced by source paper "fast computations on ordered nominal sets"):
  with members:
    - "learning nominal automata"
    - "history register automata"
    - "automata theory in nominal sets"

Connected through hyperedge HE-4 (induced by source paper "scalar and vectorial mu calculus with atoms"):
  with members:
    - "modal logics for nominal transition systems"
    - "reasoning about data repetitions with counter systems"
    - "automata theory in nominal sets"
    - "alternating register automata on finite words and trees"
    - "alternating automata on data trees and xpath satisfiability"
    - "ltl with the freeze quantifier and register automata"
    - "on the freeze quantifier in constraint ltl decidability and complexity"

Connected through hyperedge HE-5 (induced by source paper "learning nominal automata"):
  with members:
    - "learning regular languages over large ordered alphabets"
    - "automata theory in nominal sets"
    - "ltl with the freeze quantifier and register automata"

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.PL(Programming Languages)