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 "entropy bounds on abelian groups and the ruzsa divergence"):
  Abstract: Over the past few years, a family of interesting new inequalities for the entropies of sums and differences of random variables has been developed by Ruzsa, Tao and others, motivated by analogous results in additive combinatorics. The present work extends these earlier results to the case of random variables taking values in $\mathbb{R}^n$ or, more generally, in arbitrary locally compact and Polish abelian groups. We isolate and study a key quantity, the Ruzsa divergence between two probability distributions, and we show that its properties can be used to extend the earlier inequalities to the present general setting. The new results established include several variations on the theme that the entropies of the sum and the difference of two independent random variables severely constrain each other. Although the setting is quite general, the result are already of interest (and new) for random vectors in $\mathbb{R}^n$. In that special case, quantitative bounds are provided for the stability of the equality conditions in the entropy power inequality; a reverse entropy power inequality for log-concave random vectors is proved; an information-theoretic analog of the Rogers-Shephard inequality for convex bodies is established; and it is observed that some of these results lead to new inequalities for the determinants of positive-definite matrices. Moreover, by considering the multiplicative subgroups of the complex plane, one obtains new inequalities for the differential entropies of products and ratios of nonzero, complex-valued random variables.

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 "degrees of freedom in vector interference channels":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "necessary conditions for k 2 degrees of freedom")
  Member "characterizing degrees of freedom through additive combinatorics":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "necessary conditions for k 2 degrees of freedom")
  Member "entropies of weighted sums in cyclic groups and an application to polar codes":
    also connected through other hyperedges:
      - Hyperedge HE-4 (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-5 (induced by source paper "two remarks on generalized entropy power inequalities")
  Member "sumset and inverse sumset inequalities for differential entropy and mutual information":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "countably infinite multilevel source polarization for non stationary erasure distributions")
  Member "a new entropy power inequality for integer valued random variables":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "an entropy power inequality for discrete random variables")
  Member "entropy and set cardinality inequalities for partition determined functions":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "countably infinite multilevel source polarization for non stationary erasure distributions")

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)