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: "robust energy harvesting based on a stackelberg game"
  Abstract: We study a Stackelberg game between a base station and a multiantenna power beacon for wireless energy harvesting in a multiple sensor node scenario. Assuming imperfect CSI between the sensor nodes and the power beacon, we propose a utility function that is based on  throughput nonoutage probability  at the base station. We provide an analytical solution for the equilibrium in case of a single sensor node. For the general case consisting of multiple sensor nodes, we provide upper and lower bounds on the power and price (players’ strategies). We compare the bounds with solutions resulting from an exhaustive search and a relaxed semidefinite program, and find the upper bound to be tight.

Connected through hyperedge HE-1 (induced by source paper "incentive mechanism design for wireless energy harvesting based internet of things"):
  with members:
    - "energy efficient resource allocation in machine to machine communications with multiple access and energy harvesting for iot"
    - "a contract based incentive mechanism for energy harvesting based internet of things"
    - "wirelessly powered communication networks with short packets"
    - "distributed and optimal resource allocation for power beacon assisted wireless powered communications"
    - "distributed power splitting for swipt in relay interference channels using game theory"
    - "wireless networks with rf energy harvesting a contemporary survey"
    - "throughput maximization in wireless powered communication networks"
    - "internet of things iot a vision architectural elements and future directions"

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)