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: "analysis of multi cell downlink cooperation with a constrained spatial model"
  Abstract: Multi-cell cooperation (MCC) mitigates intercell interference and improves throughput at the cell edge. This paper considers a cooperative downlink, whereby cell-edge mobiles are served by multiple cooperative base stations. The cooperating base stations transmit identical signals over paths with non-identical path losses, and the receiving mobile performs diversity combining. The analysis in this paper is driven by a new expression for the conditional outage probability when signals arriving over different paths are combined in the presence of noise and interference, where the conditioning is with respect to the network topology and shadowing. The channel model accounts for path loss, shadowing, and Nakagami fading, and the Nakagami fading parameters do not need to be identical for all paths. To study performance over a wide class of network topologies, a random spatial model is adopted, and performance is found by statistically characterizing the rates provided on the downlinks. To model realistic networks, the model requires a minimum separation among base stations. Having adopted a realistic model and an accurate analysis, the paper proceeds to determine performance under several resource-allocation policies and provides insight regarding how the cell edge should be defined.

Connected through hyperedge HE-1 (induced by source paper "controlled barrage regions stochastic modeling analysis and optimization"):
  with members:
    - "effect of spatial interference correlation on the performance of maximum ratio combining"
    - "a direct approach to computing spatially averaged outage probability"
    - "unicast barrage relay networks outage analysis and optimization"

Connected through hyperedge HE-2 (induced by source paper "an accurate and efficient analysis of a mbsfn network"):
  with members:
    - "an analysis of the ds cdma cellular uplink for arbitrary and constrained topologies"
    - "a new analysis of the ds cdma cellular downlink under spatial constraints"
    - "the outage probability of a finite ad hoc network in nakagami fading"
    - "a tractable approach to coverage and rate in cellular networks"

Connected through hyperedge HE-3 (induced by source paper "unicast barrage relay networks outage analysis and optimization"):
  with members:
    - "effect of spatial interference correlation on the performance of maximum ratio combining"
    - "multihop routing in ad hoc networks"
    - "analysis and optimization of a frequency hopping ad hoc network in rayleigh fading"
    - "the outage probability of a finite ad hoc network in nakagami fading"

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)