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: "uplink age of information of unilaterally powered two way data exchanging systems"
  Abstract: We consider a two-way data exchanging system where a master node transfers energy and data packets to a slave node alternatively. The slave node harvests the transferred energy and performs information transmission as long as it has sufficient energy for current block, i.e., according to the best-effort policy. We examine the freshness of the received packets at the master node in terms of age of information (AoI), which is defined as the time elapsed after the generation of the latest received packet. We derive average uplink AoI and uplink data rate as functions of downlink data rate in closed form. The obtained results illustrate the performance limit of the unilaterally powered two-way data exchanging system in terms of timeliness and efficiency. The results also specify the achievable tradeoff between the data rates of the two-way data exchanging system.

Connected through hyperedge HE-1 (induced by source paper "energy harvesting powered sensing in iot timeliness versus distortion"):
  with members:
    - "distributed sensing with orthogonal multiple access to code or not to code"
    - "timely updates in energy harvesting two hop networks offline and online policies"
    - "scheduling status updates to minimize age of information with an energy harvesting sensor"
    - "optimal status update for age of information minimization with an energy harvesting source"
    - "optimal power control for transmitting correlated sources with energy harvesting constraints"
    - "energy harvesting wireless communications a review of recent advances"
    - "delay limited source and channel coding of quasi stationary sources over block fading channels design and scaling laws"

Connected through hyperedge HE-2 (induced by source paper "optimal online transmission policy in wireless powered networks with urgency aware age of information"):
  with members:
    - "optimal status update for age of information minimization with an energy harvesting source"
    - "group cooperation with optimal resource allocation in wireless powered communication networks"
    - "waveform design for wireless power transfer"
    - "update or wait how to keep your data fresh"
    - "simultaneous wireless information and power transfer in modern communication systems"
    - "mimo broadcasting for simultaneous wireless information and power transfer"

Connected through hyperedge HE-3 (induced by source paper "broadcast age of information in csma ca based wireless networks"):
  with members:
    - "update or wait how to keep your data fresh"
    - "optimizing data freshness throughput and delay in multi server information update systems"
    - "throughput optimal multihop broadcast on directed acyclic wireless networks"
    - "5g ultra dense cellular networks"

Connected through hyperedge HE-4 (induced by source paper "weighted sum average age of information in unilaterally powered two way data exchanging systems"):
  with members:
    - "wireless powered user cooperative computation in mobile edge computing systems"
    - "update or wait how to keep your data fresh"
    - "a queueing characterization of information transmission over block fading rayleigh channels in the low snr regime"

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)