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: "regular cost functions part i logic and algebra over words"
  Abstract: The theory of regular cost functions is a quantitative extension to the#N#classical notion of regularity. A cost function associates to each input a#N#non-negative integer value (or infinity), as opposed to languages which only#N#associate to each input the two values "inside" and "outside". This theory is a#N#continuation of the works on distance automata and similar models. These models#N#of automata have been successfully used for solving the star-height problem,#N#the finite power property, the finite substitution problem, the relative#N#inclusion star-height problem and the boundedness problem for monadic-second#N#order logic over words. Our notion of regularity can be -- as in the classical#N#theory of regular languages -- equivalently defined in terms of automata,#N#expressions, algebraic recognisability, and by a variant of the monadic#N#second-order logic. These equivalences are strict extensions of the#N#corresponding classical results. The present paper introduces the cost monadic#N#logic, the quantitative extension to the notion of monadic second-order logic#N#we use, and show that some problems of existence of bounds are decidable for#N#this logic. This is achieved by introducing the corresponding algebraic#N#formalism: stabilisation monoids.

Connected through hyperedge HE-1 (induced by source paper "intersection types for unboundedness problems"):
  with members:
    - "intersection types and counting"
    - "pumping lemma for higher order languages"
    - "the diagonal problem for higher order recursion schemes is decidable"
    - "on word and frontier languages of unsafe higher order grammars"
    - "relational semantics of linear logic and higher order model checking"
    - "ordered tree pushdown systems"
    - "finitary semantics of linear logic and higher order model checking"
    - "an approach to computing downward closures"

Connected through hyperedge HE-2 (induced by source paper "controlling a random population"):
  with members:
    - "controlling a random population is exptime hard"
    - "controlling a population"
    - "two recursively inseparable problems for probabilistic automata"

Connected through hyperedge HE-3 (induced by source paper "trading bounds for memory in games with counters"):
  with members:
    - "decidability results for the boundedness problem"

Connected through hyperedge HE-4 (induced by source paper "deciding maxmin reachability in half blind stochastic games"):
  with members:
    - "profinite techniques for probabilistic automata and the optimality of the markov monoid algorithm"
    - "deciding the value 1 problem for probabilistic leaktight automata"
    - "the complexity of partial observation stochastic parity games with finite memory strategies"
    - "decidable problems for probabilistic automata on infinite words"
    - "power of randomization in automata on infinite strings"
    - "partial observation stochastic games how to win when belief fails"

Connected through hyperedge HE-5 (induced by source paper "an approach to computing downward closures"):
  with members:
    - "on infinite words determined by indexed languages"
    - "computing downward closures for stacked counter automata"
    - "silent transitions in automata with storage"
    - "model checking vector addition systems with one zero test"

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.FL(Formal Languages and Automata Theory)