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: "queueing analysis for block fading rayleigh channels in the low snr regime"
  Abstract: Wireless fading channels suffer from the time varying channel gains besides the Additive White Gaussian Noise (AWGN). As a result, it is impossible for fading channels to support a constant rate data stream without the help of buffers. In this paper, we consider information transmission over an infinite buffer-aided block Rayleigh fading channel in the low signal-to-noise ratio (SNR) regime, and characterize the transmission capability of the channel in terms of stationary queue length distribution and packet delay rather than using data rate only. Taking advantage of the memoryless property of the service provided by the channel in each block, which follows the negative exponential distribution, the transmission process is formulated as a discrete time discrete state D/G/1 queueing problem. The obtained results provide a full characterization of block Rayleigh fading channels and can be extended to the finite buffer aided transmissions.

Connected through hyperedge HE-1 (induced by source paper "uplink age of information of unilaterally powered two way data exchanging systems"):
  with members:
    - "scheduling status updates to minimize age of information with an energy harvesting sensor"
    - "optimal status update for age of information minimization with an energy harvesting source"
    - "timely updates over an erasure channel"
    - "age optimal information updates in multihop networks"
    - "update or wait how to keep your data fresh"
    - "optimizing data freshness throughput and delay in multi server information update systems"
    - "the age of information real time status updating by multiple sources"
    - "on the age of information in status update systems with packet management"

Connected through hyperedge HE-2 (induced by source paper "a queueing characterization of information transmission over block fading rayleigh channels in the low snr regime"):
  with members:
    - "the deterministic time linearity of service provided by fading channels"
    - "noncoherent capacity of underspread fading channels"
    - "low snr capacity of noncoherent fading 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)