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: "generalized entropy power inequalities and monotonicity properties of information"
  Abstract: New families of Fisher information and entropy power inequalities for sums of independent random variables are presented. These inequalities relate the information in the sum of $n$ independent random variables to the information contained in sums over subsets of the random variables, for an arbitrary collection of subsets. As a consequence, a simple proof of the monotonicity of information in central limit theorems is obtained, both in the setting of i.i.d. summands as well as in the more general setting of independent summands with variance-standardized sums.

Connected through hyperedge HE-1 (induced by source paper "two remarks on generalized entropy power inequalities"):
  with members:
    - "an entropy inequality for symmetric random variables"
    - "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"
    - "sumset and inverse sumset inequalities for differential entropy and mutual information"

Connected through hyperedge HE-2 (induced by source paper "dual loomis whitney inequalities via information theory"):
  with members:
    - "intrinsic entropies of log concave distributions"
    - "f divergence inequalities"
    - "the entropy per coordinate of a random vector is highly constrained under convexity conditions"
    - "information inequalities for joint distributions with interpretations and applications"

Connected through hyperedge HE-3 (induced by source paper "maximal correlation and the rate of fisher information convergence in the central limit theorem"):
  with members:
    - "monotonicity of entropy and fisher information a quick proof via maximal correlation"
    - "on maximal correlation hypercontractivity and the data processing inequality studied by erkip and cover"

Connected through hyperedge HE-4 (induced by source paper "convexity of mutual information along the ornstein uhlenbeck flow"):
  with members:
    - "convexity of mutual information along the heat flow"
    - "information and estimation in fokker planck channels"
    - "a concavity property for the reciprocal of fisher information and its consequences on costa s epi"
    - "higher order derivatives in costa s entropy power inequality"
    - "information theoretic proofs of entropy power inequalities"
    - "estimation in gaussian noise properties of the minimum mean square error"
    - "mutual information and minimum mean square error in gaussian channels"

Connected through hyperedge HE-5 (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"
    - "strengthening the entropy power inequality"
    - "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"

Connected through hyperedge HE-6 (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"
    - "strengthening the entropy power inequality"
    - "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"

Connected through hyperedge HE-7 (induced by source paper "on the entropy power inequality for the r enyi entropy of order 0 1"):
  with members:
    - "a lower bound on the differential entropy of log concave random vectors with applications"
    - "forward and reverse entropy power inequalities in convex geometry"
    - "wasserstein stability of the entropy power inequality for log concave densities"
    - "on renyi entropy power inequalities"
    - "variants of the entropy power inequality"
    - "a concavity property for the reciprocal of fisher information and its consequences on costa s epi"
    - "a strengthened entropy power inequality for log concave densities"
    - "the entropy per coordinate of a random vector is highly constrained under convexity conditions"

Connected through hyperedge HE-8 (induced by source paper "optimal transportation to the entropy power inequality"):
  with members:
    - "at every corner determining corner points of two user gaussian interference channels"
    - "links between the logarithmic sobolev inequality and the convolution inequalities for entropy and fisher information"
    - "yet another proof of the entropy power inequality"
    - "wasserstein continuity of entropy and outer bounds for interference channels"
    - "beyond the entropy power inequality via rearrangements"
    - "information theoretic proofs of entropy power inequalities"
    - "a simple proof of the entropy power inequality via properties of mutual information"

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)