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: "on coding for cooperative data exchange"
  Abstract: We consider the problem of data exchange by a group of closely-located wireless nodes. In this problem each node holds a set of packets and needs to obtain all the packets held by other nodes. Each of the nodes can broadcast the packets in its possession (or a combination thereof) via a noiseless broadcast channel of capacity one packet per channel use. The goal is to minimize the total number of transmissions needed to satisfy the demands of all the nodes, assuming that they can cooperate with each other and are fully aware of the packet sets available to other nodes. This problem arises in several practical settings, such as peer-to-peer systems and wireless data broadcast. In this paper, we establish upper and lower bounds on the optimal number of transmissions and present an efficient algorithm with provable performance guarantees. The effectiveness of our algorithms is established through numerical simulations.

Connected through hyperedge HE-1 (induced by source paper "embedded index coding"):
  with members:
    - "task based solutions to embedded index coding"
    - "cooperative multi sender index coding"
    - "linear index coding with multiple senders and extension to a cellular network"
    - "on locally decodable index codes"
    - "interlinked cycles for index coding generalizing cycles and cliques"
    - "distributed index coding"
    - "three stories on a two sided coin index coding locally recoverable distributed storage and guessing games on graphs"
    - "improved lower bounds for coded caching"

Connected through hyperedge HE-2 (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"
    - "coded cooperative data exchange in multihop networks"

Connected through hyperedge HE-3 (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-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"
    - "coded cooperative data exchange in multihop networks"
    - "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"
    - "coded cooperative data exchange in multihop networks"
    - "on tightness of mutual dependence upperbound for secret key capacity of multiple terminals"

Connected through hyperedge HE-6 (induced by source paper "packet loss recovery in broadcast for real time applications in dense wireless networks"):
  with members:
    - "broadcasting in time division duplexing a random linear network coding approach"
    - "informed network coding for minimum decoding delay"
    - "random linear network coding for time division duplexing when to stop talking and start listening"
    - "random linear network coding a free cipher"
    - "opportunistic network coding for video streaming over wireless"

Connected through hyperedge HE-7 (induced by source paper "upper bounds via lamination on the constrained secrecy capacity of hypergraphical sources"):
  with members:
    - "multiterminal secret key agreement at asymptotically zero discussion rate"
    - "secret key agreement under discussion rate constraints"
    - "on the optimality of secret key agreement via omniscience"
    - "bounds on the communication rate needed to achieve sk capacity in the hypergraphical source model"
    - "secret key generation with limited interaction"
    - "incremental and decremental secret key agreement"
    - "on the public communication needed to achieve sk capacity in the multiterminal source model"
    - "coded cooperative data exchange for a secret key"

Connected through hyperedge HE-8 (induced by source paper "on the packet decoding delay of linear network coded wireless broadcast"):
  with members:
    - "performance characterization and transmission schemes for instantly decodable network coding in wireless broadcast"
    - "on deterministic linear network coded broadcast and its relation to matroid theory"
    - "completion delay minimization for instantly decodable network codes"
    - "broadcasting in time division duplexing a random linear network coding approach"
    - "informed network coding for minimum decoding delay"
    - "on the index coding problem and its relation to network coding and matroid theory"

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)