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: "the single source two terminal network with network coding"
  Abstract: We consider a communication network with a single source that has a set of messages and two terminals where each terminal is interested in an arbitrary subset of messages at the source. A tight capacity region for this problem is demonstrated. We show by a simple graph-theoretic procedure that any such problem can be solved by performing network coding on the subset of messages that are requested by both the terminals and that routing is sufficient for transferring the remaining messages.

Connected through hyperedge HE-1 (induced by source paper "on secure network coding for multiple unicast traffic"):
  with members:
    - "coding across unicast sessions can increase the secure message capacity"
    - "on secure network coding for two unicast sessions studying butterflies"
    - "lp formulations for secrecy over erasure networks with feedback"
    - "secret message capacity of a line network"
    - "on secure network coding with nonuniform or restricted wiretap sets"

Connected through hyperedge HE-2 (induced by source paper "capacity results for multicasting nested message sets over combination networks"):
  with members:
    - "is non unique decoding necessary"
    - "network coding capacity regions via entropy functions"
    - "wireless network information flow a deterministic approach"
    - "entropy vectors and network codes"

Connected through hyperedge HE-3 (induced by source paper "generalized cut set bounds for broadcast networks"):
  with members:
    - "latent capacity region a case study on symmetric broadcast with common messages"
    - "mission impossible computing the network coding capacity region"
    - "fundamental constraints on multicast capacity regions"

Connected through hyperedge HE-4 (induced by source paper "low complexity non uniform demand multicast network coding problems"):
  with members:
    - "approximate graph coloring by semidefinite programming"

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)