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 "downward collapse from a weaker hypothesis"):
  Abstract: Hemaspaandra et al. proved that, for $m > 0$ and $0   0$ and $0 < i < k - 1$: if $DIFF_s(\Sigma_i^p) \BoldfaceDelta DIFF_m(\Sigma_k^p)$ is closed under complementation, then $DIFF_m(\Sigma_k^p) = coDIFF_m(\Sigma_k^p)$.

Includes members:
  Member "what s up with downward collapse using the easy hard technique to link boolean and polynomial hierarchy collapses":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "using the no search easy hard technique for downward collapse")
  Member "a downward collapse within the polynomial hierarchy":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "using the no search easy hard technique for downward collapse")
  Member "an introduction to query order":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "query monotonic turing reductions")
  Member "translating equality downwards":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "what s up with downward collapse using the easy hard technique to link boolean and polynomial hierarchy collapses")

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)