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 "wireless link capacity under shadowing and fading"):
  Abstract: We consider the following basic link capacity (a.k.a., one-shot scheduling) problem in wireless networks: Given a set of communication links, find a maximum subset of links that can successfully transmit simultaneously. Good performance guarantees are known only for deterministic models, such as the physical model with geometric (log-distance) pathloss. We treat this problem under stochastic shadowing under general distributions, bound the effects of shadowing on optimal capacity, and derive constant approximation algorithms. We also consider temporal fading under Rayleigh distribution, and show that it affects non-fading solutions only by a constant-factor. These can be combined into a constant approximation link capacity algorithm under both time-invariant shadowing and temporal fading.

Includes members:
  Member "3d channel model in 3gpp":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "elevation beamforming with full dimension mimo architectures in 5g systems a tutorial")
  Member "beyond geometry towards fully realistic wireless models":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "effective wireless scheduling via hypergraph sketches")
  Member "approximation algorithms for wireless link scheduling with flexible data rates":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "wireless aggregation at nearly constant rate")
  Member "a fully distributed algorithm for throughput performance in wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "beyond geometry towards fully realistic wireless models")
  Member "dynamic packet scheduling in wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "effective wireless scheduling via hypergraph sketches")
  Member "algorithms for wireless capacity":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "reception capacity definitions game theory and hardness")
  Member "secondary spectrum auctions for symmetric and submodular bidders":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "effective wireless scheduling via hypergraph sketches")
  Member "wireless connectivity and capacity":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "reception capacity definitions game theory and hardness")

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)