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 "multiuser random coding techniques for mismatched decoding"):
  Abstract: This paper studies multiuser random coding techniques for channel coding with a given (possibly suboptimal) decoding rule. For the mismatched discrete memoryless multipleaccess channel, an error exponent is obtained that is tight with respect to the ensemble average, and positive within the interior of Lapidoth’s achievable rate region. This exponent proves the ensemble tightness of the exponent of Liu and Hughes in the case of maximum-likelihood decoding. An equivalent dual form of Lapidoth’s achievable rate region is given, and the latter is shown to extend immediately to channels with infinite and continuous alphabets. In the setting of single-user mismatched decoding, similar analysis techniques are applied to a refined version of superposition coding, which is shown to achieve rates at least as high as standard superposition coding for any set of randomcoding parameters.

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 "a counter example to the mismatched decoding converse for binary input discrete memoryless channels":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "channel capacity of polar coding with a given polar mismatched successive cancellation decoder")
  Member "expurgated random coding ensembles exponents refinements and connections":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "ratio list decoding")
  Member "mismatched decoding error exponents second order rates and saddlepoint approximations":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "saddlepoint approximations for short packet wireless communications")
  Member "error exponent for multiple access channels lower bounds":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "error exponents for asynchronous multiple access channels controlled asynchronism may outperform synchronism")

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)