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 agreement for hypergraphical sources with limited total discussion"):
  Abstract: We consider the multiterminal secret key agreement problem under the total discussion rate constraint and characterized the secrecy capacity for the hypergraphical sources. Our result not only covers the existing characterization for pairwise independent network but also extends it to the case with helpers, where the existing tree-packing protocol is known to be suboptimal. We show that decremental secret key agreement is optimal instead, which resolves a previous conjecture in the affirmative. The converse is established by a single-letter upper bound on secrecy capacity for general sources that are not necessarily hypergraphical. The minimax optimization involved in the upper bound can be relaxed to give various existing bounds such as the lamination bounds for hypergraphical sources, helper-set bound for general sources, the bound at asymptotically zero discussion rate via multivariate Gacs--Korner common information, and the lower bound on communication complexity via a multivariate extension of Wyner common information. Our result not only unifies existing bounding techniques but also reveals surprising connections between seemingly different information-theoretic notions. We point out further challenges by showing that the bound can be loose for a simple finite linear source.

Includes members:
  Member "multiterminal secret key agreement with nearly no discussion":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "one shot perfect secret key agreement for finite linear sources")
  Member "one shot perfect secret key agreement for finite linear sources":
    also connected through other hyperedges:
      (none)
  Member "secrecy capacity under limited discussion rate for minimally connected hypergraphical sources":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "wiretap secret key capacity of tree pin")
  Member "upper bounds via lamination on the constrained secrecy capacity of hypergraphical sources":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "multiterminal secret key agreement with nearly no discussion")
  Member "multiterminal secret key agreement at asymptotically zero discussion rate":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "multiterminal secret key agreement with nearly no discussion")
  Member "secret key agreement under discussion rate constraints":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "multiterminal secret key agreement with nearly no discussion")
  Member "compressed secret key agreement maximizing multivariate mutual information per bit":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "multiterminal secret key agreement with nearly no discussion")
  Member "on the optimality of secret key agreement via omniscience":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "coordination through shared randomness")

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)