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: "new upper bound on block sensitivity and certificate complexity in terms of sensitivity"
  Abstract: Sensitivity [4, 5] and block sensitivity [9] are two important complexity measures of Boolean functions. A longstanding open problem in decision tree complexity, the “Sensitivity versus Block Sensitivity” question, proposed by Nisan and Szegedy [10] in 1992, is whether these two complexity measures are polynomially related, i.e., whether bs(f) = O(s(f) O(1) ). We prove an new upper bound on block sensitivity in terms of sensitivity: bs(f) ≤ 2 s(f)−1 s(f). Previously, the best upper bound on block sensitivity was bs(f) ≤ ( e √ 2� )e s(f) p s(f) by Kenyon and Kutin [8]. We also prove that if min{s0(f),s1(f)} is a constant, then sensitivity and block sensitivity are linearly related, i.e. bs(f) = O(s(f)).

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)