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 "improved bounds on lossless source coding and guessing moments via r e nyi measures"):
  Abstract: This paper provides upper and lower bounds on the optimal guessing moments of a random variable taking values on a finite set when side information may be available. These moments quantify the number of guesses required for correctly identifying the unknown object and, similarly to Arikan's bounds, they are expressed in terms of the Arimoto-R\'{e}nyi conditional entropy. Although Arikan's bounds are asymptotically tight, the improvement of the bounds in this paper is significant in the non-asymptotic regime. Relationships between moments of the optimal guessing function and the MAP error probability are also established, characterizing the exact locus of their attainable values. The bounds on optimal guessing moments serve to improve non-asymptotic bounds on the cumulant generating function of the codeword lengths for fixed-to-variable optimal lossless source coding without prefix constraints. Non-asymptotic bounds on the reliability function of discrete memoryless sources are derived as well. Relying on these techniques, lower bounds on the cumulant generating function of the codeword lengths are derived, by means of the smooth R\'{e}nyi entropy, for source codes that allow decoding errors.

Includes members:
  Member "distributed task encoding":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "tight bounds on the r enyi entropy via majorization with applications to guessing and compression")
  Member "reducing guesswork via an unreliable oracle":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "tight bounds on the r enyi entropy via majorization with applications to guessing and compression")
  Member "guessing attacks on distributed storage systems":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "tight bounds on the r enyi entropy via majorization with applications to guessing and compression")
  Member "sharp bounds on arimoto s conditional r e nyi entropies between two distinct orders":
    also connected through other hyperedges:
      (none)
  Member "on empirical cumulant generating functions of code lengths for individual sequences":
    also connected through other hyperedges:
      (none)
  Member "f divergence inequalities":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "on implicit regularization in beta vaes")
  Member "on the smooth renyi entropy and variable length source coding allowing errors":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "asymptotic expansions of smooth r e nyi entropies and their applications")
  Member "encoding tasks and renyi entropy":
    also connected through other hyperedges:
      - Hyperedge HE-6 (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)