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: "coded cooperative data exchange in multihop networks"
  Abstract: Consider a connected network of n nodes that all wish to recover k desired packets. Each node begins with a subset of the desired packets and exchanges coded packets with its neighbors. This paper provides necessary and sufficient conditions which characterize the set of all transmission schemes that permit every node to ultimately learn (recover) all k packets. When the network satisfies certain regularity conditions and packets are randomly distributed, this paper provides tight concentration results on the number of transmissions required to achieve universal recovery. For the case of a fully connected network, a polynomial-time algorithm for computing an optimal transmission scheme is derived. An application to secrecy generation is discussed.

Connected through hyperedge HE-1 (induced by source paper "part i improving computational efficiency of communication for omniscience"):
  with members:
    - "part ii a practical approach for successive omniscience"
    - "improving computational efficiency of communication for omniscience and successive omniscience"
    - "secret key agreement under discussion rate constraints"
    - "a faster algorithm for asymptotic communication for omniscience"
    - "info clustering a mathematical theory for data clustering"
    - "on the public communication needed to achieve sk capacity in the multiterminal source model"
    - "efficient algorithms for the data exchange problem"
    - "perfect omniscience perfect secrecy and steiner tree packing"

Connected through hyperedge HE-2 (induced by source paper "part ii a practical approach for successive omniscience"):
  with members:
    - "part i improving computational efficiency of communication for omniscience"
    - "attaining fairness in communication for omniscience"
    - "improving computational efficiency of communication for omniscience and successive omniscience"
    - "successive local and successive global omniscience"
    - "a practical approach for successive omniscience"
    - "universal multiparty data exchange and secret key agreement"
    - "a faster algorithm for asymptotic communication for omniscience"
    - "iterative merging algorithm for cooperative data exchange"

Connected through hyperedge HE-3 (induced by source paper "decentralized pliable index coding"):
  with members:
    - "tight information theoretic converse results for some pliable index coding problems"
    - "mds matrices over small fields a proof of the gm mds conjecture"
    - "capacity theorems for distributed index coding"
    - "the benefit of being flexible in distributed computation"
    - "the single uniprior index coding problem the single sender case and the multi sender extension"
    - "a polynomial time algorithm for pliable index coding"
    - "efficient algorithms for the data exchange problem"
    - "fundamental limits of caching in wireless d2d networks"

Connected through hyperedge HE-4 (induced by source paper "attaining fairness in communication for omniscience"):
  with members:
    - "a faster algorithm for asymptotic communication for omniscience"
    - "fairest constant sum rate transmission for cooperative data exchange an m convex minimization approach"
    - "structured convex optimization under submodular constraints"
    - "on coding for cooperative data exchange"
    - "on tightness of mutual dependence upperbound for secret key capacity of multiple terminals"
    - "a quantitative measure of fairness and discrimination for resource allocation in shared computer systems"

Connected through hyperedge HE-5 (induced by source paper "improving computational efficiency of communication for omniscience and successive omniscience"):
  with members:
    - "a practical approach for successive omniscience"
    - "a faster algorithm for asymptotic communication for omniscience"
    - "iterative merging algorithm for cooperative data exchange"
    - "efficient algorithms for the data exchange problem"
    - "on coding for cooperative data exchange"
    - "on tightness of mutual dependence upperbound for secret key capacity of multiple terminals"

Connected through hyperedge HE-6 (induced by source paper "a monetary mechanism for stabilizing cooperative data exchange with selfish users"):
  with members:
    - "a game theoretic perspective on communication for omniscience"
    - "efficient algorithms for the data exchange problem"
    - "coded cooperative data exchange for a secret key"
    - "coded cooperative data exchange problem for general topologies"
    - "on coding for cooperative data exchange"

Connected through hyperedge HE-7 (induced by source paper "cooperative data exchange based on mds codes"):
  with members:
    - "successive local and successive global omniscience"
    - "universal multiparty data exchange and secret key agreement"
    - "cooperative data exchange with unreliable clients"
    - "efficient algorithms for the data exchange problem"
    - "balanced sparsest generator matrices for mds codes"
    - "coded cooperative data exchange problem for general topologies"
    - "on coding for cooperative data exchange"

Connected through hyperedge HE-8 (induced by source paper "successive local and successive global omniscience"):
  with members:
    - "cooperative data exchange with unreliable clients"
    - "efficient algorithms for the data exchange problem"
    - "coded cooperative data exchange for a secret key"
    - "coded cooperative data exchange problem for general topologies"

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)