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: "exchanging third party information with minimum transmission cost"
  Abstract: In this paper, we consider the problem of minimizing the total transmission cost for exchanging channel state information. We proposed a network coded cooperative data exchange scheme, such that the total transmission cost is minimized while each client can decode all the channel information held by all other clients. In this paper, we first derive a necessary and sufficient condition for a feasible transmission. Based on the derived condition, there exists a feasible code design to guarantee that each client can decode the complete information. We further formulate the problem of minimizing the total transmission cost as an integer linear programming. Finally, we discuss the probability that each client can decode the complete information with distributed random linear network coding.

Connected through hyperedge HE-1 (induced by source paper "a game theoretic approach to minimize the completion time of network coded cooperative data exchange"):
  with members:
    - "on minimizing the maximum broadcast decoding delay for instantly decodable network coding"
    - "completion time reduction in instantly decodable network coding through decoding delay control"
    - "a lossy graph model for delay reduction in generalized instantly decodable network coding"
    - "partially blind instantly decodable network codes for lossy feedback environment"
    - "joint rate selection and wireless network coding for time critical applications"

Connected through hyperedge HE-2 (induced by source paper "coding based data broadcasting for time critical applications with rate adaptation"):
  with members:
    - "partial third party information exchange with network coding"
    - "error correction for cooperative data exchange"
    - "joint rate selection and wireless network coding for time critical applications"
    - "broadcasting with side information"

Connected through hyperedge HE-3 (induced by source paper "partial third party information exchange with network coding"):
  with members:
    - "on coding for cooperative data exchange"

Connected through hyperedge HE-4 (induced by source paper "error correction for cooperative data exchange"):
  with members:
    - "joint rate selection and wireless network coding for time critical applications"
    - "index coding and error correction"
    - "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)