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 wireless relay networks diversity multiplexing tradeoff"):
  Abstract: Opportunistic analysis has traditionally relied on independence assumptions that break down in many interesting and useful network topologies. This paper develops techniques that expand opportunistic analysis to a broader class of networks, proposes new opportunistic methods for several network geometries, and analyzes them in the high-SNR regime. For each of the geometries studied in the paper, we analyze the opportunistic DMT of several relay protocols, including amplify-and-forward, decode-and-forward, compress-and-forward, non-orthogonal amplify-forward, and dynamic decode-forward. Among the highlights of the results: in a variety of multi-user single-relay networks, simple selection strategies are developed and shown to be DMT-optimal. It is shown that compress-forward relaying achieves the DMT upper bound in the opportunistic multiple-access relay channel as well as in the opportunistic nxn user network with relay. Other protocols, e.g. dynamic decode-forward, are shown to be near optimal in several cases. Finite-precision feedback is analyzed for the opportunistic multiple-access relay channel, the opportunistic broadcast relay channel, and the opportunistic gateway channel, and is shown to be almost as good as full channel state information.

Includes members:
  Member "diversity multiplexing tradeoff of the half duplex relay channel":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "when are dynamic relaying strategies necessary in half duplex wireless networks")
  Member "a simple cooperative diversity method based on network path selection":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "dynwalks global topology and recent changes awareness dynamic network embedding")

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)