human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "tight bounds on the r enyi entropy via majorization with applications to guessing and compression"):
  Abstract: This paper provides tight bounds on the Renyi entropy of a function of a discrete random variable with a finite number of possible values, where the considered function is not one-to-one. To that end, a tight lower bound on the Renyi entropy of a discrete random variable with a finite support is derived as a function of the size of the support, and the ratio of the maximal to minimal probability masses. This work was inspired by the recently published paper by Cicalese et al., which is focused on the Shannon entropy, and it strengthens and generalizes the results of that paper to Renyi entropies of arbitrary positive orders. In view of these generalized bounds and the works by Arikan and Campbell, non-asymptotic bounds are derived for guessing moments and lossless data compression of discrete memoryless sources.

Includes members:
  Member "on the conditional smooth renyi entropy and its applications in guessing and source coding":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "asymptotic expansions of smooth r e nyi entropies and their applications")
  Member "maximum entropy interval aggregations":
    also connected through other hyperedges:
      (none)
  Member "distributed task encoding":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "improved bounds on lossless source coding and guessing moments via r e nyi measures")
  Member "reducing guesswork via an unreliable oracle":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "improved bounds on lossless source coding and guessing moments via r e nyi measures")
  Member "guessing attacks on distributed storage systems":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "improved bounds on lossless source coding and guessing moments via r e nyi measures")
  Member "bounds on the entropy of a function of a random variable and their applications":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "on data processing and majorization inequalities for f divergences with applications")
  Member "on the renyi divergence joint range of relative entropies and a channel coding theorem":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "the renyi capacity and center")
  Member "on the smooth renyi entropy and variable length source coding allowing errors":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "asymptotic expansions of smooth r e nyi entropies and their applications")

Question: Please tell me which class the source paper 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)