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: "optimal deterministic polynomial time data exchange for omniscience"
  Abstract: We study the problem of constructing a deterministic polynomial time algorithm that achieves omniscience, in a rate-optimal manner, among a set of users that are interested in a common file but each has only partial knowledge about it as side-information. Assuming that the collective information among all the users is sufficient to allow the reconstruction of the entire file, the goal is to minimize the (possibly weighted) amount of bits that these users need to exchange over a noiseless public channel in order for all of them to learn the entire file. Using established connections to the multi-terminal secrecy problem, our algorithm also implies a polynomial-time method for constructing a maximum size secret shared key in the presence of an eavesdropper. We consider the following types of side-information settings: (i) side information in the form of uncoded fragments/packets of the file, where the users' side-information consists of subsets of the file; (ii) side information in the form of linearly correlated packets, where the users have access to linear combinations of the file packets; and (iii) the general setting where the the users' side-information has an arbitrary (i.i.d.) correlation structure. Building on results from combinatorial optimization, we provide a polynomial-time algorithm (in the number of users) that, first finds the optimal rate allocations among these users, then determines an explicit transmission scheme (i.e., a description of which user should transmit what information) for cases (i) and (ii).

Connected through hyperedge HE-1 (induced by source paper "efficient algorithms for the data exchange problem"):
  with members:
    - "coded cooperative data exchange in multihop networks"
    - "coded cooperative data exchange problem for general topologies"
    - "on coding for cooperative data exchange"
    - "minimum cost multicast over coded packet networks"

Connected through hyperedge HE-2 (induced by source paper "coded cooperative data exchange for a secret key"):
  with members:
    - "on the communication complexity of secret key generation in the multiterminal source model"
    - "on the existence of mds codes over small fields with constrained generator matrices"
    - "common information and secret key capacity"
    - "coded cooperative data exchange in multihop networks"
    - "an equivalence between network coding and index coding"
    - "coded cooperative data exchange problem for general topologies"
    - "data exchange problem with helpers"
    - "a note on algorithms for connected set cover problem and fault tolerant connected set cover problem"

Connected through hyperedge HE-3 (induced by source paper "linear network code for erasure broadcast channel with feedback complexity and algorithms"):
  with members:
    - "completion delay minimization for instantly decodable network codes"
    - "three schemes for wireless coded broadcast to heterogeneous users"
    - "informed network coding for minimum decoding delay"
    - "online network coding for optimal throughput and delay the three receiver case"

Connected through hyperedge HE-4 (induced by source paper "coded cooperative data exchange problem for general topologies"):
  with members:
    - "coded cooperative data exchange in multihop networks"
    - "minimum cost multicast with decentralized sources"
    - "on coding for cooperative data exchange"

Connected through hyperedge HE-5 (induced by source paper "data exchange problem with helpers"):
  with members:
    - "on coding for cooperative data exchange"
    - "minimum cost multicast over coded 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)