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 "r enyi entropy power inequalities via normal transport and rotation"):
  Abstract: Following a recent proof of Shannon's entropy power inequality (EPI), a comprehensive framework for deriving various EPIs for the R\'enyi entropy is presented that uses transport arguments from normal densities and a change of variable by rotation. Simple arguments are given to recover the previously known R\'enyi EPIs and derive new ones, by unifying a multiplicative form with constant c and a modification with exponent {\alpha} of previous works. In particular, for log-concave densities, we obtain a simple transportation proof of a sharp varentropy bound.

Includes members:
  Member "forward and reverse entropy power inequalities in convex geometry":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "transportation proofs of r enyi entropy power inequalities")
  Member "optimal transportation to the entropy power inequality":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "transportation proofs of r enyi entropy power inequalities")
  Member "on renyi entropy power inequalities":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "the renyi capacity and center")
  Member "yet another proof 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 "variants of the entropy power inequality":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "transportation proofs of r enyi entropy power inequalities")
  Member "the concavity of renyi entropy power":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "transportation proofs of r enyi entropy power inequalities")
  Member "information theoretic proofs of entropy power inequalities":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "vector gaussian successive refinement with degraded side information")

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)