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 multicast over coded packet networks"
  Abstract: We consider the problem of establishing minimum-cost multicast connections over coded packet networks, i.e., packet networks where the contents of outgoing packets are arbitrary, causal functions of the contents of received packets. We consider both wireline and wireless packet networks as well as both static multicast (where membership of the multicast group remains constant for the duration of the connection) and dynamic multicast (where membership of the multicast group changes in time, with nodes joining and leaving the group). For static multicast, we reduce the problem to a polynomial-time solvable optimization problem, and we present decentralized algorithms for solving it. These algorithms, when coupled with existing decentralized schemes for constructing network codes, yield a fully decentralized approach for achieving minimum-cost multicast. By contrast, establishing minimum-cost static multicast connections over routed packet networks is a very difficult problem even using centralized computation, except in the special cases of unicast and broadcast connections. For dynamic multicast, we reduce the problem to a dynamic programming problem and apply the theory of dynamic programming to suggest how it may be solved.

Connected through hyperedge HE-1 (induced by source paper "asynchronous coded caching"):
  with members:
    - "decentralized asynchronous coded caching design and performance analysis in fog radio access networks"
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "on the optimality of separation between caching and delivery in general cache networks"
    - "on the placement delivery array design for centralized coded caching scheme"
    - "caching in combination networks novel multicast message generation and delivery by leveraging the network topology"
    - "coded caching schemes with reduced subpacketization from linear block codes"
    - "characterizing the rate memory tradeoff in cache networks within a factor of 2"
    - "coded caching for networks with the resolvability property"

Connected through hyperedge HE-2 (induced by source paper "updating content in cache aided coded multicast"):
  with members:
    - "centralized coded caching of correlated contents"
    - "coded multicast fronthauling and edge caching for multi connectivity transmission in fog radio access networks"
    - "communication cost for updating linear functions when message updates are sparse connections to maximally recoverable codes"
    - "cache aided coded multicast for correlated sources"
    - "adaptive caching networks with optimality guarantees"
    - "coded caching with nonuniform demands"
    - "decentralized coded caching attains order optimal memory rate tradeoff"
    - "fundamental limits of caching"

Connected through hyperedge HE-3 (induced by source paper "optimization based linear network coding for general connections of continuous flows"):
  with members:
    - "a linear network code construction for general integer connections based on the constraint satisfaction problem"
    - "on multi source networks enumeration rate region computation and hierarchy"
    - "the two unicast problem"
    - "decentralized constraint satisfaction"
    - "index coding an interference alignment perspective"
    - "scalar linear solvability of matroidal networks associated with representable matroids"
    - "optimal reverse carpooling over wireless networks a distributed optimization approach"
    - "on the index coding problem and its relation to network coding and matroid theory"

Connected through hyperedge HE-4 (induced by source paper "efficient algorithms for the data exchange problem"):
  with members:
    - "coded cooperative data exchange in multihop networks"
    - "coded cooperative data exchange problem for general topologies"
    - "optimal deterministic polynomial time data exchange for omniscience"
    - "on coding for cooperative data exchange"

Connected through hyperedge HE-5 (induced by source paper "microcast cooperative video streaming using cellular and d2d connections"):
  with members:
    - "relieving the wireless infrastructure when opportunistic networks meet guaranteed delays"

Connected through hyperedge HE-6 (induced by source paper "multicasting in cognitive radio networks"):
  with members:
    - "artificial intelligence based cognitive routing for cognitive radio networks"

Connected through hyperedge HE-7 (induced by source paper "network coding for multicasting over rayleigh fading multi access channels"):
  with members:
    - "on coding for reliable communication over packet networks"

Connected through hyperedge HE-8 (induced by source paper "structural and optimization properties for joint selection of source rates and network flow"):
  with members:
    - "minimum cost distributed source coding over a network"

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)