human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "information complexity versus corruption and applications to orthogonality and gap hamming"):
  Abstract: Three decades of research in communication complexity have led to the invention of a number of techniques to lower bound randomized communication complexity. The majority of these techniques involve properties of large submatrices (rectangles) of the truth-table matrix defining a communication problem. The only technique that does not quite fit is information complexity, which has been investigated over the last decade. Here, we connect information complexity to one of the most powerful "rectangular" techniques: the recently-introduced smooth corruption (or "smooth rectangle") bound. We show that the former subsumes the latter under rectangular input distributions. We conjecture that this subsumption holds more generally, under arbitrary distributions, which would resolve the long-standing direct sum question for randomized communication. As an application, we obtain an optimal $\Omega(n)$ lower bound on the information complexity---under the {\em uniform distribution}---of the so-called orthogonality problem (ORT), which is in turn closely related to the much-studied Gap-Hamming-Distance (GHD). The proof of this bound is along the lines of recent communication lower bounds for GHD, but we encounter a surprising amount of additional technical detail.

Includes members:
  Member "a direct product theorem for bounded round public coin randomized communication complexity":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "on the power of multiplexing in number on the forehead protocols")
  Member "lower bounds on information complexity via zero communication protocols and applications":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "query to communication lifting using low discrepancy gadgets")
  Member "a discrepancy lower bound for information complexity":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "detecting patterns can be hard circuit lower bounds for the string matching problem")
  Member "tight bounds for distributed functional monitoring":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "towards optimal moment estimation in streaming and distributed models")
  Member "an optimal lower bound on the communication complexity of gap hamming distance":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "approximate mathbb f _2 sketching of valuation functions")
  Member "strong direct product theorems for quantum communication and query complexity":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "a new minimax theorem for randomized algorithms")
  Member "the partition bound for classical communication complexity and query complexity":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "query to communication lifting using low discrepancy gadgets")
  Member "a direct sum theorem in communication complexity via message compression":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "polynomial pass lower bounds for graph streaming algorithms")

Question: Please tell me which class the source paper 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)