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: "asymptotic scheduling gains in point to multipoint cognitive networks"
  Abstract: We study simultaneous channel sharing of collocated primary and secondary networks at three different levels of coexistence: pure interference, asymmetric, and symmetric. At the pure interference level, both networks operate simultaneously in the same frequency band regardless of their interference to each other. At the asymmetric level, only the secondary network performs user scheduling based on various degrees of interference and channel gain knowledge while at the symmetric level both networks do so. Using a lemma on the asymptotic behavior of the largest order statistic and a proposition on the asymptotic sum of lower order statistics, we derive asymptotic primary and secondary sum-rates under simultaneous channel sharing at each coexistence level. As a baseline comparison, time-division (TD) channel sharing is considered. While maintaining the same asymptotic primary sum-rate, the asymptotic secondary sum-rate under TD is compared with that achievable by simultaneous channel sharing. The results indicate that simultaneous channel sharing at both asymmetric and symmetric co-existence levels can outperform TD. Furthermore, this enhancement is achievable asymptotically when user scheduling in uplink mode is based only on the interference gains to the opposite network and not on a network's own channel gains.

Connected through hyperedge HE-1 (induced by source paper "capacity limits of multiuser multiantenna cognitive networks"):
  with members:
    - "on ergodic sum capacity of fading cognitive multiple access and broadcast channels"
    - "exploiting multi antennas for opportunistic spectrum sharing in cognitive radio networks"

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)