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 of cognitive networks"
  Abstract: Opportunistic secondary spectrum usage has the potential to dramatically increase spectral efficiency and rates of a network of secondary cognitive users. In this work we consider a cognitive network: n pairs of cognitive transmitter and receiver wish to communicate simultaneously in the presence of a single primary transmitter-receiver link. We assume each cognitive transmitter-receiver pair communicates in a realistic single-hop fashion, as cognitive links are likely to be highly localized in space. We first show that under an outage constraint on the primary link's capacity, provided that the density of the cognitive users is constant, the sum-rate of the n cognitive links scales linearly with n as n ? ?. This scaling is in contrast to the sum-rate scaling of ?n seen in multi-hop ad-hoc networks. We then explore the optimal radius of the primary exclusive region: the region in which no secondary cognitive users may transmit, such that the outage constraint on the primary user is satisfied. We obtain bounds that help the design of this primary exclusive region, outside of which cognitive radios may freely transmit.

Connected through hyperedge HE-1 (induced by source paper "exploiting self interference suppression for improved spectrum awareness efficiency in cognitive radio systems"):
  with members:
    - "pushing the limits of full duplex design and real time implementation"

Connected through hyperedge HE-2 (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"
    - "cognitive networks achieve throughput scaling of a homogeneous network"
    - "an overview of the transmission capacity of wireless networks"
    - "geographic routing with limited information in sensor networks"

Connected through hyperedge HE-3 (induced by source paper "cognitive networks achieve throughput scaling of a homogeneous network"):
  with members:
    - "on capacity scaling in arbitrary wireless networks"
    - "hierarchical cooperation achieves optimal capacity scaling in ad hoc networks"
    - "cognitive radio an information theoretic perspective"
    - "capacity limits of cognitive radio with distributed and dynamic spectral activity"

Connected through hyperedge HE-4 (induced by source paper "on ergodic sum capacity of fading cognitive multiple access and broadcast channels"):
  with members:
    - "optimal power allocation for fading channels in cognitive radio networks ergodic capacity and outage capacity"
    - "exploiting multi antennas for opportunistic spectrum sharing in cognitive radio networks"
    - "optimal dynamic resource allocation for multi antenna broadcasting with heterogeneous delay constrained traffic"
    - "on peak versus average interference power constraints for protecting primary users in cognitive radio networks"
    - "weighted sum rate optimization for cognitive radio mimo broadcast channels"
    - "cognitive radio an information theoretic perspective"
    - "capacity limits of cognitive radio with distributed and dynamic spectral activity"

Connected through hyperedge HE-5 (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 for overlaid wireless networks a cognitive radio network vs a primary network"

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