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 gaussian multiple access wiretap channel and the gaussian wiretap channel with a helper achievable schemes and upper bounds"):
  Abstract: We study deterministic approximations of the Gaussian two-user multiple access wiretap channel (G-MAC-WT) and the Gaussian wiretap channel with a helper (G-WT-H). These approximations enable results beyond the recently shown 2/3 and 1/2 secure degrees of freedom (s.d.o.f.) for the G-MAC-WT and the G-WT-H, respectively. While the s.d.o.f. were obtained by real interference alignment, our approach uses signal-scale alignment. We show achievable schemes which are independent of the rationality of the channel gains. Moreover, our results can differentiate between channel strengths, in particular between both users, and establishes secrecy rates dependent on this difference. We can show that the resulting achievable secrecy rates tend to the s.d.o.f. for vanishing channel gain differences. Moreover, we extend previous and develop new techniques to prove general s.d.o.f. bounds for varying channel strengths and show that our achievable schemes reach the bounds for certain channel gain parameters. We believe that our analysis is the next step towards a constant-gap analysis of the G-MAC-WT and the G-WT-H.

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 "on the deterministic sum capacity of the multiple access wiretap channel":
    also connected through other hyperedges:
      (none)
  Member "on multiuser gain and the constant gap sum capacity of the gaussian interfering multiple access channel":
    also connected through other hyperedges:
      (none)
  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 "secrecy in mimo networks with no eavesdropper csit")
  Member "towards a constant gap sum capacity result for the gaussian wiretap channel with a helper":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "adding common randomness can remove the secrecy constraints in communication networks")
  Member "secure degrees of freedom of the gaussian diamond wiretap channel":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "capacity bounds on the downlink of symmetric multi relay single receiver c ran networks")
  Member "finite snr regime analysis of the gaussian wiretap multiple access channel":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "adding common randomness can remove the secrecy constraints in communication networks")
  Member "secure degrees of freedom of one hop wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "towards an algebraic network information theory simultaneous joint typicality decoding")

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)