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 "joint source channel coding with feedback"):
  Abstract: This paper quantifies the fundamental limits of variable-length transmission of a general (possibly analog) source over a memoryless channel with noiseless feedback, under a distortion constraint. We consider excess distortion, average distortion and guaranteed distortion ($d$-semifaithful codes). In contrast to the asymptotic fundamental limit, a general conclusion is that allowing variable-length codes and feedback leads to a sizable improvement in the fundamental delay-distortion tradeoff. In addition, we investigate the minimum energy required to reproduce $k$ source samples with a given fidelity after transmission over a memoryless Gaussian channel, and we show that the required minimum energy is reduced with feedback and an average (rather than maximal) power constraint.

Includes members:
  Member "joint source channel coding with feedback extended":
    also connected through other hyperedges:
      (none)
  Member "minimum energy to send k bits over multiple antenna fading channels":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "joint power control and rate allocation enabling ultra reliability and energy efficiency in simo wireless networks")
  Member "asymptotic expansions for gaussian channels with feedback under a peak power constraint":
    also connected through other hyperedges:
      (none)
  Member "variable length compression allowing errors extended":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on the conditional smooth renyi entropy and its applications in guessing and source coding")
  Member "variable length compression allowing errors":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "asymptotic expansions of smooth r e nyi entropies and their applications")
  Member "active sequential hypothesis testing":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "decentralized sequential active hypothesis testing and the mac feedback capacity")
  Member "lossy joint source channel coding in the finite blocklength regime":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "finite sample analysis of image registration")
  Member "fixed length lossy compression in the finite blocklength regime":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "finite sample analysis of image registration")

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)