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: "decision problems for additive regular functions"
  Abstract: Additive Cost Register Automata (ACRA) map strings to integers using a finite set of registers that are updated using assignments of the form "x := y + c" at every step. The corresponding class of additive regular functions has multiple equivalent characterizations, appealing closure properties, and a decidable equivalence problem. In this paper, we solve two decision problems for this model. First, we define the register complexity of an additive regular function to be the minimum number of registers that an ACRA needs to compute it. We characterize the register complexity by a necessary and sufficient condition regarding the largest subset of registers whose values can be made far apart from one another. We then use this condition to design a PSPACE algorithm to compute the register complexity of a given ACRA, and establish a matching lower bound. Our results also lead to a machine-independent characterization of the register complexity of additive regular functions. Second, we consider two-player games over ACRAs, where the objective of one of the players is to reach a target set while minimizing the cost. We show the corresponding decision problem to be EXPTIME-complete when costs are non-negative integers, but undecidable when costs are integers.

Connected through hyperedge HE-1 (induced by source paper "pumping lemmas for weighted automata"):
  with members:
    - "a robust class of linear recurrence sequences"
    - "weak cost register automata are still powerful"
    - "descriptive complexity for counting complexity classes"
    - "copyless cost register automata structure expressiveness and closure properties"
    - "on the positivity problem for simple linear recurrence sequences"
    - "ultimate positivity is decidable for simple linear recurrence sequences"
    - "deciding unambiguity and sequentiality from a finitely ambiguous max plus automaton"

Connected through hyperedge HE-2 (induced by source paper "affine extensions of integer vector addition systems with states"):
  with members:
    - "the reachability problem for petri nets is not elementary"
    - "how hard is it to verify flat affine counter systems with the finite monoid property"
    - "reachability in two dimensional vector addition systems with states is pspace complete"
    - "integer vector addition systems with states"
    - "regular combinators for string transformations"
    - "ackermannian and primitive recursive bounds with dickson s lemma"
    - "bounded parikh automata"

Connected through hyperedge HE-3 (induced by source paper "re pairing brackets"):
  with members:
    - "complexity of problems of commutative grammars"
    - "pebble games proof complexity and time space trade offs"
    - "algorithmic verification of asynchronous programs"
    - "parikh s theorem a simple and direct automaton construction"
    - "mso definable string transductions and two way finite state transducers"

Connected through hyperedge HE-4 (induced by source paper "streamable regular transductions"):
  with members:
    - "on the expressibility of copyless cost register automata"
    - "nested weighted automata"
    - "regular combinators for string transformations"
    - "streaming tree transducers"
    - "ltl with the freeze quantifier and register automata"
    - "mso definable string transductions and two way finite state transducers"

Connected through hyperedge HE-5 (induced by source paper "decidable weighted expressions with presburger combinators"):
  with members:
    - "comparison of max plus automata and joint spectral radius of tropical matrices"
    - "quantitative languages defined by functional automata"
    - "nested weighted automata"
    - "regular combinators for string transformations"
    - "the complexity of mean payoff automaton expression"
    - "mean payoff automaton expressions"
    - "deciding unambiguity and sequentiality from a finitely ambiguous max plus automaton"

Connected through hyperedge HE-6 (induced by source paper "degree of sequentiality of weighted automata"):
  with members:
    - "multi sequential word relations"
    - "quantitative languages defined by functional automata"

Connected through hyperedge HE-7 (induced by source paper "copyless cost register automata structure expressiveness and closure properties"):
  with members:
    - "streaming tree transducers"
    - "regular functions cost register automata and generalized min cost problems"

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)