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 "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.

Includes members:
  Member "information inequalities for joint distributions with interpretations and applications":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "dual loomis whitney inequalities via information theory")
  Member "minimum cost distributed source coding over a network":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "self organizing networks of information gathering cognitive agents")
  Member "coalition games with cooperative transmission a cure for the curse of boundary nodes in selfish packet forwarding wireless networks":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "coalitional game theoretic approach for cooperative transmission in vehicular networks")
  Member "generalized entropy power inequalities and monotonicity properties of information":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "two remarks on generalized entropy power inequalities")
  Member "combinatorial auctions with decreasing marginal utilities":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "complexity theory game theory and economics the barbados lectures")

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)