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: "age of information vs value of information scheduling for cellular networked control systems"
  Abstract: Age-of-Information (AoI) is a recently introduced metric for network operation with sensor applications which quantifies the freshness of data. In the context of networked control systems (NCSs), we compare the worth of the AoI metric with the value-of-information (VoI) metric, which is related to the uncertainty reduction in stochastic processes. First, we show that the uncertainty propagates non-linearly over time depending on system dynamics. Next, we define the value of a new update of the process of interest as a function of AoI and system parameters of the NCSs. We use the aggregated update value as a utility for the centralized scheduling problem in a cellular NCS composed of multiple heterogeneous control loops. By conducting a simulative analysis, we show that prioritizing transmissions with higher VoI improves performance of the NCSs compared with providing fair data freshness to all sub-systems equally.

Connected through hyperedge HE-1 (induced by source paper "revealing much while saying less predictive wireless for status update"):
  with members:
    - "sampling for remote estimation through queues age of information and beyond"
    - "ai assisted low information latency wireless networking"
    - "status from a random field how densely should one update"
    - "closed form whittle s index enabled random access for timely status update"
    - "minimizing the age of information in a csma environment"
    - "scheduling policies for minimizing age of information in broadcast wireless networks"
    - "can decentralized status update achieve universally near optimal age of information in wireless multiaccess channels"
    - "distributed scheduling algorithms for optimizing information freshness in wireless networks"

Connected through hyperedge HE-2 (induced by source paper "robustness analysis of networked control systems with aging status"):
  with members:
    - "optimal scheduling for discounted age penalty minimization in multi loop networked control"
    - "scheduling policies for minimizing age of information in broadcast wireless networks"

Connected through hyperedge HE-3 (induced by source paper "how often should i access my online social networks"):
  with members:
    - "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"
    - "the age of information real time status updating by multiple sources"

Connected through hyperedge HE-4 (induced by source paper "probability analysis of age of information in multi hop networks"):
  with members:
    - "a general formula for the stationary distribution of the age of information and its application to single server queues"
    - "performance characterization using aoi in a single loop networked control system"
    - "age of information in a network of preemptive servers"
    - "age optimal trajectory planning for uav assisted data collection"
    - "age optimal information updates in multihop networks"
    - "status updates over unreliable multiaccess channels"
    - "update or wait how to keep your data fresh"
    - "on the age of information in status update systems with packet management"

Connected through hyperedge HE-5 (induced by source paper "a whittle index approach to minimizing functions of age of information"):
  with members:
    - "a general formula for the stationary distribution of the age of information and its application to single server queues"
    - "performance characterization using aoi in a single loop networked control system"
    - "scheduling policies for minimizing age of information in broadcast wireless networks"
    - "the cost of delay in status updates and their value non linear ageing"
    - "optimizing information freshness in wireless networks under general interference constraints"
    - "age and value of information non linear age case"
    - "update or wait how to keep your data fresh"

Connected through hyperedge HE-6 (induced by source paper "age of information with finite horizon and partial updates"):
  with members:
    - "age of information for updates with distortion"
    - "information aging through queues a mutual information perspective"
    - "average age of information with hybrid arq under a resource constraint"
    - "age and value of information non linear age case"
    - "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 "optimal scheduling for discounted age penalty minimization in multi loop networked control"):
  with members:
    - "age optimal information updates in multihop networks"
    - "age and value of information non linear age case"
    - "update or wait how to keep your data fresh"

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)