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 "secret sharing ldpc codes for the bpsk constrained gaussian wiretap channel"):
  Abstract: The problem of secret sharing over the Gaussian wiretap channel is considered. A source and a destination intend to share secret information over a Gaussian channel in the presence of a wiretapper who observes the transmission through another Gaussian channel. Two constraints are imposed on the source-to-destination channel; namely, the source can transmit only binary phase-shift-keyed (BPSK) symbols, and symbol-by-symbol hard-decision quantization is applied to the received symbols of the destination. An error-free public channel is also available for the source and destination to exchange messages in order to help the secret-sharing process. The wiretapper can perfectly observe all messages in the public channel. It is shown that a secret-sharing scheme that employs a random ensemble of regular low-density parity-check (LDPC) codes can achieve the key capacity of the BPSK-constrained Gaussian wiretap channel asymptotically with increasing block length. To accommodate practical constraints of finite block length and limited decoding complexity, fixed irregular LDPC codes are also designed to replace the regular LDPC code ensemble in the proposed secret-sharing scheme.

Includes members:
  Member "achieving the secrecy capacity of wiretap channels using polar codes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "explicit codes for the wiretap channel a unified design framework")
  Member "polar coding for secure transmission and key agreement":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "polar codes for broadcast channels")
  Member "non systematic codes for physical layer security":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "an overview of physical layer security with finite alphabet signaling")
  Member "efficient reconciliation protocol for discrete variable quantum key distribution":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "improved reconciliation with polar codes in quantum key distribution")
  Member "channel polarization a method for constructing capacity achieving codes for symmetric binary input memoryless channels":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "reed muller codes theory and algorithms")
  Member "secret sharing over fast fading mimo wiretap channels":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "energy efficiency in secure multi antenna systems")
  Member "secure nested codes for type ii wiretap channels":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "generalizing multiple access wiretap and wiretap ii channel models achievable rates and cost of strong secrecy")
  Member "side information coding with turbo codes and its application to quantum key distribution":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "nonreciprocity compensation combined with turbo codes for secret key generation in vehicular ad hoc social iot networks")

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)