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 "secret key generation for minimally connected hypergraphical sources"):
  Abstract: This paper investigates the secret key generation in the multiterminal source model, where users observing correlated sources discuss interactively under limited rates to agree on a secret key. We focus on a class of sources representable by minimally connected hypergraphs. For such sources, we give a single-letter explicit characterization of the region of achievable secret key rate and public discussion rate tuple. This is the first result that completely characterizes the achievable rate region for a multiterminal source model, which is beyond the PIN model on a tree. We also obtain an explicit formula for the maximum achievable secret key rate, called the constrained secrecy capacity, as a function of the total discussion rate.

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 "upper bounds via lamination on the constrained secrecy capacity of hypergraphical sources":
    also connected through other hyperedges:
      - Hyperedge HE-2 (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-3 (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-4 (induced by source paper "secret key agreement for hypergraphical sources with limited total discussion")
  Member "bounds on the communication rate needed to achieve sk capacity in the hypergraphical source model":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "secret key agreement for hypergraphical sources with limited total discussion")
  Member "secret key generation with limited interaction":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "communication for generating correlation a unifying survey")
  Member "info clustering a mathematical theory for data clustering":
    also connected through other hyperedges:
      - Hyperedge HE-7 (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-8 (induced by source paper "communication for generating correlation a unifying survey")

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)