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 "multiterminal secret key agreement at asymptotically zero discussion rate"):
  Abstract: In the multiterminal secret key agreement problem, a set of users want to discuss with each other until they share a common secret key independent of their discussion. We want to characterize the maximum secret key rate, called the secrecy capacity, asymptotically when the total discussion rate goes to zero. In the case of only two users, the capacity is equal to the G\'acs-K\"orner common information. However, when there are more than two users, the capacity is unknown. It is plausible that a multivariate extension of the G\'acs-K\"orner common information is the capacity, however, proving the converse is challenging. We resolved this for the hypergraphical sources and finite linear sources, and provide efficiently computable characterizations. We also give some ideas of extending the techniques to more general source models.

Includes members:
  Member "upper bounds via lamination on the constrained secrecy capacity of hypergraphical sources":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "secret key agreement for hypergraphical sources with limited total discussion")
  Member "secret key agreement under discussion rate constraints":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "secret key agreement for hypergraphical sources with limited total discussion")
  Member "common randomness and key generation with limited interaction":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "compressed secret key agreement maximizing multivariate mutual information per bit")
  Member "on the public communication needed to achieve sk capacity in the multiterminal source model":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "communication for generating correlation a unifying survey")
  Member "coded cooperative data exchange for a secret key":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "secret key agreement for hypergraphical sources with limited total discussion")
  Member "common information and secret key capacity":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "communication for generating correlation a unifying survey")
  Member "perfect omniscience perfect secrecy and steiner tree packing":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "secret key agreement for hypergraphical sources with limited total discussion")
  Member "secret key generation for a pairwise independent network model":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "secret key agreement for hypergraphical sources with limited total discussion")

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)