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: "bounds on monotone switching networks for directed connectivity"
  Abstract: We separate monotone analogues of L and NL by proving that any monotone switching network solving directed connectivity on $n$ vertices must have size at least $n^(\Omega(\lg(n)))$.

Connected through hyperedge HE-1 (induced by source paper "nullstellensatz size degree trade offs from reversible pebbling"):
  with members:
    - "pebble games proof complexity and time space trade offs"

Connected through hyperedge HE-2 (induced by source paper "the parameterized space complexity of model checking bounded variable first order logic"):
  with members:
    - "computing hitting set kernels by ac 0 circuits"
    - "fast parallel fixed parameter algorithms via color coding"
    - "one hierarchy spawns another graph deconstructions and the complexity classification of conjunctive queries"
    - "deciding first order properties of nowhere dense graphs"
    - "on the complexity of existential positive queries"
    - "fixed parameter tractability definability and model checking"

Connected through hyperedge HE-3 (induced by source paper "communication lower bounds via critical block sensitivity"):
  with members:
    - "pebble games proof complexity and time space trade offs"
    - "tight bounds for set disjointness in the message passing model"
    - "approximability and proof complexity"
    - "hardness amplification in proof complexity"

Connected through hyperedge HE-4 (induced by source paper "bounds on the size of sound monotone switching networks accepting permutation sets of directed trees"):
  with members:
    - "monotone switching networks for directed connectivity are strictly more powerful than certain knowledge switching networks"

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)