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 "entropies of weighted sums and applications to polar codes"):
  Abstract: In this note, we give some specific examples of i.i.d. random variables $X, Y$ taking values in $\mZ/n\mZ$ such that the entropy of their sum is larger than the entropy of their difference; however, we also show that this cannot happen for $n=3$. Furthermore, we show that there exist i.i.d. $\mZ$-valued random variables $X, Y$ with finite entropy such that $H(X+Y)$ can exceed $H(X-Y)$ by an arbitrarily large amount, complementing a result of Lapidoth and Pete (2008); this statement is also true for differential entropies of real-valued random variables. These results are closely related to the study of MSTD (more sums than differences) sets in additive number theory. Finally we investigate polar codes for $q$-ary input channels using non-canonical kernels to construct the generator matrix, and present applications of our results to constructing polar codes with significantly improved error probability compared to the canonical construction.

Includes members:
  Member "entropy bounds on abelian groups and the ruzsa divergence":
    also connected through other hyperedges:
      - Hyperedge HE-1 (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-2 (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-3 (induced by source paper "countably infinite multilevel source polarization for non stationary erasure distributions")
  Member "non binary polar codes using reed solomon codes and algebraic geometry codes":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "polar codes and their quantum domain counterparts")
  Member "channel polarization a method for constructing capacity achieving codes for symmetric binary input memoryless channels":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "reed muller codes theory and algorithms")
  Member "information inequalities for joint distributions with interpretations and applications":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "dual loomis whitney inequalities via information theory")
  Member "on the rate of channel polarization":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "polar codes and their quantum domain counterparts")

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)