human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "on the energy distortion tradeoff in the iot"):
  Abstract: The Internet of Things paradigm envisages the presence of many battery-powered sensors and this entails the design of energy-aware protocols. Source coding techniques allow to save some energy by compressing the packets sent over the network, but at the cost of a poorer accuracy in the representation of the data. This paper addresses the problem of designing efficient policies to jointly perform processing and transmission tasks. In particular, we aim at defining an optimal scheduling strategy with the twofold ultimate goal of extending the network lifetime and guaranteeing a low overall distortion of the transmitted data. We propose a Time Division Multiple Access (TDMA)-based access scheme that optimally allocates resources to heterogeneous nodes. We use realistic rate-distortion curves to quantify the impact of compression on the data quality and propose a complete energy model that includes the energy spent for processing and transmitting the data, as well as the circuitry costs. Both full knowledge and statistical knowledge of the wireless channels are considered, and optimal policies are derived for both cases. The overall problem is structured in a modular fashion and solved through convex and alternate programming techniques. Finally, we thoroughly evaluate the proposed algorithms and the influence of the design variables on the system performance adopting parameters of real sensors.

Includes members:
  Member "optimal adaptive random multiaccess in energy harvesting wireless sensor networks":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "game theory for multi access edge computing survey use cases and future trends")
  Member "energy harvesting wireless communications a review of recent advances":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "analysis of d2d communication with rf energy harvesting and interference management")
  Member "joint transmission and energy transfer policies for energy harvesting devices with finite batteries":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "an energy efficient controller for wirelessly powered communication networks")
  Member "energy management policies for energy neutral source channel coding":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "stochastic routing and scheduling policies for energy harvesting communication networks")

Question: Please tell me which class the source paper 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)