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 "wiretap secret key capacity of tree pin"):
  Abstract: Secret key agreement (SKA) is an essential primitive in cryptography and information security. In a multiterminal key agreement problem, there are a set of terminals each having access to a component of vector random variable. The goal of the terminals is to establish a shared key among a designated subset of terminals. This problem has been studied under different assumptions about the adversary's information, the most general case corresponding to the setting where adversary's information is represented by a random variable that is correlated with all terminals' variables. Secret key capacity for this general adversary that is known as the wiretap adversary, is not known in the general case. In this paper, we calculate the wiretap secret key capacity of a Tree-PIN, and present a protocol that achieves this capacity for SKA among an arbitrary subset of terminals. We relate our work with known results and discuss future directions for research.

Includes members:
  Member "secrecy capacity under limited discussion rate for minimally connected 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 "on the optimality of secret key agreement via omniscience":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "secret key agreement for hypergraphical sources with limited total discussion")
  Member "the private key capacity of a cooperative pairwise independent network":
    also connected through other hyperedges:
      (none)
  Member "the communication complexity of achieving sk capacity in a class of pin models":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "on the optimality of secret key agreement via omniscience")
  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 "perfect omniscience perfect secrecy and steiner tree packing":
    also connected through other hyperedges:
      - Hyperedge HE-6 (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-7 (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)