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: "information theoretic proofs of entropy power inequalities"
  Abstract: While most useful information theoretic inequalities can be deduced from the basic properties of entropy or mutual information, up to now Shannon's entropy power inequality (EPI) is an exception: Existing information theoretic proofs of the EPI hinge on representations of differential entropy using either Fisher information or minimum mean-square error (MMSE), which are derived from de Bruijn's identity. In this paper, we first present an unified view of these proofs, showing that they share two essential ingredients: 1) a data processing argument applied to a covariance-preserving linear transformation; 2) an integration over a path of a continuous Gaussian perturbation. Using these ingredients, we develop a new and brief proof of the EPI through a mutual information inequality, which replaces Stam and Blachman's Fisher information inequality (FII) and an inequality for MMSE by Guo, Shamai, and Verdu used in earlier proofs. The result has the advantage of being very simple in that it relies only on the basic properties of mutual information. These ideas are then generalized to various extended versions of the EPI: Zamir and Feder's generalized EPI for linear transformations of the random variables, Takano and Johnson's EPI for dependent variables, Liu and Viswanath's covariance-constrained EPI, and Costa's concavity inequality for the entropy power.

Connected through hyperedge HE-1 (induced by source paper "vector gaussian successive refinement with degraded side information"):
  with members:
    - "the sum rate of vector gaussian multiple description coding with tree structured covariance distortion constraints"
    - "vector gaussian rate distortion with variable side information"
    - "broadcasting correlated vector gaussians"
    - "new results on multiple input multiple output broadcast channels with confidential messages"
    - "private broadcasting over independent parallel channels"
    - "secure lossy transmission of vector gaussian sources"
    - "capacity equivocation region of the gaussian mimo wiretap channel"
    - "capacity region of gaussian mimo broadcast channels with common and confidential messages"

Connected through hyperedge HE-2 (induced by source paper "sensitivity analysis for binary sampling systems via quantitative fisher information lower bounds"):
  with members:
    - "a pessimistic approximation for the fisher information measure"
    - "measurement driven quality assessment of nonlinear systems by exponential replacement"
    - "doa parameter estimation with 1 bit quantization bounds methods and the exponential replacement"
    - "a lower bound for the fisher information measure"
    - "gaussian assumption the least favorable but the most useful lecture notes"
    - "a general framework for transmission with transceiver distortion and some applications"
    - "multiple parameter estimation with quantized channel output"

Connected through hyperedge HE-3 (induced by source paper "transportation proofs of r enyi entropy power inequalities"):
  with members:
    - "forward and reverse entropy power inequalities in convex geometry"
    - "optimal transportation to the entropy power inequality"
    - "on renyi entropy power inequalities"
    - "two measures of dependence"
    - "yet another proof of the entropy power inequality"
    - "variants of the entropy power inequality"
    - "renyi divergence and kullback leibler divergence"
    - "the concavity of renyi entropy power"

Connected through hyperedge HE-4 (induced by source paper "unifying the brascamp lieb inequality and the entropy power inequality"):
  with members:
    - "strong data processing inequalities for channels and bayesian networks"
    - "yet another proof of the entropy power inequality"
    - "wasserstein continuity of entropy and outer bounds for interference channels"
    - "superposition coding is almost always optimal for the poisson broadcast channel"
    - "an extremal inequality for long markov chains"

Connected through hyperedge HE-5 (induced by source paper "equality in the matrix entropy power inequality and blind separation of real and complex sources"):
  with members:
    - "optimal transportation to the entropy power inequality"
    - "yet another proof of the entropy power inequality"
    - "complex random vectors and ica models identifiability uniqueness and separability"

Connected through hyperedge HE-6 (induced by source paper "remarks on the r e nyi entropy of a sum of iid random variables"):
  with members:
    - "forward and reverse entropy power inequalities in convex geometry"
    - "on renyi entropy power inequalities"
    - "beyond the entropy power inequality via rearrangements"

Connected through hyperedge HE-7 (induced by source paper "hardware limited task based quantization"):
  with members:
    - "analog to digital compression a new paradigm for converting signals to bits"
    - "performance analysis for channel estimation with 1 bit adc and unknown quantization threshold"
    - "channel estimation and performance analysis of one bit massive mimo systems"
    - "resolution adaptive hybrid mimo architectures for millimeter wave communications"
    - "hybrid analog digital beamforming for massive mimo systems"
    - "narrowband channel estimation for hybrid beamforming millimeter wave communication systems with one bit quantization"
    - "hybrid architectures with few bit adc receivers achievable rates and energy rate tradeoffs"
    - "fundamental distortion limits of analog to digital compression"

Connected through hyperedge HE-8 (induced by source paper "wireless energy beamforming using received signal strength indicator feedback"):
  with members:
    - "a general design framework for mimo wireless energy transfer with limited feedback"
    - "wireless powered communication opportunities and challenges"
    - "throughput optimization for massive mimo systems powered by wireless energy transfer"
    - "enhancing wireless information and power transfer by exploiting multi antenna techniques"
    - "multiuser mimo wireless energy transfer with coexisting opportunistic communication"
    - "optimized training for net energy maximization in multi antenna wireless energy transfer over frequency selective channel"
    - "energy beamforming with one bit feedback"
    - "optimized training design for wireless energy transfer"

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)