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: "space bounded kolmogorov extractors"
  Abstract: An extractor is a function that receives some randomness and either "improves" it or produces "new" randomness. There are statistical and algorithmical specifications of this notion. We study an algorithmical one called Kolmogorov extractors and modify it to resource-bounded version of Kolmogorov complexity. Following Zimand we prove the existence of such objects with certain parameters. The utilized technique is "naive" derandomization: we replace random constructions employed by Zimand by pseudo-random ones obtained by Nisan-Wigderson generator.

Connected through hyperedge HE-1 (induced by source paper "short lists with short programs in short time"):
  with members:
    - "short lists with short programs in short time a short proof"
    - "nonuniform kolmogorov extractors"
    - "short lists for shortest descriptions in short time"
    - "complexity of complexity and strings with maximal plain and prefix kolmogorov complexity"
    - "possibilities and impossibilities in kolmogorov complexity extraction"
    - "symmetry of information and bounds on nonuniform randomness extraction via kolmogorov extractors"
    - "improving the space bounded version of muchnik s conditional complexity theorem via naive derandomization"
    - "variations on muchnik s conditional complexity theorem"

Connected through hyperedge HE-2 (induced by source paper "improving the space bounded version of muchnik s conditional complexity theorem via naive derandomization"):
  with members:
    - "symmetry of information and bounds on nonuniform randomness extraction via kolmogorov extractors"
    - "on the optimal compression of sets in pspace"
    - "pseudo random graphs and bit probe schemes with one sided error"
    - "impossibility of independence amplification in kolmogorov complexity theory"
    - "extracting the kolmogorov complexity of strings and sequences from sources with limited independence"
    - "variations on muchnik s conditional complexity theorem"

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)