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: "the entropy per coordinate of a random vector is highly constrained under convexity conditions"
  Abstract: The entropy per coordinate in a log-concave random vector of any dimension with given density at the mode is shown to have a range of just 1. Uniform distributions on convex bodies are at the lower end of this range, the distribution with i.i.d. exponentially distributed coordinates is at the upper end, and the normal is exactly in the middle. Thus in terms of the amount of randomness as measured by entropy per coordinate, any log-concave random vector of any dimension contains randomness that differs from that in the normal random variable with the same maximal density value by at most 1/2. As applications, we obtain an information-theoretic formulation of the famous hyperplane conjecture in convex geometry, entropy bounds for certain infinitely divisible distributions, and quantitative estimates for the behavior of the density at the mode on convolution. More generally, one may consider so-called convex or hyperbolic probability measures on Euclidean spaces; we give new constraints on entropy per coordinate for this class of measures, which generalize our results under the log-concavity assumption, expose the extremal role of multivariate Pareto-type distributions, and give some applications.

Connected through hyperedge HE-1 (induced by source paper "constrained functional value under general convexity conditions with applications to distributed simulation"):
  with members:
    - "distributed simulation of continuous random variables"

Connected through hyperedge HE-2 (induced by source paper "dual loomis whitney inequalities via information theory"):
  with members:
    - "intrinsic entropies of log concave distributions"
    - "f divergence inequalities"
    - "information inequalities for joint distributions with interpretations and applications"
    - "generalized entropy power inequalities and monotonicity properties of information"

Connected through hyperedge HE-3 (induced by source paper "a lower bound on the differential entropy of log concave random vectors with applications"):
  with members:
    - "forward and reverse entropy power inequalities in convex geometry"
    - "wasserstein stability of the entropy power inequality for log concave densities"
    - "the shannon lower bound is asymptotically tight"
    - "links between the logarithmic sobolev inequality and the convolution inequalities for entropy and fisher information"
    - "a concavity property for the reciprocal of fisher information and its consequences on costa s epi"
    - "entropy bounds on abelian groups and the ruzsa divergence"
    - "data compression with low distortion and finite blocklength"
    - "a strengthened entropy power inequality for log concave densities"

Connected through hyperedge HE-4 (induced by source paper "sharp moment entropy inequalities and capacity bounds for log concave distributions"):
  with members:
    - "two remarks on generalized entropy power inequalities"
    - "bounds on variance for unimodal distributions"
    - "forward and reverse entropy power inequalities in convex geometry"
    - "on the entropy power inequality for the r enyi entropy of order 0 1"
    - "entropy bounds on abelian groups and the ruzsa divergence"
    - "minimization problems based on relative alpha entropy i forward projection"

Connected through hyperedge HE-5 (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-6 (induced by source paper "on the entropy power inequality for the r enyi entropy of order 0 1"):
  with members:
    - "a lower bound on the differential entropy of log concave random vectors with applications"
    - "forward and reverse entropy power inequalities in convex geometry"
    - "wasserstein stability of the entropy power inequality for log concave densities"
    - "on renyi entropy power inequalities"
    - "variants of the entropy power inequality"
    - "a concavity property for the reciprocal of fisher information and its consequences on costa s epi"
    - "a strengthened entropy power inequality for log concave densities"
    - "generalized entropy power inequalities and monotonicity properties of information"

Connected through hyperedge HE-7 (induced by source paper "bounds on variance for unimodal distributions"):
  with members:
    - "forward and reverse entropy power inequalities in convex geometry"
    - "bounds on variance for symmetric unimodal distributions"
    - "collaborative 20 questions for target localization"

Connected through hyperedge HE-8 (induced by source paper "distributed simulation of continuous random variables"):
  with members:
    - "gaussian secure source coding and wyner s common information"
    - "exact common information"
    - "distributed channel synthesis"
    - "the common information of n dependent random variables"

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)