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: "history register automata"
  Abstract: Programs with dynamic allocation are able to create and use an unbounded#N#number of fresh resources, such as references, objects, files, etc. We propose#N#History-Register Automata (HRA), a new automata-theoretic formalism for#N#modelling such programs. HRAs extend the expressiveness of previous approaches#N#and bring us to the limits of decidability for reachability checks. The#N#distinctive feature of our machines is their use of unbounded memory sets#N#(histories) where input symbols can be selectively stored and compared with#N#symbols to follow. In addition, stored symbols can be consumed or deleted by#N#reset. We show that the combination of consumption and reset capabilities#N#renders the automata powerful enough to imitate counter machines, and yields#N#closure under all regular operations apart from complementation. We moreover#N#examine weaker notions of HRAs which strike different balances between#N#expressiveness and effectiveness.

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

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)