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 stability of random multiple access with stochastic energy harvesting"):
  Abstract: In this paper, we consider random access by nodes that have energy harvesting capability. Each node is equipped with both a queue for storing the arriving packets and a battery for storing the harvested energy chunks, where the packet arrival and the energy harvesting events are all modeled as discrete-time stochastic processes. In each time slot, each node attempts to transmit the head-of-the-line packet in the queue with some probability if its battery is non-empty, and each transmission consumes one chunk of energy. Therefore, the transmission by one node is not just limited by the availability of packets in the queue but also by the availability of energy chunks in the battery. In most of related previous work, it was implicitly assumed that there exists unlimited energy for transmission, which is impractical in many distributed systems. In this work, we characterize the exact stability region when a pair of bursty nodes, which are harvesting energy from the environment, are randomly accessing a common receiver. The analysis takes into account the compound effects of multi-packet reception capability at the receiver. The contributions in the paper are twofold. First, we accurately assess the effect of limited, but renewable, energy availability due to harvesting on the stability region by comparing against the case of having unlimited energy. Second, the impact of the finite capacity batteries on the achieved stability region is also quantified.

Includes members:
  Member "medium access control protocols for wireless sensor networks with energy harvesting":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "proportional fairness in aloha networks with rf energy harvesting")
  Member "neighbor discovery in a wireless sensor network multipacket reception capability and physical layer signal processing":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "sparse ofdm a compressive sensing approach to asynchronous neighbor discovery")
  Member "optimal utilization of a cognitive shared channel with a rechargeable primary source node":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "wireless network level partial relay cooperation a stable throughput analysis")
  Member "information theoretic analysis of an energy harvesting communication system":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "diffusion based molecular communication with limited molecule production rate")
  Member "efficient energy management policies for networks with energy harvesting sensor nodes":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "kalman prediction based proportional fair resource allocation for a solar powered wireless downlink")
  Member "asymptotic stability region of slotted aloha":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "optimizing information freshness in wireless networks a stochastic geometry approach")

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)