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 throughput of channels that wear out"):
  Abstract: This work investigates the fundamental limits of communication over a noisy discrete memoryless channel that wears out, in the sense of signal-dependent catastrophic failure. In particular, we consider a channel that starts as a memoryless binary-input channel and when the number of transmitted ones causes a sufficient amount of damage, the channel ceases to convey signals. Constant composition codes are adopted to obtain an achievability bound and the left-concave right-convex inequality is then refined to obtain a converse bound on the log-volume throughput for channels that wear out. Since infinite blocklength codes will always wear out the channel for any finite threshold of failure and therefore cannot convey information at positive rates, we analyze the performance of finite blocklength codes to determine the maximum expected transmission volume at a given level of average error probability. We show that this maximization problem has a recursive form and can be solved by dynamic programming. Numerical results demonstrate that a sequence of block codes is preferred to a single block code for streaming sources.

Includes members:
  Member "energy harvesting transmitters that heat up throughput maximization under temperature constraints":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "coded status updates in an energy harvesting erasure channel")
  Member "subblock constrained codes for real time simultaneous energy and information transfer":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "rate control for wireless powered communication network with reliability and delay constraints")
  Member "dissipation of information in channels with input constraints":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "broadcasting on random directed acyclic graphs")
  Member "channels with cost constraints strong converse and dispersion":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "finite sample analysis of image registration")
  Member "a tight upper bound for the third order asymptotics for most discrete memoryless channels":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "finite sample analysis of image registration")
  Member "the log volume of optimal codes for memoryless channels asymptotically within a few nats":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "finite sample analysis of image registration")
  Member "an information theoretic characterization of channels that die":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "capacity of electron based communication over bacterial cables the full csi case")
  Member "channels that heat up":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "scheduling a human channel")

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)