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 "coherent multiple antenna block fading channels at finite blocklength"):
  Abstract: In this paper we consider a channel model that is often used to describe the mobile wireless scenario: multiple-antenna additive white Gaussian noise channels subject to random (fading) gain with full channel state information at the receiver. Dynamics of the fading process are approximated by a piecewise-constant process (frequency non-selective isotropic block fading). This work addresses the finite blocklength fundamental limits of this channel model. Specifically, we give a formula for the channel dispersion -- a quantity governing the delay required to achieve capacity. Multiplicative nature of the fading disturbance leads to a number of interesting technical difficulties that required us to enhance traditional methods for finding channel dispersion. Alas, one difficulty remains: the converse (impossibility) part of our result holds under an extra constraint on the growth of the peak-power with blocklength. #R##N#Our results demonstrate, for example, that while capacities of $n_t\times n_r$ and $n_r \times n_t$ antenna configurations coincide (under fixed received power), the coding delay can be quite sensitive to this switch. For example, at the received SNR of $20$ dB the $16\times 100$ system achieves capacity with codes of length (delay) which is only $60\%$ of the length required for the $100\times 16$ system. Another interesting implication is that for the MISO channel, the dispersion-optimal coding schemes require employing orthogonal designs such as Alamouti's scheme -- a surprising observation considering the fact that Alamouti's scheme was designed for reducing demodulation errors, not improving coding rate. Finding these dispersion-optimal coding schemes naturally gives a criteria for producing orthogonal design-like inputs in dimensions where orthogonal designs do not exist.

Includes members:
  Member "a beta beta achievability bound with applications":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "minimum energy to send k bits over multiple antenna fading channels")
  Member "asymptotic estimates in information theory with non vanishing error probabilities":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "finite sample analysis of image registration")
  Member "minimum energy to send k bits over multiple antenna fading channels":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "joint power control and rate allocation enabling ultra reliability and energy efficiency in simo wireless networks")
  Member "optimum power control at finite blocklength":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "privacy aware distributed hypothesis testing")
  Member "bounds on the second order coding rate of the mimo rayleigh block fading channel":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "asymptotic estimates in information theory with non vanishing error probabilities")
  Member "dispersion analysis of infinite constellations in ergodic fading channels":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "on the separability of ergodic fading mimo channels a lattice coding approach")
  Member "diversity versus channel knowledge at finite block length":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "on single antenna rayleigh block fading channels at finite blocklength")

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)