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 "subblock constrained codes for real time simultaneous energy and information transfer"):
  Abstract: Consider an energy-harvesting receiver that uses the same received signal both for decoding information and for harvesting energy, which is employed to power its circuitry. In the scenario where the receiver has limited battery size, a signal with bursty energy content may cause power outage at the receiver since the battery will drain during intervals with low signal energy. In this paper, we consider a discrete memoryless channel and characterize achievable information rates when the energy content in each codeword is regularized by ensuring that sufficient energy is carried within every subblock duration. In particular, we study constant subblock-composition codes (CSCCs) where all subblocks in every codeword have the same fixed composition, and this subblock-composition is chosen to maximize the rate of information transfer while meeting the energy requirement. Compared to constant composition codes (CCCs), we show that CSCCs incur a rate loss and that the error exponent for CSCCs is also related to the error exponent for CCCs by the same rate loss term. We show that CSCC capacity can be improved by allowing different subblocks to have different composition while still meeting the subblock energy constraint. We provide numerical examples highlighting the tradeoff between delivery of sufficient energy to the receiver and achieving high information transfer rates. It is observed that the ability to use energy in real-time imposes less of penalty than the ability to use information in real-time.

Includes members:
  Member "energy harvesting wireless communications a review of recent advances":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "analysis of d2d communication with rf energy harvesting and interference management")
  Member "multiply constant weight codes and the reliability of loop physically unclonable functions":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "generalized sphere packing bound for subblock constrained codes")
  Member "simultaneous wireless information and power transfer in modern communication systems":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "wirelessly powered sensor networks power allocation for channel estimation and energy beamforming")
  Member "constrained codes for joint energy and information transfer":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "deep learning based decoding for constrained sequence codes")
  Member "application of smart antenna technologies in simultaneous wireless information and power transfer":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "simultaneous wireless information and power transfer for decode and forward multihop relay systems in energy constrained iot networks")
  Member "a tight upper bound for the third order asymptotics for most discrete memoryless channels":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "finite sample analysis of image registration")
  Member "importance of symbol equity in coded modulation for power line communications":
    also connected through other hyperedges:
      (none)
  Member "interactive joint transfer of energy and information":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "wirelessly powered data aggregation for iot via over the air functional computation beamforming and power control")

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)