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 "optimization of the parity check matrix density in qc ldpc code based mceliece cryptosystems"):
  Abstract: Low-density parity-check (LDPC) codes are one of the most promising families of codes to replace the Goppa codes originally used in the McEliece cryptosystem. In fact, it has been shown that by using quasi-cyclic low-density parity-check (QC-LDPC) codes in this system, drastic reductions in the public key size can be achieved, while maintaining fixed security levels. Recently, some proposals have appeared in the literature using codes with denser parity-check matrices, named moderate-density parity-check (MDPC) codes. However, the density of the parity-check matrices to be used in QC-LDPC code-based variants of the McEliece cryptosystem has never been optimized. This paper aims at filling such gap, by proposing a procedure for selecting the density of the private parity-check matrix, based on the security level and the decryption complexity. We provide some examples of the system parameters obtained through the proposed technique.

Includes members:
  Member "security and complexity of the mceliece cryptosystem based on quasi cyclic low density parity check codes":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "analysis of the error correction capability of ldpc and mdpc codes under parallel bit flipping decoding and application to cryptography")
  Member "low power secret key agreement over ofdm":
    also connected through other hyperedges:
      (none)
  Member "coding with scrambling concatenation and harq for the awgn wire tap channel a security gap analysis":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a survey of physical layer security techniques for 5g wireless networks and challenges ahead")
  Member "increasing physical layer security through scrambled codes and arq":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "practical ldpc coded modulation schemes for the fading broadcast channel with confidential messages")
  Member "enhanced public key security for the mceliece cryptosystem":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "on the security of a loidreau s rank metric code based encryption scheme")
  Member "on a family of circulant matrices for quasi cyclic low density generator matrix codes":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "soft mceliece mdpc code based mceliece cryptosystems with very compact keys through real valued intentional errors")
  Member "non systematic codes for physical layer security":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "an overview of physical layer security with finite alphabet signaling")
  Member "construction of near optimum burst erasure correcting low density parity check codes":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "improving the efficiency of the ldpc code based mceliece cryptosystem through irregular codes")

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)