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: "optimal scheduling of multiple sensors with packet length constraint"
  Abstract: This paper considers the problem of sensory data scheduling of multiple processes. There are $n$ independent linear time-invariant processes and a remote estimator monitoring all the processes. Each process is measured by a sensor, which sends its local state estimate to the remote estimator. The sizes of the packets are different due to different dimensions of each process, and thus it may take different lengths of time steps for the sensors to send their data. Because of bandwidth limitation, only a portion of all the sensors are allowed to transmit. Our goal is to minimize the average of estimation error covariance of the whole system at the remote estimator. The problem is formulated as a Markov decision process (MDP) with average cost over an infinite time horizon. We prove the existence of a deterministic and stationary policy for the problem. We also find that the optimal policy has a consistent behavior and threshold type structure. A numerical example is provided to illustrate our main results.

Connected through hyperedge HE-1 (induced by source paper "anti aging scheduling in single server queues a systematic and comparative study"):
  with members:
    - "a general formula for the stationary distribution of the age of information and its application to single server queues"
    - "age delay tradeoffs in single server systems"
    - "status updates in a multi stream m g 1 1 preemptive queue"
    - "delay and peak age violation probability in short packet transmissions"
    - "optimizing data freshness throughput and delay in multi server information update systems"
    - "the age of information real time status updating by multiple sources"
    - "on the age of information in status update systems with packet management"

Connected through hyperedge HE-2 (induced by source paper "minimum age of information in the internet of things with non uniform status packet sizes"):
  with members:
    - "average peak age of information minimization in uav assisted iot networks"
    - "age optimal transmission of rateless codes in an erasure channel"
    - "beyond 5g with uavs foundations of a 3d wireless cellular network"
    - "a reinforcement learning approach to age of information in multi user networks"
    - "can decentralized status update achieve universally near optimal age of information in wireless multiaccess channels"
    - "sampling for data freshness optimization non linear age functions"
    - "controlling packet drops to improve freshness of information"
    - "joint status sampling and updating for minimizing age of information in the internet of things"

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.SY(Systems and Control)