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 "beamforming design for multiuser two way relaying a unified approach via max min sinr"):
  Abstract: In this paper, we develop a unified framework for beamforming designs in non-regenerative multiuser two-way relaying (TWR). The core of our framework is the solution to the max-min signal-to-interference-plus-noise-ratio (SINR) problem for multiuser TWR. We solve this problem using a Dinkelbach-type algorithm with near-optimal performance and superlinear convergence. We show that, using the max-min SINR solution as a corner stone, the beamforming designs under various important criteria, such as weighted sum-rate maximization, weighted sum mean-square-error (MSE) minimization, and average bit-error-rate (BER) or symbol-error-rate (SER) minimization, etc, can be reformulated into a monotonic program. A polyblock outer approximation algorithm is then used to find the desired solutions with guaranteed convergence and optimal performance (provided that the core max-min SINR solver is optimal). Furthermore, the proposed unified approach can provide important insights for tackling the optimal beamforming designs in other emerging network models and settings. For instances, we extend the proposed framework to address the beamforming design in collaborative TWR and multi-pair MIMO TWR. Extensive numerical results are presented to demonstrate the merits of the proposed beamforming solutions.

Includes members:
  Member "compute and forward harnessing interference through structured codes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "private information retrieval over gaussian mac")
  Member "optimal beamforming for two way multi antenna relay channel with analogue network coding":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "optimization of a power splitting protocol for two way multiple energy harvesting relay system")
  Member "mapel achieving global optimality for a non convex wireless power control problem":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "sum throughput maximization in multi tag backscattering to multiantenna reader")
  Member "physical layer network coding":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "implementation of uplink network coded modulation for two hop networks")
  Member "capacity of a class of modulo sum relay channels":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "a new coding paradigm for the primitive relay channel")

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)