human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "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.

Includes members:
  Member "unary probabilistic and quantum automata on promise problems":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "quantum finite automata survey status and research directions")
  Member "the minimum amount of useful space new results and new directions":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "alternating private alternating and quantum alternating realtime automata")
  Member "recognizability versus solvability of promise problems in finite classical and quantum automata framework":
    also connected through other hyperedges:
      (none)
  Member "potential of quantum finite automata with exact acceptance":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "language recognition power and succinctness of affine automata")
  Member "on the state complexity of semi quantum finite automata":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "quantum finite automata survey status and research directions")
  Member "new results on the minimum amount of useful space":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "uncountable classical and quantum complexity classes")
  Member "superiority of exact quantum automata for promise problems":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "quantum finite automata survey status and research directions")
  Member "succinctness of two way probabilistic and quantum finite automata":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "quantum finite automata survey status and research directions")

Question: Please tell me which class the source paper 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)