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: "classical automata on promise problems"
  Abstract: Promise problems were mainly studied in quantum automata theory. Here we focus on state complexity of classical automata for promise problems. First, it was known that there is a family of unary promise problems solvable by quantum automata by using a single qubit, but the number of states required by corresponding one-way deterministic automata cannot be bounded by a constant. For this family, we show that even two-way nondeterminism does not help to save a single state. By comparing this with the corresponding state complexity of alternating machines, we then get a tight exponential gap between two-way nondeterministic and one-way alternating automata solving unary promise problems. Second, despite of the existing quadratic gap between Las Vegas realtime probabilistic automata and one-way deterministic automata for language recognition, we show that, by turning to promise problems, the tight gap becomes exponential. Last, we show that the situation is different for one-way probabilistic automata with two-sided bounded-error. We present a family of unary promise problems that is very easy for these machines; solvable with only two states, but the number of states in two-way alternating or any simpler automata is not limited by a constant. Moreover, we show that one-way bounded-error probabilistic automata can solve promise problems not solvable at all by any other classical model.

Connected through hyperedge HE-1 (induced by source paper "nonuniform families of polynomial size quantum finite automata and quantum logarithmic space computation with polynomial size advice"):
  with members:
    - "state complexity characterizations of parameterized degree bounded graph connectivity sub linear space computation and the linear space hypothesis"
    - "the 2cnf boolean formula satisfiability problem and the linear space hypothesis"
    - "complexity bounds of constant space quantum computation"
    - "automata and quantum computing"
    - "oracle pushdown automata nondeterministic reducibilities and the cfl hierarchy over the family of context free languages"
    - "quantum computation with write only memory"
    - "unbounded error quantum computation with small space bounds"
    - "the roles of advice to one tape linear time turing machines and finite automata"

Connected through hyperedge HE-2 (induced by source paper "language recognition power and succinctness of affine automata"):
  with members:
    - "affine counter automata"
    - "zero error affine unitary and probabilistic obdds"
    - "can one quantum bit separate any pair of words with zero error"
    - "on the computational power of affine automata"
    - "affine computation and affine automaton"
    - "automata and quantum computing"
    - "unary probabilistic and quantum automata on promise problems"
    - "potential of quantum finite automata with exact acceptance"

Connected through hyperedge HE-3 (induced by source paper "exact affine counter automata"):
  with members:
    - "language recognition power and succinctness of affine automata"
    - "can one quantum bit separate any pair of words with zero error"
    - "on the computational power of affine automata"
    - "affine computation and affine automaton"
    - "automata and quantum computing"
    - "quantum finite automata a modern introduction"
    - "proving the power of postselection"
    - "quantum counter automata"

Connected through hyperedge HE-4 (induced by source paper "automata and quantum computing"):
  with members:
    - "potential of quantum finite automata with exact acceptance"
    - "magic coins are useful for small space quantum machines"
    - "finite automata with advice tapes"
    - "superiority of exact quantum automata for promise problems"
    - "probabilistic and quantum finite automata with postselection"
    - "computation with narrow ctcs"
    - "classical and quantum computation with small space bounds phd thesis"
    - "unbounded error quantum computation with small space bounds"

Connected through hyperedge HE-5 (induced by source paper "unary probabilistic and quantum automata on promise problems"):
  with members:
    - "new results on classical and quantum counter automata"
    - "potential of quantum finite automata with exact acceptance"
    - "promise problems solved by quantum and classical finite automata"
    - "very narrow quantum obdds and width hierarchies for classical obdds"
    - "quantum finite automata a modern introduction"
    - "on the state complexity of semi quantum finite automata"
    - "superiority of exact quantum automata for promise problems"
    - "unbounded error quantum computation with small space bounds"

Connected through hyperedge HE-6 (induced by source paper "potential of quantum finite automata with exact acceptance"):
  with members:
    - "power of the interactive proof systems with verifiers modeled by semi quantum two way finite automata"
    - "very narrow quantum obdds and width hierarchies for classical obdds"
    - "from quantum query complexity to state complexity"
    - "exact quantum algorithms have advantage for almost all boolean functions"
    - "on the state complexity of semi quantum finite automata"
    - "superiority of exact quantum automata for promise problems"
    - "unbounded error quantum computation with small space bounds"
    - "succinctness of two way probabilistic and quantum finite automata"

Connected through hyperedge HE-7 (induced by source paper "promise problems solved by quantum and classical finite automata"):
  with members:
    - "on hybrid models of quantum finite automata"
    - "power of the interactive proof systems with verifiers modeled by semi quantum two way finite automata"
    - "potential of quantum finite automata with exact acceptance"
    - "from quantum query complexity to state complexity"
    - "on the state complexity of semi quantum finite automata"
    - "superiority of exact quantum automata for promise problems"
    - "succinctness of two way probabilistic and quantum finite automata"
    - "hierarchy and equivalence of multi letter quantum finite automata"

Connected through hyperedge HE-8 (induced by source paper "new results on classical and quantum counter automata"):
  with members:
    - "automata and quantum computing"
    - "unary probabilistic and quantum automata on promise problems"
    - "potential of quantum finite automata with exact acceptance"
    - "promise problems solved by quantum and classical finite automata"
    - "quantum finite automata a modern introduction"
    - "quantum computation with write only memory"
    - "unbounded error quantum computation with small space bounds"
    - "two way finite automata with quantum and classical states"

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)