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 "coding with scrambling concatenation and harq for the awgn wire tap channel a security gap analysis"):
  Abstract: This paper examines the use of nonsystematic channel codes to obtain secure transmissions over the additive white Gaussian noise wire-tap channel. Unlike the previous approaches, we propose to implement nonsystematic coded transmission by scrambling the information bits, and characterize the bit error rate of scrambled transmissions through theoretical arguments and numerical simulations. We have focused on some examples of Bose-Chaudhuri-Hocquenghem and low-density parity-check codes to estimate the security gap, which we have used as a measure of physical layer security, in addition to the bit error rate. Based on a number of numerical examples, we found that such a transmission technique can outperform alternative solutions. In fact, when an eavesdropper (Eve) has a worse channel than the authorized user (Bob), the security gap required to reach a given level of security is very small. The amount of degradation of Eve's channel with respect to Bob's that is needed to achieve sufficient security can be further reduced by implementing scrambling and descrambling operations on blocks of frames, rather than on single frames. While Eve's channel has a quality equal to or better than that of Bob's channel, we have shown that the use of a hybrid automatic repeat-request protocol with authentication still allows achieving a sufficient level of security. Finally, the secrecy performance of some practical schemes has also been measured in terms of the equivocation rate about the message at the eavesdropper and compared with that of ideal codes.

Includes members:
  Member "secret sharing ldpc codes for the bpsk constrained gaussian wiretap channel":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "ldpc codes over gaussian multiple access wiretap channel")
  Member "increasing physical layer security through scrambled codes and arq":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "practical ldpc coded modulation schemes for the fading broadcast channel with confidential messages")
  Member "ldpc code design for the bpsk constrained gaussian wiretap channel":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "an overview of physical layer security with finite alphabet signaling")
  Member "non systematic codes for physical layer security":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "an overview of physical layer security with finite alphabet signaling")
  Member "on the throughput of secure hybrid arq protocols for gaussian block fading channels":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "tradeoff between delay and physical layer security in wireless networks")
  Member "arq secrecy from theory to practice":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "practical provably secure multi node communication")
  Member "the wiretap channel with feedback encryption over the channel":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "a survey of physical layer security techniques for 5g wireless networks and challenges ahead")

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)