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 "joint unitary triangularization for mimo networks"):
  Abstract: This paper considers communication networks where individual links can be described as those based on multiple-input multiple-output channels. Unlike orthogonal modulation methods (such as the singular-value decomposition), we allow interference between subchannels, which can be removed by the receivers via successive cancellation. The degrees of freedom earned by this relaxation are used for obtaining a basis, and corresponding decomposition, which are simultaneously good for more than one link. Specifically, we derive necessary and sufficient conditions for shaping the ratio vector of subchannel gains of two broadcast-channel receivers. We then apply this decomposition to two scenarios: First, in digital multicasting we present a practical capacity-achieving scheme which uses only scalar codes and linear processing. Then, we consider the joint source-channel problem of transmitting a Gaussian source over a two-user multiple-input multiple-output channel, where we show the existence of nontrivial cases, where the optimal distortion pair (which for high signal-to-noise ratios (SNRs) equals the optimal point-to-point distortions of the individual users) may be achieved by employing a hybrid digital-analog scheme over the induced equivalent channel. These scenarios demonstrate the advantage of choosing a modulation basis based upon multiple links in the network. Thus, we coin the approach “network modulation”.

Includes members:
  Member "physical layer mimo relaying":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "the dirty mimo multiple access channel")
  Member "hybrid digital analog codes for source channel broadcast of gaussian sources over gaussian channels":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "joint state estimation and communication over a state dependent gaussian multiple access channel")
  Member "analog matching of colored sources to colored channels":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "multi rate control over awgn channels via analog joint source channel coding")
  Member "robust joint source channel coding for delay limited applications":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "analog matching of colored sources to colored channels")
  Member "a framework for designing mimo systems with decision feedback equalization or tomlinson harashima precoding":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "a survey on mimo transmission with discrete input signals technical challenges advances and future trends")

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)