human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "on the time complexity of 2 tag systems and small universal turing machines"
  Abstract: We show that 2-tag systems efficiently simulate Turing machines. As a corollary we find that the small universal Turing machines of Rogozhin, Minsky and others simulate Turing machines in polynomial time. This is an exponential improvement on the previously known simulation time overhead and improves a forty year old result in the area of small universal Turing machines.

Connected through hyperedge HE-1 (induced by source paper "the complexity of small universal turing machines a survey"):
  with members:
    - "a concrete view of rule 110 computation"
    - "a particular universal cellular automaton"
    - "small weakly universal turing machines"

Connected through hyperedge HE-2 (induced by source paper "program size versus time complexity speed up and slowdown phenomena in small turing machines"):
  with members:
    - "empirical encounters with computational irreducibility and unpredictability"
    - "most programs stop quickly or never halt"

Connected through hyperedge HE-3 (induced by source paper "on the computational complexity of spiking neural p systems"):
  with members:
    - "a boundary between universality and non universality in spiking neural p systems"
    - "small weakly universal turing machines"

Connected through hyperedge HE-4 (induced by source paper "a concrete view of rule 110 computation"):
  with members:
    - "small weakly universal turing machines"

Connected through hyperedge HE-5 (induced by source paper "small turing universal signal machines"):
  with members:
    - "a particular universal cellular automaton"

Question: Please tell me which class the center node 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)