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 "verification in staged tile self assembly"):
  Abstract: We prove the unique assembly and unique shape verification problems, benchmark measures of self-assembly model power, are $\mathrm{coNP}^{\mathrm{NP}}$-hard and contained in $\mathrm{PSPACE}$ (and in $\mathrm{\Pi}^\mathrm{P}_{2s}$ for staged systems with $s$ stages). En route, we prove that unique shape verification problem in the 2HAM is $\mathrm{coNP}^{\mathrm{NP}}$-complete.

Includes members:
  Member "optimal staged self assembly of general shapes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "tilt assembly algorithms for micro factories that build objects with uniform external forces")
  Member "new geometric algorithms for fully connected staged self assembly":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "connected assembly and reconfiguration by finite automata")
  Member "staged self assembly and polyomino context free grammars":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "optimal staged self assembly of general shapes")
  Member "producibility in hierarchical self assembly":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "optimal staged self assembly of general shapes")
  Member "the power of nondeterminism in self assembly":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "universal simulation of directed systems in the abstract tile assembly model requires undirectedness")
  Member "staged self assembly nanomanufacture of arbitrary shapes with o 1 glues":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "connected assembly and reconfiguration by finite automata")

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)