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: "capacity per unit energy of fading channels with a peak constraint"
  Abstract: A discrete-time single-user scalar channel with temporally correlated Rayleigh fading is analyzed. There is no side information at the transmitter or the receiver. A simple expression is given for the capacity per unit energy, in the presence of a peak constraint. The simple formula of Verdu/spl acute/ for capacity per unit cost is adapted to a channel with memory, and is used in the proof. In addition to bounding the capacity of a channel with correlated fading, the result gives some insight into the relationship between the correlation in the fading process and the channel capacity. The results are extended to a channel with side information, showing that the capacity per unit energy is one nat per joule, independently of the peak power constraint. A continuous-time version of the model is also considered. The capacity per unit energy subject to a peak constraint (but no bandwidth constraint) is given by an expression similar to that for discrete time, and is evaluated for Gauss-Markov and Clarke fading channels.

Connected through hyperedge HE-1 (induced by source paper "unified capacity limit of non coherent wideband fading channels"):
  with members:
    - "millimeter wave cellular wireless networks potentials and challenges"
    - "millimeter wave channel modeling and cellular capacity evaluation"
    - "on the sensitivity of continuous time noncoherent fading channel capacity"
    - "noncoherent capacity of underspread fading channels"
    - "low snr capacity of noncoherent fading channels"

Connected through hyperedge HE-2 (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"
    - "proof of the outage probability conjecture for miso channels"

Connected through hyperedge HE-3 (induced by source paper "on capacity and capacity per unit cost of gaussian multiple access channel with peak power constraints"):
  with members:
    - "noncoherent capacity of underspread fading channels"
    - "low snr capacity of noncoherent fading channels"
    - "multicasting in large wireless networks bounds on the minimum energy per bit"
    - "low snr capacity of fading channels with peak and average power constraints"
    - "mutual information and minimum mean square error in gaussian channels"

Connected through hyperedge HE-4 (induced by source paper "kalman filtering over fading channels zero one laws and almost sure stabilities"):
  with members:
    - "distributed kalman filtering over massive data sets analysis through large deviations of random riccati equations"

Connected through hyperedge HE-5 (induced by source paper "nearest neighbor decoding and pilot aided channel estimation for fading channels"):
  with members:
    - "a coding theorem for a class of stationary channels with feedback"

Connected through hyperedge HE-6 (induced by source paper "on the achievable rate of stationary rayleigh flat fading channels with gaussian inputs"):
  with members:
    - "on the gain of joint processing of pilot and data symbols in stationary rayleigh fading channels"
    - "mutual information of iid complex gaussian signals on block rayleigh faded channels"
    - "low snr capacity of noncoherent fading channels"
    - "on multipath fading channels at high snr"
    - "capacity results for block stationary gaussian fading channels with a peak power constraint"

Connected through hyperedge HE-7 (induced by source paper "bounds on the capacity of ofdm underspread frequency selective fading channels"):
  with members:
    - "noncoherent capacity of underspread fading channels"
    - "low snr capacity of noncoherent fading channels"
    - "on the sensitivity of noncoherent capacity to the channel model"
    - "capacity results for block stationary gaussian fading channels with a peak power constraint"
    - "channel uncertainty in ultra wideband communication systems"

Connected through hyperedge HE-8 (induced by source paper "noncoherent capacity of underspread fading channels"):
  with members:
    - "low snr capacity of noncoherent fading channels"
    - "on the sensitivity of noncoherent capacity to the channel model"
    - "multipath channels of bounded capacity"
    - "capacity results for block stationary gaussian fading channels with a peak power constraint"
    - "capacity of sparse multipath channels in the ultra wideband regime"
    - "low snr capacity of fading channels with peak and average power constraints"
    - "channel uncertainty in ultra wideband communication systems"
    - "mutual information and minimum mean square error in gaussian channels"

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)