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 "short lists with short programs in short time"):
  Abstract: Given a machine $U$, a $c$-short program for $x$ is a string $p$ such that $U(p)=x$ and the length of $p$ is bounded by $c$ + (the length of a shortest program for $x$). We show that for any standard Turing machine, it is possible to compute in polynomial time on input $x$ a list of polynomial size guaranteed to contain a O$(\log |x|)$-short program for $x$. We also show that there exists a computable function that maps every $x$ to a list of size $|x|^2$ containing a O$(1)$-short program for $x$. This is essentially optimal because we prove that for each such function there is a $c$ and infinitely many $x$ for which the list has size at least $c|x|^2$. Finally we show that for some standard machines, computable functions generating lists with $0$-short programs, must have infinitely often list sizes proportional to $2^{|x|}$.

Includes members:
  Member "short lists with short programs in short time a short proof":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "how incomputable is kolmogorov complexity")
  Member "space bounded kolmogorov extractors":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "improving the space bounded version of muchnik s conditional complexity theorem via naive derandomization")
  Member "nonuniform kolmogorov extractors":
    also connected through other hyperedges:
      (none)
  Member "short lists for shortest descriptions in short time":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "universal almost optimal compression and slepian wolf coding in probabilistic polynomial time")
  Member "complexity of complexity and strings with maximal plain and prefix kolmogorov complexity":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "how incomputable is kolmogorov complexity")
  Member "possibilities and impossibilities in kolmogorov complexity extraction":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "space bounded kolmogorov extractors")
  Member "symmetry of information and bounds on nonuniform randomness extraction via kolmogorov extractors":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "space bounded kolmogorov extractors")
  Member "improving the space bounded version of muchnik s conditional complexity theorem via naive derandomization":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "on algorithmic statistics for space bounded algorithms")

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)