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: "reducing age of information for computation intensive messages via packet replacement"
  Abstract: Freshness of data is an important performance metric for real-time applications, which can be measured by age-of-information. For computation-intensive messages, the embedded information is not available until being computed. In this paper, we study the age-of-information for computation-intensive messages, which are firstly transmitted to a mobile edge server, and then processed in the edge server to extract the embedded information. The packet generation follows zero-wait policy, by which a new packet is generated when the last one is just delivered to the edge server. The queue in front of the edge server adopts one-packet-buffer replacement policy, meaning that only the latest received packet is preserved. We derive the expression of average age-of-information for exponentially distributed transmission time and computing time. With packet replacement, the average age is reduced compared with the case without packet replacement, especially when the transmission rate is close to or greater than the computing rate.

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"
    - "timely distributed computation with stragglers"
    - "age of information in multicast networks with multiple update streams"
    - "age of information for updates with distortion constant and age dependent distortion constraints"

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"
    - "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"
    - "age of information with finite horizon and partial updates"

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"
    - "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"
    - "age of information with finite horizon and partial updates"

Connected through hyperedge HE-4 (induced by source paper "timely status updating through intermittent sensing and transmission"):
  with members:
    - "optimizing information freshness in computing enabled iot networks"
    - "a general formula for the stationary distribution of the age of information and its application to single server queues"
    - "trading off computation with transmission in status update systems"
    - "waiting before serving a companion to packet management in status update systems"
    - "the age of information in networks moments distributions and sampling"
    - "optimal status updating for an energy harvesting sensor with a noisy channel"
    - "can determinacy minimize age of information"
    - "controlling packet drops to improve freshness of information"

Connected through hyperedge HE-5 (induced by source paper "joint transmission and computing scheduling for status update with mobile edge computing"):
  with members:
    - "trading off computation with transmission in status update systems"
    - "age of information for computation intensive messages in mobile edge computing"
    - "timely cloud computing preemption and waiting"
    - "age of information in a network of preemptive servers"
    - "joint information freshness and completion time optimization for vehicular networks"
    - "a survey on mobile edge computing the communication perspective"
    - "age optimal information updates in multihop networks"
    - "age minimal transmission in energy harvesting two hop networks"

Connected through hyperedge HE-6 (induced by source paper "timely distributed computation with stragglers"):
  with members:
    - "straggler mitigation at scale"
    - "trading off computation with transmission in status update systems"
    - "age of information with prioritized streams when to buffer preempted packets"
    - "sampling for remote estimation through queues age of information and beyond"
    - "computation scheduling for distributed machine learning with straggling workers"
    - "age of information for computation intensive messages in mobile edge computing"
    - "age of information for discrete time queues"
    - "on timely channel coding with hybrid arq"

Connected through hyperedge HE-7 (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"
    - "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"
    - "the age of information in networks moments distributions and sampling"

Connected through hyperedge HE-8 (induced by source paper "optimizing information freshness through computation transmission tradeoff and queue management in edge computing"):
  with members:
    - "optimizing information freshness in computing enabled iot networks"
    - "a general formula for the stationary distribution of the age of information and its application to single server queues"
    - "trading off computation with transmission in status update systems"
    - "waiting before serving a companion to packet management in status update systems"
    - "relative age of information a new metric for status update systems"
    - "the age of information in networks moments distributions and sampling"
    - "can determinacy minimize age of information"
    - "the age of updates in a simple relay network"

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)