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 "the secrecy capacity of gaussian mimo channels with finite memory full version"):
  Abstract: In this work we study the secrecy capacity of Gaussian multiple-input multiple-output (MIMO) wiretap channels (WTCs) with a finite memory, subject to a per-symbol average power constraint on the MIMO channel input. MIMO channels with finite memory are very common in wireless communications as well as in wireline communications (e.g., in communications over power lines). To derive the secrecy capacity of the Gaussian MIMO WTC with finite memory we first construct an asymptotically-equivalent block-memoryless MIMO WTC, which is then transformed into a set of parallel, independent, memoryless MIMO WTCs in the frequency domain. The secrecy capacity of the Gaussian MIMO WTC with finite memory is obtained as the secrecy capacity of the set of parallel independent memoryless MIMO WTCs, and is expressed as a maximization over the input covariance matrices in the frequency domain. Lastly, we detail two applications of our result: First, we show that the secrecy capacity of the Gaussian scalar WTC with finite memory can be achieved by waterfilling, and obtain a closed-form expression for this secrecy capacity. Then, we use our result to characterize the secrecy capacity of narrowband powerline channels, thereby resolving one of the major open issues for this channel model.

Includes members:
  Member "on the capacity of narrowband plc channels":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "the rate distortion function of asynchronously sampled memoryless cyclostationary gaussian processes")
  Member "principles of physical layer security in multiuser wireless networks a survey":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "angle aware user cooperation for secure massive mimo in rician fading channel")
  Member "full rank solutions for the mimo gaussian wiretap channel with an average power constraint":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "intelligent reflecting surface assisted secure wireless communications with multiple transmit and multiple receive antennas")
  Member "source channel coding theorems for the multiple access relay channel":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "on the energy distortion tradeoff of gaussian broadcast channels with feedback")
  Member "private broadcasting over independent parallel channels":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "vector gaussian successive refinement with degraded side information")
  Member "for the grid and through the grid the role of power line communications in the smart grid":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "making the grid truly smart autonomous system identification in modemless dc microgrids")
  Member "secured communication over frequency selective fading channels a practical vandermonde precoding":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "securing ofdm based wireless links using temporal artificial noise injection")
  Member "towards the secrecy capacity of the gaussian mimo wire tap channel the 2 2 1 channel":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "interplay between noma and other emerging technologies a survey")

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)