human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "opportunistic interference mitigation achieves optimal degrees of freedom in wireless multi cell uplink networks"):
  Abstract: We introduce an opportunistic interference mitigation (OIM) protocol, where a user scheduling strategy is utilized in K-cell uplink networks with time-invariant channel coefficients and base stations (BSs) having M antennas. Each BS opportunistically selects a set of users who generate the minimum interference to the other BSs. Two OIM protocols are shown according to the number of simultaneously transmitting users per cell, S: opportunistic interference nulling (OIN) and opportunistic interference alignment (OIA). Then, their performance is analyzed in terms of degrees-of-freedom (DoFs). As our main result, it is shown that KM DoFs are achievable under the OIN protocol with M selected users per cell, if the total number of users in a cell, N, scales at least as SNR(K-1)M. Similarly, it turns out that the OIA scheme with S(<;M) selected users achieves KS DoFs, if N scales faster than SNR(K-1)S. These results indicate that there exists a trade-off between the achievable DoFs and the minimum required N. By deriving the corresponding upper bound on the DoFs, it is shown that the OIN scheme is DoF-optimal. Finally, numerical evaluation, a two-step scheduling method, and the extension to multi-carrier scenarios are shown.

Includes members:
  Member "real interference alignment exploiting the potential of single antenna systems":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "multi antenna coded content delivery with caching a low complexity solution")
  Member "parallel opportunistic routing in wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on the effects of subpacketization in content centric mobile networks")
  Member "interference alignment with limited feedback on two cell interfering two user mimo mac":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "interference mitigation techniques for clustered multicell joint decoding systems")
  Member "from spectrum pooling to space pooling opportunistic interference alignment in mimo cognitive networks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "contextual bandit learning for machine type communications in the null space of multi antenna systems")
  Member "opportunistic relaying in wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "multi stream opportunistic network decoupling relay selection and interference management")
  Member "ergodic interference alignment":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "the interference channel revisited aligning interference by adjusting receive antenna separation")
  Member "opportunistic spatial orthogonalization and its application in fading cognitive radio networks":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "contextual bandit learning for machine type communications in the null space of multi antenna systems")
  Member "exploiting opportunistic multiuser detection in decentralized multiuser mimo systems":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "wireless communications in the era of big data")

Question: Please tell me which class the source paper 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)