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 "improving the space bounded version of muchnik s conditional complexity theorem via naive derandomization"):
  Abstract: Many theorems about Kolmogorov complexity rely on existence of combinatorial objects with specific properties. Usually the probabilistic method gives such objects with better parameters than explicit constructions do. But the probabilistic method does not give "effective" variants of such theorems, i.e. variants for resource-bounded Kolmogorov complexity. We show that a "naive derandomization" approach of replacing these objects by the output of Nisan-Wigderson pseudo-random generator may give polynomial-space variants of such theorems. #R##N#Specifically, we improve the preceding polynomial-space analogue of Muchnik's conditional complexity theorem. I.e., for all $a$ and $b$ there exists a program $p$ of least possible length that transforms $a$ to $b$ and is simple conditional on $b$. Here all programs work in polynomial space and all complexities are measured with logarithmic accuracy instead of polylogarithmic one in the previous work.

Includes members:
  Member "space bounded kolmogorov extractors":
    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 "space bounded kolmogorov extractors")
  Member "pseudo random graphs and bit probe schemes with one sided error":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "space bounded kolmogorov extractors")
  Member "impossibility of independence amplification in kolmogorov complexity theory":
    also connected through other hyperedges:
      - Hyperedge HE-5 (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-6 (induced by source paper "space bounded kolmogorov extractors")
  Member "variations on muchnik s conditional complexity theorem":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "universal almost optimal compression and slepian wolf coding in probabilistic polynomial 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)