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 "one shot perfect secret key agreement for finite linear sources"):
  Abstract: We consider a non-asymptotic (one-shot) version of the multiterminal secret key agreement problem on a finite linear source model. In this model, the observation of each terminal is a linear function of an underlying random vector composed of finitely many i.i.d. uniform random variables. Restricting the public discussion to be a linear function of the terminals' observations, we obtain a characterization of the communication complexity (minimum number of symbols of public discussion) of generating a secret key of maximum length. The minimum discussion is achieved by a non-interactive protocol in which each terminal first does a linear processing of its own private observations, following which the terminals all execute a discussion-optimal communication-for-omniscience protocol. The secret key is finally obtained as a linear function of the vector of all observations.

Includes members:
  Member "multiterminal secret key agreement with nearly no discussion":
    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 "multiterminal secret key agreement at asymptotically zero discussion rate":
    also connected through other hyperedges:
      - Hyperedge HE-3 (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-4 (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-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 "on the public communication needed to achieve sk capacity in the multiterminal source model":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "communication for generating correlation a unifying survey")
  Member "efficient algorithms for the data exchange problem":
    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)