human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "outage capacity of incremental relaying at low signal to noise ratios"
  Abstract: We present the \epsilon-outage capacity of incremental relaying at low signal-to-noise ratios (SNR) in a wireless cooperative network with slow Rayleigh fading channels. The relay performs decode-and-forward and repetition coding is employed in the network, which is optimal in the low SNR regime. We derive an expression on the optimal relay location that maximizes the \epsilon-outage capacity. It is shown that this location is independent of the outage probability and SNR but only depends on the channel conditions represented by a path-loss factor. We compare our results to the \epsilon-outage capacity of the cut-set bound and demonstrate that the ratio between the \epsilon-outage capacity of incremental relaying and the cut-set bound lies within 1/\sqrt{2} and 1. Furthermore, we derive lower bounds on the \epsilon-outage capacity for the case of K relays.

Connected through hyperedge HE-1 (induced by source paper "outage capacity of bursty amplify and forward with incremental relaying"):
  with members:
    - "on outage capacity for incremental relaying with imperfect feedback"
    - "outage capacity of the fading relay channel in the low snr regime"

Connected through hyperedge HE-2 (induced by source paper "goodput maximization in cooperative networks with arq"):
  with members:
    - "coding versus arq in fading channels how reliable should the phy be"

Connected through hyperedge HE-3 (induced by source paper "on outage capacity for incremental relaying with imperfect feedback"):
  with members:
    - "a simple cooperative diversity method based on network path selection"

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