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: "transmit signal and bandwidth optimization in multiple antenna relay channels"
  Abstract: In a multiple-antenna relay channel, the full-duplex cut-set capacity upper bound and decode-and-forward rate are formulated as convex optimization problems. For half-duplex relaying, bandwidth allocation and transmit signals are optimized jointly. Moreover, achievable rates based on the compress-and-forward strategy are presented using rate-distortion and Wyner-Ziv compression schemes.

Connected through hyperedge HE-1 (induced by source paper "maximizing the partial decode and forward rate in the gaussian mimo relay channel"):
  with members:
    - "rate bounds for mimo relay channels"

Connected through hyperedge HE-2 (induced by source paper "approximate capacity of the mimo relay channel"):
  with members:
    - "distributed decode forward for relay networks"
    - "capacity approximations for gaussian relay networks"
    - "the optimal input distribution for partial decode and forward in the mimo relay channel"
    - "wireless network information flow a deterministic approach"
    - "slepian wolf coding over cooperative relay networks"
    - "gaussian relay channel capacity to within a fixed number of bits"
    - "rate bounds for mimo relay channels"

Connected through hyperedge HE-3 (induced by source paper "coverage region analysis for mimo amplify and forward relay channel with the source to destination link"):
  with members:
    - "analysis of coverage region for mimo relay network with multiple cooperative df relays"
    - "analysis of coverage region for mimo relay channel"
    - "on maximizing coverage in gaussian relay channels"

Connected through hyperedge HE-4 (induced by source paper "the optimal input distribution for partial decode and forward in the mimo relay channel"):
  with members:
    - "noisy interference sum rate capacity for vector gaussian interference channels"
    - "rate bounds for mimo relay channels"
    - "an extremal inequality motivated by multiterminal information theoretic problems"

Connected through hyperedge HE-5 (induced by source paper "analysis of coverage region for mimo relay network with multiple cooperative df relays"):
  with members:
    - "impact of propagation environment on energy efficient relay placement model and performance analysis"
    - "analysis of coverage region for mimo relay channel"
    - "on maximizing coverage in gaussian relay channels"

Connected through hyperedge HE-6 (induced by source paper "analysis of coverage region for mimo relay channel"):
  with members:
    - "on maximizing coverage in gaussian relay channels"

Connected through hyperedge HE-7 (induced by source paper "optimal resource allocation and relay selection in bandwidth exchange based cooperative forwarding"):
  with members:
    - "simple distributed weighted matchings"

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)