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: "asymmetric evaluations of erasure and undetected error probabilities"
  Abstract: The problem of channel coding with the erasure option is revisited for discrete memoryless channels. The interplay between the code rate, the undetected and total error probabilities is characterized. Using the information spectrum method, a sequence of codes of increasing blocklengths $n$ is designed to illustrate this tradeoff. Furthermore, for additive discrete memoryless channels with uniform input distribution, we establish that our analysis is tight with respect to the ensemble average. This is done by analysing the ensemble performance in terms of a tradeoff between the code rate, the undetected and the total errors. This tradeoff is parametrized by the threshold in a generalized likelihood ratio test. Two asymptotic regimes are studied. First, the code rate tends to the capacity of the channel at a rate slower than $n^{-1/2}$ corresponding to the moderate deviations regime. In this case, both error probabilities decay subexponentially and asymmetrically. The precise decay rates are characterized. Second, the code rate tends to capacity at a rate of $n^{-1/2}$. In this case, the total error probability is asymptotically a positive constant while the undetected error probability decays as $\exp(- b n^{ 1/2})$ for some $b>0$. The proof techniques involve applications of a modified (or "shifted") version of the G\"artner-Ellis theorem and the type class enumerator method to characterize the asymptotic behavior of a sequence of cumulant generating functions.

Connected through hyperedge HE-1 (induced by source paper "distributed detection with empirically observed statistics"):
  with members:
    - "second order asymptotically optimal statistical classification"
    - "anonymous heterogeneous distributed detection optimal decision rules error exponents and the price of anonymity"
    - "distributed hypothesis testing with privacy constraints"
    - "hypothesis testing under maximal leakage privacy constraints"
    - "asymptotically optimal matching of multiple sequences to source distributions and training sequences"
    - "privacy against statistical inference"
    - "data fusion trees for detection does architecture matter"

Connected through hyperedge HE-2 (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"
    - "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"
    - "a neyman pearson approach to universal erasure and list decoding"

Connected through hyperedge HE-3 (induced by source paper "moderate deviation asymptotics for variable length codes with feedback"):
  with members:
    - "streaming data transmission in the moderate deviations and central limit regimes"
    - "extrinsic jensen shannon divergence applications to variable length coding"
    - "moderate deviations in channel coding"
    - "moderate deviations of lossy source coding for discrete and gaussian sources"
    - "opportunistic capacity and error exponent regions for compound channel with feedback"
    - "optimal feedback communication via posterior matching"
    - "a simple converse of burnashev s reliability function"
    - "error exponents for variable length block codes with feedback and cost constraints"

Connected through hyperedge HE-4 (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"
    - "list decoding random coding exponents and expurgated exponents"
    - "encoding tasks and renyi entropy"
    - "secure multiterminal source coding with side information at the eavesdropper"
    - "erasure list exponents for slepian wolf decoding"

Connected through hyperedge HE-5 (induced by source paper "achievable moderate deviations asymptotics for streaming compression of correlated sources"):
  with members:
    - "secure multiplex coding with dependent and non uniform multiple messages"
    - "exact moderate deviation asymptotics in streaming data transmission"
    - "asymptotic estimates in information theory with non vanishing error probabilities"
    - "streaming data transmission in the moderate deviations and central limit regimes"
    - "the streaming dmt of fading channels"
    - "moderate deviations in channel coding"
    - "linear error correcting codes with anytime reliability"
    - "moderate deviations of lossy source coding for discrete and gaussian sources"

Connected through hyperedge HE-6 (induced by source paper "equivocations exponents and second order coding rates under various r enyi information measures"):
  with members:
    - "operational interpretation of renyi information measures via composite hypothesis testing against product and markov distributions"
    - "exact random coding secrecy exponents for the wiretap channel"
    - "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"
    - "the sender excited secret key agreement model capacity reliability and secrecy exponents"
    - "on the secrecy exponent of the wire tap channel"
    - "second order coding rates for channels with state"
    - "on the dispersions of three network information theory problems"

Connected through hyperedge HE-7 (induced by source paper "streaming data transmission in the moderate deviations and central limit regimes"):
  with members:
    - "exact moderate deviation asymptotics in streaming data transmission"
    - "asymptotic estimates in information theory with non vanishing error probabilities"
    - "on error exponents and moderate deviations for lossless streaming compression of correlated sources"
    - "convolutional codes with maximum column sum rank for network streaming"
    - "unequal message protection asymptotic and non asymptotic tradeoffs"
    - "the streaming dmt of fading channels"
    - "moderate deviations in channel coding"
    - "linear error correcting codes with anytime reliability"

Connected through hyperedge HE-8 (induced by source paper "simplified erasure list decoding"):
  with members:
    - "list decoding random coding exponents and expurgated exponents"
    - "expurgated random coding ensembles exponents refinements and connections"
    - "erasure list random coding error exponents are not universally achievable"
    - "erasure list exponents for slepian wolf decoding"
    - "a neyman pearson approach to universal erasure and list decoding"

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)