human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "throughput scaling laws for wireless networks with fading channels"
  Abstract: A network of n communication links, operating over a shared wireless channel, is considered. Fading is assumed to be the dominant factor affecting the strength of the channels between transmitter and receiver terminals. It is assumed that each link can be active and transmit with a constant power P or remain silent. The objective is to maximize the throughput over the selection of active links. By deriving an upper bound and a lower bound, it is shown that in the case of Rayleigh fading: (i) the maximum throughput scales like log n; (ii) the maximum throughput is achievable in a distributed fashion. The upper bound is obtained using probabilistic methods, where the key point is to upper bound the throughput of any random set of active links by a chi-squared random variable. To obtain the lower bound, a decentralized link activation strategy is proposed and analyzed.

Connected through hyperedge HE-1 (induced by source paper "hierarchical radio resource optimization for heterogeneous networks with enhanced inter cell interference coordination eicic"):
  with members:
    - "joint base station clustering and beamformer design for partial coordinated transmission in heterogenous networks"

Connected through hyperedge HE-2 (induced by source paper "parallel opportunistic routing in wireless networks"):
  with members:
    - "on capacity scaling in arbitrary wireless networks"
    - "opportunistic relaying in wireless networks"
    - "opportunistic spatial orthogonalization and its application in fading cognitive radio networks"
    - "the effect of fading channel inversion and threshold scheduling on ad hoc networks"
    - "hierarchical cooperation achieves optimal capacity scaling in ad hoc networks"

Connected through hyperedge HE-3 (induced by source paper "throughput of one hop wireless networks with noisy feedback channel"):
  with members:
    - "throughput of large one hop wireless networks with general fading"
    - "one hop throughput of wireless networks with random connections"
    - "rate constrained wireless networks with fading channels interference limited and noise limited regimes"
    - "hierarchical cooperation achieves optimal capacity scaling in ad hoc networks"

Connected through hyperedge HE-4 (induced by source paper "throughput of large one hop wireless networks with general fading"):
  with members:
    - "one hop throughput of wireless networks with random connections"
    - "opportunistic relaying in wireless networks"
    - "hierarchical cooperation achieves optimal capacity scaling in ad hoc networks"

Connected through hyperedge HE-5 (induced by source paper "on the design of large scale wireless systems with detailed proofs"):
  with members:
    - "miso capacity with per antenna power constraint"
    - "femtocell networks a survey"

Connected through hyperedge HE-6 (induced by source paper "randomized vs orthogonal spectrum allocation in decentralized networks outage analysis"):
  with members:
    - "a model for randomized resource allocation in decentralized wireless networks"
    - "bandwidth partitioning in decentralized wireless networks"
    - "fractional power control for decentralized wireless networks"
    - "rate constrained wireless networks with fading channels interference limited and noise limited regimes"
    - "the effect of fading channel inversion and threshold scheduling on ad hoc networks"
    - "on the user selection for mimo broadcast channels"
    - "cognitive radio an information theoretic perspective"
    - "capacity limits of cognitive radio with distributed and dynamic spectral activity"

Connected through hyperedge HE-7 (induced by source paper "throughput scaling of wireless networks with random connections"):
  with members:
    - "opportunistic relaying in wireless networks"
    - "information theoretic operating regimes of large wireless networks"
    - "wireless ad hoc networks strategies and scaling laws for the fixed snr regime"
    - "crystallization in large wireless networks"
    - "hierarchical cooperation achieves optimal capacity scaling in ad hoc networks"

Connected through hyperedge HE-8 (induced by source paper "improved power delay trade off in wireless networks using opportunistic routing"):
  with members:
    - "on capacity scaling in arbitrary wireless networks"
    - "opportunistic relaying in wireless networks"
    - "the effect of fading channel inversion and threshold scheduling on ad hoc networks"

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