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: "monotonicity thinning and discrete versions of the entropy power inequality"
  Abstract: We consider the entropy of sums of independent discrete random variables, in analogy with Shannon's Entropy Power Inequality, where equality holds for normals. In our case, infinite divisibility suggests that equality should hold for Poisson variables. We show that some natural analogues of the EPI do not in fact hold, but propose an alternative formulation which does always hold. The key to many proofs of Shannon's EPI is the behavior of entropy on scaling of continuous random variables. We believe that Renyi's operation of thinning discrete random variables plays a similar role to scaling, and give a sharp bound on how the entropy of ultra log-concave random variables behaves on thinning. In the spirit of the monotonicity results established by Artstein, Ball, Barthe, and Naor, we prove a stronger version of concavity of entropy, which implies a strengthened form of our discrete EPI.

Connected through hyperedge HE-1 (induced by source paper "an entropy power inequality for discrete random variables"):
  with members:
    - "a new entropy power inequality for integer valued random variables"
    - "entropy power inequality for a family of discrete random variables"

Connected through hyperedge HE-2 (induced by source paper "a de bruijn identity for discrete random variables"):
  with members:
    - "thinning photonic beamsplitting and a general discrete entropy power inequality"
    - "thinning entropy and the law of thin numbers"
    - "generalized entropy power inequalities and monotonicity properties of information"

Connected through hyperedge HE-3 (induced by source paper "on renyi entropy power inequalities"):
  with members:
    - "forward and reverse entropy power inequalities in convex geometry"
    - "strengthening 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"
    - "renyi divergence and kullback leibler divergence"
    - "the concavity of renyi entropy power"
    - "a new entropy power inequality for integer valued random variables"

Connected through hyperedge HE-4 (induced by source paper "thinning photonic beamsplitting and a general discrete entropy power inequality"):
  with members:
    - "a new entropy power inequality for integer valued random variables"
    - "concavity of entropy under thinning"
    - "monotonic convergence in an information theoretic law of small numbers"
    - "generalized entropy power inequalities and monotonicity properties of information"

Connected through hyperedge HE-5 (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"
    - "entropy and set cardinality inequalities for partition determined functions"
    - "polar codes for q ary channels q 2 r"

Connected through hyperedge HE-6 (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"
    - "entropy and set cardinality inequalities for partition determined functions"

Connected through hyperedge HE-7 (induced by source paper "capacity bounds for diamond networks with an orthogonal broadcast channel"):
  with members:
    - "generalization of mrs gerber s lemma"
    - "capacity bounds for a class of diamond networks"
    - "a new entropy power inequality for integer valued random variables"
    - "achieving the capacity of the n relay gaussian diamond network within log n bits"
    - "the gaussian multiple access diamond channel"
    - "wireless network information flow a deterministic approach"
    - "the approximate capacity of the gaussian n relay diamond network"
    - "entropy power inequality for a family of discrete random variables"

Connected through hyperedge HE-8 (induced by source paper "a new entropy power inequality for integer valued random variables"):
  with members:
    - "sumset and inverse sumset inequalities for differential entropy and mutual information"
    - "the entropy power inequality and mrs gerber s lemma for abelian groups of order 2 n"
    - "adaptive sensing using deterministic partial hadamard matrices"
    - "information theoretic proofs of entropy power inequalities"
    - "entropy power inequality for a family of discrete random variables"
    - "generalized entropy power inequalities and monotonicity properties of information"
    - "an extremal inequality motivated by multiterminal information theoretic problems"

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)