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: "time and location aware mobile data pricing"
  Abstract: Mobile users' correlated mobility and data consumption patterns often lead to severe cellular network congestion in peak hours and hot spots. This paper presents an optimal design of time and location aware mobile data pricing, which incentivizes users to smooth traffic and reduce network congestion. We derive the optimal pricing scheme through analyzing a two-stage decision process, where the operator determines the time and location aware prices by minimizing his total cost in Stage I, and each mobile user schedules his mobile traffic by maximizing his payoff (i.e., utility minus payment) in Stage II. We formulate the two-stage decision problem as a bilevel optimization problem, and propose a derivative-free algorithm to solve the problem for any increasing concave user utility functions. We further develop low complexity algorithms for the commonly used logarithmic and linear utility functions. The optimal pricing scheme ensures a win-win situation for the operator and users. Simulations show that the operator can reduce the cost by up to 97.52% in the logarithmic utility case and 98.70% in the linear utility case, and users can increase their payoff by up to 79.69% and 106.10% for the two types of utilities, respectively, comparing with a time and location independent pricing benchmark. Our study suggests that the operator should provide price discounts at less crowded time slots and locations, and the discounts need to be significant when the operator's cost of provisioning excessive traffic is high or users' willingness to delay traffic is low.

Connected through hyperedge HE-1 (induced by source paper "duopoly competition for mobile data plans with time flexibility"):
  with members:
    - "economic viability of data trading with rollover"
    - "a novel mobile data contract design with time flexibility"
    - "exploring time flexibility in wireless data plans"
    - "an integrated spectrum and information market for green cognitive communications"
    - "the role of data cap in optimal two part network pricing"
    - "mine gold to deliver green cognitive communications"
    - "economic viability of paris metro pricing for digital services"
    - "a survey of smart data pricing past proposals current plans and future trends"

Connected through hyperedge HE-2 (induced by source paper "economic viability of data trading with rollover"):
  with members:
    - "a novel mobile data contract design with time flexibility"
    - "exploring time flexibility in wireless data plans"
    - "mobile data trading behavioral economics analysis and algorithm design"
    - "a survey of smart data pricing past proposals current plans and future trends"

Connected through hyperedge HE-3 (induced by source paper "dynamic pricing for revenue maximization in mobile social data market with network effects"):
  with members:
    - "mobile data trading behavioral economics analysis and algorithm design"
    - "a socially aware incentive mechanism for mobile crowdsensing service market"
    - "competition and cooperation analysis for data sponsored market a network effects model"
    - "exploiting social tie structure for cooperative wireless networking a social group utility maximization framework"
    - "price discrimination for energy trading in smart grid a game theoretic approach"
    - "a survey of smart data pricing past proposals current plans and future trends"
    - "optimal pricing in networks with externalities"
    - "price based resource allocation for spectrum sharing femtocell networks a stackelberg game approach"

Connected through hyperedge HE-4 (induced by source paper "exploring time flexibility in wireless data plans"):
  with members:
    - "mobile data trading behavioral economics analysis and algorithm design"
    - "the role of data cap in optimal two part network pricing"

Connected through hyperedge HE-5 (induced by source paper "tiered cloud storage via two stage latency aware bidding"):
  with members:
    - "differentiated latency in data center networks with erasure coded files through traffic engineering"
    - "video streaming in distributed erasure coded storage systems stall duration analysis"
    - "joint latency and cost optimization for erasure coded data center storage"
    - "sprout a functional caching approach to minimize service latency in erasure coded storage"
    - "tail index for a distributed storage system with pareto file size distribution"

Connected through hyperedge HE-6 (induced by source paper "mobile data trading behavioral economics analysis and algorithm design"):
  with members:
    - "prospect pricing in cognitive radio networks"
    - "integrating energy storage into the smart grid a prospect theoretic approach"

Connected through hyperedge HE-7 (induced by source paper "pricing of tiered cloud storage via two stage latency aware bidding"):
  with members:
    - "joint latency and cost optimization for erasure coded data center storage"

Connected through hyperedge HE-8 (induced by source paper "optimal pricing and admission control for heterogeneous secondary users"):
  with members:
    - "mine gold to deliver green cognitive communications"
    - "a hybrid pricing framework for tv white space database"
    - "investment and pricing with spectrum uncertainty a cognitive operator s perspective"

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)