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: "on the sensitivity of cyclically invariant boolean functions"
  Abstract: In this paper we construct a cyclically invariant Boolean function whose sensitivity is $\Theta(n^{1/3})$. This result answers two previously published questions. Tur\'an (1984) asked if any Boolean function, invariant under some transitive group of permutations, has sensitivity $\Omega(\sqrt{n})$. Kenyon and Kutin (2004) asked whether for a ``nice'' function the product of 0-sensitivity and 1-sensitivity is $\Omega(n)$. Our function answers both questions in the negative. #R##N#We also prove that for minterm-transitive functions (a natural class of Boolean functions including our example) the sensitivity is $\Omega(n^{1/3})$. Hence for this class of functions sensitivity and block sensitivity are polynomially related.

Connected through hyperedge HE-1 (induced by source paper "alternation sparsity and sensitivity bounds and exponential gaps"):
  with members:
    - "on the sensitivity conjecture for disjunctive normal forms"
    - "sensitivity conjecture and log rank conjecture for functions with small alternating numbers"
    - "degree and sensitivity tails of two distributions"
    - "sensitivity versus certificate complexity of boolean functions"
    - "analysis of boolean functions"
    - "learning circuits with few negations"
    - "communication is bounded by root of rank"
    - "fourier sparsity spectral norm and the log rank conjecture"

Connected through hyperedge HE-2 (induced by source paper "sensitivity conjecture and log rank conjecture for functions with small alternating numbers"):
  with members:
    - "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"
    - "parity decision tree complexity and 4 party communication complexity of xor functions are polynomially equivalent"
    - "tighter relations between sensitivity and other complexity measures"
    - "learning circuits with few negations"
    - "a composition theorem for parity kill number"
    - "communication is bounded by root of rank"

Connected through hyperedge HE-3 (induced by source paper "on the sensitivity conjecture for disjunctive normal forms"):
  with members:
    - "smooth boolean functions are easy efficient algorithms for low sensitivity functions"
    - "tighter relations between sensitivity and other complexity measures"
    - "composition limits and separating examples for some boolean function complexity measures"
    - "new separation between s f and bs f"
    - "variations on the sensitivity conjecture"

Connected through hyperedge HE-4 (induced by source paper "on the sensitivity complexity of k uniform hypergraph properties"):
  with members:
    - "sensitivity conjecture and log rank conjecture for functions with small alternating numbers"
    - "degree and sensitivity tails of two distributions"
    - "evasiveness and the distribution of prime numbers"
    - "variations on the sensitivity conjecture"
    - "lecture notes on evasiveness of graph properties"

Connected through hyperedge HE-5 (induced by source paper "a tighter relation between sensitivity and certificate complexity"):
  with members:
    - "sensitivity conjecture and log rank conjecture for functions with small alternating numbers"
    - "variations on the sensitivity conjecture"

Connected through hyperedge HE-6 (induced by source paper "lower bounds for sensitivity of graph properties"):
  with members:
    - "on the sensitivity complexity of k uniform hypergraph properties"
    - "variations on the sensitivity conjecture"

Connected through hyperedge HE-7 (induced by source paper "on the sensitivity of k uniform hypergraph properties"):
  with members:
    - "variations on the sensitivity conjecture"

Connected through hyperedge HE-8 (induced by source paper "variations on the sensitivity conjecture"):
  with members:
    - "on the parity complexity measures of boolean functions"
    - "on quantum classical equivalence for composed communication problems"

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)