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: "tension bounds for information complexity"
  Abstract: The main contribution of this work is to relate information complexity to "tension" [Prabhakaran and Prabhakaran, 2014] - an information-theoretic quantity defined with no reference to protocols - and to illustrate that it allows deriving strong lower-bounds on information complexity. In particular, we use a very special case of this connection to give a quantitatively tighter connection between information complexity and discrepancy than the one in the work of Braverman and Weinstein (2012) (albeit, restricted to independent inputs). Further, as tension is in fact a multi-dimensional notion, it enables us to bound the 2-dimensional region that represents the trade-off between the amounts of communication in the two directions in a 2-party protocol. #R##N#This work is also intended to highlight tension as a fundamental measure of correlation between a pair of random variables, with rich connections to a variety of questions in computer science and information theory.

Connected through hyperedge HE-1 (induced by source paper "extended gray wyner system with complementary causal side information"):
  with members:
    - "strong functional representation lemma and applications to coding theorems"
    - "synergy redundancy and common information"
    - "notes on information theoretic privacy"
    - "assisted common information with an application to secure two party sampling"
    - "from the information bottleneck to the privacy funnel"
    - "distributed channel synthesis"
    - "on maximal correlation hypercontractivity and the data processing inequality studied by erkip and cover"
    - "multiterminal source coding with complementary delivery"

Connected through hyperedge HE-2 (induced by source paper "lower bounds for interactive function computation via wyner common information"):
  with members:
    - "information complexity is computable"
    - "assisted common information with an application to secure two party sampling"
    - "a new upperbound for the oblivious transfer capacity of discrete memoryless channels"
    - "the infinite message limit of two terminal interactive source coding"

Connected through hyperedge HE-3 (induced by source paper "r enyi information complexity and an information theoretic characterization of the partition bound"):
  with members:
    - "lower bounds on information complexity via zero communication protocols and applications"
    - "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)