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 "coded cooperative data exchange for a secret key"):
  Abstract: We consider a coded cooperative data exchange problem with the goal of generating a secret key. Specifically, we investigate the number of public transmissions required for a set of clients to agree on a secret key with probability one, subject to the constraint that it remains private from an eavesdropper. #R##N#Although the problems are closely related, we prove that secret key generation with fewest number of linear transmissions is NP-hard, while it is known that the analogous problem in traditional cooperative data exchange can be solved in polynomial time. In doing this, we completely characterize the best possible performance of linear coding schemes, and also prove that linear codes can be strictly suboptimal. Finally, we extend the single-key results to characterize the minimum number of public transmissions required to generate a desired integer number of statistically independent secret keys.

Includes members:
  Member "on the communication complexity of secret key generation in the multiterminal source model":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "on the public communication needed to achieve sk capacity in the multiterminal source model")
  Member "on the existence of mds codes over small fields with constrained generator matrices":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "gabidulin codes with support constrained generator matrices")
  Member "common information and secret key capacity":
    also connected through other hyperedges:
      - Hyperedge HE-3 (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-4 (induced by source paper "part i improving computational efficiency of communication for omniscience")
  Member "an equivalence between network coding and index coding":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "embedded index coding")
  Member "coded cooperative data exchange problem for general topologies":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "a monetary mechanism for stabilizing cooperative data exchange with selfish users")
  Member "data exchange problem with helpers":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "network codes for real time applications")
  Member "optimal deterministic polynomial time data exchange for omniscience":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "efficient algorithms for the data exchange problem")

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)