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 "on the secrecy degress of freedom of the multi antenna block fading wiretap channels"):
  Abstract: We consider the multi-antenna wiretap channel in which the transmitter wishes to send a confidential message to its receiver while keeping it secret to the eavesdropper. It has been known that the secrecy capacity of such a channel does not increase with signal-to-noise ratio when the transmitter has no channel state information (CSI) under mild conditions. Motivated by Jafar's robust interference alignment technique, we study the so-called staggered multi-antenna block-fading wiretap channel where the legitimate receiver and the eavesdropper have different temporal correlation structures. Assuming no CSI at transmitter, we characterize lower and upper bounds on the secrecy degrees of freedom (s.d.o.f.) of the channel at hand. Our results show that a positive s.d.o.f. can be ensured whenever two receivers experience different fading variation. Remarkably, very simple linear precoding schemes provide the optimal s.d.o.f. in some cases of interest.

Includes members:
  Member "interference alignment for the multi antenna compound wiretap channel":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "mimo multiple access channel with an arbitrarily varying eavesdropper")
  Member "on the secure dof of the single antenna mac":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "optimal secure gdof of symmetric gaussian wiretap channel with a helper")
  Member "exploiting channel correlations simple interference alignment schemes with no csit":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "achievable dof delay trade offs for the k user mimo interference channel with delayed csit")
  Member "on the degrees of freedom of the compound mimo broadcast channels with finite states":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "optimality of simple layered superposition coding in the 3 user miso bc with finite precision csit")
  Member "on the compound mimo broadcast channels with confidential messages":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "the secrecy capacity of compound gaussian mimo wiretap channels")
  Member "on the degrees of freedom of finite state compound wireless networks settling a conjecture by weingarten et al":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "mimo broadcast channel with an unknown eavesdropper secrecy degrees of freedom")
  Member "on the secure degrees of freedom in the k user gaussian interference channel":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "friendly jamming in a mimo wiretap interference network a nonconvex game approach")

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)