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: "strengthening the entropy power inequality"
  Abstract: We tighten the Entropy Power Inequality (EPI) when one of the random summands is Gaussian. Our strengthening is closely connected to the concept of strong data processing for Gaussian channels and generalizes the (vector extension of) Costa's EPI. This leads to a new reverse entropy power inequality and, as a corollary, sharpens Stam's inequality relating entropy power and Fisher information. Applications to network information theory are given, including a short self-contained proof of the rate region for the two-encoder quadratic Gaussian source coding problem. #R##N#Our argument is based on weak convergence and a technique employed by Geng and Nair for establishing Gaussian optimality via rotational-invariance, which traces its roots to a `doubling trick' that has been successfully used in the study of functional inequalities.

Connected through hyperedge HE-1 (induced by source paper "an entropy inequality for symmetric random variables"):
  with members:
    - "a counterexample to the vector generalization of costa s epi and partial resolution"
    - "entropy jumps for radially symmetric random vectors"
    - "monotonicity of entropy and fisher information a quick proof via maximal correlation"
    - "beyond the entropy power inequality via rearrangements"
    - "information theoretic proofs of entropy power inequalities"
    - "information inequalities for joint distributions with interpretations and applications"
    - "generalized entropy power inequalities and monotonicity properties of information"

Connected through hyperedge HE-2 (induced by source paper "sum rate capacity for symmetric gaussian multiple access channels with feedback"):
  with members:
    - "posterior matching scheme for gaussian multiple access channel with feedback"
    - "dependence balance based outer bounds for gaussian networks with cooperation and feedback"
    - "variations on a theme by schalkwijk and kailath"
    - "outer bounds for multiple access channels with feedback using dependence balance"
    - "optimal feedback communication via posterior matching"
    - "on the gaussian mac with imperfect feedback"

Connected through hyperedge HE-3 (induced by source paper "information theoretic perspectives on brascamp lieb inequality and its reverse"):
  with members:
    - "arimoto r enyi conditional entropy and bayesian m ary hypothesis testing"
    - "algorithmic and optimization aspects of brascamp lieb inequalities via operator scaling"
    - "brascamp lieb inequality and its reverse an information theoretic view"
    - "converses for distributed estimation via strong data processing inequalities"
    - "secret key generation with one communicator and a one shot converse via hypercontractivity"
    - "on non interactive simulation of joint distributions"
    - "a note on the strong data processing inequalities in bayesian networks"
    - "communication lower bounds for statistical estimation problems via a distributed data processing inequality"

Connected through hyperedge HE-4 (induced by source paper "forward and reverse entropy power inequalities in convex geometry"):
  with members:
    - "wasserstein stability of the entropy power inequality for log concave densities"
    - "on renyi entropy power inequalities"
    - "variants of the entropy power inequality"
    - "entropy bounds on abelian groups and the ruzsa divergence"
    - "entropies of weighted sums in cyclic groups and an application to polar codes"
    - "beyond the entropy power inequality via rearrangements"
    - "a strengthened entropy power inequality for log concave densities"
    - "the concavity of renyi entropy power"

Connected through hyperedge HE-5 (induced by source paper "on renyi entropy power inequalities"):
  with members:
    - "forward and reverse entropy power inequalities in convex geometry"
    - "entropy bounds on abelian groups and the ruzsa divergence"
    - "beyond the entropy power inequality via rearrangements"
    - "a strengthened entropy power inequality for log concave densities"
    - "renyi divergence and kullback leibler divergence"
    - "the concavity of renyi entropy power"
    - "a new entropy power inequality for integer valued random variables"
    - "information theoretic proofs of entropy power inequalities"

Connected through hyperedge HE-6 (induced by source paper "variants of the entropy power inequality"):
  with members:
    - "forward and reverse entropy power inequalities in convex geometry"
    - "on the entropy power inequality for the r enyi entropy of order 0 1"
    - "on renyi entropy power inequalities"
    - "beyond the entropy power inequality via rearrangements"
    - "the concavity of renyi entropy power"
    - "an information theoretic proof of nash s inequality"
    - "information theoretic proofs of entropy power inequalities"
    - "generalized entropy power inequalities and monotonicity properties of information"

Connected through hyperedge HE-7 (induced by source paper "information measures inequalities and performance bounds for parameter estimation in impulsive noise environments"):
  with members:
    - "on properties of the support of capacity achieving distributions for additive noise channel models with input cost constraints"
    - "links between the logarithmic sobolev inequality and the convolution inequalities for entropy and fisher information"
    - "stable distributions as noise models for molecular communication"
    - "sumset and inverse sumset inequalities for differential entropy and mutual information"
    - "a de bruijn identity for symmetric stable laws"
    - "information theoretic proofs of entropy power inequalities"

Connected through hyperedge HE-8 (induced by source paper "wasserstein stability of the entropy power inequality for log concave densities"):
  with members:
    - "entropy jumps for radially symmetric random vectors"
    - "links between the logarithmic sobolev inequality and the convolution inequalities for entropy and fisher information"
    - "yet another proof of the entropy power inequality"
    - "a strengthened entropy power inequality for log concave densities"

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)