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 "clifford gates in the holant framework"):
  Abstract: We show that the Clifford gates and stabilizer circuits in the quantum computing literature, which admit efficient classical simulation, are equivalent to affine signatures under a unitary condition. The latter is a known class of tractable functions under the Holant framework.

Includes members:
  Member "dichotomy for real holant c problems":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "zeros and approximations of holant polynomials on the complex plane")
  Member "the complexity of holant problems over boolean domain with non negative weights":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "zeros and approximations of holant polynomials on the complex plane")
  Member "basis collapse for holographic algorithms over all domain sizes":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on blockwise symmetric matchgate signatures and higher domain csp")
  Member "a holant dichotomy is the fkt algorithm universal":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "perfect matchings rank of connection tensors and graph homomorphisms")
  Member "base collapse of holographic algorithms":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "on blockwise symmetric matchgate signatures and higher domain csp")
  Member "holographic algorithms beyond matchgates":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "the complexity of holant problems over boolean domain with non negative weights")
  Member "a complete dichotomy rises from the capture of vanishing signatures":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "zeros and approximations of holant polynomials on the complex plane")

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)