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: "minimum cost distributed source coding over a network"
  Abstract: This work considers the problem of transmitting multiple compressible sources over a network at minimum cost. The aim is to find the optimal rates at which the sources should be compressed and the network flows using which they should be transmitted so that the cost of the transmission is minimal. We consider networks with capacity constraints and linear cost functions. The problem is complicated by the fact that the description of the feasible rate region of distributed source coding problems typically has a number of constraints that is exponential in the number of sources. This renders general purpose solvers inefficient. We present a framework in which these problems can be solved efficiently by exploiting the structure of the feasible rate regions coupled with dual decomposition and optimization techniques such as the subgradient method and the proximal bundle method.

Connected through hyperedge HE-1 (induced by source paper "self organizing networks of information gathering cognitive agents"):
  with members:
    - "social data offloading in d2d enhanced cellular networks by network formation games"
    - "conjoining speeds up information diffusion in overlaying social physical networks"
    - "dynamic network formation with incomplete information"
    - "a game theoretic analysis of incentives in content production and sharing over peer to peer networks"
    - "coalition formation games for distributed cooperation among roadside units in vehicular networks"
    - "coalitional games for distributed collaborative spectrum sensing in cognitive radio networks"
    - "network information flow with correlated sources"

Connected through hyperedge HE-2 (induced by source paper "dynamic optimization for heterogeneous powered wireless multimedia sensor networks with correlated sources and network coding"):
  with members:
    - "optimal power allocation for energy harvesting and power grid coexisting wireless communication systems"

Connected through hyperedge HE-3 (induced by source paper "structural and optimization properties for joint selection of source rates and network flow"):
  with members:
    - "minimum cost multicast over coded packet networks"

Connected through hyperedge HE-4 (induced by source paper "minimum communication cost for joint distributed source coding and dispersive information routing"):
  with members:
    - "source coding for a simple network with receiver side information"

Connected through hyperedge HE-5 (induced by source paper "minimum cost mirror sites using network coding replication versus coding at the source nodes"):
  with members:
    - "on the delay of network coding over line networks"
    - "minimum cost multicast over coded packet networks"
    - "minimal network coding for multicast"

Connected through hyperedge HE-6 (induced by source paper "polymatroids with network coding"):
  with members:
    - "multicasting correlated multi source to multi sink over a network"
    - "wireless network information flow"
    - "network information flow with correlated sources"

Connected through hyperedge HE-7 (induced by source paper "multicasting correlated multi source to multi sink over a network"):
  with members:
    - "wireless network information flow"
    - "network information flow with correlated sources"

Connected through hyperedge HE-8 (induced by source paper "selfish distributed compression over networks correlation induces anarchy"):
  with members:
    - "minimum cost mirror sites using network coding replication versus coding at the source nodes"
    - "rate and power allocation under the pairwise distributed source coding constraint"
    - "coalition games with cooperative transmission a cure for the curse of boundary nodes in selfish packet forwarding wireless networks"
    - "minimum cost multicast over coded packet networks"
    - "network information flow with correlated sources"

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)