human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "on the capacity of narrowband plc channels"
  Abstract: Power line communications (PLC) is the central communications technology for the realization of smart power grids. As the designated band for smart grid communications is the narrowband (NB) power line channel, NB-PLC has been receiving substantial attention in recent years. Narrowband power line channels are characterized by cyclic short-term variations of the channel transfer function (CTF) and strong noise with periodic statistics. In this paper, modeling the CTF as a linear periodically time-varying filter and the noise as an additive cyclostationary Gaussian process, we derive the capacity of discrete-time NB-PLC channels. As part of the capacity derivation, we characterize the capacity achieving transmission scheme, which leads to a practical code construction that approaches capacity. The capacity derived in this work is numerically evaluated for several NB-PLC channel configurations taken from previous works, and the results show that the optimal scheme achieves a substantial rate gain over a previously proposed  ad-hoc  scheme. This gain is due to optimally accounting for the periodic properties of the channel and the noise.

Connected through hyperedge HE-1 (induced by source paper "the rate distortion function of asynchronously sampled memoryless cyclostationary gaussian processes"):
  with members:
    - "the capacity of memoryless channels with sampled cyclostationary gaussian noise"
    - "the distortion rate function of cyclostationary gaussian processes"
    - "frequency shift filtering for ofdm signal recovery in narrowband power line communications"
    - "on the optimal compressions in the compress and forward relay schemes"
    - "the generalized asymptotic equipartition property necessary and sufficient conditions"
    - "achieving the gaussian rate distortion function by prediction"

Connected through hyperedge HE-2 (induced by source paper "the capacity of memoryless channels with sampled cyclostationary gaussian noise"):
  with members:
    - "analog to digital cognitive radio sampling detection and hardware"
    - "on the capacity of mimo broadband power line communications channels"
    - "sub nyquist cyclostationary detection for cognitive radio"
    - "channel capacity under sub nyquist nonuniform sampling"
    - "frequency shift filtering for ofdm signal recovery in narrowband power line communications"
    - "what will 5g be"
    - "shannon meets nyquist capacity of sampled gaussian channels"
    - "on the minimax capacity loss under sub nyquist universal sampling"

Connected through hyperedge HE-3 (induced by source paper "on the capacity of mimo broadband power line communications channels"):
  with members:
    - "state of the art in power line communications from the applications to the medium"
    - "a novel approach to the statistical modeling of wireline channels"

Connected through hyperedge HE-4 (induced by source paper "the secrecy capacity of gaussian mimo channels with finite memory full version"):
  with members:
    - "principles of physical layer security in multiuser wireless networks a survey"
    - "full rank solutions for the mimo gaussian wiretap channel with an average power constraint"
    - "source channel coding theorems for the multiple access relay channel"
    - "private broadcasting over independent parallel channels"
    - "for the grid and through the grid the role of power line communications in the smart grid"
    - "secured communication over frequency selective fading channels a practical vandermonde precoding"
    - "towards the secrecy capacity of the gaussian mimo wire tap channel the 2 2 1 channel"
    - "the capacity region of the degraded finite state broadcast channel"

Connected through hyperedge HE-5 (induced by source paper "partial duplex amplify and forward relaying spectral efficiency analysis under self interference"):
  with members:
    - "capacity of the gaussian two hop full duplex relay channel with residual self interference"
    - "passive self interference suppression for full duplex infrastructure nodes"
    - "half duplex or full duplex relaying a capacity analysis under self interference"
    - "in band full duplex wireless challenges and opportunities"
    - "experiment driven characterization of full duplex wireless systems"

Question: Please tell me which class the center node 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)