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: "dynamic pricing for controlling age of information"
  Abstract: Fueled by the rapid development of communication networks and sensors in portable devices, today many mobile users are invited by content providers to sense and send back real-time useful information (e.g., traffic observations and sensor data) to keep the freshness of the providers' content updates. However, due to the sampling cost in sensing and transmission, an individual may not have the incentive to contribute the real-time information to help a content provider reduce the age of information (AoI). Accordingly, we propose dynamic pricing for the provider to offer age-dependent monetary returns and encourage users to sample information at different rates over time. This dynamic pricing design problem needs to balance the monetary payments to users and the AoI evolution over time, and is challenging to solve especially under the incomplete information about users' arrivals and their private sampling costs. For analysis tractability, we linearize the nonlinear AoI evolution in the constrained dynamic programming problem, by approximating the dynamic AoI reduction as a time-average term and solving the approximate dynamic pricing in closed-form. Then, we estimate this approximate term based on Brouwer's fixed-point theorem. Finally, we provide the steady-state analysis of the optimized approximate dynamic pricing scheme for an infinite time horizon, and show that the pricing scheme can be further simplified to an e-optimal version without recursive computing over time.

Connected through hyperedge HE-1 (induced by source paper "how to price fresh data"):
  with members:
    - "economics of age of information management under network externalities"
    - "timely updates in energy harvesting two hop networks offline and online policies"
    - "a dynamic jamming game for real time status updates"
    - "joint status sampling and updating for minimizing age of information in the internet of things"
    - "optimizing information freshness in wireless networks under general interference constraints"
    - "on the role of age of information in internet of things"
    - "age minimal transmission for energy harvesting sensors with finite batteries online policies"
    - "optimal status update for age of information minimization with an energy harvesting source"

Connected through hyperedge HE-2 (induced by source paper "regulating competition in age of information under network externalities"):
  with members:
    - "economics of age of information management under network externalities"
    - "how to price fresh data"
    - "scalable mobile crowdsensing via peer to peer data sharing"
    - "age optimal information updates in multihop networks"
    - "minimizing the age of the information through queues"
    - "update or wait how to keep your data fresh"
    - "dynamic routing for social information sharing"
    - "the age of information real time status updating by multiple sources"

Connected through hyperedge HE-3 (induced by source paper "economics of age of information management under network externalities"):
  with members:
    - "how to price fresh data"
    - "age optimal information updates in multihop networks"
    - "update or wait how to keep your data fresh"
    - "optimizing data freshness throughput and delay in multi server information update systems"
    - "on the age of information in status update systems with packet management"
    - "motivating smartphone collaboration in data acquisition and distributed computing"
    - "attack prevention for collaborative spectrum sensing in cognitive radio 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)