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: "scaling laws for overlaid wireless networks a cognitive radio network vs a primary network"
  Abstract: We study the scaling laws for the throughputs and delays of two coexisting wireless networks that operate in the same geographic region. The primary network consists of Poisson distributed legacy users of density n, and the secondary network consists of Poisson distributed cognitive users of density m, with m>n. The primary users have a higher priority to access the spectrum without particular considerations for the secondary users, while the secondary users have to act conservatively in order to limit the interference to the primary users. With a practical assumption that the secondary users only know the locations of the primary transmitters (not the primary receivers), we first show that both networks can achieve the same throughput scaling law as what Gupta and Kumar [1] established for a stand-alone wireless network if proper transmission schemes are deployed, where a certain throughput is achievable for each individual secondary user (i.e., zero outage) with high probability. By using a fluid model, we also show that both networks can achieve the same delay-throughput tradeoff as the optimal one established by El Gamal et al. [2] for a stand-alone wireless network.

Connected through hyperedge HE-1 (induced by source paper "an overview of the transmission capacity of wireless networks"):
  with members:
    - "spatial multiplexing with mmse receivers single stream optimality in ad hoc networks"
    - "random access transport capacity"
    - "performance of optimum combining in a poisson field of interferers and rayleigh fading channels"
    - "transmission capacities for overlaid wireless ad hoc networks with outage constraints"
    - "transmission capacity of ad hoc networks with multiple antennas using transmit stream adaptation and interference cancelation"
    - "outage local throughput and capacity of random wireless networks"
    - "interference and outage in clustered wireless ad hoc networks"
    - "spatial interference cancellation for multi antenna mobile ad hoc networks"

Connected through hyperedge HE-2 (induced by source paper "random access transport capacity"):
  with members:
    - "on capacity scaling in arbitrary wireless networks"
    - "spatial and temporal correlation of the interference in aloha ad hoc networks"
    - "interference and outage in clustered wireless ad hoc networks"
    - "spectrum sharing between cellular and mobile ad hoc networks transmission capacity trade off"
    - "bandwidth partitioning in decentralized wireless networks"
    - "transmission capacity of ad hoc networks with spatial diversity"
    - "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 "on the connectivity and multihop delay of ad hoc cognitive radio networks"):
  with members:
    - "cognitive networks achieve throughput scaling of a homogeneous network"
    - "information propagation speed in mobile and delay tolerant networks"
    - "connectivity percolation and information dissemination in large scale wireless networks with dynamic links"
    - "power control in cognitive radio networks how to cross a multi lane highway"
    - "bandwidth partitioning in decentralized wireless networks"
    - "scaling laws of cognitive networks"

Connected through hyperedge HE-4 (induced by source paper "throughput and delay scaling in supportive two tier networks"):
  with members:
    - "cognitive networks achieve throughput scaling of a homogeneous network"
    - "throughput scaling in random wireless networks a non hierarchical multipath routing strategy"
    - "hierarchical cooperation achieves optimal capacity scaling in ad hoc networks"

Connected through hyperedge HE-5 (induced by source paper "transmission capacities for overlaid wireless ad hoc networks with outage constraints"):
  with members:
    - "cognitive networks achieve throughput scaling of a homogeneous network"

Connected through hyperedge HE-6 (induced by source paper "spectrum sharing between cellular and mobile ad hoc networks transmission capacity trade off"):
  with members:
    - "bandwidth partitioning in decentralized wireless networks"
    - "spatial interference cancelation for mobile ad hoc networks imperfect csi"
    - "transmission capacity of ad hoc networks with spatial diversity"
    - "the effect of fading channel inversion and threshold scheduling on ad hoc networks"
    - "uplink capacity and interference avoidance for two tier femtocell networks"

Connected through hyperedge HE-7 (induced by source paper "delay throughput tradeoff for supportive two tier networks"):
  with members:
    - "cognitive networks achieve throughput scaling of a homogeneous network"
    - "hierarchical cooperation achieves optimal capacity scaling in 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)