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 power inequality for weighted entropy"
  Abstract: We analyse an analog of the entropy-power inequality for the weighted entropy. In particular, we discuss connections with weighted Lieb‘s splitting inequality and an Gaussian additive noise formula. Examples and counterexamples are given, for some classes of probability distributions.

Connected through hyperedge HE-1 (induced by source paper "basic inequalities for weighted entropies"):
  with members:
    - "weighted gaussian entropy and determinant inequalities"

Connected through hyperedge HE-2 (induced by source paper "weighted gaussian entropy and determinant inequalities"):
  with members:
    - "an extension of the ky fan inequality"
    - "simple inequalities for weighted entropies"

Connected through hyperedge HE-3 (induced by source paper "asymptotic behaviour of weighted differential entropies in a bayesian problem"):
  with members:
    - "simple inequalities for weighted entropies"
    - "continuity of mutual entropy in the large signal to noise ratio limit"

Connected through hyperedge HE-4 (induced by source paper "results on the solutions of maximum weighted renyi entropy problems"):
  with members:
    - "extended inequalities for weighted renyi entropy involving generalized gaussian densities"
    - "an extension of the ky fan inequality"

Connected through hyperedge HE-5 (induced by source paper "extended inequalities for weighted renyi entropy involving generalized gaussian densities"):
  with members:
    - "an extension of the ky fan 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)