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 "adaptive interference removal for uncoordinated radar communication coexistence"):
  Abstract: Most existing approaches to coexisting communication/radar systems assume that the radar and communication systems are coordinated, i.e., they share information, such as relative position, transmitted waveforms, and channel state. In this paper, we consider an uncoordinated scenario where a communication receiver is to operate in the presence of a number of radars, of which only a subset may be active, which poses the problem of estimating the active waveforms and the relevant parameters thereof, so as to cancel them prior to demodulation. Two algorithms are proposed for such a joint waveform estimation/data demodulation problem, both exploiting sparsity of a proper representation of the interference and of the vector containing the errors of the data block, so as to implement an iterative joint interference removal/data demodulation process. The former algorithm is based on classical on-grid compressed sensing, whereas the latter forces an atomic norm (AN) constraint: In both cases the radar parameters and the communication demodulation errors can be estimated by solving a convex problem. We also propose a way to improve the efficiency of the AN-based algorithm. The performance of these algorithms are demonstrated through extensive simulations, taking into account a variety of conditions concerning both the interferers and the respective channel states.

Includes members:
  Member "joint design of overlaid communication systems and pulsed radars":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "interference removal for radar communication co existence the random scattering case")
  Member "complete dictionary recovery over the sphere i overview and the geometric picture":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "finding the sparsest vectors in a subspace theory algorithms and applications")
  Member "spectrum sharing between a surveillance radar and secondary wi fi networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "interference removal for radar communication co existence the random scattering case")
  Member "optimum co design for spectrum sharing between matrix completion based mimo radars and a mimo communication system":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "interference removal for radar communication co existence the random scattering case")
  Member "super resolution of complex exponentials from modulations with unknown waveforms":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "resolution limit for line spectral estimation theory and algorithm")
  Member "robust spectral compressed sensing via structured matrix completion":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "recovery analysis of damped spectrally sparse signals and its relation to music")
  Member "exact joint sparse frequency recovery via optimization methods":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "approximate support recovery of atomic line spectral estimation a tale of resolution and precision")
  Member "direction of arrival estimation using co prime arrays a super resolution viewpoint":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "interference removal for radar communication co existence the random scattering case")

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.SY(Systems and Control)