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 of optimum decoding for the interference channel"
  Abstract: Exponential error bounds for the finite-alphabet interference channel (IFC) with two transmitter-receiver pairs, are investigated under the random coding regime. Our focus is on optimum decoding, as opposed to heuristic decoding rules that have been used in previous works, like joint typicality decoding, decoding based on interference cancellation, and decoding that considers the interference as additional noise. Indeed, the fact that the actual interfering signal is a codeword and not an i.i.d. noise process complicates the application of conventional techniques to the performance analysis of the optimum decoder. Using analytical tools rooted in statistical physics, we derive a single letter expression for error exponents achievable under optimum decoding and demonstrate strict improvement over error exponents obtainable using suboptimal decoding rules, but which are amenable to more conventional analysis.

Connected through hyperedge HE-1 (induced by source paper "exact error and erasure exponents for the asymmetric broadcast channel"):
  with members:
    - "exact random coding exponents and universal decoders for the asymmetric broadcast channel"
    - "expurgated bounds for the asymmetric broadcast channel"
    - "random coding error exponents for the two user interference channel"
    - "simplified erasure list decoding"
    - "asymmetric evaluations of erasure and undetected error probabilities"
    - "exact random coding error exponents of optimal bin index decoding"
    - "erasure list random coding error exponents are not universally achievable"
    - "error exponents for broadcast channels with degraded message sets"

Connected through hyperedge HE-2 (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"
    - "multiuser coding techniques for mismatched decoding"
    - "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"

Connected through hyperedge HE-3 (induced by source paper "random coding error exponents for the two user interference channel"):
  with members:
    - "mismatched multi letter successive decoding for the multiple access channel"
    - "optimal achievable rates for interference networks with random codes"
    - "list decoding random coding exponents and expurgated exponents"
    - "exact correct decoding exponent of the wiretap channel decoder"
    - "exact random coding error exponents of optimal bin index decoding"
    - "erasure list random coding error exponents are not universally achievable"
    - "multiuser random coding techniques for mismatched decoding"
    - "the generalized random energy model and its application to the statistical physics of ensembles of hierarchical codes"

Connected through hyperedge HE-4 (induced by source paper "expurgated random coding ensembles exponents refinements and connections"):
  with members:
    - "mismatched decoding error exponents second order rates and saddlepoint approximations"
    - "refinement of the random coding bound"
    - "a derivation of the asymptotic random coding prefactor"
    - "error exponents of erasure list decoding revisited via moments of distance enumerators"

Connected through hyperedge HE-5 (induced by source paper "another look at expurgated bounds and their statistical mechanical interpretation"):
  with members:
    - "rate distortion function via minimum mean square error estimation"
    - "the generalized random energy model and its application to the statistical physics of ensembles of hierarchical codes"
    - "error exponents for broadcast channels with degraded message sets"
    - "error exponents of erasure list decoding revisited via moments of distance enumerators"
    - "on the statistical physics of directed polymers in a random medium and their relation to tree codes"
    - "relations between random coding exponents and the statistical physics of random codes"

Connected through hyperedge HE-6 (induced by source paper "an information spectrum approach to the capacity region of gifc"):
  with members:
    - "a new ensemble of rate compatible ldpc codes"
    - "gaussian interference channel capacity to within one bit"

Connected through hyperedge HE-7 (induced by source paper "an information spectrum approach to the capacity region of general interference channel"):
  with members:
    - "accessible capacity of secondary users"
    - "interference networks with point to point codes"
    - "gaussian interference channel capacity to within one bit"

Connected through hyperedge HE-8 (induced by source paper "information theory and statistical physics lecture notes"):
  with members:
    - "the generalized random energy model and its application to the statistical physics of ensembles of hierarchical codes"
    - "error exponents for broadcast channels with degraded message sets"
    - "an identity of chernoff bounds with an interpretation in statistical physics and applications in information theory"
    - "relations between random coding exponents and the statistical physics of random codes"

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)