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: "communication complexity for algorithm designers"
  Abstract: This document collects the lecture notes from my course "Communication Complexity (for Algorithm Designers),'' taught at Stanford in the winter quarter of 2015. The two primary goals of the course are: 1. Learn several canonical problems that have proved the most useful for proving lower bounds (Disjointness, Index, Gap-Hamming, etc.). 2. Learn how to reduce lower bounds for fundamental algorithmic problems to communication complexity lower bounds. Along the way, we'll also: 3. Get exposure to lots of cool computational models and some famous results about them --- data streams and linear sketches, compressive sensing, space-query time trade-offs in data structures, sublinear-time algorithms, and the extension complexity of linear programs. 4. Scratch the surface of techniques for proving communication complexity lower bounds (fooling sets, corruption bounds, etc.).

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"
    - "query to communication lifting for bpp"
    - "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"

Connected through hyperedge HE-2 (induced by source paper "the communication complexity of set intersection and multiple equality testing"):
  with members:
    - "improved distributed expander decomposition and nearly optimal triangle enumeration"
    - "distributed triangle detection via expander decomposition"
    - "detecting cliques in congest networks"
    - "fooling views a new lower bound technique for distributed computations under congestion"
    - "triangle finding and listing in congest networks"
    - "deterministic subgraph detection in broadcast congest"
    - "on the communication complexity of sparse set disjointness and exists equal problems"

Connected through hyperedge HE-3 (induced by source paper "the online event detection problem"):
  with members:
    - "optimal hashing in external memory"
    - "an optimal algorithm for l1 heavy hitters in insertion streams and related problems"
    - "bptree an ell_2 heavy hitters algorithm using constant memory"
    - "heavy hitters via cluster preserving clustering"
    - "beating countsketch for heavy hitters in insertion streams"
    - "don t thrash how to cache your hash on flash"

Connected through hyperedge HE-4 (induced by source paper "on the streaming complexity of fundamental geometric problems"):
  with members:
    - "optimal quantile approximation in streams"
    - "interval selection in the streaming model"
    - "space constrained interval selection"
    - "deterministic sampling and range counting in geometric data streams"

Connected through hyperedge HE-5 (induced by source paper "extension complexity of the correlation polytope"):
  with members:
    - "improved bounds for the excluded grid theorem"
    - "extension complexity of independent set polytopes"
    - "extended formulation for csp that is compact for instances of bounded treewidth"
    - "polynomial bounds for the grid minor theorem"

Connected through hyperedge HE-6 (induced by source paper "communication complexity of cake cutting"):
  with members:
    - "consensus halving is ppa complete"
    - "the query complexity of cake cutting"
    - "combinatorial auctions do need modest interaction"
    - "a discrete and bounded envy free cake cutting protocol for any number of agents"
    - "waste makes haste bounded time algorithms for envy free cake cutting with free disposal"
    - "hardness results for consensus halving"
    - "welfare maximization with limited interaction"
    - "a stable marriage requires communication"

Connected through hyperedge HE-7 (induced by source paper "communication complexity of correlated equilibrium in two player games"):
  with members:
    - "settling the complexity of computing approximate two player nash equilibria"
    - "finding any nontrivial coarse correlated equilibrium is hard"
    - "inapproximability of nash equilibrium"
    - "on the communication complexity of approximate nash equilibria"
    - "settling the complexity of computing two player nash equilibria"

Connected through hyperedge HE-8 (induced by source paper "extension complexity of stable set polytopes of bipartite graphs"):
  with members:
    - "fooling sets and the spanning tree polytope"
    - "extension complexity of independent set polytopes"
    - "the matching polytope has exponential extension 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)