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: "on the duality of additivity and tensorization"
  Abstract: A function is said to be additive if, similar to mutual information, expands by a factor of $n$, when evaluated on $n$ i.i.d. repetitions of a source or channel. On the other hand, a function is said to satisfy the tensorization property if it remains unchanged when evaluated on i.i.d. repetitions. Additive rate regions are of fundamental importance in network information theory, serving as capacity regions or upper bounds thereof. Tensorizing measures of correlation have also found applications in distributed source and channel coding problems as well as the distribution simulation problem. Prior to our work only two measures of correlation, namely the hypercontractivity ribbon and maximal correlation (and their derivatives), were known to have the tensorization property. In this paper, we provide a general framework to obtain a region with the tensorization property from any additive rate region. We observe that hypercontractivity ribbon indeed comes from the dual of the rate region of the Gray-Wyner source coding problem, and generalize it to the multipartite case. Then we define other measures of correlation with similar properties from other source coding problems. We also present some applications of our results.

Connected through hyperedge HE-1 (induced by source paper "communication for generating correlation a unifying survey"):
  with members:
    - "secret key capacity for multipleaccess channel with public feedback"
    - "exact exponent for soft covering"
    - "exact channel synthesis"
    - "strong converse using change of measure arguments"
    - "coding for positive rate in the source model key agreement problem"
    - "wiretap channels nonasymptotic fundamental limits"
    - "channel resolvability theorems for general sources and channels"
    - "strong functional representation lemma and applications to coding theorems"

Connected through hyperedge HE-2 (induced by source paper "communication for generating correlation a survey"):
  with members:
    - "secret key capacity for multipleaccess channel with public feedback"
    - "exact soft covering exponent"
    - "on exact and infty r enyi common informations"
    - "exact channel synthesis"
    - "strong converse using change of measure arguments"
    - "coding for positive rate in the source model key agreement problem"
    - "wiretap channels nonasymptotic fundamental limits"
    - "channel resolvability theorems for general sources and channels"

Connected through hyperedge HE-3 (induced by source paper "principal inertia components and applications"):
  with members:
    - "brascamp lieb inequality and its reverse an information theoretic view"
    - "the most informative boolean function conjecture holds for high noise"
    - "bounds between contraction coefficients"
    - "managing your private and public data bringing down inference attacks against your privacy"
    - "remarks on the most informative function conjecture at fixed mean"
    - "euclidean information theory of networks"
    - "notes on information theoretic privacy"
    - "an improved upper bound for the most informative boolean function conjecture"

Connected through hyperedge HE-4 (induced by source paper "dimension reduction for polynomials over gaussian space and applications"):
  with members:
    - "information complexity is computable"

Connected through hyperedge HE-5 (induced by source paper "decidability of non interactive simulation of joint distributions"):
  with members:
    - "on the role of shared randomness in simultaneous communication"
    - "information complexity is computable"
    - "on non interactive simulation of joint distributions"
    - "communication complexity of permutation invariant functions"
    - "communication with imperfectly shared randomness"
    - "information equals amortized communication"
    - "reductions between expansion problems"
    - "a regularity lemma and low weight approximators for low degree polynomial threshold functions"

Connected through hyperedge HE-6 (induced by source paper "privacy aware mmse estimation"):
  with members:
    - "on maximal correlation mutual information and data privacy"
    - "notes on information theoretic privacy"
    - "information extraction under privacy constraints"
    - "key capacity for product sources with application to stationary gaussian processes"
    - "from the information bottleneck to the privacy funnel"
    - "utility privacy tradeoffs in databases an information theoretic approach"
    - "bounds on inference"
    - "discriminatory lossy source coding side information privacy"

Connected through hyperedge HE-7 (induced by source paper "multipartite monotones for secure sampling by public discussion from noisy correlations"):
  with members:
    - "assisted common information with an application to secure two party sampling"
    - "a new upperbound for the oblivious transfer capacity of discrete memoryless channels"
    - "on the efficiency of classical and quantum secure function evaluation"
    - "the common information of n dependent random variables"

Connected through hyperedge HE-8 (induced by source paper "zero error coordination"):
  with members:
    - "exact common information"
    - "renyi divergence and kullback leibler divergence"
    - "lov asz s theta function r enyi s divergence and the sphere packing bound"
    - "channel simulation via interactive communications"

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.IT(Information Theory)