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 communication complexity of sparse set disjointness and exists equal problems"
  Abstract: In this paper we study the two player randomized communication complexity of the sparse set disjointness and the exists-equal problems and give matching lower and upper bounds (up to constant factors) for any number of rounds for both of these problems. In the sparse set disjointness problem, each player receives a k-subset of [m] and the goal is to determine whether the sets intersect. For this problem, we give a protocol that communicates a total of O(k\log^{(r)}k) bits over r rounds and errs with very small probability. Here we can take r=\log^{*}k to obtain a O(k) total communication \log^{*}k-round protocol with exponentially small error probability, improving on the O(k)-bits O(\log k)-round constant error probability protocol of Hastad and Wigderson from 1997. #R##N#In the exist-equal problem, the players receive vectors x,y\in [t]^n and the goal is to determine whether there exists a coordinate i such that x_i=y_i. Namely, the exists-equal problem is the OR of n equality problems. Observe that exists-equal is an instance of sparse set disjointness with k=n, hence the protocol above applies here as well, giving an O(n\log^{(r)}n) upper bound. Our main technical contribution in this paper is a matching lower bound: we show that when t=\Omega(n), any r-round randomized protocol for the exists-equal problem with error probability at most 1/3 should have a message of size \Omega(n\log^{(r)}n). Our lower bound holds even for super-constant r <= \log^*n, showing that any O(n) bits exists-equal protocol should have \log^*n - O(1) rounds.

Connected through hyperedge HE-1 (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"
    - "communication complexity for algorithm designers"

Connected through hyperedge HE-2 (induced by source paper "near log convexity of measured heat in discrete time and consequences"):
  with members:
    - "the non adaptive query complexity of testing k parities"
    - "spectral norm of symmetric functions"
    - "lower bounds on information complexity via zero communication protocols and applications"
    - "an optimal lower bound on the communication complexity of gap hamming distance"

Connected through hyperedge HE-3 (induced by source paper "an adaptivity hierarchy theorem for property testing"):
  with members:
    - "on the power of adaptivity in sparse recovery"

Connected through hyperedge HE-4 (induced by source paper "communication complexity of inevitable intersection"):
  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"

Connected through hyperedge HE-5 (induced by source paper "communication complexity of permutation invariant functions"):
  with members:
    - "on the role of shared randomness in simultaneous communication"
    - "information complexity is computable"
    - "communication with imperfectly shared randomness"
    - "lower bounds on information complexity via zero communication protocols and applications"
    - "on extracting common random bits from correlated sources on large alphabets"
    - "an optimal lower bound on the communication complexity of gap hamming distance"
    - "on extracting common random bits from correlated sources"
    - "the partition bound for classical communication complexity and query complexity"

Connected through hyperedge HE-6 (induced by source paper "near optimal bounds on bounded round quantum communication complexity of disjointness"):
  with members:
    - "lower bounds on the size of semidefinite programming relaxations"
    - "lower bounds on information complexity via zero communication protocols and applications"
    - "strong direct product theorems for quantum communication and query complexity"
    - "multiparty communication complexity of disjointness"

Connected through hyperedge HE-7 (induced by source paper "correlation in hard distributions in communication complexity"):
  with members:
    - "new bounds on classical and quantum one way communication complexity"
    - "a direct sum theorem in communication complexity via message compression"

Connected through hyperedge HE-8 (induced by source paper "practical verified computation with streaming interactive proofs"):
  with members:
    - "arthur merlin streaming complexity"
    - "time optimal interactive proofs for circuit evaluation"
    - "verifying computations with streaming interactive proofs"
    - "on arthur merlin games in communication complexity"
    - "streaming graph computations with a helpful advisor"
    - "computing the diameter polynomially faster than apsp"
    - "weighted matching in the semi streaming model"
    - "straggler identification in round trip data streams via newton s identities and invertible bloom filters"

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)