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 "dimension extractors and optimal decompression"):
  Abstract: A *dimension extractor* is an algorithm designed to increase the effective dimension -- i.e., the amount of computational randomness -- of an infinite binary sequence, in order to turn a "partially random" sequence into a "more random" sequence. Extractors are exhibited for various effective dimensions, including constructive, computable, space-bounded, time-bounded, and finite-state dimension. Using similar techniques, the Kucera-Gacs theorem is examined from the perspective of decompression, by showing that every infinite sequence S is Turing reducible to a Martin-Loef random sequence R such that the asymptotic number of bits of R needed to compute n bits of S, divided by n, is precisely the constructive dimension of S, which is shown to be the optimal ratio of query bits to computed bits achievable with Turing reductions. The extractors and decompressors that are developed lead directly to new characterizations of some effective dimensions in terms of optimal decompression by Turing reductions.

Includes members:
  Member "finite state dimension and lossy decompressors":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "bounded pushdown dimension vs lempel ziv information density")
  Member "every sequence is decompressible from a random one":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "compression of data streams down to their information content")
  Member "effective strong dimension algorithmic information and computational complexity":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "the arithmetical complexity of dimension and randomness")
  Member "gales suffice for constructive dimension":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "resource bounded dimension in computational learning theory")
  Member "dimension in complexity classes":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "asymptotic divergences and strong dichotomy")
  Member "the dimensions of individual strings and sequences":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "who asked us how the theory of computing answers questions about analysis")
  Member "gales and supergales are equivalent for defining constructive hausdorff dimension":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "every sequence is decompressible from a random one")

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)