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 "unary probabilistic and quantum automata on promise problems"):
  Abstract: We continue the systematic investigation of probabilistic and quantum finite automata (PFAs and QFAs) on promise problems by focusing on unary languages. We show that bounded-error QFAs are more powerful than PFAs. But, in contrary to the binary problems, the computational powers of Las-Vegas QFAs and bounded-error PFAs are equivalent to deterministic finite automata (DFAs). Lastly, we present a new family of unary promise problems with two parameters such that when fixing one parameter QFAs can be exponentially more succinct than PFAs and when fixing the other parameter PFAs can be exponentially more succinct than DFAs.

Includes members:
  Member "new results on classical and quantum counter automata":
    also connected through other hyperedges:
      (none)
  Member "potential of quantum finite automata with exact acceptance":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "language recognition power and succinctness of affine automata")
  Member "promise problems solved by quantum and classical finite automata":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "quantum finite automata survey status and research directions")
  Member "very narrow quantum obdds and width hierarchies for classical obdds":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "language recognition power and succinctness of affine automata")
  Member "classical automata on promise problems":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "nonuniform families of polynomial size quantum finite automata and quantum logarithmic space computation with polynomial size advice")
  Member "quantum finite automata a modern introduction":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "classically time controlled quantum automata definition and properties")
  Member "on the state complexity of semi quantum finite automata":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "quantum finite automata survey status and research directions")
  Member "superiority of exact quantum automata for promise problems":
    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.CC(Computational Complexity)