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 "multicarrier papr reduction by iteratively shifting and concentrating the probability measure"):
  Abstract: The peak power problem in multicarrier waveforms is well-known and imposes substantial limitations on wireless communications. As the quest for investigation of enabling technologies for the next generation of wireless communication systems 5G is at its peak, the problem is re-emerging in a much broader range of technologies. However, despite numerous publications on the topic, there is no well-established structure available for the problem, which motivates a boost in research. In this paper, a novel peak power reduction algorithm is proposed which offers a substantial Peak-to-Average Power Ratio (PAPR) reduction and exhibits high potential for further refinements. Mathematical tractability of the algorithm is expected to be of particular importance to this end. A remarkable early observation is a PAPR reduction of about 4.5 dB for 64 subcarriers with a rate loss of 0.5 bits per complex data symbol in an OFDM scheme, which is half the rate loss that other methods require in this class of algorithms.

Includes members:
  Member "5gnow challenging the lte design paradigms of orthogonality and synchronicity":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "impact of timing and frequency offsets on multicarrier waveform candidates for 5g")
  Member "the papr problem in ofdm transmission new directions for a long lasting problem":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "bound on peak to average power ratio with moment and reduction method")
  Member "on the concentration of the crest factor for ofdm signals":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "the papr problem in ofdm transmission new directions for a long lasting problem")

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)