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: "a game theoretic perspective on communication for omniscience"
  Abstract: We propose a coalition game model for the problem of communication for omniscience (CO). In this game model, the core contains all achievable rate vectors for CO with sum-rate being equal to a given value. Any rate vector in the core distributes the sum-rate among users in a way that makes all users willing to cooperate in CO. We give the necessary and sufficient condition for the core to be nonempty. Based on this condition, we derive the expression of the minimum sum-rate for CO and show that this expression is consistent with the results in multivariate mutual information (MMI) and coded cooperative data exchange (CCDE). We prove that the coalition game model is convex if the sum-rate is no less than the minimal value. In this case, the core is non-empty and a rate vector in the core that allocates the sum-rate among the users in a fair manner can be found by calculating the Shapley value.

Connected through hyperedge HE-1 (induced by source paper "a monetary mechanism for stabilizing cooperative data exchange with selfish users"):
  with members:
    - "efficient algorithms for the data exchange problem"
    - "coded cooperative data exchange for a secret key"
    - "coded cooperative data exchange in multihop networks"
    - "coded cooperative data exchange problem for general topologies"
    - "on coding for cooperative data exchange"

Connected through hyperedge HE-2 (induced by source paper "fairness in communication for omniscience"):
  with members:
    - "estimating minimum sum rate for cooperative data exchange"
    - "fairest constant sum rate transmission for cooperative data exchange an m convex minimization approach"
    - "efficient algorithms for the data exchange problem"
    - "structured convex optimization under submodular constraints"
    - "coded cooperative data exchange in multihop networks"
    - "on coding for cooperative data exchange"
    - "a quantitative measure of fairness and discrimination for resource allocation in shared computer systems"

Connected through hyperedge HE-3 (induced by source paper "a faster algorithm for asymptotic communication for omniscience"):
  with members:
    - "info clustering a mathematical theory for data clustering"
    - "estimating minimum sum rate for cooperative data exchange"
    - "iterative merging algorithm for cooperative data exchange"
    - "fairest constant sum rate transmission for cooperative data exchange an m convex minimization approach"
    - "efficient algorithms for the data exchange problem"
    - "coded cooperative data exchange in multihop networks"
    - "on coding for cooperative data exchange"

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)