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 in many to one networks an integrated game theoretic and information theoretic approach"):
  Abstract: This paper considers secret-key generation between several agents and a base station that observe independent and identically distributed realizations of correlated random variables. Each agent wishes to generate the longest possible individual key with the base station by means of public communication. All keys must be jointly kept secret from all external entities. In this many-to-one secret-key generation setting, it can be shown that the agents can take advantage of a collective protocol to increase the sum-rate of their generated keys. However, when each agent is only interested in maximizing its own secret-key rate, agents may be unwilling to participate in a collective protocol. Furthermore, when such a collective protocol is employed, how to fairly allocate individual key rates arises as a valid issue. This paper studies this tension between cooperation and self-interest with a game-theoretic treatment. The work establishes that cooperation is in the best interest of all individualistic agents and that there exists individual secret-key rate allocations that incentivize the agents to follow the protocol. Additionally, an explicit coding scheme that achieves such allocations is proposed.

Includes members:
  Member "polar coding for the broadcast channel with confidential messages a random binning analogy":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "explicit codes for the wiretap channel a unified design framework")
  Member "the capacity region of the source type model for secret key and private key generation":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "the private key capacity of a cooperative pairwise independent network")
  Member "polar coding for secret key generation":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "explicit codes for the wiretap channel a unified design framework")
  Member "separation of reliability and secrecy in rate limited secret key generation":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "explicit codes for the wiretap channel a unified design framework")
  Member "a game theoretic view of the interference channel impact of coordination and bargaining":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "repeated games for inter operator spectrum sharing")
  Member "a constrained evolutionary gaussian multiple access channel game":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "evolutionary games for multiple access control")
  Member "secret key and private key constructions for simple multiterminal source models":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "universal hashing for information theoretic security")
  Member "shannon meets nash on the interference channel":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "strategic communication with side information at the decoder")

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)