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 "staged self assembly and polyomino context free grammars"):
  Abstract: Previous work by Demaine et al. (2012) developed a strong connection between smallest context-free grammars and staged self-assembly systems for one-dimensional strings and assemblies. We extend this work to two-dimensional polyominoes and assemblies, comparing staged self-assembly systems to a natural generalization of context-free grammars we call polyomino context-free grammars (PCFGs). We achieve nearly optimal bounds on the largest ratios of the smallest PCFG and staged self-assembly system for a given polyomino with n cells. For the ratio of PCFGs over assembly systems, we show the smallest PCFG can be an Omega(n/(log(n))^3)-factor larger than the smallest staged assembly system, even when restricted to square polyominoes. For the ratio of assembly systems over PCFGs, we show that the smallest staged assembly system is never more than a O(log(n))-factor larger than the smallest PCFG and is sometimes an Omega(log(n)/loglog(n))-factor larger.

Includes members:
  Member "the two handed tile assembly model is not intrinsically universal":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "the program size complexity of self assembled paths")
  Member "combinatorial optimization in pattern assembly":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "the complexity of fixed height patterned tile self assembly")
  Member "intrinsic universality and the computational power of self assembly":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "the program size complexity of self assembled paths")
  Member "approximation of grammar based compression via recompression":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "a survey on string constraint solving")
  Member "fuel efficient computation in passive self assembly":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "covert computation in self assembled circuits")
  Member "one tile to rule them all simulating any turing machine tile assembly system or tiling system with a single puzzle piece":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "the program size complexity of self assembled paths")
  Member "inapproximability of the smallest superpolyomino problem":
    also connected through other hyperedges:
      (none)
  Member "parallelism and time in hierarchical self assembly":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "hierarchical growth is necessary and sometimes sufficient to self assemble discrete self similar fractals")

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)