human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "age of information aware cache updating with file and age dependent update durations"):
  Abstract: We consider a system consisting of a library of time-varying files, a server that at all times observes the current version of all files, and a cache that at the beginning stores the current versions of all files but afterwards has to update %fresh versions of these files from the server. Unlike previous works, the update duration is not constant but depends on the file and its Age of Information (AoI), i.e., of the time elapsed since it was last updated. The goal of this work is to design an update policy that minimizes the average AoI of all files with respect to a given popularity distribution. Actually a relaxed problem, close to the original optimization problem, is solved and a practical update policy is derived. The update policy relies on the file popularity and on the functions that characterize the update durations of the files depending on their AoI. Numerical simulations show a significant improvement of this new update policy compared to the so-called square-root policy that is optimal under file-independent and constant update durations.

Includes members:
  Member "scheduling to minimize age of synchronization in wireless broadcast networks with random updates":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "minimizing age of information with power constraints multi user opportunistic scheduling in multi state time varying channels")
  Member "age of information for updates with distortion":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "who should google scholar update more often")
  Member "scheduling policies for minimizing age of information in broadcast wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "who should google scholar update more often")
  Member "joint status sampling and updating for minimizing age of information in the internet of things":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "age of information with gilbert elliot servers and samplers")
  Member "when to preempt age of information minimization under link capacity constraint":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "information freshness for timely detection of status changes")
  Member "scheduling policies for age minimization in wireless networks with unknown channel state":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "timely updates by multiple sources the m m 1 queue revisited")
  Member "the age of information real time status updating by multiple sources":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "timely updates by multiple sources the m m 1 queue revisited")
  Member "robust monotonic optimization framework for multicell miso systems":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "robust resource allocation for pd noma based miso heterogeneous networks with comp technology")

Question: Please tell me which class the source paper 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)