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: "optimizing data freshness throughput and delay in multi server information update systems"
  Abstract: In this work, we investigate the design of information-update systems, where incoming update packets are forwarded to a remote destination through multiple servers (each server can be viewed as a wireless channel). One important performance metric of these systems is the age-of-information or simply age, which is defined as the time elapsed since the freshest packet at the destination was generated. Recent studies on information-update systems have shown that the age-of-information can be reduced by intelligently dropping stale packets. However, packet dropping may not be appropriate in many applications, such as news and social updates, where users are interested in not just the latest updates, but also past news. Therefore, all packets may need to be successfully delivered. In this paper, we study how to optimize age-of-information without throughput loss. We consider a general scenario where incoming update packets do not necessarily arrive in the order of their generation times. We prove that a preemptive Last Generated First Served (LGFS) policy simultaneous optimizes the age, throughput, and delay performance in infinite buffer queueing systems. We also show age-optimality for the LGFS policy for any finite queue size. These results hold for arbitrary, including non-stationary, arrival processes. To the best of our knowledge, this paper presents the first optimal result on minimizing the age-of-information in communication networks with an external arrival process of information update packets.

Connected through hyperedge HE-1 (induced by source paper "who should google scholar update more often"):
  with members:
    - "optimal selective encoding for timely updates"
    - "trading off computation with transmission in status update systems"
    - "average peak age of information minimization in uav assisted iot networks"
    - "a reinforcement learning framework for optimizing age of information in rf powered communication systems"
    - "age of information aware cache updating with file and age dependent update durations"
    - "reducing age of information for computation intensive messages via packet replacement"
    - "timely distributed computation with stragglers"
    - "age of information in multicast networks with multiple update streams"

Connected through hyperedge HE-2 (induced by source paper "partial updates losing information for freshness"):
  with members:
    - "optimal selective encoding for timely updates"
    - "trading off computation with transmission in status update systems"
    - "on timely channel coding with hybrid arq"
    - "reducing age of information for computation intensive messages via packet replacement"
    - "timely distributed computation with stragglers"
    - "age of information in multicast networks with multiple update streams"
    - "age of information for updates with distortion"
    - "using erasure feedback for online timely updating with an energy harvesting sensor"

Connected through hyperedge HE-3 (induced by source paper "optimal selective encoding for timely updates"):
  with members:
    - "trading off computation with transmission in status update systems"
    - "on timely channel coding with hybrid arq"
    - "reducing age of information for computation intensive messages via packet replacement"
    - "timely distributed computation with stragglers"
    - "age of information in multicast networks with multiple update streams"
    - "age of information in g g 1 1 systems age expressions bounds special cases and optimization"
    - "age of information for updates with distortion"
    - "using erasure feedback for online timely updating with an energy harvesting sensor"

Connected through hyperedge HE-4 (induced by source paper "timely updates by multiple sources the m m 1 queue revisited"):
  with members:
    - "average age of information for a multi source m m 1 queueing model with packet management"
    - "a general formula for the stationary distribution of the age of information and its application to single server queues"
    - "on the age of information in multi source queueing models"
    - "age optimal updates of multiple information flows"
    - "the age of information in networks moments distributions and sampling"
    - "can decentralized status update achieve universally near optimal age of information in wireless multiaccess channels"
    - "to skip or to switch minimizing age of information under link capacity constraint"
    - "coded status updates in an energy harvesting erasure channel"

Connected through hyperedge HE-5 (induced by source paper "non linear age of information in a discrete time queue stationary distribution and average performance analysis"):
  with members:
    - "a general formula for the stationary distribution of the age of information and its application to single server queues"
    - "sampling for remote estimation through queues age of information and beyond"
    - "age of information for discrete time queues"
    - "on the distribution of aoi for the gi gi 1 1 and gi gi 1 2 systems exact expressions and bounds"
    - "age of information in g g 1 1 systems age expressions bounds special cases and optimization"
    - "the distribution of age of information performance measures for message processing systems"
    - "age of information in a network of preemptive servers"
    - "the age of information in networks moments distributions and sampling"

Connected through hyperedge HE-6 (induced by source paper "information freshness for timely detection of status changes"):
  with members:
    - "optimal information updating based on value of information"
    - "the age of incorrect information a new performance metric for status updates"
    - "minimum age of information in the internet of things with non uniform status packet sizes"
    - "adaptive coding for information freshness in a two user broadcast erasure channel"
    - "information aging through queues a mutual information perspective"
    - "coded status updates in an energy harvesting erasure channel"
    - "age of information minimization for an energy harvesting source with updating erasures with and without feedback"
    - "when to preempt age of information minimization under link capacity constraint"

Connected through hyperedge HE-7 (induced by source paper "optimal sampling and scheduling for timely status updates in multi source networks"):
  with members:
    - "optimizing information freshness using low power status updates via sleep wake scheduling"
    - "age optimal updates of multiple information flows"
    - "scheduling policies for minimizing age of information in broadcast wireless networks"
    - "distributed scheduling algorithms for optimizing information freshness in wireless networks"
    - "optimizing information freshness in wireless networks under general interference constraints"
    - "age optimal sampling and transmission scheduling in multi source systems"
    - "optimizing age of information in wireless networks with perfect channel state information"
    - "scheduling policies for age minimization in wireless networks with unknown channel state"

Connected through hyperedge HE-8 (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"
    - "optimal scheduling of multiple sensors with packet length constraint"
    - "the age of information real time status updating by multiple sources"
    - "on the age of information in status update systems with packet management"

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)