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: "multihop diversity in wideband ofdm systems the impact of spatial reuse and frequency selectivity"
  Abstract: The goal of this paper is to establish which practical routing schemes for wireless networks are most suitable for wide- band systems in the power-limited regime, which is, for example, a practically relevant mode of operation for the analysis of ultra- wideband (UWB) mesh networks. For this purpose, we study the tradeoff between energy efficiency and spectral efficiency (known as the power-bandwidth tradeoff) in a wideband linear multihop network in which transmissions employ orthogonal frequency- division multiplexing (OFDM) modulation and are affected by quasi-static, frequency-selective fading. Considering open-loop (fixed-rate) and closed-loop (rate-adaptive) multihop relaying techniques, we characterize the impact of routing with spatial reuse on the statistical properties of the end-to-end conditional mutual information (conditioned on the specific values of the channel fading parameters and therefore treated as a random variable) and on the energy and spectral efficiency measures of the wideband regime. Our analysis particularly deals with the convergence of these end-to-end performance measures in the case of large number of hops, i.e., the phenomenon first observed in (1) and named as "multihop diversity". Our results demonstrate the realizability of the multihop diversity advantages in the case of routing with spatial reuse for wideband OFDM systems under wireless channel effects such as path-loss and quasi-static frequency-selective multipath fading. I. INTRODUCTION The design of large scale distributed networks (e.g., mesh and ad-hoc networks, relay networks) poses a set of new challenges to information theory, communication theory and network theory. Such networks are characterized by the large size of the network both in terms of the number of nodes (i.e., dense) and in terms of the geographical area the network covers. Each terminal can be severely constrained by its computational and transmission/receiving power. Moreover, delay and complexity constraints along with diversity-limited channel behavior may require transmissions under insufficient levels of coding protection causing link outages. These con- straints require an understanding of the performance limits of such networks jointly in terms of power and bandwidth efficiency and link reliability, especially when designing key operational elements essential in these systems such as mul- tihop routing algorithms, bandwidth allocation policies and relay deployment models. This paper applies tools from information theory and statis-

Connected through hyperedge HE-1 (induced by source paper "power bandwidth tradeoff in multiuser relay channels with opportunistic scheduling"):
  with members:
    - "opportunistic relay selection with limited feedback"
    - "power bandwidth tradeoff in dense multi antenna relay networks"
    - "opportunism in multiuser relay channels scheduling routing and spectrum reuse"
    - "cooperative relay broadcast channels"
    - "high snr analysis of mimo broadcast channels"

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)