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 "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.

Includes members:
  Member "possibilities and impossibilities in kolmogorov complexity extraction":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "short lists with short programs in short time")
  Member "symmetry of information and bounds on nonuniform randomness extraction via kolmogorov extractors":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "short lists with short programs in short time")
  Member "on the optimal compression of sets in pspace":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "improving the space bounded version of muchnik s conditional complexity theorem via naive derandomization")
  Member "pseudo random graphs and bit probe schemes with one sided error":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "improving the space bounded version of muchnik s conditional complexity theorem via naive derandomization")
  Member "impossibility of independence amplification in kolmogorov complexity theory":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "possibilities and impossibilities in kolmogorov complexity extraction")
  Member "improving the space bounded version of muchnik s conditional complexity theorem via naive derandomization":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "on algorithmic statistics for space bounded algorithms")
  Member "extracting the kolmogorov complexity of strings and sequences from sources with limited independence":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "symmetry of information a closer look")
  Member "two sources are better than one for increasing the kolmogorov complexity of infinite sequences":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "short lists with short programs in short time")

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)