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 "secrecy in mimo networks with no eavesdropper csit"):
  Abstract: We consider two fundamental multi-user channel models: the multiple-input multiple-output (MIMO) wiretap channel with one helper (WTH) and the MIMO multiple access wiretap channel (MAC-WT). In each case, the eavesdropper has $K$ antennas while the remaining terminals have $N$ antennas each. We consider a fast fading channel where the channel state information (CSI) of the legitimate receiver is available at the transmitters but no channel state information at the transmitters (CSIT) is available for the eavesdropper's channel. We determine the optimal sum secure degrees of freedom (s.d.o.f.) for each channel model for the regime $K\leq N$, and show that in this regime, the MAC-WT channel reduces to the WTH in the absence of eavesdropper CSIT. For the regime $N\leq K\leq 2N$, we obtain the optimal linear s.d.o.f., and show that the MAC-WT channel and the WTH have the same optimal s.d.o.f. when restricted to linear encoding strategies. In the absence of any such restrictions, we provide an upper bound for the sum s.d.o.f. of the MAC-WT chanel in the regime $N\leq K\leq 2N$. Our results show that unlike in the single-input single-output (SISO) case, there is loss of s.d.o.f. for even the WTH due to lack of eavesdropper CSIT when $K\geq N$.

Includes members:
  Member "secure degrees of freedom of one hop wireless networks with no eavesdropper csit":
    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 degrees of freedom of the multiple access wiretap channel with multiple antennas":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on the gaussian multiple access wiretap channel and the gaussian wiretap channel with a helper achievable schemes and upper bounds")
  Member "secure degrees of freedom for the mimo wire tap channel with a multi antenna cooperative jammer":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "secure degrees of freedom of the multiple access wiretap channel with multiple antennas")
  Member "secure degrees of freedom of one hop wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "towards an algebraic network information theory simultaneous joint typicality decoding")
  Member "feasibility of interference alignment for the mimo interference channel":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "the interference channel revisited aligning interference by adjusting receive antenna separation")
  Member "blind mimome wiretap channel with delayed csit":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "on the dof of parallel miso bcs with partial csit total order and separability")
  Member "mimo broadcast channel with an unknown eavesdropper secrecy degrees of freedom":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "secure degrees of freedom of one hop wireless networks with no eavesdropper csit")
  Member "secure degrees of freedom of the gaussian wiretap channel with helpers and no eavesdropper csi blind cooperative jamming":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "optimal secure gdof of symmetric gaussian wiretap channel with a helper")

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)