human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "proof of the outage probability conjecture for miso channels"
  Abstract: In Telatar 1999, it is conjectured that the covariance matrices minimizing the outage probability for MIMO channels with Gaussian fading are diagonal with either zeros or constant values on the diagonal. In the MISO setting, this is equivalent to conjecture that the Gaussian quadratic forms having largest tale probability correspond to such diagonal matrices. We prove here the conjecture in the MISO setting.

Connected through hyperedge HE-1 (induced by source paper "interleaving channel estimation and limited feedback for point to point systems with a large number of transmit antennas"):
  with members:
    - "interleaved training and training based transmission design for hybrid massive antenna downlink"
    - "compressed channel feedback for correlated massive mimo systems"
    - "spatially common sparsity based adaptive channel estimation and feedback for fdd massive mimo"
    - "antenna grouping based feedback compression for fdd based massive mimo systems"
    - "distributed compressive csit estimation and feedback for fdd multi user massive mimo systems"
    - "training sequence design for feedback assisted hybrid beamforming in massive mimo systems"
    - "massive mimo for next generation wireless systems"
    - "downlink training techniques for fdd massive mimo systems open loop and closed loop training with memory"

Connected through hyperedge HE-2 (induced by source paper "on the outage probability conjecture for mimo channels"):
  with members:
    - "an overview of signal processing techniques for millimeter wave mimo systems"
    - "massive mimo ten myths and one critical question"
    - "spatially sparse precoding in millimeter wave mimo systems"
    - "five disruptive technology directions for 5g"

Connected through hyperedge HE-3 (induced by source paper "short packet communications over multiple antenna rayleigh fading channels"):
  with members:
    - "towards massive ultra reliable and low latency wireless the art of sending short packets"
    - "finite snr bounds on the sum rate capacity of rayleigh block fading multiple access channels with no a priori csi"
    - "closed form output statistics of mimo block fading channels"
    - "diversity versus multiplexing at finite blocklength"
    - "ultra reliable communication in 5g wireless systems"
    - "five disruptive technology directions for 5g"
    - "quasi static multiple antenna fading channels at finite blocklength"
    - "diversity versus channel knowledge at finite block length"

Connected through hyperedge HE-4 (induced by source paper "minimum energy to send k bits over multiple antenna fading channels"):
  with members:
    - "a beta beta achievability bound with applications"
    - "short packet communications over multiple antenna rayleigh fading channels"
    - "asymptotic estimates in information theory with non vanishing error probabilities"
    - "joint source channel coding with feedback"
    - "optimum power control at finite blocklength"
    - "quasi static multiple antenna fading channels at finite blocklength"
    - "diversity versus channel knowledge at finite block length"
    - "noncoherent capacity of underspread fading channels"

Connected through hyperedge HE-5 (induced by source paper "coordinated shared spectrum precoding with distributed csit"):
  with members:
    - "large system analysis of cognitive radio network via partially projected regularized zero forcing precoding"
    - "exploiting multi antennas for opportunistic spectrum sharing in cognitive radio networks"
    - "on peak versus average interference power constraints for protecting primary users in cognitive radio networks"

Connected through hyperedge HE-6 (induced by source paper "quasi static multiple antenna fading channels at finite blocklength"):
  with members:
    - "the third order term in the normal approximation for the awgn channel"
    - "quasi static simo fading channels at finite blocklength"
    - "bounds on the second order coding rate of the mimo rayleigh block fading channel"
    - "diversity versus channel knowledge at finite block length"

Connected through hyperedge HE-7 (induced by source paper "broadcast approaches to the diamond channel"):
  with members:
    - "maximum throughput in multiple antenna systems"
    - "experiment driven characterization of full duplex wireless systems"
    - "pushing the limits of full duplex design and real time implementation"
    - "an efficient adaptive distributed space time coding scheme for cooperative relaying"
    - "asymptotic analysis of amplify and forward relaying in a parallel mimo relay network"
    - "on multistage successive refinement for wyner ziv source coding with degraded side informations"
    - "broadcast cooperation strategies for two colocated users"

Connected through hyperedge HE-8 (induced by source paper "a colonel blotto gladiator game"):
  with members:
    - "on an inequality of karlin and rinott concerning weighted sums of i i d random variables"

Question: Please tell me which class the center node 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)