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 in cyclic groups and an application to polar codes"):
  Abstract: In this note, the following basic question is explored: in a cyclic group, how are the Shannon entropies of the sum and difference of i.i.d. random variables related to each other? For the integer group, we show that they can differ by any real number additively, but not too much multiplicatively; on the other hand, for $\mathbb{Z}/3\mathbb{Z}$, the entropy of the difference is always at least as large as that of the sum. These results are closely related to the study of more-sum-than-difference (i.e. MSTD) sets in additive combinatorics. We also 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 "degrees of freedom in vector interference channels":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "necessary conditions for k 2 degrees of freedom")
  Member "entropy bounds on abelian groups and the ruzsa divergence":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "countably infinite multilevel source polarization for non stationary erasure distributions")
  Member "unified scaling of polar codes error exponent scaling exponent moderate deviations and error floors":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "on the polarizing behavior and scaling exponent of polar codes with product kernels")
  Member "finite length scaling for polar codes":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "reed muller codes theory and algorithms")
  Member "sumset and inverse sumset inequalities for differential entropy and mutual information":
    also connected through other hyperedges:
      - Hyperedge HE-5 (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-6 (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-7 (induced by source paper "countably infinite multilevel source polarization for non stationary erasure distributions")
  Member "polar codes for q ary channels q 2 r":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "polar codes simplicity random codes durability")

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)