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: "capacity of remotely powered communication"
  Abstract: Motivated by recent developments in wireless power transfer, we study communication with a remotely powered transmitter. We propose an information-theoretic model where a charger can dynamically decide on how much power to transfer to the transmitter based on its side information regarding the communication, while the transmitter needs to dynamically adopt its coding strategy to its instantaneous energy state, which in turn depends on the actions previously taken by the charger. We characterize the capacity as n-letter mutual information rate under various levels of side information available at the charger. In some special cases, motivated by different settings of practical interest, we simplify these expressions to single-letter form, or provide an algorithm to efficiently compute capacity using dynamic programming. Our results provide some surprising insights on how side information at the charger can be used to increase the overall capacity of the system.

Connected through hyperedge HE-1 (induced by source paper "efficient fair and qos aware policies for wirelessly powered communication networks"):
  with members:
    - "online policies for throughput maximization of energy constrained wireless powered communication systems"
    - "optimal and near optimal policies for wireless power transfer in energy limited and power limited scenarios"
    - "optimal hierarchical radio resource management for hetnets with flexible backhaul"
    - "distributed wireless power transfer with energy feedback"
    - "theory and experiment for wireless powered sensor networks how to keep sensors alive"
    - "battery powered devices in wpcns"
    - "wireless powered communication opportunities and challenges"
    - "wireless power transfer survey and roadmap"

Connected through hyperedge HE-2 (induced by source paper "analog spatial cancellation for tackling the near far problem in wirelessly powered communications"):
  with members:
    - "wireless charging technologies fundamentals standards and network applications"
    - "wireless powered communication opportunities and challenges"
    - "wireless powered relays in cooperative communications time switching relaying protocols and throughput analysis"
    - "towards 1 gbps ue in cellular systems understanding ultra dense small cell deployments"
    - "energy harvesting wireless communications a review of recent advances"
    - "throughput optimization for massive mimo systems powered by wireless energy transfer"
    - "enhancing wireless information and power transfer by exploiting multi antenna techniques"
    - "spatial throughput maximization of wireless powered communication networks"

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)