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 "secure compute and forward in a bidirectional relay"):
  Abstract: We consider the basic bidirectional relaying problem, in which two users in a wireless network wish to exchange messages through an intermediate relay node. In the compute-and-forward strategy, the relay computes a function of the two messages using the naturally occurring sum of symbols simultaneously transmitted by user nodes in a Gaussian multiple-access channel (MAC), and the computed function value is forwarded to the user nodes in an ensuing broadcast phase. In this paper, we study the problem under an additional security constraint, which requires that each user’s message be kept secure from the relay. We consider two types of security constraints: 1) perfect secrecy, in which the MAC channel output seen by the relay is independent of each user’s message and 2) strong secrecy, which is a form of asymptotic independence. We propose a coding scheme based on nested lattices, the main feature of which is that given a pair of nested lattices that satisfy certain goodness properties, we can explicitly specify probability distributions for randomization at the encoders to achieve the desired security criteria. In particular, our coding scheme guarantees perfect or strong secrecy even in the absence of channel noise. The noise in the channel only affects reliability of computation at the relay, and for Gaussian noise, we derive achievable rates for reliable and secure computation. We also present an application of our methods to the multihop line network in which a source needs to transmit messages to a destination through a series of intermediate relays.

Includes members:
  Member "semantically secure lattice codes for the gaussian wiretap channel":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "semantically secure lattice codes for compound mimo channels")
  Member "secure computation in a bidirectional relay":
    also connected through other hyperedges:
      (none)
  Member "reliable physical layer network coding":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "towards massive connectivity support for scalable mmtc communications in 5g networks")
  Member "lattice codes for the gaussian wiretap channel":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "ldpc based code hopping for gaussian wiretap channel with limited feedback")
  Member "strong secrecy and reliable byzantine detection in the presence of an untrusted relay":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "byzantine multiple access")
  Member "secrecy gain a wiretap lattice code design":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "a survey of physical layer security techniques for 5g wireless networks and challenges ahead")
  Member "channel coding and decoding in a relay system operated with physical layer network coding":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "deep learning based constellation optimization for physical network coding in two way relay networks")
  Member "providing secrecy with lattice codes":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "perfect secrecy in physical layer network coding systems from structured interference")

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)