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: "contract based cooperative spectrum sharing"
  Abstract: Providing proper economic incentives is essential for the success of dynamic spectrum sharing. Cooperative spectrum sharing is one effective way to achieve this goal. In cooperative spectrum sharing, secondary users (SUs) relay traffics for primary users (PUs), in exchange for dedicated transmission time for the SUs' own communication needs. In this paper, we study the cooperative spectrum sharing under incomplete information, where SUs' types (which capture the relay channel gains and the SUs' power costs) are private information and are not known to the PU. Inspired by the contract theory, we model the network as a labor market. The PU is an employer who offers a contract to the SUs. The contract consists of a set of items representing combinations of spectrum access time (i.e., reward) and relay power (i.e., contribution). The SUs are employees, and each of them selects the best contract item to maximize its payoff. We study the optimal contract design for both weakly and strongly incomplete information scenarios. First, we provide necessary and sufficient conditions for feasible contracts in both scenarios. In the weakly incomplete information scenario, we further derive the optimal contract that achieves the same maximum PU's utility as in the complete information benchmark. In the strongly incomplete information scenario, we propose a Decompose-and-Compare algorithm that achieves a close-to-optimal contract. We further show that the PU's expected utility loss due to the suboptimal algorithm and the strongly incomplete information are both relatively small (less than 2% and 1.3%, respectively, in our numerical results with two SU types).

Connected through hyperedge HE-1 (induced by source paper "offloading in software defined network at edge with information asymmetry a contract theoretical approach"):
  with members:
    - "exploring social ties for enhanced device to device communications in wireless networks"

Connected through hyperedge HE-2 (induced by source paper "improving macrocell small cell coexistence through adaptive interference draining"):
  with members:
    - "a distributed approach to interference alignment in ofdm based two tiered networks"
    - "enhanced intercell interference coordination challenges in heterogeneous networks"
    - "exploiting interference alignment in multi cell cooperative ofdma resource allocation"
    - "cooperative algorithms for mimo interference channels"
    - "on feasibility of interference alignment in mimo interference networks"
    - "downlink interference alignment"
    - "performance of interference alignment in clustered wireless ad hoc networks"
    - "from spectrum pooling to space pooling opportunistic interference alignment in mimo cognitive networks"

Connected through hyperedge HE-3 (induced by source paper "relay selection for ofdm wireless systems under asymmetric information a contract theory based approach"):
  with members:
    - "green cellular networks a survey some research issues and challenges"

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.NI(Networking and Internet Architecture)