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: "nested weighted limit average automata of bounded width"
  Abstract: While weighted automata provide a natural framework to express quantitative properties, many basic properties like average response time cannot be expressed with weighted automata. Nested weighted automata extend weighted automata and consist of a master automaton and a set of slave automata that are invoked by the master automaton. Nested weighted automata are strictly more expressive than weighted automata (e.g., average response time can be expressed with nested weighted automata), but the basic decision questions have higher complexity (e.g., for deterministic automata, the emptiness question for nested weighted automata is PSPACE-hard, whereas the corresponding complexity for weighted automata is PTIME). We consider a natural subclass of nested weighted automata where at any point at most a bounded number k of slave automata can be active. We focus on automata whose master value function is the limit average. We show that these nested weighted automata with bounded width are strictly more expressive than weighted automata (e.g., average response time with no overlapping requests can be expressed with bound k=1, but not with non-nested weighted automata). We show that the complexity of the basic decision problems (i.e., emptiness and universality) for the subclass with k constant matches the complexity for weighted automata. Moreover, when k is part of the input given in unary we establish PSPACE-completeness.

Connected through hyperedge HE-1 (induced by source paper "long run average behavior of vector addition systems with states"):
  with members:
    - "the reachability problem for petri nets is not elementary"
    - "average energy games"
    - "long run average behaviour of probabilistic vector addition systems"
    - "mixed integer quadratic programming is in np"
    - "reachability games on extended vector addition systems with states"

Connected through hyperedge HE-2 (induced by source paper "bidirectional nested weighted automata"):
  with members:
    - "quantitative automata under probabilistic semantics"
    - "copyless cost register automata structure expressiveness and closure properties"
    - "nested weighted automata"
    - "expressiveness and closure properties for quantitative languages"

Connected through hyperedge HE-3 (induced by source paper "quantitative automata under probabilistic semantics"):
  with members:
    - "multigain a controller synthesis tool for mdps with multiple mean payoff objectives"
    - "unifying two views on multiple mean payoff objectives in markov decision processes"
    - "nested weighted automata"
    - "markov decision processes with multiple long run averageobjectives"
    - "discounting in ltl"
    - "energy and mean payoff parity markov decision processes"
    - "measuring and synthesizing systems in probabilistic environments"
    - "expressiveness and closure properties for quantitative languages"

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)