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 "second order and moderate deviation analysis of a block fading channel with deterministic and energy harvesting power constraints"):
  Abstract: We consider a block fading additive white Gaussian noise (AWGN) channel with perfect channel state information (CSI) at the transmitter and the receiver. First, for a given codeword length and non-vanishing average probability of error, we obtain lower and upper bounds on the maximum transmission rate. We derive bounds for three kinds of power constraints inherent to a wireless transmitter. These include the canonical peak power constraint and average power constraint. In addition, we consider a time varying peak power constraint imposed by an \emph{energy harvesting device}-a mechanism that powers many modern-day wireless transmitters. The bounds characterize \emph{second order} deviation of finite blocklength coding rates from the channel capacity, which is in turn achieved by \textit{water-filling} power allocation across time. The bounds obtained also indicate the rate enhancement possible due to CSI at the transmitter in the finite blocklength regime. Next, we provide bounds on the optimal exponent with which error probability drops to zero when channel coding rate is simultaneously allowed to approach capacity \emph{at a certain rate}, as the codeword length increases. These bounds identify what is known as the moderate deviation regime of the block fading channel. We compare the bounds numerically to bring out the efficacy of our results.

Includes members:
  Member "5g wireless network slicing for embb urllc and mmtc a communication theoretic view":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "overhead aware design of reconfigurable intelligent surfaces in smart radio environments")
  Member "ultra reliable and low latency communications in 5g downlink physical layer aspects":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "towards reliable uav swarm communication in d2d enhanced cellular network")
  Member "on achievable rates of awgn energy harvesting channels with block energy arrival and non vanishing error probabilities":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "non asymptotic achievable rates for gaussian energy harvesting channels best effort and save and transmit")
  Member "beta beta bounds finite blocklength analog of the golden formula":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "channel coding at low capacity")
  Member "finite blocklength achievable rates for energy harvesting awgn channels with infinite buffer":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "non asymptotic achievable rates for gaussian energy harvesting channels best effort and save and transmit")
  Member "non asymptotic achievable rates for energy harvesting channels using save and transmit":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "non asymptotic achievable rates for gaussian energy harvesting channels best effort and save and transmit")
  Member "short packet communications over multiple antenna rayleigh fading channels":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "ultra reliable communication via optimum power allocation for harq retransmission schemes")
  Member "second order coding rates for channels with state":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "resolution limits of noisy 20 questions estimation")

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)