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 "bounds on the communication rate needed to achieve sk capacity in the hypergraphical source model"):
  Abstract: In the multiterminal source model of Csiszar and Narayan, the communication complexity, R SK , for secret key (SK) generation is the minimum rate of communication required to achieve SK capacity. An obvious upper bound to R SK  is given by R CO , which is the minimum rate of communication required for omniscience. In this paper we derive a better upper bound to R SK  for the hypergraphical source model, which is a special instance of the multiterminal source model. The upper bound is based on the idea of fractional removal of hyperedges. It is further shown that this upper bound can be computed in polynomial time. We conjecture that our upper bound is tight. For the special case of a graphical source model, we also give an explicit lower bound on R SK . This bound, however, is not tight, as demonstrated by a counterexample.

Includes members:
  Member "incremental and decremental secret key agreement":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "secret key agreement for hypergraphical sources with limited total discussion")
  Member "on the public communication needed to achieve sk capacity in the multiterminal source model":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "communication for generating correlation a unifying survey")
  Member "the communication complexity of achieving sk capacity in a class of pin models":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "wiretap secret key capacity of tree pin")
  Member "coded cooperative data exchange for a secret key":
    also connected through other hyperedges:
      - Hyperedge HE-4 (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-5 (induced by source paper "on the public communication needed to achieve sk capacity in the multiterminal source model")
  Member "wyner s common information generalizations and a new lossy source coding interpretation":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "on exact and infty r enyi common informations")
  Member "common information and secret key capacity":
    also connected through other hyperedges:
      - Hyperedge HE-7 (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-8 (induced by source paper "part i improving computational efficiency of communication for omniscience")

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)