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 minimization for an energy harvesting source with updating erasures with and without feedback"
  Abstract: Consider an energy harvesting (EH) sensor that continuously monitors a system and sends time-stamped status update to a destination. The sensor harvests energy from nature and uses it to power its updating operations. The destination keeps track of the system status through the successfully received updates. With the recently introduced information freshness metric "Age of Information" (AoI), our objective is to design optimal online status updating policy to minimize the long-term average AoI at the destination, subject to the energy causality constraint at the sensor. Due to the noisy channel between the sensor and the destination, each transmitted update may be erased with a fixed probability, and the AoI at the destination will be reset to zero only when an update is successfully received. We first consider status updating without feedback available to the sensor and show that the Best-effort Uniform updating (BU) policy is optimal. We then investigate status updating with perfect feedback to the sensor and prove the optimality of the Best-effort Uniform updating with Retransmission (BUR) policy. In order to prove the optimality of the proposed policies, for each case, we first identify a lower bound on the long-term average AoI among a broad class of online policies, and then construct a sequence of virtual policies to approach the lower bound asymptotically. Since those virtual policies are sub-optimal to the original policy, the original policy is thus optimal.

Connected through hyperedge HE-1 (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"
    - "when to preempt age of information minimization under link capacity constraint"
    - "timely lossless source coding for randomly arriving symbols"

Connected through hyperedge HE-2 (induced by source paper "timely synchronization with sporadic status changes"):
  with members:
    - "scheduling to minimize age of synchronization in wireless broadcast networks with random updates"
    - "the age of incorrect information a new performance metric for status updates"
    - "control of status updates for energy harvesting devices that monitor processes with alarms"
    - "timely cloud computing preemption and waiting"
    - "age optimal updates of multiple information flows"
    - "scheduling policies for minimizing age of information in broadcast wireless networks"
    - "to skip or to switch minimizing age of information under link capacity constraint"
    - "age minimal online policies for energy harvesting sensors with random battery recharges"

Connected through hyperedge HE-3 (induced by source paper "risk aware optimization of age of information in the internet of things"):
  with members:
    - "optimized age of information tail for ultra reliable low latency communications in vehicular networks"
    - "a reinforcement learning framework for optimizing age of information in rf powered communication systems"
    - "taming the tail of maximal information age in wireless industrial networks"
    - "a vision of 6g wireless systems applications trends technologies and open research problems"
    - "minimum age of information in the internet of things with non uniform status packet sizes"
    - "reliable transmission of short packets through queues and noisy channels under latency and peak age violation guarantees"
    - "joint status sampling and updating for minimizing age of information in the internet of things"
    - "when to preempt age of information minimization under link capacity constraint"

Connected through hyperedge HE-4 (induced by source paper "trading off computation with transmission in status update systems"):
  with members:
    - "a general formula for the stationary distribution of the age of information and its application to single server queues"
    - "waiting before serving a companion to packet management in status update systems"
    - "reducing age of information for computation intensive messages via packet replacement"
    - "adaptive coding for information freshness in a two user broadcast erasure channel"
    - "using erasure feedback for online timely updating with an energy harvesting sensor"
    - "on peak age of information in data preprocessing enabled iot networks"
    - "relative age of information a new metric for status update systems"
    - "scheduling policies for minimizing age of information in broadcast wireless networks"

Connected through hyperedge HE-5 (induced by source paper "using erasure feedback for online timely updating with an energy harvesting sensor"):
  with members:
    - "online timely status updates with erasures for energy harvesting sensors"
    - "status updates in a multi stream m g 1 1 preemptive queue"
    - "sending information through status updates"
    - "delay and peak age violation probability in short packet transmissions"
    - "content based status updates"
    - "timely lossless source coding for randomly arriving symbols"
    - "age minimal transmission for energy harvesting sensors with finite batteries online policies"
    - "scheduling status updates to minimize age of information with an energy harvesting sensor"

Connected through hyperedge HE-6 (induced by source paper "adaptive coding for information freshness in a two user broadcast erasure channel"):
  with members:
    - "benefits of coding on age of information in broadcast networks"
    - "age optimal transmission of rateless codes in an erasure channel"
    - "optimal age over erasure channels"
    - "scheduling policies for minimizing age of information in broadcast wireless networks"
    - "coded status updates in an energy harvesting erasure channel"
    - "controlling packet drops to improve freshness of information"
    - "when to preempt age of information minimization under link capacity constraint"
    - "timely lossless source coding for randomly arriving symbols"

Connected through hyperedge HE-7 (induced by source paper "active status update packet drop control in an energy harvesting node"):
  with members:
    - "using erasure feedback for online timely updating with an energy harvesting sensor"
    - "online timely status updates with erasures for energy harvesting sensors"
    - "minimizing the age of information from sensors with common observations"
    - "age of information performance of multiaccess strategies with packet management"
    - "the age of updates in a simple relay network"
    - "joint information freshness and completion time optimization for vehicular networks"
    - "scheduling status updates to minimize age of information with an energy harvesting sensor"
    - "optimal status update for age of information minimization with an energy harvesting source"

Connected through hyperedge HE-8 (induced by source paper "average age of information with a backup information source"):
  with members:
    - "age minimal online policies for energy harvesting sensors with random battery recharges"
    - "age minimal transmission for energy harvesting sensors with finite batteries online policies"
    - "scheduling status updates to minimize age of information with an energy harvesting sensor"
    - "average age of information with hybrid arq under a resource constraint"
    - "the age of information real time status updating by multiple sources"

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)