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 "low power secret key agreement over ofdm"):
  Abstract: Information-theoretic secret-key agreement is perhaps the most practically feasible mechanism that provides unconditional security at the physical layer to date. In this paper, we consider the problem of secret-key agreement by sharing randomness at low power over an orthogonal frequency division multiplexing (OFDM) link, in the presence of an eavesdropper. The low power assumption greatly simplifies the design of the randomness sharing scheme, even in a fading channel scenario. We assess the performance of the proposed system in terms of secrecy key rate and show that a practical approach to key sharing is obtained by using low-density parity check (LDPC) codes for information reconciliation. Numerical results confirm the merits of the proposed approach as a feasible and practical solution. Moreover, the outage formulation allows to implement secret-key agreement even when only statistical knowledge of the eavesdropper channel is available.

Includes members:
  Member "coding with scrambling concatenation and harq for the awgn wire tap channel a security gap analysis":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "a survey of physical layer security techniques for 5g wireless networks and challenges ahead")
  Member "exploiting channel diversity in secret key generation from multipath fading randomness":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "design and implementation of secret key agreement for platoon based vehicular cyber physical systems")
  Member "secret sharing ldpc codes for the bpsk constrained gaussian wiretap channel":
    also connected through other hyperedges:
      - Hyperedge HE-3 (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-4 (induced by source paper "practical ldpc coded modulation schemes for the fading broadcast channel with confidential messages")
  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 "efficient reconciliation protocol for discrete variable quantum key distribution":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "improved reconciliation with polar codes in quantum key distribution")
  Member "secure communication in the low snr regime":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "secure transmission with large numbers of antennas and finite alphabet inputs")

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)