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 physical layer network coding versus secure network coding"):
  Abstract: Secure network coding realizes the secrecy of the message when the message is transmitted via noiseless network and a part of edges or a part of intermediate nodes are eavesdropped. In this framework, if the channels of the network has noise, we apply the error correction to noisy channel before applying the secure network coding. In contrast, secure physical layer network coding is a method to securely transmit a message by a combination of coding operation on nodes when the network is given as a set of noisy channels. In this paper, we give several examples of network, in which, secure physical layer network coding has advantage over secure network coding.

Includes members:
  Member "secure computation and forward with linear codes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "asymptotic analysis on ldpc bicm scheme for compute and forward relaying")
  Member "secure modulo sum via multiple access channel":
    also connected through other hyperedges:
      (none)
  Member "physical layer network coding a random coding error exponent perspective":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "compute and forward relaying with ldpc codes over qpsk scheme")
  Member "expanding the compute and forward framework unequal powers signal levels and multiple linear combinations":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "towards an algebraic network information theory simultaneous joint typicality decoding")
  Member "secure compute and forward in a bidirectional relay":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "towards an algebraic network information theory simultaneous joint typicality decoding")
  Member "strong secrecy and reliable byzantine detection in the presence of an untrusted relay":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "byzantine multiple access")
  Member "compute and forward harnessing interference through structured codes":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "private information retrieval over gaussian mac")

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.CR(Cryptography and Security)