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: "the streaming dmt of fading channels"
  Abstract: We consider the sequential transmission of a stream of messages over a block-fading multi-input-multi-output (MIMO) channel. A new message arrives at the beginning of each coherence block, and the decoder is required to output each message sequentially, after a delay of $T$ coherence blocks. In the special case when $T=1$, the setup reduces to the quasi-static fading channel. We establish the optimal diversity-multiplexing tradeoff (DMT) in the high signal-to-noise-ratio (SNR) regime, and show that it equals $T$ times the DMT of the quasi-static channel. The converse is based on utilizing the delay constraint to amplify a local outage event associated with a message, globally across all the coherence blocks. This approach appears to be new. We propose two coding schemes that achieve the optimal DMT. The first scheme involves interleaving of messages, such that each message is transmitted across $T$ consecutive coherence blocks. This scheme requires the knowledge of the delay constraint at both the encoder and decoder. Our second coding scheme involves a sequential tree code and is delay-universal i.e., the knowledge of the decoding delay is not required by the encoder. However, in this scheme we require the coherence block-length to increase as $\log\mathrm{({SNR})}$, in order to attain the optimal DMT. Finally, we discuss the case when multiple messages arrive at uniform intervals {\em within} each coherence period. Through a simple example we exhibit the sub-optimality of interleaving, and propose another scheme that achieves the optimal DMT.

Connected through hyperedge HE-1 (induced by source paper "generalized harq protocols with delayed channel state information and average latency constraints"):
  with members:
    - "delayed channel state information incremental redundancy with backtrack retransmission"
    - "block fading channels with delayed csit at finite blocklength"
    - "variable rate retransmissions for incremental redundancy hybrid arq"
    - "on the benefits of partial channel state information for repetition protocols in block fading channels"
    - "completely stale transmitter channel state information is still very useful"

Connected through hyperedge HE-2 (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"
    - "asymmetric evaluations of erasure and undetected error probabilities"
    - "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-3 (induced by source paper "exact moderate deviation asymptotics in streaming data transmission"):
  with members:
    - "streaming data transmission in the moderate deviations and central limit regimes"
    - "moderate deviations in channel coding"
    - "linear error correcting codes with anytime reliability"

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"
    - "unequal message protection asymptotic and non asymptotic tradeoffs"
    - "moderate deviations in channel coding"
    - "linear error correcting codes with anytime reliability"

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)