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 "outage capacity of bursty amplify and forward with incremental relaying"):
  Abstract: We derive the outage capacity of a bursty version of the amplify-and-forward (BAF) protocol for small signal-to-noise ratios when incremental relaying is used. We show that the ratio between the outage capacities of BAF and the cut-set bound is independent of the relay position and that BAF is outage optimal for certain conditions on the target rate R. This is in contrast to decode-and-forward with incremental relaying, where the relay location strongly determines the performance of the cooperative protocol. We further derive the outage capacity for a network consisting of an arbitrary number of relay nodes. In this case the relays transmit in subsequent partitions of the overall transmission block and the destination accumulates signal-to-noise ratio until it is able to decode.

Includes members:
  Member "on outage capacity for incremental relaying with imperfect feedback":
    also connected through other hyperedges:
      (none)
  Member "outage capacity of incremental relaying at low signal to noise ratios":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "goodput maximization in cooperative networks with arq")
  Member "outage capacity of the fading relay channel in the low snr regime":
    also connected through other hyperedges:
      (none)

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)