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 "polynomial depth highness and lowness for e"):
  Abstract: We study the relations between the notions of highness, lowness and logical depth in the setting of complexity theory. We introduce a new notion of polynomial depth based on time bounded Kolmogorov complexity. We show our polynomial depth notion satisfies all basic logical depth properties, namely neither sets in P nor sets random for EXP are polynomial deep, and only polynomial deep sets can polynomially Turing compute a polynomial deep set. We prove all EXP- complete sets are poly-deep, and under the assumption that NP does not have p-measure zero, then NP contains a polynomial deep set. We show that every high set for E contains a polynomial deep set in its polynomial Turing degree, and that there exists low for E polynomial deep sets.

Includes members:
  Member "depth highness and dnr degrees":
    also connected through other hyperedges:
      (none)
  Member "on the polynomial depth of various sets of random strings":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "depth highness and dnr degrees")

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)