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 and throughput in a shared access network with heterogeneous traffic"
  Abstract: We consider a cognitive shared access scheme consisting of a high priority primary node and a low priority network with $N$ secondary nodes accessing the spectrum. Assuming bursty traffic at the primary node, saturated queues at the secondary nodes, and multipacket reception capabilities at the receivers, we derive analytical expressions of the time average age of information of the primary node and the throughput of the secondary nodes. We formulate two optimization problems, the first aiming to minimize the time average age of information of the primary node subject to an aggregate secondary throughput requirement. The second problem aims to maximize the aggregate secondary throughput of the network subject to a maximum time average staleness constraint. Our results provide guidelines for the design of a multiple access system with multipacket reception capabilities that fulfils both timeliness and throughput requirements.

Connected through hyperedge HE-1 (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"
    - "reducing age of information for computation intensive messages via packet replacement"
    - "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"

Connected through hyperedge HE-2 (induced by source paper "optimal control of status updates in a multiple access channel with stability constraints"):
  with members:
    - "optimal status updating with a finite battery energy harvesting source"
    - "control of status updates for energy harvesting devices that monitor processes with alarms"
    - "age of information in a multiple access channel with heterogeneous traffic and an energy harvesting node"
    - "optimal status updating for an energy harvesting sensor with a noisy channel"
    - "coded status updates in an energy harvesting erasure channel"
    - "age of information performance of multiaccess strategies with packet management"
    - "optimizing information freshness in wireless networks under general interference constraints"
    - "age minimal online policies for energy harvesting sensors with random battery recharges"

Connected through hyperedge HE-3 (induced by source paper "age of information in a multiple access channel with heterogeneous traffic and an energy harvesting node"):
  with members:
    - "optimal status updating for an energy harvesting sensor with a noisy channel"
    - "sampling for data freshness optimization non linear age functions"
    - "coded status updates in an energy harvesting erasure channel"
    - "optimal policies for status update generation in a wireless system with heterogeneous traffic"
    - "optimizing information freshness in wireless networks under general interference constraints"
    - "age minimal online policies for energy harvesting sensors with random battery recharges"
    - "a game theoretic approach to dsrc and wifi coexistence"
    - "scheduling status updates to minimize age of information with an energy harvesting sensor"

Connected through hyperedge HE-4 (induced by source paper "delay violation probability and age of information interplay in the two user multiple access channel"):
  with members:
    - "age of information in a multiple access channel with heterogeneous traffic and an energy harvesting node"
    - "sampling for data freshness optimization non linear age functions"
    - "optimal policies for status update generation in a wireless system with heterogeneous traffic"
    - "qos provisioning in large wireless networks"
    - "reliable transmission of short packets through queues and noisy channels under latency and peak age violation guarantees"
    - "optimizing information freshness in wireless networks under general interference constraints"
    - "age and value of information non linear age case"
    - "on the delay performance of interference channels"

Connected through hyperedge HE-5 (induced by source paper "the cost of delay in status updates and their value non linear ageing"):
  with members:
    - "a general formula for the stationary distribution of the age of information and its application to single server queues"
    - "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"
    - "control of status updates for energy harvesting devices that monitor processes with alarms"
    - "age of information in a network of preemptive servers"
    - "age optimal updates of multiple information flows"
    - "the age of information in networks moments distributions and sampling"
    - "information aging through queues a mutual information perspective"

Connected through hyperedge HE-6 (induced by source paper "age of information performance of multiaccess strategies with packet management"):
  with members:
    - "a general formula for the stationary distribution of the age of information and its application to single server queues"
    - "minimizing the age of information noma or oma"
    - "average peak age of information minimization in uav assisted iot networks"
    - "age of information in multicast networks with multiple update streams"
    - "timely updates in energy harvesting two hop networks offline and online policies"
    - "age of information in a multiple access channel with heterogeneous traffic and an energy harvesting node"
    - "age of information in a network of preemptive servers"
    - "scheduling policies for minimizing age of information in broadcast wireless networks"

Connected through hyperedge HE-7 (induced by source paper "reinforcement learning based scheduling algorithm for optimizing age of information in ultra reliable low latency networks"):
  with members:
    - "ultra reliable low latency vehicular networks taming the age of information tail"
    - "application of machine learning in wireless networks key techniques and open issues"

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.NI(Networking and Internet Architecture)