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: "every decision tree has an influential variable"
  Abstract: We prove that for any decision tree calculating a boolean function $f:\{-1,1\}^n\to\{-1,1\}$, \[ \Var[f] \le \sum_{i=1}^n \delta_i \Inf_i(f), \] where $\delta_i$ is the probability that the $i$th input variable is read and $\Inf_i(f)$ is the influence of the $i$th variable on $f$. The variance, influence and probability are taken with respect to an arbitrary product measure on $\{-1,1\}^n$. It follows that the minimum depth of a decision tree calculating a given balanced function is at least the reciprocal of the largest influence of any input variable. Likewise, any balanced boolean function with a decision tree of depth $d$ has a variable with influence at least $\frac{1}{d}$. The only previous nontrivial lower bound known was $\Omega(d 2^{-d})$. Our inequality has many generalizations, allowing us to prove influence lower bounds for randomized decision trees, decision trees on arbitrary product probability spaces, and decision trees with non-boolean outputs. As an application of our results we give a very easy proof that the randomized query complexity of nontrivial monotone graph properties is at least $\Omega(v^{4/3}/p^{1/3})$, where $v$ is the number of vertices and $p \leq \half$ is the critical threshold probability. This supersedes the milestone $\Omega(v^{4/3})$ bound of Hajnal and is sometimes superior to the best known lower bounds of Chakrabarti-Khot and Friedgut-Kahn-Wigderson.

Connected through hyperedge HE-1 (induced by source paper "on higher order cryptography long version"):
  with members:
    - "abstract machines for game semantics revisited"
    - "complexity theory for operators in analysis"

Connected through hyperedge HE-2 (induced by source paper "top down induction of decision trees rigorous guarantees and inherent limitations"):
  with members:
    - "on the optimality of trees generated by id3"
    - "beyond the low degree algorithm mixtures of subcubes and their applications"
    - "extractor based time space lower bounds for learning"
    - "hyperparameter optimization a spectral approach"
    - "fast learning requires good memory a time space lower bound for parity learning"
    - "analysis of boolean functions"
    - "learning circuits with few negations"
    - "fundamental limits of online and distributed algorithms for statistical learning and estimation"

Connected through hyperedge HE-3 (induced by source paper "constructive derandomization of query algorithms"):
  with members:
    - "lifting with simple gadgets and applications to circuit and proof complexity"
    - "beyond worst case analysis"
    - "query to communication lifting for bpp"
    - "the influence lower bound via query elimination"
    - "improved direct product theorems for randomized query complexity"
    - "optimal direct sum results for deterministic and randomized decision tree complexity"
    - "optimal aggregation algorithms for middleware"

Connected through hyperedge HE-4 (induced by source paper "fourier entropy influence conjecture for random linear threshold functions"):
  with members:
    - "analysis of boolean functions"
    - "a composition theorem for the fourier entropy influence conjecture"

Connected through hyperedge HE-5 (induced by source paper "quantum query complexity of subgraph isomorphism and homomorphism"):
  with members:
    - "a super grover separation between randomized and quantum query complexities"
    - "bounds for small error and zero error quantum algorithms"

Connected through hyperedge HE-6 (induced by source paper "analysis of boolean functions"):
  with members:
    - "improved bounds for the randomized decision tree complexity of recursive majority"
    - "some improvements to total degree tests"
    - "dnf sparsification and a faster deterministic counting algorithm"
    - "hypercontractive inequalities via sos with an application to vertex cover"
    - "hypercontractivity sum of squares proofs and their applications"
    - "majority is stablest discrete and sos"
    - "a satisfiability algorithm for ac 0"
    - "the influence lower bound via query elimination"

Connected through hyperedge HE-7 (induced by source paper "a composition theorem for parity kill number"):
  with members:
    - "analysis of boolean functions"
    - "two structural results for low degree polynomials and applications"
    - "communication is bounded by root of rank"
    - "on the structure of boolean functions with small spectral norm"
    - "on the parity complexity measures of boolean functions"
    - "variations on the sensitivity conjecture"
    - "on the communication complexity of xor functions"

Connected through hyperedge HE-8 (induced by source paper "the influence lower bound via query elimination"):
  with members:
    - "an optimal lower bound on the communication complexity of gap hamming distance"
    - "the partition bound for classical communication complexity and query complexity"
    - "a strong direct product theorem for disjointness"

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)