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: "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”.

Connected through hyperedge HE-1 (induced by source paper "the dirty mimo multiple access channel"):
  with members:
    - "joint unitary triangularization for gaussian multi user mimo networks"
    - "multiple input multiple output two way relaying a space division approach"
    - "physical layer mimo relaying"
    - "lattice strategies for the dirty multiple access channel"

Connected through hyperedge HE-2 (induced by source paper "the mimo wiretap channel decomposed"):
  with members:
    - "optimal signaling for secure communications over gaussian mimo wiretap channels"
    - "an algorithm for global maximization of secrecy rates in gaussian mimo wiretap channels"
    - "joint unitary triangularization for gaussian multi user mimo networks"
    - "semantically secure coding scheme achieving the capacity of a gaussian wiretap channel"
    - "achieving the secrecy capacity of wiretap channels using polar codes"
    - "strong secrecy from channel resolvability"
    - "construction of wiretap codes from ordinary channel codes"
    - "the secrecy capacity of the mimo wiretap channel"

Connected through hyperedge HE-3 (induced by source paper "broadcasting correlated vector gaussians"):
  with members:
    - "a source channel separation theorem with application to the source broadcast problem"
    - "hybrid digital analog codes for source channel broadcast of gaussian sources over gaussian channels"
    - "hybrid coding for gaussian broadcast channels with gaussian sources"
    - "broadcasting correlated gaussians"
    - "vector gaussian multiple description with individual and central receivers"

Connected through hyperedge HE-4 (induced by source paper "joint unitary triangularization for gaussian multi user mimo networks"):
  with members:
    - "physical layer mimo relaying"
    - "rateless coding for gaussian channels"
    - "approximately universal codes over slow fading channels"

Connected through hyperedge HE-5 (induced by source paper "space time mimo multicasting"):
  with members:
    - "modulation for mimo networks with several users"

Connected through hyperedge HE-6 (induced by source paper "physical layer mimo relaying"):
  with members:
    - "modulation for mimo networks with several users"
    - "compute and forward harnessing interference through structured codes"
    - "optimal beamforming for two way multi antenna relay channel with analogue network coding"

Connected through hyperedge HE-7 (induced by source paper "modulation for mimo networks with several users"):
  with members:
    - "physical layer mimo relaying"
    - "rateless coding for gaussian channels"

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)