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: "deciding unambiguity and sequentiality from a finitely ambiguous max plus automaton"
  Abstract: Finite automata with weights in the max-plus semiring are considered. The main result is: it is decidable whether a series that is recognized by a finitely ambiguous max-plus automaton is unambiguous, or is sequential. Furthermore, the proof is constructive. A collection of examples is given to illustrate the hierarchy of max-plus series with respect to ambiguity.

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"
    - "decision problems for additive regular functions"
    - "ultimate positivity is decidable for simple linear recurrence sequences"

Connected through hyperedge HE-2 (induced by source paper "weight annotation in information extraction"):
  with members:
    - "efficient logspace classes for enumeration counting and uniform generation"
    - "complexity bounds for relational algebra over document spanners"
    - "representing formal languages a comparison between finite automata and recurrent neural networks"
    - "constant delay enumeration for nondeterministic document spanners"
    - "constant delay algorithms for regular document spanners"
    - "document spanners for extracting incomplete information expressiveness and complexity"
    - "snorkel rapid training data creation with weak supervision"
    - "extracting automata from recurrent neural networks using queries and counterexamples"

Connected through hyperedge HE-3 (induced by source paper "aperiodic weighted automata and weighted first order logic"):
  with members:
    - "pumping lemmas for weighted automata"
    - "copyless cost register automata structure expressiveness and closure properties"
    - "weighted automata and logics for infinite nested words"
    - "multi weighted automata and mso logic"
    - "expressiveness and closure properties for quantitative languages"

Connected through hyperedge HE-4 (induced by source paper "a robust class of linear recurrence sequences"):
  with members:
    - "pumping lemmas for weighted automata"
    - "weak cost register automata are still powerful"

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"
    - "decision problems for additive regular functions"
    - "the complexity of mean payoff automaton expression"
    - "mean payoff automaton expressions"

Connected through hyperedge HE-6 (induced by source paper "multiple context free tree grammars lexicalization and characterization"):
  with members:
    - "tree automata and tree grammars"
    - "streaming tree transducers"
    - "mso definable string transductions and two way finite state transducers"

Connected through hyperedge HE-7 (induced by source paper "quantitative languages defined by functional automata"):
  with members:
    - "series which are both max plus and min plus rational are unambiguous"

Connected through hyperedge HE-8 (induced by source paper "on determinism and unambiguity of weighted two way automata"):
  with members:
    - "series which are both max plus and min plus rational are unambiguous"

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.CC(Computational Complexity)