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: "better gap hamming lower bounds via better round elimination"
  Abstract: Gap Hamming Distance is a well-studied problem in communication complexity, in which Alice and Bob have to decide whether the Hamming distance between their respective n-bit inputs is less than n/2-sqrt(n) or greater than n/2+sqrt(n). We show that every k-round bounded-error communication protocol for this problem sends a message of at least Omega(n/(k^2\log k)) bits. This lower bound has an exponentially better dependence on the number of rounds than the previous best bound, due to Brody and Chakrabarti. Our communication lower bound implies strong space lower bounds on algorithms for a number of data stream computations, such as approximating the number of distinct elements in a stream. #R##N#Subsequent to this result, the bound has been improved by some of us to the optimal Omega(n), independent of k, by using different techniques.

Connected through hyperedge HE-1 (induced by source paper "some bounds on communication complexity of gap hamming distance"):
  with members:
    - "an optimal lower bound on the communication complexity of gap hamming distance"

Connected through hyperedge HE-2 (induced by source paper "sketching and embedding are equivalent for norms"):
  with members:
    - "streaming symmetric norms via measure concentration"
    - "sketching as a tool for numerical linear algebra"
    - "an optimal lower bound on the communication complexity of gap hamming distance"
    - "a multi round communication lower bound for gap hamming and some consequences"
    - "optimal lower bounds for locality sensitive hashing except when q is tiny"
    - "planar earthmover is not in l_1"
    - "lower bounds on locality sensitive hashing"

Connected through hyperedge HE-3 (induced by source paper "time bounds for streaming problems"):
  with members:
    - "the cell probe complexity of dynamic range counting"
    - "an optimal lower bound on the communication complexity of gap hamming distance"
    - "logarithmic lower bounds in the cell probe model"

Connected through hyperedge HE-4 (induced by source paper "on the communication complexity of sparse set disjointness and exists equal problems"):
  with members:
    - "a multi round communication lower bound for gap hamming and some consequences"
    - "recognizing well parenthesized expressions in the streaming model"
    - "a direct sum theorem in communication complexity via message compression"

Connected through hyperedge HE-5 (induced by source paper "tight cell probe bounds for online hamming distance computation"):
  with members:
    - "the cell probe complexity of dynamic range counting"
    - "an optimal lower bound on the communication complexity of gap hamming distance"
    - "logarithmic lower bounds in the cell probe model"

Connected through hyperedge HE-6 (induced by source paper "tight bounds for distributed functional monitoring"):
  with members:
    - "optimal random sampling from distributed streams revisited"
    - "a lower bound for estimating high moments of a data stream"
    - "information complexity versus corruption and applications to orthogonality and gap hamming"
    - "randomized algorithms for tracking distributed count frequencies and ranks"
    - "lower bounds for number in hand multiparty communication complexity made easy"
    - "polynomial estimators for high frequency moments"
    - "information cost tradeoffs for augmented index and streaming language recognition"
    - "fast moment estimation in data streams in optimal space"

Connected through hyperedge HE-7 (induced by source paper "an optimal lower bound on the communication complexity of gap hamming distance"):
  with members:
    - "tight bounds for distributed functional monitoring"
    - "a multi round communication lower bound for gap hamming and some consequences"
    - "the partition bound for classical communication complexity and query complexity"
    - "a strong direct product theorem for disjointness"
    - "rectangle size bounds and threshold covers in communication 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)