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: "feedback communication systems with limitations on incremental redundancy"
  Abstract: This paper explores feedback systems using incremental redundancy (IR) with noiseless transmitter confirmation (NTC). For IR-NTC systems based on {\em finite-length} codes (with blocklength $N$) and decoding attempts only at {\em certain specified decoding times}, this paper presents the asymptotic expansion achieved by random coding, provides rate-compatible sphere-packing (RCSP) performance approximations, and presents simulation results of tail-biting convolutional codes. #R##N#The information-theoretic analysis shows that values of $N$ relatively close to the expected latency yield the same random-coding achievability expansion as with $N = \infty$. However, the penalty introduced in the expansion by limiting decoding times is linear in the interval between decoding times. For binary symmetric channels, the RCSP approximation provides an efficiently-computed approximation of performance that shows excellent agreement with a family of rate-compatible, tail-biting convolutional codes in the short-latency regime. For the additive white Gaussian noise channel, bounded-distance decoding simplifies the computation of the marginal RCSP approximation and produces similar results as analysis based on maximum-likelihood decoding for latencies greater than 200. The efficiency of the marginal RCSP approximation facilitates optimization of the lengths of incremental transmissions when the number of incremental transmissions is constrained to be small or the length of the incremental transmissions is constrained to be uniform after the first transmission. Finally, an RCSP-based decoding error trajectory is introduced that provides target error rates for the design of rate-compatible code families for use in feedback communication systems.

Connected through hyperedge HE-1 (induced by source paper "optimizing transmission lengths for limited feedback with non binary ldpc examples"):
  with members:
    - "isn t hybrid arq sufficient"
    - "protograph based raptor like ldpc codes"
    - "reliability output decoding of tail biting convolutional codes"
    - "a hybrid arq scheme based on polar codes"
    - "polar coded harq scheme with chase combining"
    - "a rate compatible sphere packing analysis of feedback coding with limited retransmissions"

Connected through hyperedge HE-2 (induced by source paper "towards massive ultra reliable and low latency wireless the art of sending short packets"):
  with members:
    - "asymptotic estimates in information theory with non vanishing error probabilities"
    - "variable length convolutional coding for short blocklengths with decision feedback"
    - "unified scaling of polar codes error exponent scaling exponent moderate deviations and error floors"
    - "finite snr bounds on the sum rate capacity of rayleigh block fading multiple access channels with no a priori csi"
    - "finite length scaling for polar codes"
    - "diversity versus multiplexing at finite blocklength"
    - "optimum power control at finite blocklength"
    - "ultra reliable communication in 5g wireless systems"

Connected through hyperedge HE-3 (induced by source paper "variable length convolutional coding for short blocklengths with decision feedback"):
  with members:
    - "convolutional code specific crc code design"
    - "extrinsic jensen shannon divergence applications to variable length coding"
    - "green communication via type i arq finite block length analysis"
    - "finite block length analysis of the incremental redundancy harq"
    - "reliability output decoding of tail biting convolutional codes"
    - "quasi static simo fading channels at finite blocklength"
    - "a hybrid arq scheme based on polar codes"
    - "reliability based error detection for feedback communication with low latency"

Connected through hyperedge HE-4 (induced by source paper "towards massive ultra reliable and low latency wireless communication with short packets"):
  with members:
    - "short packet communications over multiple antenna rayleigh fading channels"
    - "asymptotic estimates in information theory with non vanishing error probabilities"
    - "the third order term in the normal approximation for the awgn channel"
    - "variable length convolutional coding for short blocklengths with decision feedback"
    - "finite snr bounds on the sum rate capacity of rayleigh block fading multiple access channels with no a priori csi"
    - "finite length scaling for polar codes"
    - "ultra reliable communication in 5g wireless systems"
    - "improved bounds on the finite length scaling of polar codes"

Connected through hyperedge HE-5 (induced by source paper "fixed error asymptotics for erasure and list decoding"):
  with members:
    - "the third order term in the normal approximation for the awgn channel"
    - "list decoding random coding exponents and expurgated exponents"
    - "on the dispersions of three network information theory problems"
    - "a tight upper bound for the third order asymptotics for most discrete memoryless channels"
    - "erasure list exponents for slepian wolf decoding"
    - "reliability based error detection for feedback communication with low latency"
    - "the third order term in the normal approximation for singular channels"
    - "the log volume of optimal codes for memoryless channels asymptotically within a few nats"

Connected through hyperedge HE-6 (induced by source paper "protograph based raptor like ldpc codes"):
  with members:
    - "analysis and design of raptor codes for joint decoding using information content evolution"

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)