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 "reducing tile complexity for the self assembly of scaled shapes through temperature programming"):
  Abstract: This paper concerns the self-assembly of scaled-up versions of arbitrary finite shapes. We work in the multiple temperature model that was introduced by Aggarwal, Cheng, Goldwasser, Kao, and Schweller (Complexities for Generalized Models of Self-Assembly, SODA 2004). The multiple temperature model is a natural generalization of Winfree's abstract tile assembly model, where the temperature of a tile system is allowed to be shifted up and down as self-assembly proceeds. We first exhibit two constant-size tile sets in which scaled-up versions of arbitrary shapes self-assemble. Our first tile set has the property that each scaled shape self-assembles via an asymptotically "Kolmogorov-optimum" temperature sequence but the scaling factor grows with the size of the shape being assembled. In contrast, our second tile set assembles each scaled shape via a temperature sequence whose length is proportional to the number of points in the shape but the scaling factor is a constant independent of the shape being assembled. We then show that there is no constant-size tile set that can uniquely assemble an arbitrary (non-scaled, connected) shape in the multiple temperature model, i.e., the scaling is necessary for self-assembly. This answers an open question of Kao and Schweller (Reducing Tile Complexity for Self-Assembly Through Temperature Programming, SODA 2006), who asked whether such a tile set existed.

Includes members:
  Member "intrinsic universality in self assembly":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "the non cooperative tile assembly model is not intrinsically universal or capable of bounded turing machine simulation")
  Member "randomized self assembly for exact shapes":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "universal simulation of directed systems in the abstract tile assembly model requires undirectedness")
  Member "strict self assembly of discrete sierpinski triangles":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "geometric tiles and powers and limitations of geometric hindrance in self assembly")
  Member "staged self assembly nanomanufacture of arbitrary shapes with o 1 glues":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "connected assembly and reconfiguration by finite automata")
  Member "complexity of self assembled shapes":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "the program size complexity of self assembled paths")
  Member "reducing tile complexity for self assembly through temperature programming":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "self assembly of 4 sided fractals in the two handed tile assembly model")

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)