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 "lower bounds on information complexity via zero communication protocols and applications"):
  Abstract: We show that almost all known lower bound methods for communication complexity are also lower bounds for the information complexity. In particular, we define a relaxed version of the partition bound of Jain and Klauck and prove that it lower bounds the information complexity of any function. Our relaxed partition bound subsumes all norm based methods (e.g. the ?2 method) and rectangle-based methods (e.g. the rectangle/corruption bound, the smooth rectangle bound, and the discrepancy bound), except the partition bound. Our result uses a new connection between rectangles and zero-communication protocols where the players can either output a value or abort. We prove the following compression lemma: given a protocol for a function f with information complexity I, one can construct a zero-communication protocol that has non-abort probability at least 2^{-O(I)} and that computes f correctly with high probability conditioned on not aborting. Then, we show how such a zero-communication protocol relates to the relaxed partition bound. We use our main theorem to resolve three of the open questions raised by Braver man. First, we show that the information complexity of the Vector in Subspace Problem is O(n^{1/3}), which, in turn, implies that there exists an exponential separation between quantum communication complexity and classical information complexity. Moreover, we provide an O(n) lower bound on the information complexity of the Gap Hamming Distance Problem.

Includes members:
  Member "a strong direct product theorem in terms of the smooth rectangle bound":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "simulation theorems via pseudorandom properties")
  Member "information complexity versus corruption and applications to orthogonality and gap hamming":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "r enyi information complexity and an information theoretic characterization of the partition bound")
  Member "information equals amortized communication":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "communication for generating correlation a unifying survey")
  Member "a discrepancy lower bound for information complexity":
    also connected through other hyperedges:
      - Hyperedge HE-4 (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-5 (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-6 (induced by source paper "approximate mathbb f _2 sketching of valuation functions")
  Member "the space complexity of recognizing well parenthesized expressions in the streaming model the index function revisited":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "sliding window property testing for regular languages")
  Member "quantum one way communication is exponentially stronger than classical communication":
    also connected through other hyperedges:
      (none)

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)