human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "unambiguous computation boolean hierarchies and sparse turing complete sets"
  Abstract: It is known that for any class C closed under union and intersection, the Boolean closure of C, the Boolean hierarchy over C, and the symmetric difference hierarchy over C all are equal. We prove that these equalities hold for any complexity class closed under intersection; in particular, they thus hold for unambiguous polynomial time (UP). In contrast to the NP case, we prove that the Hausdorff hierarchy and the nested difference hierarchy over UP both fail to capture the Boolean closure of UP in some relativized worlds. #R##N#Karp and Lipton proved that if nondeterministic polynomial time has sparse Turing-complete sets, then the polynomial hierarchy collapses. We establish the first consequences from the assumption that unambiguous polynomial time has sparse Turing-complete sets: (a) UP is in Low_2, where Low_2 is the second level of the low hierarchy, and (b) each level of the unambiguous polynomial hierarchy is contained one level lower in the promise unambiguous polynomial hierarchy than is otherwise known to be the case.

Connected through hyperedge HE-1 (induced by source paper "complexity of the exact domatic number problem and of the exact conveyor flow shop problem"):
  with members:
    - "recognizing when heuristics can approximate minimum vertex covers is complete for parallel access to np"
    - "exact complexity of the winner problem for young elections"
    - "exact complexity of exact four colorability"
    - "raising np lower bounds to parallel np lower bounds"
    - "exact analysis of dodgson elections lewis carroll s 1876 voting system is complete for parallel access to np"

Connected through hyperedge HE-2 (induced by source paper "exact complexity of exact four colorability"):
  with members:
    - "complexity of the exact domatic number problem and of the exact conveyor flow shop problem"

Connected through hyperedge HE-3 (induced by source paper "what s up with downward collapse using the easy hard technique to link boolean and polynomial hierarchy collapses"):
  with members:
    - "a downward collapse within the polynomial hierarchy"
    - "downward collapse from a weaker hypothesis"
    - "translating equality downwards"

Connected through hyperedge HE-4 (induced by source paper "a downward collapse within the polynomial hierarchy"):
  with members:
    - "what s up with downward collapse using the easy hard technique to link boolean and polynomial hierarchy collapses"
    - "translating equality downwards"

Connected through hyperedge HE-5 (induced by source paper "restrictive acceptance suffices for equivalence problems"):
  with members:
    - "a second step towards complexity theoretic analogs of rice s theorem"

Connected through hyperedge HE-6 (induced by source paper "tally np sets and easy census functions"):
  with members:
    - "boolean operations joins and the extended low hierarchy"
    - "a downward collapse within the polynomial hierarchy"

Question: Please tell me which class the center node 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)