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: "entropy and set cardinality inequalities for partition determined functions"
  Abstract: A new notion of partition-determined functions is introduced, and several basic inequalities are developed for the entropies of such functions of independent random variables, as well as for cardinalities of compound sets obtained using these functions. Here a compound set means a set obtained by varying each argument of a function of several variables over a set associated with that argument, where all the sets are subsets of an appropriate algebraic structure so that the function is well defined. On the one hand, the entropy inequalities developed for partition-determined functions imply entropic analogues of general inequalities of Plunnecke-Ruzsa type. On the other hand, the cardinality inequalities developed for compound sets imply several inequalities for sumsets, including for instance a generalization of inequalities proved by Gyarmati, Matolcsi and Ruzsa (2010). We also provide partial progress towards a conjecture of Ruzsa (2007) for sumsets in nonabelian groups. All proofs are elementary and rely on properly developing certain information-theoretic inequalities. © 2011 Wiley Periodicals, Inc. Random Struct. Alg., 40, 399–424, 2012 © 2012 Wiley Periodicals, Inc.

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 "cryptanalysis of a chaotic image encryption algorithm based on information entropy"):
  with members:
    - "cryptanalyzing an image scrambling encryption algorithm of pixel bits"
    - "on the cryptanalysis of fridrich s chaotic image encryption scheme"
    - "cryptanalyzing an image encryption algorithm based on autoblocking and electrocardiography"
    - "cracking a hierarchical chaotic image encryption algorithm based on permutation"
    - "cryptanalyzing image encryption using chaotic logistic map"
    - "dynamic analysis of chaotic maps as complex networks in the digital domain"
    - "network analysis of the state space of chaotic map in digital domain"

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"
    - "entropies of weighted sums in cyclic groups and an application to polar codes"
    - "beyond the entropy power inequality via rearrangements"
    - "a strengthened entropy power inequality for log concave densities"

Connected through hyperedge HE-4 (induced by source paper "equivalence of additive combinatorial linear inequalities for shannon entropy and differential entropy"):
  with members:
    - "on additive combinatorial affine inequalities for shannon entropy and differential entropy"
    - "entropy bounds on abelian groups and the ruzsa divergence"
    - "dissipation of information in channels with input constraints"
    - "sumset and inverse sumset inequalities for differential entropy and mutual information"

Connected through hyperedge HE-5 (induced by source paper "on additive combinatorial affine inequalities for shannon entropy and differential entropy"):
  with members:
    - "entropy bounds on abelian groups and the ruzsa divergence"
    - "dissipation of information in channels with input constraints"
    - "sumset and inverse sumset inequalities for differential entropy and mutual information"

Connected through hyperedge HE-6 (induced by source paper "entropies of weighted sums in cyclic groups and an application to polar codes"):
  with members:
    - "degrees of freedom in vector interference channels"
    - "entropy bounds on abelian groups and the ruzsa divergence"
    - "unified scaling of polar codes error exponent scaling exponent moderate deviations and error floors"
    - "finite length scaling for polar codes"
    - "sumset and inverse sumset inequalities for differential entropy and mutual information"
    - "a new entropy power inequality for integer valued random variables"
    - "polar codes for q ary channels q 2 r"
    - "monotonicity thinning and discrete versions of the entropy power inequality"

Connected through hyperedge HE-7 (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"
    - "entropies of weighted sums in cyclic groups and an application to polar codes"
    - "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"
    - "monotonicity thinning and discrete versions of the entropy power inequality"

Connected through hyperedge HE-8 (induced by source paper "entropies of weighted sums and applications to polar codes"):
  with members:
    - "entropy bounds on abelian groups and the ruzsa divergence"
    - "a new entropy power inequality for integer valued random variables"
    - "non binary polar codes using reed solomon codes and algebraic geometry codes"
    - "channel polarization a method for constructing capacity achieving codes for symmetric binary input memoryless channels"
    - "information inequalities for joint distributions with interpretations and applications"
    - "on the rate of channel polarization"

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)