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 "possibilities and impossibilities in kolmogorov complexity extraction"):
  Abstract: Randomness extraction is the process of constructing a source of randomness of high quality from one or several sources of randomness of lower quality. The problem can be modeled using probability distributions and min-entropy to measure their quality and also by using individual strings and Kolmogorov complexity to measure their quality. Complexity theorists are more familiar with the first approach. In this paper we survey the second approach. We present the connection between extractors and Kolmogorov extractors and the basic positive and negative results concerning Kolmogorov complexity extraction.

Includes members:
  Member "counting dependent and independent strings":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "symmetry of information a closer look")
  Member "impossibility of independence amplification in kolmogorov complexity theory":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "space bounded kolmogorov extractors")
  Member "extracting the kolmogorov complexity of strings and sequences from sources with limited independence":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "space bounded kolmogorov extractors")
  Member "algorithmically independent sequences":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "finite state independence")
  Member "two sources are better than one for increasing the kolmogorov complexity of infinite sequences":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "short lists with short programs in short time")
  Member "constructive dimension and turing degrees":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "impossibility of independence amplification in kolmogorov complexity theory")
  Member "dimension extractors and optimal decompression":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "compression of data streams down to their information content")

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)