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: "a tight lower bound on certificate complexity in terms of block sensitivity and sensitivity"
  Abstract: Sensitivity, certificate complexity and block sensitivity are widely used Boolean function complexity measures. A longstanding open problem, proposed by Nisan and Szegedy [7], is whether sensitivity and block sensitivity are polynomially related. Motivated by the constructions of functions which achieve the largest known separations, we study the relation between 1-certificate complexity and 0-sensitivity and 0-block sensitivity.

Connected through hyperedge HE-1 (induced by source paper "low sensitivity functions from unambiguous certificates"):
  with members:
    - "randomized query complexity of sabotaged and composed functions"
    - "nearly optimal separations between communication or query complexity and partitions"
    - "degree and sensitivity tails of two distributions"
    - "separations in query complexity based on pointer functions"
    - "smooth boolean functions are easy efficient algorithms for low sensitivity functions"
    - "sensitivity versus certificate complexity of boolean functions"
    - "size of sets with small sensitivity a generalization of simon s lemma"
    - "an o n 0 4732 upper bound on the complexity of the gks communication game"

Connected through hyperedge HE-2 (induced by source paper "smooth boolean functions are easy efficient algorithms for low sensitivity functions"):
  with members:
    - "sensitivity versus certificate complexity of boolean functions"
    - "size of sets with small sensitivity a generalization of simon s lemma"
    - "analysis of boolean functions"
    - "tighter relations between sensitivity and other complexity measures"
    - "new separation between s f and bs f"
    - "variations on the sensitivity conjecture"

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)