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: "exact random coding error exponents of optimal bin index decoding"
  Abstract: We consider ensembles of channel codes that are partitioned into bins, and focus on analysis of exact random coding error exponents associated with optimum decoding of the index of the bin to which the transmitted codeword belongs. Two main conclusions arise from this analysis: (i) for independent random selection of codewords within a given type class, the random coding exponent of optimal bin index decoding is given by the ordinary random coding exponent function, computed at the rate of the entire code, independently of the exponential rate of the size of the bin. (ii) for this ensemble of codes, sub-optimal bin index decoding, that is based on ordinary maximum likelihood (ML) decoding, is as good as the optimal bin index decoding in terms of the random coding error exponent achieved. Finally, for the sake of completeness, we also outline how our analysis of exact random coding exponents extends to the hierarchical ensemble that correspond to superposition coding and optimal decoding, where for each bin, first, a cloud center is drawn at random, and then the codewords of this bin are drawn conditionally independently given the cloud center. For this ensemble, conclusions (i) and (ii), mentioned above, no longer hold necessarily in general.

Connected through hyperedge HE-1 (induced by source paper "sharp bounds for mutual covering"):
  with members:
    - "exact soft covering exponent"
    - "a unified framework for one shot achievability via the poisson matching lemma"
    - "strong functional representation lemma and applications to coding theorems"
    - "secret key generation with limited interaction"
    - "the likelihood encoder for lossy compression"
    - "the generalized stochastic likelihood decoder random coding and expurgated bounds"
    - "on non interactive simulation of joint distributions"
    - "one shot mutual covering lemma and marton s inner bound with a common message"

Connected through hyperedge HE-2 (induced by source paper "exact exponent for soft covering"):
  with members:
    - "first and second order asymptotics in covert communication"
    - "exact random coding secrecy exponents for the wiretap channel"
    - "second order asymptotics in covert communication"
    - "secure multiplex coding with dependent and non uniform multiple messages"
    - "soft covering with high probability"
    - "a stronger soft covering lemma and applications"
    - "renyi divergence and kullback leibler divergence"
    - "effective secrecy reliability confusion and stealth"

Connected through hyperedge HE-3 (induced by source paper "large deviations behavior of the logarithmic error probability of random codes"):
  with members:
    - "error exponents of typical random trellis codes"
    - "error exponents of typical random codes for the colored gaussian channel"
    - "error exponents of typical random codes"
    - "the generalized stochastic likelihood decoder random coding and expurgated bounds"
    - "comparing the bit map and block map decoding thresholds of reed muller codes on bms channels"
    - "channel detection in coded communication"
    - "typicality graphs large deviation analysis"

Connected through hyperedge HE-4 (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"
    - "erasure list random coding error exponents are not universally achievable"
    - "error exponents for broadcast channels with degraded message sets"
    - "a neyman pearson approach to universal erasure and list decoding"

Connected through hyperedge HE-5 (induced by source paper "exact soft covering exponent"):
  with members:
    - "exact random coding secrecy exponents for the wiretap channel"
    - "soft covering with high probability"
    - "a stronger soft covering lemma and applications"
    - "renyi divergence and kullback leibler divergence"
    - "effective secrecy reliability confusion and stealth"
    - "distributed channel synthesis"
    - "exponential decreasing rate of leaked information in universal random privacy amplification"
    - "strong secrecy from channel resolvability"

Connected through hyperedge HE-6 (induced by source paper "exact random coding secrecy exponents for the wiretap channel"):
  with members:
    - "secure multiplex coding with dependent and non uniform multiple messages"
    - "soft covering with high probability"
    - "the sender excited secret key agreement model capacity reliability and secrecy exponents"
    - "on the secrecy exponent of the wire tap channel"
    - "informational divergence approximations to product distributions"
    - "effective secrecy reliability confusion and stealth"
    - "tight exponential analysis of universally composable privacy amplification and its applications"
    - "distributed channel synthesis"

Connected through hyperedge HE-7 (induced by source paper "expurgated bounds for the asymmetric broadcast channel"):
  with members:
    - "exact random coding exponents and universal decoders for the asymmetric broadcast channel"
    - "the generalized stochastic likelihood decoder random coding and expurgated bounds"
    - "list decoding random coding exponents and expurgated exponents"
    - "error exponents for broadcast channels with degraded message sets"

Connected through hyperedge HE-8 (induced by source paper "exact random coding exponents and universal decoders for the asymmetric broadcast channel"):
  with members:
    - "error exponents for broadcast channels with degraded message sets"

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)