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: "fundamental limits of cdf based scheduling throughput fairness and feedback overhead"
  Abstract: In this paper, we investigate fundamental performance limits of cumulative distribution function (CDF)-based scheduling (CS) in downlink cellular networks. CS is known as an efficient scheduling method that can assign different time fractions for users or, equivalently, satisfy different channel access ratio (CAR) requirements of users while exploiting multiuser diversity. We first mathematically analyze the throughput characteristics of CS in arbitrary fading statistics and data rate functions. It is shown that the throughput gain of CS increases as the CAR of a user decreases or the number of users in a cell increases. For Nakagami-  $m$   fading channels, we obtain the average throughput in closed form and investigate the effects of the average signal-to-noise ratio, the shape parameter   $m$  , and the CAR on the throughput performance. In addition, we propose a threshold-based opportunistic feedback technique in order to reduce feedback overhead while satisfying the CAR requirements of users. We prove that the average feedback overhead of the proposed technique is upper-bounded by   $-\ln p$  , where   $p$   is the probability that no user satisfies the threshold condition in a cell. Finally, we adopt a novel fairness criterion, called qualitative fairness, which considers not only the quantity of the allocated resources to users, but also the quality of the resources. It is observed that CS provides a better qualitative fairness than other scheduling algorithms designed for controlling CARs of users.

Connected through hyperedge HE-1 (induced by source paper "opportunistic interference alignment for random access networks"):
  with members:
    - "performance analysis and optimization for interference alignment over mimo interference channels with limited feedback"
    - "opportunistic interference alignment for mimo interfering multiple access 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)