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 "overshooting and l 1 norms of a class of nyquist filters"):
  Abstract: To tightly control the signal envelope, estimating the peak regrowth between FFT samples is an important sub-problem in multicarrier communications. While the problem is well-investigated for trigonometric polynomials (i.e. OFDM), the impact of an aperiodic transmit filter is important too and typically neglected in the peak regrowth analysis. In this paper, we provide new bounds on the overshooting between samples for general multicarrier signals improving on available bounds for small oversampling factors. In particular, we generalize a result of [1, Theorem 4.10]. Our results will be extended to bound overshooting of a class of Nyquist filters as well. Eventually, results are related to some respective $L^1$-properties of these filters with application to filter design.

Includes members:
  Member "sparse signal processing concepts for efficient 5g system design":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "faster activity and data detection in massive random access a multi armed bandit approach")
  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")

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)