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: "the deterministic time linearity of service provided by fading channels"
  Abstract: In the paper, we study the service process S(t) of an independent and identically distributed (i.i.d.) Nakagami-m fading channel, which is defined as the amount of service provided, i.e., the integral of the instantaneous channel capacity over time t. By using the Moment Generation Function (MGF) approach and the infinitely divisible law, it is proved that, other than certain generally recognized curve form or a stochastic process, the channel service process S(t) is a deterministic linear function of time t, namely, S(t)=cm* · t where cm* is a constant determined by the fading parameter m. Furthermore, we extend it to general i.i.d. fading channels and present an explicit form of the constant service rate cp*. The obtained work provides such a new insight on the system design of joint source/channel coding that there exists a coding scheme such that a receiver can decode with zero error probability and zero high layer queuing delay, if the transmitter maintains a constant data rate no more than cp*. Finally, we verify our analysis through Monte Carlo simulations.

Connected through hyperedge HE-1 (induced by source paper "non parametric message important measure storage code design and transmission planning for big data"):
  with members:
    - "spatiotemporal stochastic modeling of iot enabled cellular networks scalability and stability analysis"
    - "lossy compression for compute and forward in limited backhaul uplink multicell processing"
    - "message importance measure and its application to minority subset detection in big data"
    - "distributed binary detection with lossy data compression"
    - "wireless communications in the era of big data"
    - "renyi divergence and kullback leibler divergence"
    - "identifying the signs of fraudulent accounts using data mining techniques"
    - "on the distortion snr exponent of some layered transmission schemes"

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:
    - "queueing analysis for block fading rayleigh channels in the low snr regime"
    - "noncoherent capacity of underspread fading channels"
    - "low snr capacity of noncoherent fading channels"

Connected through hyperedge HE-3 (induced by source paper "high speed railway wireless communications efficiency versus fairness"):
  with members:
    - "channel service based high speed railway base station arrangement"

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)