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 "two hands are better than one up to constant factors"):
  Abstract: We study the difference between the standard seeded model of tile self-assembly, and the "seedless" two-handed model of tile self-assembly. Most of our results suggest that the two-handed model is more powerful. In particular, we show how to simulate any seeded system with a two-handed system that is essentially just a constant factor larger. We exhibit finite shapes with a busy-beaver separation in the number of distinct tiles required by seeded versus two-handed, and exhibit an infinite shape that can be constructed two-handed but not seeded. Finally, we show that verifying whether a given system uniquely assembles a desired supertile is co-NP-complete in the two-handed model, while it was known to be polynomially solvable in the seeded model.

Includes members:
  Member "parallelism and time in hierarchical self assembly":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "hierarchical growth is necessary and sometimes sufficient to self assemble discrete self similar fractals")
  Member "self assembly with geometric tiles":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "the program size complexity of self assembled paths")
  Member "strong fault tolerance for self assembly with fuzzy temperature":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "the program size complexity of self assembled paths")
  Member "self assembly of arbitrary shapes using rnase enzymes meeting the kolmogorov bound with small scale factor extended abstract":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "know when to fold em self assembly of shapes by folding in oritatami")
  Member "strict self assembly of discrete sierpinski triangles":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "geometric tiles and powers and limitations of geometric hindrance in self assembly")
  Member "temperature 1 self assembly deterministic assembly in 3d and probabilistic assembly in 2d":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "the program size complexity of self assembled paths")
  Member "staged self assembly nanomanufacture of arbitrary shapes with o 1 glues":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "connected assembly and reconfiguration by finite automata")
  Member "complexity of self assembled shapes":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "the program size complexity of self assembled paths")

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)