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 "self assembly of a statistically self similar fractal"):
  Abstract: We demonstrate existence of a tile assembly system that self-assembles the statistically self-similar Sierpinski Triangle in the Winfree-Rothemund Tile Assembly Model. This appears to be the first paper that considers self-assembly of a random fractal, instead of a deterministic fractal or a finite, bounded shape. Our technical contributions include a way to remember, and use, unboundedly-long prefixes of an infinite coding sequence at each stage of fractal construction; a tile assembly mechanism for nested recursion; and a definition of "almost-everywhere local determinism," to describe a tileset whose assembly is locally determined, conditional upon a zeta-dimension zero set of (infinitely many) "input" tiles. This last is similar to the definition of randomized computation for Turing machines, in which an algorithm is deterministic relative to an oracle sequence of coin flips that provides advice but does not itself compute. Keywords: tile self-assembly, statistically self-similar Sierpinski Triangle.

Includes members:
  Member "simulation of self assembly in the abstract tile assembly model with isu tas":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "computing real numbers using dna self assembly")
  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 "self assembly of the discrete sierpinski carpet and related fractals":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "compact error resilient self assembly of recursively defined patterns")
  Member "self assembly of discrete self similar fractals":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "deterministic 2 dimensional temperature 1 tile assembly systems cannot compute")
  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")

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)