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 "secured communication over frequency selective fading channels a practical vandermonde precoding"):
  Abstract: In this paper, we study the frequency-selective broadcast channel with confidential messages (BCC) in which the transmitter sends a confidential message to receiver 1 and a common message to receivers 1 and 2. In the case of a block transmission of N symbols followed by a guard interval of L symbols, the frequency-selective channel can be modeled as a N * (N+L) Toeplitz matrix. For this special type of multiple-input multiple-output (MIMO) channels, we propose a practical Vandermonde precoding that consists of projecting the confidential messages in the null space of the channel seen by receiver 2 while superposing the common message. For this scheme, we provide the achievable rate region, i.e. the rate-tuple of the common and confidential messages, and characterize the optimal covariance inputs for some special cases of interest. It is proved that the proposed scheme achieves the optimal degree of freedom (d.o.f) region. More specifically, it enables to send l <= L confidential messages and N-l common messages simultaneously over a block of N+L symbols. Interestingly, the proposed scheme can be applied to secured multiuser scenarios such as the K+1-user frequency-selective BCC with K confidential messages and the two-user frequency-selective BCC with two confidential messages. For each scenario, we provide the achievable secrecy degree of freedom (s.d.o.f.) region of the corresponding frequency-selective BCC and prove the optimality of the Vandermonde precoding. One of the appealing features of the proposed scheme is that it does not require any specific secrecy encoding technique but can be applied on top of any existing powerful encoding schemes.

Includes members:
  Member "interference alignment for secrecy":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "adding common randomness can remove the secrecy constraints in communication networks")
  Member "secure transmission with multiple antennas ii the mimome wiretap channel":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "multi antenna jamming in covert communication")
  Member "the secrecy capacity region of the gaussian mimo multi receiver wiretap channel":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "secure relaying in non orthogonal multiple access trusted and untrusted scenarios")
  Member "on the 3 receiver broadcast channel with degraded message sets and confidential messages":
    also connected through other hyperedges:
      (none)
  Member "the secrecy capacity region of the gaussian mimo broadcast channel":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "the secrecy capacity region of the degraded vector gaussian broadcast channel")
  Member "the k receiver broadcast channel with confidential messages":
    also connected through other hyperedges:
      (none)
  Member "discrete memoryless interference and broadcast channels with confidential messages secrecy rate regions":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "cognitive radio networks an information theoretic perspective")
  Member "secrecy capacity of a class of broadcast channels with an eavesdropper":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "feedback coding schemes for the broadcast channel with mutual secrecy requirement")

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)