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 "error and erasure exponents for the broadcast channel with degraded message sets"):
  Abstract: Error and erasure exponents for the broadcast channel with degraded message sets are analyzed. The focus of our error probability analysis is on the main receiver where, nominally, both messages are to be decoded. A two-step decoding algorithm is proposed and analyzed. This receiver first attempts to decode both messages, failing which, it attempts to decode only the message representing the coarser information, i.e., the cloud center. This algorithm reflects the intuition that we should decode both messages only if we have confidence in the estimates; otherwise one should only decode the coarser information. The resulting error and erasure exponents, derived using the method of types, are expressed in terms of a penalized form of the modified random coding error exponent.

Includes members:
  Member "on the reliability function of the discrete memoryless relay channel":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "strong converse theorems for multimessage networks with tight cut set bound")
  Member "achievable error exponents for channel with side information erasure and list decoding":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "errors and erasures decoding for block codes with feedback")
  Member "error exponents for broadcast channels with degraded message sets":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "operational interpretation of renyi information measures via composite hypothesis testing against product and markov distributions")
  Member "a neyman pearson approach to universal erasure and list decoding":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "exact error and erasure exponents for the asymmetric broadcast channel")
  Member "error exponents of erasure list decoding revisited via moments of distance enumerators":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "exact error and erasure exponents for the asymmetric broadcast channel")

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)