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: "multiuser coding techniques for mismatched decoding"
  Abstract: This work was supported in part by the European Union Seventh Framework Program under Grant 303633, in part by the Spanish Ministry of Economy and Competitiveness under Grant RYC-2011-08150, and Grant TEC2012-38800-C03-03, and in part by the European Research Council under Grant 259663.

Connected through hyperedge HE-1 (induced by source paper "mismatched multi letter successive decoding for the multiple access channel"):
  with members:
    - "random coding error exponents for the two user interference channel"
    - "re proving channel polarization theorems an extremality and robustness analysis"
    - "polarization as a novel architecture to boost the classical mismatched capacity of b dmcs"
    - "a technique for deriving one shot achievability results in network information theory"
    - "mismatched decoding error exponents second order rates and saddlepoint approximations"
    - "a general formula for the mismatch capacity"
    - "on achievable rates for channels with mismatched decoding"
    - "multiuser random coding techniques for mismatched decoding"

Connected through hyperedge HE-2 (induced by source paper "on the reliability function of the discrete memoryless relay channel"):
  with members:
    - "multiuser random coding techniques for mismatched decoding"
    - "reliability in source coding with side information"
    - "moderate deviations of lossy source coding for discrete and gaussian sources"
    - "the gelfand pinsker channel strong converse and upper bound for the reliability function"
    - "information spectrum approach to second order coding rate in channel coding"
    - "relations between random coding exponents and the statistical physics of random codes"
    - "capacity and random coding exponents for channel coding with side information"

Connected through hyperedge HE-3 (induced by source paper "a counter example to the mismatched decoding converse for binary input discrete memoryless channels"):
  with members:
    - "a general formula for the mismatch capacity"

Connected through hyperedge HE-4 (induced by source paper "mismatched decoding error exponents second order rates and saddlepoint approximations"):
  with members:
    - "expurgated random coding ensembles exponents refinements and connections"
    - "a general formula for the mismatch capacity"
    - "refinement of the random coding bound"
    - "a derivation of the asymptotic random coding prefactor"
    - "on achievable rates for channels with mismatched decoding"
    - "moderate deviations in channel coding"
    - "refinement of the sphere packing bound asymmetric channels"
    - "error exponent for multiple access channels lower bounds"

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)