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: "multicast with prioritized delivery how fresh is your data"
  Abstract: We consider a multicast network in which real-time status updates generated by a source are replicated and sent to multiple interested receiving nodes through independent links. The receiving nodes are divided into two groups: one priority group consists of $k$ nodes that require the reception of every update packet, the other non-priority group consists of all other nodes without the delivery requirement. Using age of information as a freshness metric, we analyze the time-averaged age at both priority and non-priority nodes. For shifted-exponential link delay distributions, the average age at a priority node is lower than that at a non-priority node due to the delivery guarantee. However, this advantage for priority nodes disappears if the link delay is exponential distributed. Both groups of nodes have the same time-averaged age, which implies that the guaranteed delivery of updates has no effect the time-averaged freshness.

Connected through hyperedge HE-1 (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-2 (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-3 (induced by source paper "age of information for multicast transmission with fixed and random deadlines in iot systems"):
  with members:
    - "age of information for computation intensive messages in mobile edge computing"
    - "average peak age of information minimization in uav assisted iot networks"
    - "economics of age of information management under network externalities"
    - "minimizing the age of information in wireless networks with stochastic arrivals"
    - "broadcast age of information in csma ca based wireless networks"
    - "adaptive coding for information freshness in a two user broadcast erasure channel"
    - "scheduling policies for minimizing age of information in broadcast wireless networks"
    - "age minimal online policies for energy harvesting sensors with random battery recharges"

Connected through hyperedge HE-4 (induced by source paper "on the age of information for multicast transmission with hard deadlines in iot systems"):
  with members:
    - "minimum age of information in the internet of things with non uniform status packet sizes"
    - "scheduling policies for minimizing age of information in broadcast wireless networks"
    - "joint status sampling and updating for minimizing age of information in the internet of things"
    - "status updates through multicast networks"
    - "on the age of information in status update systems with packet management"

Connected through hyperedge HE-5 (induced by source paper "the age of incorrect information a new performance metric for status updates"):
  with members:
    - "age of information with prioritized streams when to buffer preempted packets"
    - "minimizing the age of information noma or oma"
    - "minimizing the age of information in a csma environment"
    - "timely status update in massive iot systems decentralized scheduling for wireless uplinks"
    - "distributed scheduling algorithms for optimizing information freshness in wireless networks"
    - "joint status sampling and updating for minimizing age of information in the internet of things"
    - "age minimal online policies for energy harvesting sensors with random battery recharges"
    - "the age of updates in a simple relay network"

Connected through hyperedge HE-6 (induced by source paper "minimizing the age of information noma or oma"):
  with members:
    - "noma an information theoretic perspective"
    - "minimizing the age of information in a csma environment"
    - "age of information in a network of preemptive servers"
    - "age minimal online policies for energy harvesting sensors with random battery recharges"
    - "the age of updates in a simple relay network"
    - "content based status updates"
    - "on the foundation of noma and its application to 5g cellular networks"
    - "age optimal information updates in multihop networks"

Connected through hyperedge HE-7 (induced by source paper "minimizing the age of information in a csma environment"):
  with members:
    - "age of information in a network of preemptive servers"
    - "timely status update in massive iot systems decentralized scheduling for wireless uplinks"
    - "distributed scheduling algorithms for optimizing information freshness in wireless networks"
    - "age minimal online policies for energy harvesting sensors with random battery recharges"
    - "the age of updates in a simple relay network"
    - "content based status updates"
    - "age optimal information updates in multihop networks"
    - "energy efficient and throughput optimal csma scheme"

Connected through hyperedge HE-8 (induced by source paper "age of information with prioritized streams when to buffer preempted packets"):
  with members:
    - "minimizing the age of information noma or oma"
    - "minimizing the age of information in a csma environment"
    - "age of information in a network of preemptive servers"
    - "age minimal online policies for energy harvesting sensors with random battery recharges"
    - "the age of updates in a simple relay network"
    - "content based status updates"
    - "age optimal information updates in multihop networks"
    - "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)