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: "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.

Connected through hyperedge HE-1 (induced by source paper "query to communication lifting using low discrepancy gadgets"):
  with members:
    - "from expanders to hitting distributions and simulation theorems"
    - "query to communication lifting for bpp"
    - "simulation theorems via pseudorandom properties"
    - "communication lower bounds via critical block sensitivity"
    - "information equals amortized communication"
    - "improved direct product theorems for randomized query complexity"
    - "the partition bound for classical communication complexity and query complexity"
    - "a strong direct product theorem for disjointness"

Connected through hyperedge HE-2 (induced by source paper "query to communication lifting for bpp using inner product"):
  with members:
    - "from expanders to hitting distributions and simulation theorems"
    - "query to communication lifting for bpp"
    - "communication lower bounds via critical block sensitivity"
    - "information equals amortized communication"
    - "improved direct product theorems for randomized query complexity"
    - "the partition bound for classical communication complexity and query complexity"
    - "a strong direct product theorem for disjointness"

Connected through hyperedge HE-3 (induced by source paper "trading information complexity for error ii the case of a large error and external information complexity"):
  with members:
    - "trading information complexity for error"

Connected through hyperedge HE-4 (induced by source paper "near log convexity of measured heat in discrete time and consequences"):
  with members:
    - "on the communication complexity of sparse set disjointness and exists equal problems"
    - "the non adaptive query complexity of testing k parities"
    - "spectral norm of symmetric functions"
    - "an optimal lower bound on the communication complexity of gap hamming distance"

Connected through hyperedge HE-5 (induced by source paper "simulation theorems via pseudorandom properties"):
  with members:
    - "a strong direct product theorem in terms of the smooth rectangle bound"
    - "information equals amortized communication"
    - "improved direct product theorems for randomized query complexity"
    - "strong direct product theorems for quantum communication and query complexity"
    - "a direct sum theorem in communication complexity via message compression"

Connected through hyperedge HE-6 (induced by source paper "communication and randomness lower bounds for secure computation"):
  with members:
    - "assisted common information with an application to secure two party sampling"
    - "two shannon type problems on secure multi party computations"
    - "how to securely compute the modulo two sum of binary sources"
    - "the infinite message limit of two terminal interactive source coding"

Connected through hyperedge HE-7 (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"
    - "on the communication complexity of sparse set disjointness and exists equal problems"
    - "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-8 (induced by source paper "r enyi information complexity and an information theoretic characterization of the partition bound"):
  with members:
    - "tension bounds for information complexity"
    - "information complexity versus corruption and applications to orthogonality and gap hamming"
    - "information equals amortized communication"
    - "a discrepancy lower bound for information complexity"
    - "the partition bound for classical communication complexity and query complexity"
    - "a direct sum theorem in communication complexity via message compression"

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)