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: "an information theoretic proof of nash s inequality"
  Abstract: We show that an information-theoretic property of Shannon's entropy power, known as concavity of entropy power, can be fruitfully employed to prove inequalities in sharp form. In particular, the concavity of entropy power implies the logarithmic Sobolev inequality, and Nash's inequality with the sharp constant.

Connected through hyperedge HE-1 (induced by source paper "variants of the entropy power inequality"):
  with members:
    - "forward and reverse entropy power inequalities in convex geometry"
    - "on the entropy power inequality for the r enyi entropy of order 0 1"
    - "on renyi entropy power inequalities"
    - "strengthening the entropy power inequality"
    - "beyond the entropy power inequality via rearrangements"
    - "the concavity of renyi entropy power"
    - "information theoretic proofs of entropy power inequalities"
    - "generalized entropy power inequalities and monotonicity properties of information"

Connected through hyperedge HE-2 (induced by source paper "a concavity property for the reciprocal of fisher information and its consequences on costa s epi"):
  with members:
    - "a strengthened entropy power inequality for log concave densities"
    - "higher order derivatives in costa s entropy power inequality"
    - "the concavity of renyi entropy power"
    - "information theoretic proofs of entropy power inequalities"
    - "mutual information and minimum mean square error in gaussian channels"

Connected through hyperedge HE-3 (induced by source paper "a strengthened entropy power inequality for log concave densities"):
  with members:
    - "beyond the entropy power inequality via rearrangements"
    - "the concavity of renyi entropy power"
    - "a simple proof of the entropy power inequality via properties of mutual information"
    - "generalized entropy power inequalities and monotonicity properties of information"
    - "mutual information and minimum mean square error in gaussian channels"

Connected through hyperedge HE-4 (induced by source paper "beyond the entropy power inequality via rearrangements"):
  with members:
    - "renyi divergence and kullback leibler divergence"
    - "the concavity of renyi entropy power"
    - "the entropy per coordinate of a random vector is highly constrained under convexity conditions"
    - "paging and registration in cellular networks jointly optimal policies and an iterative algorithm"

Connected through hyperedge HE-5 (induced by source paper "the concavity of renyi entropy power"):
  with members:
    - "information theoretic proofs of entropy power inequalities"

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)