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 "throughput analysis for wavelet ofdm in broadband power line communications"):
  Abstract: Windowed orthogonal frequency-division multiplexing (OFDM) and wavelet OFDM have been proposed as medium access techniques for broadband communications over the power line network by the standard IEEE 1901. Windowed OFDM has been extensively researched and employed in different fields of communication, while wavelet OFDM, which has been recently recommended for the first time in a standard, has received less attention. This work is aimed to show that wavelet OFDM, which basically is an Extended Lapped Transform-based multicarrier modulation (ELT-MCM), is a viable and attractive alternative for data transmission in hostile scenarios, such as in-home PLC. To this end, we obtain theoretical expressions for ELT-MCM of: 1) the useful signal power, 2) the inter-symbol interference (ISI) power, 3) the inter-carrier interference (ICI) power, and 4) the noise power at the receiver side. The system capacity and the achievable throughput are derived from these. This study includes several computer simulations that show that ELT-MCM is an efficient alternative to improve data rates in PLC networks.

Includes members:
  Member "uplink fbmc oqam based multiple access channel distortion analysis under strong frequency selectivity":
    also connected through other hyperedges:
      (none)
  Member "state of the art in power line communications from the applications to the medium":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "your noise my signal exploiting switching noise for stealthy data exfiltration from desktop computers")

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)