human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "forward and reverse entropy power inequalities in convex geometry"):
  Abstract: The entropy power inequality, which plays a fundamental role in information theory and probability, may be seen as an analogue of the Brunn-Minkowski inequality. Motivated by this connection to Convex Geometry, we survey various recent developments on forward and reverse entropy power inequalities not just for the Shannon-Boltzmann entropy but also more generally for Renyi entropy. In the process, we discuss connections between the so-called functional (or integral) and probabilistic (or entropic) analogues of some classical inequalities in geometric functional analysis.

Includes members:
  Member "wasserstein stability of the entropy power inequality for log concave densities":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a lower bound on the differential entropy of log concave random vectors with applications")
  Member "on renyi entropy power inequalities":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "the renyi capacity and center")
  Member "strengthening the entropy power inequality":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "an entropy inequality for symmetric random variables")
  Member "variants of the entropy power inequality":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "transportation proofs of r enyi entropy power inequalities")
  Member "entropy bounds on abelian groups and the ruzsa divergence":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "countably infinite multilevel source polarization for non stationary erasure distributions")
  Member "entropies of weighted sums in cyclic groups and an application to polar codes":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "countably infinite multilevel source polarization for non stationary erasure distributions")
  Member "beyond the entropy power inequality via rearrangements":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "two remarks on generalized entropy power inequalities")
  Member "a strengthened entropy power inequality for log concave densities":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "a lower bound on the differential entropy of log concave random vectors with applications")

Question: Please tell me which class the source paper 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)