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: "unequal message protection asymptotic and non asymptotic tradeoffs"
  Abstract: We study a form of unequal error protection that we term "unequal message protection" (UMP). The message set of a UMP code is a union of $m$ disjoint message classes. Each class has its own error protection requirement, with some classes needing better error protection than others. We analyze the tradeoff between rates of message classes and the levels of error protection of these codes. We demonstrate that there is a clear performance loss compared to homogeneous (classical) codes with equivalent parameters. This is in sharp contrast to previous literature that considers UMP codes. To obtain our results we generalize finite block length achievability and converse bounds due to Polyanskiy-Poor-Verd\'{u}. We evaluate our bounds for the binary symmetric and binary erasure channels, and analyze the asymptotic characteristic of the bounds in the fixed error and moderate deviations regimes. In addition, we consider two questions related to the practical construction of UMP codes. First, we study a "header" construction that prefixes the message class into a header followed by data protection using a standard homogeneous code. We show that, in general, this construction is not optimal at finite block lengths. We further demonstrate that our main UMP achievability bound can be obtained using coset codes, which suggests a path to implementation of tractable UMP codes.

Connected through hyperedge HE-1 (induced by source paper "universal random access error exponents for codebooks of different word lengths"):
  with members:
    - "random access and source channel coding error exponents for multiple access channels"
    - "error performance of channel coding in random access communication"
    - "a new approach to random access reliable communication and reliable collision detection"
    - "unequal error protection an information theoretic perspective"

Connected through hyperedge HE-2 (induced by source paper "multi class source channel coding"):
  with members:
    - "a derivation of the source channel error exponent using non identical product distributions"
    - "lossy joint source channel coding in the finite blocklength regime"
    - "the dispersion of joint source channel coding"

Connected through hyperedge HE-3 (induced by source paper "asymptotic estimates in information theory with non vanishing error probabilities"):
  with members:
    - "second order asymptotics for the gaussian mac with degraded message sets"
    - "the third order term in the normal approximation for the awgn channel"
    - "strong converse and second order asymptotics of channel resolvability"
    - "channels with cost constraints strong converse and dispersion"
    - "secret key agreement general capacity and second order asymptotics"
    - "second order coding rates for channels with state"
    - "information spectrum approach to strong converse theorems for degraded wiretap channels"
    - "on the dispersions of three network information theory problems"

Connected through hyperedge HE-4 (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"
    - "asymmetric evaluations of erasure and undetected error probabilities"
    - "the streaming dmt of fading channels"
    - "moderate deviations in channel coding"
    - "linear error correcting codes with anytime reliability"

Connected through hyperedge HE-5 (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"
    - "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"
    - "information spectrum approach to second order coding rate in channel coding"

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)