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: "coded status updates in an energy harvesting erasure channel"
  Abstract: We consider an energy harvesting transmitter sending status updates to a receiver over an erasure channel, where each status update is of length $k$ symbols. The energy arrivals and the channel erasures are independent and identically distributed (i.i.d.) and Bernoulli distributed in each slot. In order to combat the effects of the erasures in the channel and the uncertainty in the energy arrivals, we use channel coding to encode the status update symbols. We consider two types of channel coding: maximum distance separable (MDS) codes and rateless erasure codes. For each of these models, we study two achievable schemes: best-effort and save-and-transmit. In the best-effort scheme, the transmitter starts transmission right away, and sends a symbol if it has energy. In the save-and-transmit scheme, the transmitter remains silent in the beginning in order to save some energy to minimize energy outages in future slots. We analyze the average age of information (AoI) under each of these policies. We show through numerical results that as the average recharge rate decreases, MDS coding with save-and-transmit outperforms all best-effort schemes. We show that rateless coding with save-and-transmit outperforms all the other schemes.

Connected through hyperedge HE-1 (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"
    - "distributed scheduling algorithms for optimizing information freshness in wireless networks"

Connected through hyperedge HE-2 (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"
    - "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"
    - "timely lossless source coding for randomly arriving symbols"

Connected through hyperedge HE-3 (induced by source paper "timely updates in energy harvesting two hop networks offline and online policies"):
  with members:
    - "using erasure feedback for online timely updating with an energy harvesting sensor"
    - "online timely status updates with erasures for energy harvesting sensors"
    - "optimal status updating for an energy harvesting sensor with a noisy channel"
    - "status updates in a multi stream m g 1 1 preemptive queue"
    - "age minimal online policies for energy harvesting sensors with random battery recharges"
    - "sending information through status updates"
    - "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-4 (induced by source paper "age of information for updates with distortion constant and age dependent distortion constraints"):
  with members:
    - "age of information for computation intensive messages in mobile edge computing"
    - "age of information aware cache updating with file and age dependent update durations"
    - "timely distributed computation with stragglers"
    - "age of information for updates with distortion"
    - "towards the tradeoff between service performance and information freshness"
    - "age of information with finite horizon and partial updates"
    - "online timely status updates with erasures for energy harvesting sensors"
    - "minimizing age of information with soft updates"

Connected through hyperedge HE-5 (induced by source paper "age of information scaling in large networks with hierarchical cooperation"):
  with members:
    - "age of information for discrete time queues"
    - "waiting before serving a companion to packet management in status update systems"
    - "age of information in multicast networks with multiple update streams"
    - "online timely status updates with erasures for energy harvesting sensors"
    - "timely status update in massive iot systems decentralized scheduling for wireless uplinks"
    - "age of information in g g 1 1 systems"
    - "age minimal online policies for energy harvesting sensors with random battery recharges"
    - "age of information scaling in large networks"

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"
    - "controlling packet drops to improve freshness of information"
    - "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"
    - "timely lossless source coding for randomly arriving symbols"

Connected through hyperedge HE-7 (induced by source paper "optimal control of status updates in a multiple access channel with stability constraints"):
  with members:
    - "optimal status updating with a finite battery energy harvesting source"
    - "control of status updates for energy harvesting devices that monitor processes with alarms"
    - "age of information in a multiple access channel with heterogeneous traffic and an energy harvesting node"
    - "optimal status updating for an energy harvesting sensor with a noisy channel"
    - "age of information and throughput in a shared access network with heterogeneous traffic"
    - "age of information performance of multiaccess strategies with packet management"
    - "optimizing information freshness in wireless networks under general interference constraints"
    - "age minimal online policies for energy harvesting sensors with random battery recharges"

Connected through hyperedge HE-8 (induced by source paper "on timely channel coding with hybrid arq"):
  with members:
    - "age optimal transmission of rateless codes in an erasure channel"
    - "optimal age over erasure channels"
    - "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"
    - "delay and peak age violation probability in short packet transmissions"
    - "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"
    - "average age of information with hybrid arq under a resource constraint"

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)