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: "cognitive networks achieve throughput scaling of a homogeneous network"
  Abstract: Two distinct, but overlapping, networks that operate at the same time, space, and frequency is considered. The first network consists of n randomly distributed primary users, which form an ad hoc network. The second network again consists of m randomly distributed ad hoc secondary users or cognitive users. The primary users have priority access to the spectrum and do not need to change their communication protocol in the presence of the secondary users. The secondary users, however, need to adjust their protocol based on knowledge about the locations of the primary users to bring little loss to the primary network's throughput. By introducing preservation regions around primary receivers, a modified multihop routing protocol is proposed for the cognitive users. Assuming m=nβ with β >; 1, it is shown that the secondary network achieves almost the same throughput scaling law as a stand-alone network while the primary network throughput is subject to only a vanishingly small fractional loss. Specifically, the primary network achieves the sum throughput of order n1/2 and, for any δ >; 0, the secondary network achieves the sum throughput of order m1/2-δ with an arbitrarily small fraction of outage. Thus, almost all secondary source-destination pairs can communicate at a rate of order m-1/2-δ.

Connected through hyperedge HE-1 (induced by source paper "throughput scaling of covert communication over wireless adhoc networks"):
  with members:
    - "covert capacity of non coherent rayleigh fading channels"
    - "fundamental limits of covert communication over mimo awgn channel"
    - "time division is optimal for covert communication over some broadcast channels"
    - "covert communication with channel state information at the transmitter"
    - "fundamental limits of communication with low probability of detection"
    - "covert communication over noisy channels a resolvability perspective"
    - "limits of reliable communication with low probability of detection on awgn channels"
    - "on capacity scaling in arbitrary wireless networks"

Connected through hyperedge HE-2 (induced by source paper "on the capacity region of cognitive multiple access over white space channels"):
  with members:
    - "cognitive radio an information theoretic perspective"
    - "duality between channel capacity and rate distortion with two sided state information"
    - "capacity limits of cognitive radio with distributed and dynamic spectral activity"

Connected through hyperedge HE-3 (induced by source paper "large overlaid cognitive radio networks from throughput scaling to asymptotic multiplexing gain"):
  with members:
    - "on asymptotic statistics for geometric routing schemes in wireless ad hoc networks"
    - "on the random 1 2 disk routing scheme in wireless ad hoc networks"
    - "an overview of the transmission capacity of wireless networks"
    - "scaling laws of cognitive networks"
    - "geographic routing with limited information in sensor networks"

Connected through hyperedge HE-4 (induced by source paper "transmission capacity of spectrum sharing ad hoc networks with multiple antennas"):
  with members:
    - "an overview of the transmission capacity of wireless networks"
    - "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"
    - "exploiting multi antennas for opportunistic spectrum sharing in cognitive radio networks"
    - "spectrum sharing between cellular and mobile ad hoc networks transmission capacity trade off"
    - "transmission capacity of ad hoc networks with spatial diversity"
    - "cognitive radio an information theoretic perspective"

Connected through hyperedge HE-5 (induced by source paper "on the connectivity and multihop delay of ad hoc cognitive radio networks"):
  with members:
    - "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 for overlaid wireless networks a cognitive radio network vs a primary network"
    - "scaling laws of cognitive networks"

Connected through hyperedge HE-6 (induced by source paper "throughput and delay scaling in supportive two tier networks"):
  with members:
    - "scaling laws for overlaid wireless networks a cognitive radio network vs a primary 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-7 (induced by source paper "transmission capacities for overlaid wireless ad hoc networks with outage constraints"):
  with members:
    - "scaling laws for overlaid wireless networks a cognitive radio network vs a primary network"

Connected through hyperedge HE-8 (induced by source paper "scaling laws for overlaid wireless networks a cognitive radio network vs a primary network"):
  with members:
    - "throughput delay trade off for hierarchical cooperation in ad hoc wireless networks"
    - "scaling laws of cognitive networks"
    - "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)