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 for updates with distortion"
  Abstract: We consider an information update system where an information receiver requests updates from an information provider in order to minimize its age of information. The updates are generated at the transmitter as a result of completing a set of tasks such as collecting data and performing computations. We refer to this as the update generation process. We model the $quality$ (i.e., $distortion$) of an update as an increasing (resp. decreasing) function of the processing time spent while generating the update at the transmitter. While processing longer at the transmitter results in a better quality (lower distortion) update, it causes the update to age. We determine the age-optimal policies for the update request times at the receiver and update processing times at the transmitter subject to a minimum required quality (maximum allowed distortion) constraint on the updates.

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"
    - "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"
    - "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"
    - "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 "age of information with gilbert elliot servers and samplers"):
  with members:
    - "partial updates losing information for freshness"
    - "optimal selective encoding for timely updates"
    - "who should google scholar update more often"
    - "age of information with prioritized streams when to buffer preempted packets"
    - "age of information for discrete time queues"
    - "on timely channel coding with hybrid arq"
    - "timely distributed computation with stragglers"
    - "age of information in multicast networks with multiple update streams"

Connected through hyperedge HE-5 (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-6 (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"
    - "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"
    - "optimal status updating for an energy harvesting sensor with a noisy channel"

Connected through hyperedge HE-7 (induced by source paper "age of information aware cache updating with file and age dependent update durations"):
  with members:
    - "scheduling to minimize age of synchronization in wireless broadcast networks with random updates"
    - "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"
    - "when to preempt age of information minimization under link capacity constraint"
    - "scheduling policies for age minimization in wireless networks with unknown channel state"
    - "the age of information real time status updating by multiple sources"
    - "robust monotonic optimization framework for multicell miso systems"

Connected through hyperedge HE-8 (induced by source paper "age of information with finite horizon and partial updates"):
  with members:
    - "age of information vs value of information scheduling for cellular networked control systems"
    - "information aging through queues a mutual information perspective"
    - "average age of information with hybrid arq under a resource constraint"
    - "age and value of information non linear age case"
    - "update or wait how to keep your data fresh"
    - "age of information in the presence of error"

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)