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: "combining spot and futures markets a hybrid market approach to dynamic spectrum access"
  Abstract: Dynamic spectrum access (DSA) is a new paradigm of secondary spectrum utilization and sharing. It allows unlicensed secondary users (SUs) to exploit the under-utilized radio spectrum licensed to primary users opportunistically. Market mechanism is a widely-used promising means to regulate the consuming behaviours of users and, hence, achieve the efficient allocation and consumption of limited resources. In this paper, we propose and study a hybrid secondary spectrum market consisting of both the futures market and the spot market, in which SUs (buyers) purchase under-utilized licensed spectrum from a primary spectrum regulator (PR), either through predefined contracts via the futures market, or through spot transactions via the spot market. We focus on the optimal spectrum allocation among SUs in an exogenous hybrid market that maximizes the secondary spectrum utilization efficiency. The problem is challenging due to the stochasticity and asymmetry of network information. To solve this problem, we first derive an o?ff-line optimal allocation policy that maximizes the ex-ante expected spectrum utilization efficiency based on the stochastic distribution of network information. We then propose an on-line VCG auction that determines the real-time allocation and pricing of every spectrum based on the realized network information and the derived allocation policy. We further show that with the spatial frequency reuse, the proposed VCG auction is NP-hard; hence, it is not suitable for on-line implementation, especially in a large-scale market. To this end, we propose a heuristics approach based on an on-line VCG-like mechanism with polynomial-time complexity, and further characterize the corresponding performance loss bound analytically. We finally provide extensive numerical results to evaluate the performance of the proposed solutions.

Connected through hyperedge HE-1 (induced by source paper "scalable mobile crowdsensing via peer to peer data sharing"):
  with members:
    - "economic analysis of crowdsourced wireless community networks"
    - "dynamic routing for social information sharing"
    - "an integrated spectrum and information market for green cognitive communications"
    - "providing long term participation incentive in participatory sensing"
    - "a game theoretic analysis of user behaviors in crowdsourced wireless community networks"
    - "mine gold to deliver green cognitive communications"
    - "hysim a hybrid spectrum and information market for tv white space networks"
    - "distributed time sensitive task selection in mobile crowdsensing"

Connected through hyperedge HE-2 (induced by source paper "data centric mobile crowdsensing"):
  with members:
    - "scalable mobile crowdsensing via peer to peer data sharing"
    - "two sided matching based cooperative spectrum sharing"
    - "economic analysis of crowdsourced wireless community networks"
    - "centurion incentivizing multi requester mobile crowd sensing"
    - "dynamic routing for social information sharing"
    - "providing long term participation incentive in participatory sensing"
    - "distributed time sensitive task selection in mobile crowdsensing"
    - "motivating smartphone collaboration in data acquisition and distributed computing"

Connected through hyperedge HE-3 (induced by source paper "achieving an efficient and fair equilibrium through taxation"):
  with members:
    - "two sided matching based cooperative spectrum sharing"
    - "economic analysis of crowdsourced wireless community networks"
    - "public wi fi monetization via advertising"
    - "efficient and fair collaborative mobile internet access"
    - "an integrated spectrum and information market for green cognitive communications"
    - "mine gold to deliver green cognitive communications"
    - "the robust price of anarchy of altruistic games"
    - "stable nash equilibria of medium access games under symmetric socially altruistic behavior"

Connected through hyperedge HE-4 (induced by source paper "combining guaranteed and spot markets in display advertising selling guaranteed page views with stochastic demand"):
  with members:
    - "pricing average price advertising options when underlying spot market prices are discontinuous"
    - "risk aware dynamic reserve prices of programmatic guarantee in display advertising"
    - "ad exchange envy free auctions with mediators"
    - "efficient delivery policy to minimize user traffic consumption in guaranteed advertising"
    - "a dynamic pricing model for unifying programmatic guarantee and real time bidding in display advertising"
    - "a lattice framework for pricing display advertisement options with the stochastic volatility underlying model"
    - "multi keyword multi click advertisement option contracts for sponsored search"
    - "shale an efficient algorithm for allocation of guaranteed display advertising"

Connected through hyperedge HE-5 (induced by source paper "a double auction mechanism for mobile crowd sensing with data reuse"):
  with members:
    - "providing long term participation incentive in participatory sensing"
    - "fairness and social welfare in incentivizing participatory sensing"
    - "computationally feasible vcg mechanisms"

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)