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 "a new entropy power inequality for integer valued random variables"):
  Abstract: The entropy power inequality (EPI) provides lower bounds on the differential entropy of the sum of two independent real-valued random variables in terms of the individual entropies. Versions of the EPI for discrete random variables have been obtained for special families of distributions with the differential entropy replaced by the discrete entropy, but no universal inequality is known (beyond trivial ones). More recently, the sumset theory for the entropy function provides a sharp inequality $H(X+X')-H(X)\geq 1/2 -o(1)$ when $X,X'$ are i.i.d. with high entropy. This paper provides the inequality $H(X+X')-H(X) \geq g(H(X))$, where $X,X'$ are arbitrary i.i.d. integer-valued random variables and where $g$ is a universal strictly positive function on $\mR_+$ satisfying $g(0)=0$. Extensions to non identically distributed random variables and to conditional entropies are also obtained.

Includes members:
  Member "sumset and inverse sumset inequalities for differential entropy and mutual information":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "countably infinite multilevel source polarization for non stationary erasure distributions")
  Member "the entropy power inequality and mrs gerber s lemma for abelian groups of order 2 n":
    also connected through other hyperedges:
      (none)
  Member "adaptive sensing using deterministic partial hadamard matrices":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a structured construction of optimal measurement matrix for noiseless compressed sensing via analog polarization")
  Member "information theoretic proofs of entropy power inequalities":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "vector gaussian successive refinement with degraded side information")
  Member "entropy power inequality for a family of discrete random variables":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "an entropy power inequality for discrete random variables")
  Member "monotonicity thinning and discrete versions of the entropy power inequality":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "an entropy power inequality for discrete random variables")
  Member "generalized entropy power inequalities and monotonicity properties of information":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "two remarks on generalized entropy power inequalities")
  Member "an extremal inequality motivated by multiterminal information theoretic problems":
    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)