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 "the communication complexity of achieving sk capacity in a class of pin models"):
  Abstract: The communication complexity of achieving secret key (SK) capacity in the multiterminal source model of Csisz$\'a$r and Narayan is the minimum rate of public communication required to generate a maximal-rate SK. It is well known that the minimum rate of communication for omniscience, denoted by $R_{\text{CO}}$, is an upper bound on the communication complexity, denoted by $R_{\text{SK}}$. A source model for which this upper bound is tight is called $R_{\text{SK}}$-maximal. In this paper, we establish a sufficient condition for $R_{\text{SK}}$-maximality within the class of pairwise independent network (PIN) models defined on hypergraphs. This allows us to compute $R_{\text{SK}}$ exactly within the class of PIN models satisfying this condition. On the other hand, we also provide a counterexample that shows that our condition does not in general guarantee $R_{\text{SK}}$-maximality for sources beyond PIN models.

Includes members:
  Member "on the public communication needed to achieve sk capacity in the multiterminal source model":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "communication for generating correlation a unifying survey")
  Member "achieving sk capacity in the source model when must all terminals talk":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "compressed secret key agreement maximizing multivariate mutual information per bit")
  Member "coded cooperative data exchange for a secret key":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "secret key agreement for hypergraphical sources with limited total discussion")
  Member "on the communication complexity of secret key generation in the multiterminal source model":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "on the public communication needed to achieve sk capacity in the multiterminal source model")
  Member "common information and secret key capacity":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "communication for generating correlation a unifying survey")
  Member "coded cooperative data exchange in multihop networks":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "part i improving computational efficiency of communication for omniscience")
  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 "information inequalities for joint distributions with interpretations and applications":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "dual loomis whitney inequalities via information theory")

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)