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 "parallel opportunistic routing in wireless networks"):
  Abstract: We study benefits of opportunistic routing in a large wireless ad hoc network by examining how the power, delay, and total throughput scale as the number of source-destination pairs increases up to the operating maximum. Our opportunistic routing is novel in a sense that it is massively parallel, i.e., it is performed by many nodes simultaneously to maximize the opportunistic gain while controlling the interuser interference. The scaling behavior of conventional multihop transmission that does not employ opportunistic routing is also examined for comparison. Our main results indicate that our opportunistic routing can exhibit a net improvement in overall power-delay tradeoff over the conventional routing by providing up to a logarithmic boost in the scaling law. Such a gain is possible since the receivers can tolerate more interference due to the increased received signal power provided by the multi user diversity gain, which means that having more simultaneous transmissions is possible.

Includes members:
  Member "on capacity scaling in arbitrary wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "throughput scaling of covert communication over wireless adhoc networks")
  Member "opportunistic relaying in wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "multi stream opportunistic network decoupling relay selection and interference management")
  Member "opportunistic spatial orthogonalization and its application in fading cognitive radio networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "contextual bandit learning for machine type communications in the null space of multi antenna systems")
  Member "throughput scaling laws for wireless networks with fading channels":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "hierarchical radio resource optimization for heterogeneous networks with enhanced inter cell interference coordination eicic")
  Member "the effect of fading channel inversion and threshold scheduling on ad hoc networks":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "hiding communications in awgn channels and thz band with interference uncertainty")
  Member "hierarchical cooperation achieves optimal capacity scaling in ad hoc networks":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "wireless mesh networking with devices equipped with multi connectivity")

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)