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 wiretapped diamond relay channel"):
  Abstract: In this paper, we study a diamond-relay channel where the source is connected to $M$ relays through orthogonal links and the relays transmit to the destination over a wireless multiple-access channel in the presence of an eavesdropper. The eavesdropper not only observes the relay transmissions through another multiple-access channel, but also observes a certain number of source-relay links. The legitimate terminals know neither the eavesdropper's channel state information nor the location of source-relay links revealed to the eavesdropper except the total number of such links. #R##N#For this wiretapped diamond-relay channel, we establish the optimal secure degrees of freedom. In the achievability part, our proposed scheme uses the source-relay links to transmit a judiciously constructed combination of message symbols, artificial noise symbols as well as fictitious message symbols associated with secure network coding. The relays use a combination of beamforming and interference alignment in their transmission scheme. For the converse part, we take a genie-aided approach assuming that the location of wiretapped links is known.

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 "capacity bounds for diamond networks with an orthogonal broadcast channel":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on the capacity regions of cloud radio access networks with limited orthogonal fronthaul")
  Member "secure degrees of freedom of the gaussian diamond wiretap channel":
    also connected through other hyperedges:
      - Hyperedge HE-3 (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 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 "real interference alignment exploiting the potential of single antenna systems":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "multi antenna coded content delivery with caching a low complexity solution")
  Member "aligned image sets under channel uncertainty settling a conjecture by lapidoth shamai and wigger on the collapse of degrees of freedom under finite precision csit":
    also connected through other hyperedges:
      - Hyperedge HE-6 (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-7 (induced by source paper "optimal secure gdof of symmetric gaussian wiretap channel with a helper")
  Member "achievability proof via output statistics of random binning":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "biometric and physical identifiers with correlated noise for controllable private authentication")

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)