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: "cores of cooperative games in information theory"
  Abstract: Cores of cooperative games are ubiquitous in information theory and arise most frequently in the characterization of fundamental limits in various scenarios involving multiple users. Examples include classical settings in network information theory such as Slepian-Wolf source coding and multiple access channels, classical settings in statistics such as robust hypothesis testing, and new settings at the intersection of networking and statistics such as distributed estimation problems for sensor networks. Cooperative game theory allows one to understand aspects of all these problems from a fresh and unifying perspective that treats users as players in a game, sometimes leading to new insights. At the heart of these analyses are fundamental dualities that have been long studied in the context of cooperative games; for information theoretic purposes, these are dualities between information inequalities on the one hand and properties of rate, capacity, or other resource allocation regions on the other.

Connected through hyperedge HE-1 (induced by source paper "fairness in multiterminal data compression decomposition of shapley value"):
  with members:
    - "on coding for cooperative data exchange"

Connected through hyperedge HE-2 (induced by source paper "secret key generation in many to one networks an integrated game theoretic and information theoretic approach"):
  with members:
    - "polar coding for the broadcast channel with confidential messages a random binning analogy"
    - "the capacity region of the source type model for secret key and private key generation"
    - "polar coding for secret key generation"
    - "separation of reliability and secrecy in rate limited secret key generation"
    - "a game theoretic view of the interference channel impact of coordination and bargaining"
    - "a constrained evolutionary gaussian multiple access channel game"
    - "secret key and private key constructions for simple multiterminal source models"
    - "shannon meets nash on the interference channel"

Connected through hyperedge HE-3 (induced by source paper "coalitional games for transmitter cooperation in mimo multiple access channels"):
  with members:
    - "distributed learning policies for power allocation in multiple access channels"
    - "the capacity of mimo channels with per antenna power constraint"
    - "power allocation games in wireless networks of multi antenna terminals"
    - "dynamic power allocation games in parallel multiple access channels"
    - "methodologies for analyzing equilibria in wireless games"
    - "coalitions in cooperative wireless networks"

Connected through hyperedge HE-4 (induced by source paper "coalitional game theory for communication networks a tutorial"):
  with members:
    - "physical layer security coalitional games for distributed cooperation"
    - "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"
    - "a generic approach to coalition formation"
    - "complexity of determining nonemptiness of the core"

Connected through hyperedge HE-5 (induced by source paper "information inequalities for joint distributions with interpretations and applications"):
  with members:
    - "entropy and set cardinality inequalities for partition determined functions"
    - "generalized entropy power inequalities and monotonicity properties of information"
    - "combinatorial auctions with decreasing marginal utilities"

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)