human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "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.

Connected through hyperedge HE-1 (induced by source paper "countably infinite multilevel source polarization for non stationary erasure distributions"):
  with members:
    - "asymptotic distribution of multilevel channel polarization for a certain class of erasure channels"
    - "on the polarization levels of automorphic symmetric channels"
    - "general strong polarization"
    - "fano type inequalities based on general conditional information measures over countably infinite alphabets with list decoding"
    - "modular arithmetic erasure channels and their multilevel channel polarization"
    - "fourier analysis of mac polarization"
    - "a generalized erasure channel in the sense of polarization for binary erasure channels"
    - "polar coding for non stationary channels"

Connected through hyperedge HE-2 (induced by source paper "modular arithmetic erasure channels and their multilevel channel polarization"):
  with members:
    - "fourier analysis of mac polarization"
    - "a generalized erasure channel in the sense of polarization for binary erasure channels"
    - "construction of polar codes for arbitrary discrete memoryless channels"
    - "polar codes for the two user multiple access channel"
    - "polar codes for q ary channels q 2 r"
    - "how to construct polar codes"
    - "channel polarization a method for constructing capacity achieving codes for symmetric binary input memoryless channels"
    - "polarization for arbitrary discrete memoryless channels"

Connected through hyperedge HE-3 (induced by source paper "forward and reverse entropy power inequalities in convex geometry"):
  with members:
    - "wasserstein stability of the entropy power inequality for log concave densities"
    - "on renyi entropy power inequalities"
    - "strengthening the entropy power inequality"
    - "variants of the entropy power inequality"
    - "entropy bounds on abelian groups and the ruzsa divergence"
    - "beyond the entropy power inequality via rearrangements"
    - "a strengthened entropy power inequality for log concave densities"
    - "the concavity of renyi entropy power"

Connected through hyperedge HE-4 (induced by source paper "entropy bounds on abelian groups and the ruzsa divergence"):
  with members:
    - "forward and reverse entropy power inequalities in convex geometry"
    - "degrees of freedom in vector interference channels"
    - "characterizing degrees of freedom through additive combinatorics"
    - "beyond the entropy power inequality via rearrangements"
    - "sumset and inverse sumset inequalities for differential entropy and mutual information"
    - "a new entropy power inequality for integer valued random variables"
    - "entropy and set cardinality inequalities for partition determined functions"
    - "monotonicity thinning and discrete versions of the entropy power inequality"

Question: Please tell me which class the center node 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)