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: "a simple converse of burnashev s reliability function"
  Abstract: In a remarkable paper published in 1976, Burnashev determined the reliability function of variable-length block codes over discrete memoryless channels (DMCs) with feedback. Subsequently, an alternative achievability proof was obtained by Yamamoto and Itoh via a particularly simple and instructive scheme. Their idea is to alternate between a communication and a confirmation phase until the receiver detects the codeword used by the sender to acknowledge that the message is correct. We provide a converse that parallels the Yamamoto-Itoh achievability construction. Besides being simpler than the original, the proposed converse suggests that a communication and a confirmation phase are implicit in any scheme for which the probability of error decreases with the largest possible exponent. The proposed converse also makes it intuitively clear why the terms that appear in Burnashev's exponent are necessary.

Connected through hyperedge HE-1 (induced by source paper "on the reliability function of discrete memoryless multiple access channel with feedback"):
  with members:
    - "on the necessity of structured codes for communications over mac with feedback"

Connected through hyperedge HE-2 (induced by source paper "optimal active social network de anonymization using information thresholds"):
  with members:
    - "an information theoretic framework for active de anonymization in social networks based on group memberships"

Connected through hyperedge HE-3 (induced by source paper "on the reliability function of the common message broadcast channel with variable length feedback"):
  with members:
    - "common message broadcast channels with feedback in the nonasymptotic regime full feedback"
    - "on awgn channels and gaussian macs with variable length feedback"
    - "on gaussian macs with variable length feedback and non vanishing error probabilities"
    - "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"
    - "opportunistic capacity and error exponent regions for compound channel with feedback"

Connected through hyperedge HE-4 (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"
    - "error exponents for variable length block codes with feedback and cost constraints"

Connected through hyperedge HE-5 (induced by source paper "common message broadcast channels with feedback in the nonasymptotic regime full feedback"):
  with members:
    - "on the reliability function of the common message broadcast channel with variable length feedback"
    - "nonasymptotic coding rate bounds for binary erasure channels with feedback"
    - "asymptotic estimates in information theory with non vanishing error probabilities"
    - "broadcasting a common message with variable length stop feedback codes"
    - "a tight upper bound for the third order asymptotics for most discrete memoryless channels"
    - "feedback capacity of the compound channel"

Connected through hyperedge HE-6 (induced by source paper "the reliability function of lossy source channel coding of variable length codes with feedback"):
  with members:
    - "lossy joint source channel coding in the finite blocklength regime"

Connected through hyperedge HE-7 (induced by source paper "nonasymptotic coding rate bounds for binary erasure channels with feedback"):
  with members:
    - "extrinsic jensen shannon divergence applications to variable length coding"

Connected through hyperedge HE-8 (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"
    - "error exponents for variable length block codes with feedback and cost constraints"

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)