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 "unraveling simplicity in elementary cellular automata"):
  Abstract: We show that a large number of elementary cellular automata are computationally simple. This work is the first systematic classification of elementary cellular automata based on a formal notion of computational complexity. Thanks to the generality of communication complexity, the perspectives of our method include its application to other natural systems such as neural networks and gene regulatory networks.

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 "intrinsic universality in tile self assembly requires cooperation":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "the program size complexity of self assembled paths")
  Member "the tile assembly model is intrinsically universal":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "the program size complexity of self assembled paths")
  Member "on factor universality in symbolic spaces":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "subshifts as models for mso logic")
  Member "intrinsic universality in self assembly":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "the non cooperative tile assembly model is not intrinsically universal or capable of bounded turing machine simulation")
  Member "on local symmetries and universality in cellular autmata":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "intrinsic universality in tile self assembly requires cooperation")
  Member "cellular automata and communication complexity":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "traced communication complexity of cellular 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)