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: "minimal network coding for multicast"
  Abstract: We give an information flow interpretation for multicasting using network coding. This generalizes the fluid model used to represent flows to a single receiver. Using the generalized model, we present a decentralized algorithm to minimize the number of packets that undergo network coding. We also propose a decentralized algorithm to construct capacity achieving multicast codes when the processing at some nodes is restricted to routing. The proposed algorithms can be coupled with existing decentralized schemes to achieve minimum cost muticast.

Connected through hyperedge HE-1 (induced by source paper "genetic algorithm based resource minimization in network code based peer to peer network"):
  with members:
    - "evolutionary approaches to minimizing network coding resources"
    - "generating connected acyclic digraphs uniformly at random"

Connected through hyperedge HE-2 (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 distributed source coding over a network"
    - "minimum cost multicast over coded packet networks"

Connected through hyperedge HE-3 (induced by source paper "encoding complexity of network coding with two simple multicast sessions"):
  with members:
    - "two unicast information flows over linear deterministic networks"

Connected through hyperedge HE-4 (induced by source paper "evolutionary approaches to minimizing network coding resources"):
  with members:
    - "genetic representations for evolutionary minimization of network coding resources"
    - "generating connected acyclic digraphs uniformly at random"

Connected through hyperedge HE-5 (induced by source paper "efficient operation of coded packet networks"):
  with members:
    - "minimum cost multicast over coded packet networks"
    - "coding schemes for line networks"
    - "further results on coding for reliable communication over packet networks"
    - "on coding for reliable communication over packet networks"

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)