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 "optimal transportation to the entropy power inequality"):
  Abstract: We present a simple proof of the entropy-power inequality using an optimal transportation argument which takes the form of a simple change of variables. The same argument yields a reverse inequality involving a conditional differential entropy which has its own interest. It can also be generalized in various ways. The equality case is easily captured by this method and the proof is formally identical in one and several dimensions.

Includes members:
  Member "at every corner determining corner points of two user gaussian interference channels":
    also connected through other hyperedges:
      (none)
  Member "links between the logarithmic sobolev inequality and the convolution inequalities for entropy and fisher information":
    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 "yet another proof of 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 "wasserstein continuity of entropy and outer bounds for interference channels":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "a lower bound on the expected distortion of joint source channel coding")
  Member "beyond the entropy power inequality via rearrangements":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "two remarks on generalized entropy power inequalities")
  Member "information theoretic proofs of entropy power inequalities":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "vector gaussian successive refinement with degraded side information")
  Member "a simple proof of the entropy power inequality via properties of mutual information":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "yet another proof of the entropy power inequality")
  Member "generalized entropy power inequalities and monotonicity properties of information":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "two remarks on generalized entropy power inequalities")

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)