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: "tight bounds for the space complexity of nonregular language recognition by real time machines"
  Abstract: We examine the minimum amount of memory for real-time, as opposed to one-way, computation accepting nonregular languages. We consider deterministic, nondeterministic and alternating machines working within strong, middle and weak space, and processing general or unary inputs. In most cases, we are able to show that the lower bounds for one-way machines remain tight in the real-time case. Memory lower bounds for nonregular acceptance on other devices are also addressed. It is shown that increasing the number of stacks of real-time pushdown automata can result in exponential improvement in the total amount of space usage for nonregular language recognition.

Connected through hyperedge HE-1 (induced by source paper "uncountable realtime probabilistic classes"):
  with members:
    - "uncountable classical and quantum complexity classes"
    - "magic coins are useful for small space quantum machines"

Connected through hyperedge HE-2 (induced by source paper "inkdots as advice to small space machines"):
  with members:
    - "finite automata with advice tapes"
    - "immunity and pseudorandomness of context free languages"
    - "theory of one tape linear time turing machines"

Connected through hyperedge HE-3 (induced by source paper "new results on the minimum amount of useful space"):
  with members:
    - "the minimum amount of useful space new results and new directions"
    - "quantum finite automata a modern introduction"
    - "one counter verifiers for decidable languages"
    - "two way finite automata with quantum and classical states"

Connected through hyperedge HE-4 (induced by source paper "the minimum amount of useful space new results and new directions"):
  with members:
    - "one counter verifiers for decidable languages"
    - "succinctness of two way probabilistic and quantum finite automata"
    - "two way finite automata with quantum and classical states"

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)