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 erasure list decoding revisited via moments of distance enumerators"
  Abstract: The analysis of random coding error exponents pertaining to erasure/list decoding, due to Forney, is revisited. Instead of using Jensen's inequality as well as some other inequalities in the derivation, we demonstrate that an exponentially tight analysis can be carried out by assessing the relevant moments of certain distance enumerators. The resulting bound has the following advantages: (i) it is at least as tight as Forney's bound, (ii) under certain symmetry conditions associated with the channel and the random coding distribution, it is simpler than Forney's bound in the sense that it involves an optimization over one parameter only (rather than two), and (iii) in certain special cases, like the binary symmetric channel (BSC), the optimum value of this parameter can be found in closed form, and so, there is no need to conduct a numerical search. We have not found yet a numerical example where this new bound is strictly better than Forney's bound and this may provide an additional evidence to support Forney's conjecture that his bound is tight for the average code. However, when applying the proposed analysis technique to a certain universal decoder with erasures, we demonstrate that it may yield significantly tighter exponential error bounds. We believe that this technique can be useful in simplifying and improving exponential error bounds in other problem settings as well.

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 "exponential source channel duality"):
  with members:
    - "analogy and duality between random channel coding and lossy source coding"
    - "simplified erasure list decoding"
    - "stochastic interpretation for the arimoto algorithm"

Connected through hyperedge HE-3 (induced by source paper "analysis of remaining uncertainties and exponents under various conditional r e nyi entropies"):
  with members:
    - "uniform random number generation from markov chains non asymptotic and asymptotic analyses"
    - "security analysis of varepsilon almost dual universal 2 hash functions smoothing of min entropy versus smoothing of renyi entropy of order 2"
    - "asymptotic estimates in information theory with non vanishing error probabilities"
    - "equivocations exponents and second order coding rates under various r enyi information measures"
    - "asymmetric evaluations of erasure and undetected error probabilities"
    - "list decoding random coding exponents and expurgated exponents"
    - "encoding tasks and renyi entropy"
    - "secure multiterminal source coding with side information at the eavesdropper"

Connected through hyperedge HE-4 (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-5 (induced by source paper "error and erasure exponents for the broadcast channel with degraded message sets"):
  with members:
    - "on the reliability function of the discrete memoryless relay channel"
    - "achievable error exponents for channel with side information erasure and list decoding"
    - "error exponents for broadcast channels with degraded message sets"
    - "a neyman pearson approach to universal erasure and list decoding"

Connected through hyperedge HE-6 (induced by source paper "fixed error asymptotics for erasure and list decoding"):
  with members:
    - "the third order term in the normal approximation for the awgn channel"
    - "list decoding random coding exponents and expurgated exponents"
    - "on the dispersions of three network information theory problems"
    - "a tight upper bound for the third order asymptotics for most discrete memoryless channels"
    - "feedback communication systems with limitations on incremental redundancy"
    - "erasure list exponents for slepian wolf decoding"
    - "reliability based error detection for feedback communication with low latency"
    - "the third order term in the normal approximation for singular channels"

Connected through hyperedge HE-7 (induced by source paper "asymmetric evaluations of erasure and undetected error probabilities"):
  with members:
    - "asymptotic estimates in information theory with non vanishing error probabilities"
    - "list decoding random coding exponents and expurgated exponents"
    - "unequal message protection asymptotic and non asymptotic tradeoffs"
    - "fixed error asymptotics for erasure and list decoding"
    - "erasure list exponents for slepian wolf decoding"
    - "moderate deviations in channel coding"
    - "fixed length lossy compression in the finite blocklength regime"
    - "moderate deviations of lossy source coding for discrete and gaussian sources"

Connected through hyperedge HE-8 (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 optimum decoding for the interference channel"

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)