human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "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.

Includes members:
  Member "erasure coding for real time streaming":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "optimal multiplexed erasure codes for streaming messages with different decoding delays")
  Member "streaming codes for channels with burst and isolated erasures":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "an explicit construction of optimal streaming codes for channels with burst and arbitrary erasures")
  Member "linear error correcting codes with anytime reliability":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "layered constructions for low delay streaming codes")
  Member "diversity embedded streaming erasure codes de sco constructions and optimality":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "an explicit construction of optimal streaming codes for channels with burst and arbitrary erasures")
  Member "on successive refinement of diversity for fading isi channels":
    also connected through other hyperedges:
      (none)
  Member "distortion minimization in gaussian layered broadcast coding with successive refinement":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "layered coding for energy harvesting communication without csit")
  Member "high snr analysis of outage limited communications with bursty and delay limited information":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "delay performance of miso wireless communications")
  Member "on the distortion snr exponent of some layered transmission schemes":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "non parametric message important measure storage code design and transmission planning for big data")

Question: Please tell me which class the source paper 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)