human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "how to price fresh data"):
  Abstract: We introduce the concept of a fresh data market, in which a destination user requests, and pays for, fresh data updates from a source provider. Data freshness is captured by the {\it age of information} (AoI) metric, defined as the time elapsed since the latest update has reached the destination. The source incurs an operational cost, modeled as an increasing convex function of the number of updates. The destination incurs an age-related cost, modeled as an increasing convex function of the AoI. The source charges the destination for each update and designs a pricing mechanism to maximize its profit; the destination on the other hand chooses a data update schedule to minimize the summation of its payments to the source and its age-related cost. The interaction among the source and destination is hence game-theoretic. Motivated by the existing pricing literature, we first study a time-dependent pricing scheme, in which the price for each update depends on when it is requested. We show in this case that the game equilibrium leads to only one data update, which does not yield the maximum profit to the source. This motivates us to consider a quantity-based pricing scheme, in which the price of each update depends on how many updates have been previously requested. We show that among all pricing schemes in which the price of an update may vary according to both time and quantity, the quantity-based pricing scheme performs best: it maximizes the source's profit and minimizes the social cost of the system, defined as the aggregate source's operational cost and the destination's age-related cost. Numerical results show that the optimal quantity-based pricing can be 27% more profitable for the source and incurs 54% less social cost, compared with the optimal time-dependent pricing.

Includes members:
  Member "economics of age of information management under network externalities":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "age of information for multicast transmission with fixed and random deadlines in iot systems")
  Member "timely updates in energy harvesting two hop networks offline and online policies":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "optimizing information freshness in wireless networks a stochastic geometry approach")
  Member "dynamic pricing for controlling age of information":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "regulating competition in age of information under network externalities")
  Member "a dynamic jamming game for real time status updates":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "a non cooperative multiple access game for timely updates")
  Member "joint status sampling and updating for minimizing age of information in the internet of things":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "age of information with gilbert elliot servers and samplers")
  Member "optimizing information freshness in wireless networks under general interference constraints":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "optimizing information freshness in wireless networks a stochastic geometry approach")
  Member "on the role of age of information in internet of things":
    also connected through other hyperedges:
      (none)
  Member "age minimal transmission for energy harvesting sensors with finite batteries online policies":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "urgency of information for context aware timely status updates in remote control systems")

Question: Please tell me which class the source paper 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)