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 "strong secrecy in pairwise key agreement over a generalized multiple access channel"):
  Abstract: This paper considers the problem of pairwise key agreement without public communication between three users connected through a generalized multiple access channel (MAC). While two users control the channel inputs, all three users observe noisy outputs from the channel and each pair of users wishes to agree on a secret key hidden from the remaining user. We first develop a "pre-generated" key-agreement scheme based on secrecy codes for the generalized MAC, in which the channel is only used to distribute pre-generated secret keys. We then extend this scheme to include an additional layer of rate-limited secret-key generation by treating the observed channel outputs as induced sources. We characterize inner and outer bounds on the strong secret-key capacity region for both schemes. For a special case of the "pre-generated" scheme, we obtain an exact characterization. We also illustrate with some binary examples that exploiting the generalized nature of the generalized MAC may lead to significantly larger key-agreement rates.

Includes members:
  Member "achievability proof via output statistics of random binning":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "biometric and physical identifiers with correlated noise for controllable private authentication")
  Member "strongly secure communications over the two way wiretap channel":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "secrecy rates for a channel with two senders and two receivers")
  Member "strong secrecy from channel resolvability":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "securing distributed function approximation via coding for continuous compound channels")
  Member "rate regions of secret key sharing in a new source model":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "secret key generation through a relay")
  Member "secret key generation for a pairwise independent network model":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "secret key agreement for hypergraphical sources with limited total discussion")
  Member "the secret key private key capacity region for three terminals":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "secret key generation in many to one networks an integrated game theoretic and information theoretic approach")

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)