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: "error exponents for variable length block codes with feedback and cost constraints"
  Abstract: Variable-length block-coding schemes are investigated for discrete memoryless channels with ideal feedback under cost constraints. Upper and lower bounds are found for the minimum achievable probability of decoding error Pe,min as a function of constraints R, P, and tau on the transmission rate, average cost, and average block length, respectively. For given R and P, the lower and upper bounds to the exponent -( ln Pe,min )/tau are asymptotically equal as tau rarr infin. The resulting reliability function,limtaurarrinfin(-In Pe,min)/tau as a function of R and V, is concave in the pair (R,P) and generalizes the linear reliability function of Burnashev to include cost constraints. The results are generalized to a class of discrete-time memoryless channels with arbitrary alphabets, including additive Gaussian noise channels with amplitude and power constraints.

Connected through hyperedge HE-1 (induced by source paper "achievable error exponents of one way and two way awgn channels"):
  with members:
    - "the gaussian channel with noisy feedback improving reliability via interaction"
    - "gaussian channel with noisy feedback and peak energy constraint"
    - "error exponents for the gaussian channel with active noisy feedback"

Connected through hyperedge HE-2 (induced by source paper "moderate deviation asymptotics for variable length codes with feedback"):
  with members:
    - "streaming data transmission in the moderate deviations and central limit regimes"
    - "extrinsic jensen shannon divergence applications to variable length coding"
    - "asymmetric evaluations of erasure and undetected error probabilities"
    - "moderate deviations in channel coding"
    - "moderate deviations of lossy source coding for discrete and gaussian sources"
    - "opportunistic capacity and error exponent regions for compound channel with feedback"
    - "optimal feedback communication via posterior matching"
    - "a simple converse of burnashev s reliability function"

Connected through hyperedge HE-3 (induced by source paper "on gaussian macs with variable length feedback and non vanishing error probabilities"):
  with members:
    - "common message broadcast channels with feedback in the nonasymptotic regime full feedback"
    - "nonasymptotic coding rate bounds for binary erasure channels with feedback"
    - "a proof of the strong converse theorem for gaussian multiple access channels"
    - "variable length coding with stop feedback for the common message broadcast channel in the nonasymptotic regime"
    - "on gaussian channels with feedback under expected power constraints and with non vanishing error probabilities"
    - "on using feedback in a gaussian channel"
    - "broadcasting a common message with variable length stop feedback codes"
    - "on the dispersions of three network information theory problems"

Connected through hyperedge HE-4 (induced by source paper "on awgn channels and gaussian macs with variable length feedback"):
  with members:
    - "nonasymptotic coding rate bounds for binary erasure channels with feedback"
    - "variable length coding with stop feedback for the common message broadcast channel in the nonasymptotic regime"
    - "on gaussian channels with feedback under expected power constraints and with non vanishing error probabilities"
    - "on using feedback in a gaussian channel"
    - "broadcasting a common message with variable length stop feedback codes"
    - "on the dispersions of three network information theory problems"
    - "capacity and coding for the ising channel with feedback"
    - "optimal feedback communication via posterior matching"

Connected through hyperedge HE-5 (induced by source paper "streaming data transmission in the moderate deviations and central limit regimes"):
  with members:
    - "exact moderate deviation asymptotics in streaming data transmission"
    - "asymptotic estimates in information theory with non vanishing error probabilities"
    - "on error exponents and moderate deviations for lossless streaming compression of correlated sources"
    - "convolutional codes with maximum column sum rank for network streaming"
    - "asymmetric evaluations of erasure and undetected error probabilities"
    - "unequal message protection asymptotic and non asymptotic tradeoffs"
    - "the streaming dmt of fading channels"
    - "moderate deviations in channel coding"

Connected through hyperedge HE-6 (induced by source paper "extrinsic jensen shannon divergence applications to variable length coding"):
  with members:
    - "an efficient feedback coding scheme with low error probability for discrete memoryless channels"
    - "active sequential hypothesis testing"
    - "optimal feedback communication via posterior matching"
    - "a simple converse of burnashev s reliability function"

Connected through hyperedge HE-7 (induced by source paper "active sequential hypothesis testing"):
  with members:
    - "controlled sensing for multihypothesis testing"
    - "errors and erasures decoding for block codes with feedback"
    - "non adaptive probabilistic group testing with noisy measurements near optimal bounds with efficient algorithms"
    - "active classification theory and application to underwater inspection"
    - "note on noisy group testing asymptotic bounds and belief propagation reconstruction"
    - "randomized sensor selection in sequential hypothesis testing"
    - "a simple converse of burnashev s reliability function"

Connected through hyperedge HE-8 (induced by source paper "feedback communication systems with limitations on incremental redundancy"):
  with members:
    - "active sequential hypothesis testing"
    - "a rate compatible sphere packing analysis of feedback coding with limited retransmissions"
    - "variations on a theme by schalkwijk and kailath"

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)