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 "fast algorithms for designing unimodular waveform s with good correlation properties"):
  Abstract: We develop new fast and efficient algorithms for designing single or multiple unimodular waveforms with good auto- and cross-correlation or weighted correlation properties, which are highly desired in radar and communication systems. The waveform design is based on the minimization of the integrated sidelobe level (ISL) and weighted ISL (WISL) of waveforms. As the corresponding problems can quickly grow to a large scale with increasing the code length and the number of waveforms, the main issue turns to be the development of fast large-scale optimization techniques. The difficulty is also that the corresponding optimization problems are nonconvex, but the required accuracy is high. Therefore, we formulate the ISL and WISL minimization problems as nonconvex quartic optimization problems in frequency domain, and then simplify them into quadratic problems via majorization-minimization technique, which is one of the basic techniques for addressing large-scale and/or nonconvex optimization problems. While designing our fast algorithms, we explore and use the inherent algebraic structures in objective functions to rewrite them into quartic forms, and in the case of WISL minimization, to derive additionally an alternative quartic form that allows us to apply the quartic-quadratic transformation. Our algorithms are applicable to large-scale unimodular waveform design problems as they are proved to have lower or comparable computational burden (analyzed theoretically) and faster convergence speed (confirmed by comprehensive simulations) than the state-of-the-art algorithms. In addition, the waveforms designed by our algorithms demonstrate better correlation properties compared to their counterparts.

Includes members:
  Member "ambiguity function of the transmit beamspace based mimo radar":
    also connected through other hyperedges:
      (none)
  Member "sum rate maximization in two way af mimo relaying polynomial time solutions to a class of dc programming problems":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "joint beamforming and power allocation in downlink noma multiuser mimo networks")
  Member "phased mimo radar a tradeoff between phased array and mimo radars":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "single anchor localization and orientation performance limits using massive arrays mimo vs beamforming")

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)