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 optimal information gathering and dissemination on graphs"
  Abstract: We consider the problem of timely exchange of updates between a central station and a set of ground terminals $V$, via a mobile agent that traverses across the ground terminals along a mobility graph $G = (V, E)$. We design the trajectory of the mobile agent to minimize peak and average age of information (AoI), two newly proposed metrics for measuring timeliness of information. We consider randomized trajectories, in which the mobile agent travels from terminal $i$ to terminal $j$ with probability $P_{i,j}$. For the information gathering problem, we show that a randomized trajectory is peak age optimal and factor-$8\mathcal{H}$ average age optimal, where $\mathcal{H}$ is the mixing time of the randomized trajectory on the mobility graph $G$. We also show that the average age minimization problem is NP-hard. For the information dissemination problem, we prove that the same randomized trajectory is factor-$O(\mathcal{H})$ peak and average age optimal. Moreover, we propose an age-based trajectory, which utilizes information about current age at terminals, and show that it is factor-$2$ average age optimal in a symmetric setting.

Connected through hyperedge HE-1 (induced by source paper "fundamental limits of age of information in stationary and non stationary environments"):
  with members:
    - "on minimizing the maximum age of information for wireless erasure channels"
    - "age of information in multiple sensing of a single source"
    - "scheduling policies for minimizing age of information in broadcast wireless networks"
    - "user mobility evaluation for 5g small cell networks based on individual mobility model"
    - "on the age of information in status update systems with packet management"

Connected through hyperedge HE-2 (induced by source paper "age of information for discrete time queues"):
  with members:
    - "a general formula for the stationary distribution of the age of information and its application to single server queues"
    - "age delay tradeoffs in single server systems"
    - "age of information in g g 1 1 systems"
    - "can determinacy minimize age of information"
    - "optimizing information freshness in wireless networks under general interference constraints"
    - "the age of updates in a simple relay network"
    - "minimizing the age of the information through queues"
    - "age of information in the presence of error"

Connected through hyperedge HE-3 (induced by source paper "status from a random field how densely should one update"):
  with members:
    - "a general formula for the stationary distribution of the age of information and its application to single server queues"
    - "scheduling policies for minimizing age of information in broadcast wireless networks"
    - "can decentralized status update achieve universally near optimal age of information in wireless multiaccess channels"
    - "information aging through queues a mutual information perspective"
    - "a two step learning and interpolation method for location based channel database"
    - "status updates through m g 1 1 queues with harq"
    - "update or wait how to keep your data fresh"
    - "on the age of information in status update systems with packet management"

Connected through hyperedge HE-4 (induced by source paper "minimizing age in gateway based update systems"):
  with members:
    - "scheduling policies for minimizing age of information in broadcast wireless networks"
    - "age optimal trajectory planning for uav assisted data collection"
    - "age optimal sampling and transmission scheduling in multi source systems"

Connected through hyperedge HE-5 (induced by source paper "straggling for covert message passing on complete graphs"):
  with members:
    - "covert communication over noisy channels a resolvability perspective"
    - "reliable deniable and hidable communication over multipath networks"
    - "coding for fast content download"

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)