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: "a dynamic jamming game for real time status updates"
  Abstract: We study timely status updates of a real-time system in an adversarial setting. The system samples a physical process, and sends the samples from the source (e.g., a sensor) to the destination (e.g, a control center) through a channel. For real-time monitoring/control tasks, it is crucial for the system to update the status of the physical process "timely". We measure the timeliness of status updates by the time elapsed since the latest update at the destination was generated at the source, and define the time elapsed as age of information, or age in short. To sabotage the system, an attacker aims to maximize the age by jamming the channel and hence causing delay in status updates. The system aims to minimize the age by judiciously choosing when to sample and send the updates. We model the ongoing repeated interaction between the attacker and the system as a dynamic game. In each stage game, the attacker chooses the jamming time according to the jamming time distribution, and the system responds by delaying the sampling according to the sampling policy. We prove that there exists a unique stationary equilibrium in the game, and provide a complete analytical characterization of the equilibrium. Our results shed lights on how the attacker sabotages the system and how the system should defend against the attacker.

Connected through hyperedge HE-1 (induced by source paper "a non cooperative multiple access game for timely updates"):
  with members:
    - "on the optimality of the whittle s index policy for minimizing the age of information"
    - "coexistence of age and throughput optimizing networks a game theoretic approach"
    - "age of information in random access channels"
    - "age of information performance of multiaccess strategies with packet management"
    - "a game theoretic approach to dsrc and wifi coexistence"

Connected through hyperedge HE-2 (induced by source paper "coexistence of age and throughput optimizing networks a spectrum sharing game"):
  with members:
    - "coexistence of age and throughput optimizing networks a game theoretic approach"
    - "a game theoretic approach to dsrc and wifi coexistence"
    - "update or wait how to keep your data fresh"
    - "co primary inter operator spectrum sharing over a limited spectrum pool using repeated games"

Connected through hyperedge HE-3 (induced by source paper "secure status updates under eavesdropping age of information based physical layer security metrics"):
  with members:
    - "age of information dependent random access for massive iot networks"
    - "principles of physical layer security in multiuser wireless networks a survey"

Connected through hyperedge HE-4 (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"
    - "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"
    - "optimizing information freshness in wireless networks under general interference constraints"

Connected through hyperedge HE-5 (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"
    - "dynamic pricing for controlling age of information"
    - "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-6 (induced by source paper "coexistence of age and throughput optimizing networks competition vs cooperation"):
  with members:
    - "status updates over unreliable multiaccess channels"
    - "update or wait how to keep your data fresh"
    - "co primary inter operator spectrum sharing over a limited spectrum pool using repeated games"

Connected through hyperedge HE-7 (induced by source paper "coexistence of age and throughput optimizing networks a game theoretic approach"):
  with members:
    - "a game theoretic approach to dsrc and wifi coexistence"
    - "status updates over unreliable multiaccess channels"
    - "update or wait how to keep your data fresh"

Connected through hyperedge HE-8 (induced by source paper "the age of information in networks moments distributions and sampling"):
  with members:
    - "a general formula for the stationary distribution of the age of information and its application to single server queues"
    - "age of information in a network of preemptive servers"
    - "age optimal updates of multiple information flows"
    - "can decentralized status update achieve universally near optimal age of information in wireless multiaccess channels"
    - "minimizing content staleness in dynamo style replicated storage systems"
    - "to skip or to switch minimizing age of information under link capacity constraint"
    - "coded status updates in an energy harvesting erasure channel"
    - "distributed scheduling algorithms for optimizing information freshness in wireless 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)