human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "physical layer security coalitional games for distributed cooperation"
  Abstract: Cooperation between wireless network nodes is a promising technique for improving the physical layer security of wireless transmission, in terms of secrecy capacity, in the presence of multiple eavesdroppers. While existing physical layer security literature answered the question "what are the link-level secrecy capacity gains from cooperation?", this paper attempts to answer the question of "how to achieve those gains in a practical decentralized wireless network and in the presence of a secrecy capacity cost for information exchange?". For this purpose, we model the physical layer security cooperation problem as a coalitional game with non-transferable utility and propose a distributed algorithm for coalition formation. Through the proposed algorithm, the wireless users can autonomously cooperate and self-organize into disjoint independent coalitions, while maximizing their secrecy capacity taking into account the security costs during information exchange. We analyze the resulting coalitional structures, discuss their properties, and study how the users can self-adapt the network topology to environmental changes such as mobility. Simulation results show that the proposed algorithm allows the users to cooperate and self-organize while improving the average secrecy capacity per user up to 25.32% relative to the non-cooperative case.

Connected through hyperedge HE-1 (induced by source paper "secure multicast communications with private jammers"):
  with members:
    - "improving physical layer secrecy using full duplex jamming receivers"
    - "spatially selective artificial noise aided transmit optimization for miso multi eves secrecy rate maximization"
    - "jamming games in the mimo wiretap channel with an active eavesdropper"
    - "optimal and robust transmit designs for miso channel secrecy by semidefinite programming"
    - "cooperative jamming for secure communications in mimo relay networks"
    - "secure transmission with multiple antennas ii the mimome wiretap channel"

Connected through hyperedge HE-2 (induced by source paper "overlapping coalition formation games for emerging communication networks"):
  with members:
    - "coalitional graph games for popular content distribution in cognitive radio vanets"
    - "what will 5g be"
    - "coalitional games with overlapping coalitions for interference management in small cell networks"
    - "hedonic coalition formation for distributed task allocation among wireless agents"
    - "cooperative games with overlapping coalitions"
    - "coalition formation games for distributed cooperation among roadside units in vehicular networks"
    - "coalitional games for distributed collaborative spectrum sensing in cognitive radio networks"
    - "a distributed merge and split algorithm for fair cooperation in wireless networks"

Connected through hyperedge HE-3 (induced by source paper "coalitional game theory for communication networks a tutorial"):
  with members:
    - "coalitional games for distributed collaborative spectrum sensing in cognitive radio networks"
    - "coalitions in cooperative wireless networks"
    - "a distributed merge and split algorithm for fair cooperation in wireless networks"
    - "cores of cooperative games in information theory"
    - "a generic approach to coalition formation"
    - "complexity of determining nonemptiness of the core"

Connected through hyperedge HE-4 (induced by source paper "distributed coalition formation games for secure wireless transmission"):
  with members:
    - "coalitional game theory for communication networks a tutorial"
    - "a distributed merge and split algorithm for fair cooperation in wireless networks"
    - "a generic approach to coalition formation"

Question: Please tell me which class the center node 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)