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 "an introductory guide to fano s inequality with applications in statistical estimation"):
  Abstract: Information theory plays an indispensable role in the development of algorithm-independent impossibility results, both for communication problems and for seemingly distinct areas such as statistics and machine learning. While numerous information-theoretic tools have been proposed for this purpose, the oldest one remains arguably the most versatile and widespread: Fano's inequality. In this chapter, we provide a survey of Fano's inequality and its variants in the context of statistical estimation, adopting a versatile framework that covers a wide range of specific problems. We present a variety of key tools and techniques used for establishing impossibility results via this approach, and provide representative examples covering group testing, graphical model selection, sparse linear regression, density estimation, and convex optimization.

Includes members:
  Member "a strong converse bound for multiple hypothesis testing with applications to high dimensional estimation":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "the renyi capacity and center")
  Member "information theoretic analysis of generalization capability of learning algorithms":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on the information bottleneck problems models connections applications and information theoretic views")
  Member "worst case vs average case design for estimation from fixed pairwise comparisons":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "graph resistance and learning from pairwise comparisons")
  Member "an adaptive sublinear time block sparse fourier transform":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "stronger l2 l2 compressed sensing without iterating")
  Member "lower bounds on active learning for graphical model selection":
    also connected through other hyperedges:
      (none)
  Member "f divergence inequalities":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "on implicit regularization in beta vaes")
  Member "on the difficulty of selecting ising models with approximate recovery":
    also connected through other hyperedges:
      (none)
  Member "converse bounds for noisy group testing with arbitrary measurement matrices":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "group testing an information theory perspective")

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)