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: "query to communication lifting for bpp"
  Abstract: For any $n$-bit boolean function $f$, we show that the randomized communication complexity of the composed function $f\circ g^n$, where $g$ is an index gadget, is characterized by the randomized decision tree complexity of $f$. In particular, this means that many query complexity separations involving randomized models (e.g., classical vs. quantum) automatically imply analogous separations in communication complexity.

Connected through hyperedge HE-1 (induced by source paper "complexity theory game theory and economics the barbados lectures"):
  with members:
    - "a round collapse theorem for computationally sound protocols or tfnp is hard on average in pessiland"
    - "on communication complexity of fixed point computation"
    - "near optimal communication lower bounds for approximate nash equilibria"
    - "lifting randomized query complexity to randomized communication complexity"
    - "settling the complexity of computing approximate two player nash equilibria"
    - "communication complexity of approximate nash equilibria"
    - "the price of anarchy in auctions"
    - "communication complexity for algorithm designers"

Connected through hyperedge HE-2 (induced by source paper "topology dependent bounds for faqs"):
  with members:
    - "juggling functions inside a database"
    - "worst case optimal algorithms for parallel query processing"
    - "tight network topology dependent bounds on rounds of communication"
    - "the range of topological effects on communication"
    - "it s all a matter of degree using degree information to optimize multiway joins"
    - "faq questions asked frequently"
    - "skew in parallel query processing"
    - "aggregation and ordering in factorised databases"

Connected through hyperedge HE-3 (induced by source paper "query to communication lifting using low discrepancy gadgets"):
  with members:
    - "from expanders to hitting distributions and simulation theorems"
    - "simulation theorems via pseudorandom properties"
    - "communication lower bounds via critical block sensitivity"
    - "lower bounds on information complexity via zero communication protocols and applications"
    - "information equals amortized communication"
    - "improved direct product theorems for randomized query complexity"
    - "the partition bound for classical communication complexity and query complexity"
    - "a strong direct product theorem for disjointness"

Connected through hyperedge HE-4 (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"
    - "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"
    - "every decision tree has an influential variable"
    - "optimal aggregation algorithms for middleware"

Connected through hyperedge HE-5 (induced by source paper "query to communication lifting for bpp using inner product"):
  with members:
    - "from expanders to hitting distributions and simulation theorems"
    - "communication lower bounds via critical block sensitivity"
    - "lower bounds on information complexity via zero communication protocols and applications"
    - "information equals amortized communication"
    - "improved direct product theorems for randomized query complexity"
    - "the partition bound for classical communication complexity and query complexity"
    - "a strong direct product theorem for disjointness"

Connected through hyperedge HE-6 (induced by source paper "more barriers for rank methods via a numeric to symbolic transfer"):
  with members:
    - "barriers for rank methods in arithmetic complexity"
    - "explicit polynomial sequences with maximal spaces of partial derivatives and a question of k mulmuley"
    - "koszul young flattenings and symmetric border rank of the determinant"
    - "on the power of homogeneous depth 4 arithmetic circuits"
    - "tensor rank some lower and upper bounds"

Connected through hyperedge HE-7 (induced by source paper "sign rank can increase under intersection"):
  with members:
    - "near optimal lower bounds on the threshold degree and sign rank of ac 0"
    - "hardness of learning noisy halfspaces using polynomial thresholds"
    - "on the power of statistical zero knowledge"
    - "the intersection of two halfspaces has high threshold degree"
    - "optimal bounds for sign representing the intersection of two halfspaces by polynomials"

Connected through hyperedge HE-8 (induced by source paper "optimal separation and strong direct sum for randomized query complexity"):
  with members:
    - "randomized query complexity of sabotaged and composed functions"
    - "nearly optimal separations between communication or query complexity and partitions"
    - "information equals amortized communication"
    - "improved direct product theorems for randomized query complexity"

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)