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: "benefits of coding on age of information in broadcast networks"
  Abstract: Age of Information (AoI) is studied in two-user broadcast networks with feedback, and lower and upper bounds are derived on the expected weighted sum AoI of the users. In particular, a class of simple coding actions is considered and within this class, randomized and deterministic policies are devised. Explicit conditions are found for symmetric dependent channels under which coded randomized policies strictly outperform the corresponding uncoded policies. Similar behavior is numerically shown for deterministic policies.

Connected through hyperedge HE-1 (induced by source paper "adaptive coding for information freshness in a two user broadcast erasure channel"):
  with members:
    - "age optimal transmission of rateless codes in an erasure channel"
    - "optimal age over erasure channels"
    - "scheduling policies for minimizing age of information in broadcast wireless networks"
    - "coded status updates in an energy harvesting erasure channel"
    - "controlling packet drops to improve freshness of information"
    - "age of information minimization for an energy harvesting source with updating erasures with and without feedback"
    - "when to preempt age of information minimization under link capacity constraint"
    - "timely lossless source coding for randomly arriving symbols"

Connected through hyperedge HE-2 (induced by source paper "age of information in random access channels"):
  with members:
    - "minimizing the age of information in wireless networks with stochastic arrivals"
    - "optimal age over erasure channels"
    - "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"
    - "timely status update in massive iot systems decentralized scheduling for wireless uplinks"
    - "distributed scheduling algorithms for optimizing information freshness in wireless networks"
    - "age of information performance of multiaccess strategies with packet management"
    - "solving fractional polynomial problems by polynomial optimization theory"

Connected through hyperedge HE-3 (induced by source paper "on the age of information in erasure channels with feedback"):
  with members:
    - "a reinforcement learning framework for optimizing age of information in rf powered communication systems"
    - "age of information in multiple sensing of a single source"
    - "optimal age over erasure channels"
    - "adaptive coding for information freshness in a two user broadcast erasure channel"
    - "timely updates over an erasure channel"
    - "status updates through m g 1 1 queues with harq"
    - "the age of information real time status updating by multiple sources"
    - "on the age of information in status update systems with packet management"

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)