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 "performance comparisons of geographic routing protocols in mobile ad hoc networks"):
  Abstract: Geographic routing protocols greatly reduce the requirements of topology storage and provide flexibility in the accommodation of the dynamic behavior of mobile ad hoc networks. This paper presents performance evaluations and comparisons of two geographic routing protocols and the popular AODV protocol. The tradeoffs among the average path reliabilities, average conditional delays, average conditional numbers of hops, and area spectral efficiencies and the effects of various parameters are illustrated for finite ad hoc networks with randomly placed mobiles. This paper uses a dual method of closed-form analysis and simple simulation that is applicable to most routing protocols and provides a much more realistic performance evaluation than has previously been possible. Some features included in the new analysis are shadowing, exclusion and guard zones, distance-dependent fading, and interference correlation.

Includes members:
  Member "performance analysis of geographic routing protocols in ad hoc networks":
    also connected through other hyperedges:
      (none)
  Member "multihop routing in ad hoc networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "optimal and suboptimal routing based on partial csi in random ad hoc networks")
  Member "an upper bound on multihop transmission capacity with dynamic routing selection":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "secure transmission in linear multihop relaying networks")
  Member "the outage probability of a finite ad hoc network in nakagami fading":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "air to air communications beyond 5g a novel 3d comp transmission scheme")
  Member "throughput delay reliability tradeoff with arq in wireless ad hoc networks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "delay analysis of spatially coded mimo zfbf with retransmissions in random networks")
  Member "random access transport capacity":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "optimal and suboptimal routing based on partial csi in random ad hoc networks")
  Member "spatial and temporal correlation of the interference in aloha ad hoc networks":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "spatio temporal modeling for massive and sporadic access")

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)