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: "forever young aging control for smartphones in hybrid networks"
  Abstract: The demand for Internet services that require frequent updates through small messages, such as microblogging, has tremendously grown in the past few years. Although the use of such applications by domestic users is usually free, their access from mobile devices is subject to fees and consumes energy from limited batteries. If a user activates his mobile device and is in range of a service provider, a content update is received at the expense of monetary and energy costs. Thus, users face a tradeoff between such costs and their messages aging. The goal of this paper is to show how to cope with such a tradeoff, by devising \emph{aging control policies}. An aging control policy consists of deciding, based on the current utility of the last message received, whether to activate the mobile device, and if so, which technology to use (WiFi or 3G). We present a model that yields the optimal aging control policy. Our model is based on a Markov Decision Process in which states correspond to message ages. Using our model, we show the existence of an optimal strategy in the class of threshold strategies, wherein users activate their mobile devices if the age of their messages surpasses a given threshold and remain inactive otherwise. We then consider strategic content providers (publishers) that offer \emph{bonus packages} to users, so as to incent them to download updates of advertisement campaigns. We provide simple algorithms for publishers to determine optimal bonus levels, leveraging the fact that users adopt their optimal aging control strategies. The accuracy of our model is validated against traces from the UMass DieselNet bus network.

Connected through hyperedge HE-1 (induced by source paper "sampling for remote estimation through queues age of information and beyond"):
  with members:
    - "age optimal updates of multiple information flows"
    - "tutorial on uav a blue sky view on wireless communication"
    - "information aging through queues a mutual information perspective"
    - "remote estimation over a packet drop channel with markovian state"
    - "a dynamic jamming game for real time status updates"
    - "joint status sampling and updating for minimizing age of information in the internet of things"
    - "massive uav to ground communication and its stable movement control a mean field approach"
    - "quantifying link stability in ad hoc wireless networks subject to ornstein uhlenbeck mobility"

Connected through hyperedge HE-2 (induced by source paper "age of information in a multiple access channel with heterogeneous traffic and an energy harvesting node"):
  with members:
    - "optimal status updating for an energy harvesting sensor with a noisy channel"
    - "sampling for data freshness optimization non linear age functions"
    - "age of information and throughput in a shared access network with heterogeneous traffic"
    - "coded status updates in an energy harvesting erasure channel"
    - "optimal policies for status update generation in a wireless system with heterogeneous traffic"
    - "optimizing information freshness in wireless networks under general interference constraints"
    - "age minimal online policies for energy harvesting sensors with random battery recharges"
    - "a game theoretic approach to dsrc and wifi coexistence"

Connected through hyperedge HE-3 (induced by source paper "how often should i access my online social networks"):
  with members:
    - "age of information vs value of information scheduling for cellular networked control systems"
    - "performance analysis of online social platforms"
    - "minimizing the age of information in wireless networks with stochastic arrivals"
    - "biases in the facebook news feed a case study on the italian elections"
    - "fairness in online social network timelines measurements models and mechanism design"
    - "age optimal sampling and transmission scheduling in multi source systems"
    - "optimal status update for age of information minimization with an energy harvesting source"
    - "characterizing information diets of social media users"

Connected through hyperedge HE-4 (induced by source paper "delay violation probability and age of information interplay in the two user multiple access channel"):
  with members:
    - "age of information in a multiple access channel with heterogeneous traffic and an energy harvesting node"
    - "sampling for data freshness optimization non linear age functions"
    - "age of information and throughput in a shared access network with heterogeneous traffic"
    - "optimal policies for status update generation in a wireless system with heterogeneous traffic"
    - "qos provisioning in large wireless networks"
    - "reliable transmission of short packets through queues and noisy channels under latency and peak age violation guarantees"
    - "optimizing information freshness in wireless networks under general interference constraints"
    - "age and value of information non linear age case"

Connected through hyperedge HE-5 (induced by source paper "sampling for data freshness optimization non linear age functions"):
  with members:
    - "sampling for remote estimation through queues age of information and beyond"
    - "performance characterization using aoi in a single loop networked control system"
    - "age optimal updates of multiple information flows"
    - "the age of information in networks moments distributions and sampling"
    - "information aging through queues a mutual information perspective"
    - "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"

Connected through hyperedge HE-6 (induced by source paper "average age of information with hybrid arq under a resource constraint"):
  with members:
    - "timely updates over an erasure channel"
    - "status updates through m g 1 1 queues with harq"
    - "update or wait how to keep your data fresh"
    - "age of information in the presence of error"

Connected through hyperedge HE-7 (induced by source paper "stochastic content centric multicast scheduling for cache enabled heterogeneous cellular networks"):
  with members:
    - "wireless caching technical misconceptions and business barriers"
    - "coded retransmission in wireless networks via abstract mdps theory and algorithms"
    - "analysis on cache enabled wireless heterogeneous networks"
    - "optimal dynamic multicast scheduling for cache enabled content centric wireless networks"
    - "cache aided interference channels"
    - "coded caching for delay sensitive content"
    - "capacity and stable scheduling in heterogeneous wireless networks"
    - "multicast aware caching for small cell 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.PF(Performance)