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: "immunity and pseudorandomness of context free languages"
  Abstract: We discuss the computational complexity of context-free languages, concentrating on two well-known structural properties?immunity and pseudorandomness. An infinite language is REG-immune (resp., CFL-immune) if it contains no infinite subset that is a regular (resp., context-free) language. We prove that (i) there is a context-free REG-immune language outside REG/n and (ii) there is a REG-bi-immune language that can be computed deterministically using logarithmic space. We also show that (iii) there is a CFL-simple set, where a CFL-simple language is an infinite context-free language whose complement is CFL-immune. Similar to the REG-immunity, a REG-primeimmune language has no polynomially dense subsets that are also regular. We further prove that (iv) there is a context-free language that is REG/n-bi-primeimmune. Concerning pseudorandomness of context-free languages, we show that (v) CFL contains REG/n-pseudorandom languages. Finally, we prove that (vi) against REG/n, there exists an almost 1?1 pseudorandom generator computable in nondeterministic pushdown automata equipped with a write-only output tape and (vii) against REG, there is no almost 1?1 weakly pseudorandom generator computable deterministically in linear time by a single-tape Turing machine.

Connected through hyperedge HE-1 (induced by source paper "not all multi valued partial cfl functions are refined by single valued functions"):
  with members:
    - "structural complexity of multi valued partial functions computed by nondeterministic pushdown automata"
    - "oracle pushdown automata nondeterministic reducibilities and the cfl hierarchy over the family of context free languages"
    - "pseudorandom generators against advised context free languages"
    - "swapping lemmas for regular and context free languages"
    - "theory of one tape linear time turing machines"

Connected through hyperedge HE-2 (induced by source paper "structural complexity of multi valued partial functions computed by nondeterministic pushdown automata"):
  with members:
    - "oracle pushdown automata nondeterministic reducibilities and the cfl hierarchy over the family of context free languages"
    - "the roles of advice to one tape linear time turing machines and finite automata"
    - "multi head finite automata characterizations concepts and open problems"
    - "pseudorandom generators against advised context free languages"
    - "swapping lemmas for regular and context free languages"
    - "theory of one tape linear time turing machines"

Connected through hyperedge HE-3 (induced by source paper "inkdots as advice to small space machines"):
  with members:
    - "finite automata with advice tapes"
    - "tight bounds for the space complexity of nonregular language recognition by real time machines"
    - "theory of one tape linear time turing machines"

Connected through hyperedge HE-4 (induced by source paper "oracle pushdown automata nondeterministic reducibilities and the cfl hierarchy over the family of context free languages"):
  with members:
    - "the dissecting power of regular languages"
    - "the roles of advice to one tape linear time turing machines and finite automata"
    - "pseudorandom generators against advised context free languages"
    - "swapping lemmas for regular and context free languages"
    - "theory of one tape linear time turing machines"

Connected through hyperedge HE-5 (induced by source paper "finite automata with advice tapes"):
  with members:
    - "quantum computation with write only memory"
    - "unbounded error quantum computation with small space bounds"
    - "the roles of advice to one tape linear time turing machines and finite automata"
    - "theory of one tape linear time turing machines"

Connected through hyperedge HE-6 (induced by source paper "the dissecting power of regular languages"):
  with members:
    - "the roles of advice to one tape linear time turing machines and finite automata"
    - "swapping lemmas for regular and context free languages"
    - "theory of one tape linear time turing machines"

Connected through hyperedge HE-7 (induced by source paper "the roles of advice to one tape linear time turing machines and finite automata"):
  with members:
    - "swapping lemmas for regular and context free languages"
    - "theory of one tape linear time turing machines"

Connected through hyperedge HE-8 (induced by source paper "pseudorandom generators against advised context free languages"):
  with members:
    - "structural complexity of multi valued partial functions computed by nondeterministic pushdown automata"
    - "oracle pushdown automata nondeterministic reducibilities and the cfl hierarchy over the family of context free languages"
    - "the roles of advice to one tape linear time turing machines and finite automata"
    - "swapping lemmas for regular and context free languages"
    - "theory of one tape linear time turing machines"

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)