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: "a polynomial time algorithm for pliable index coding"
  Abstract: In pliable index coding, we consider a server with $m$ messages and $n$ clients where each client has as side information a subset of the messages. We seek to minimize the number of broadcast transmissions, so that each client can recover any one unknown message she does not already have. Previous work has shown that the pliable index coding problem is NP-hard and requires at most $\mathcal{O}(\log^2(n))$ broadcast transmissions, which indicates exponential savings over the conventional index coding that requires in the worst case $\mathcal{O}(n)$ transmissions. In this work, building on a decoding criterion that we propose, we first design a deterministic polynomial-time algorithm that can realize the exponential benefits, by achieving, in the worst case, a performance upper bounded by $\mathcal{O}(\log^2(n))$ broadcast transmissions. We extend our algorithm to the $t$-requests case, where each client requires $t$ unknown messages that she does not have, and show that our algorithm requires at most $\mathcal{O}(t\log(n)+\log^2(n))$ broadcast transmissions. We construct lower bound instances that require at least $\Omega(\log(n))$ transmissions for linear pliable index coding and at least $\Omega(t+\log(n))$ transmissions for the $t$-requests case, indicating that both our upper and lower bounds are polynomials of $\log(n)$ and differ within a factor of $\mathcal{O}(\log(n))$. Finally, we provide a probabilistic analysis and show that the required number of transmissions is almost surely $\Theta(\log(n))$, as compared to $\Theta(n/\log(n))$ for index coding. Our numerical experiments show that our algorithm outperforms existing algorithms for pliable index coding by up to $50\%$ less transmissions.

Connected through hyperedge HE-1 (induced by source paper "secure decentralized pliable index coding"):
  with members:
    - "task based solutions to embedded index coding"
    - "embedded index coding"
    - "private pliable index coding"
    - "on pliable index coding"
    - "improved lower bounds for pliable index coding using absent receivers"
    - "decentralized pliable index coding"
    - "optimal rate characterisation for pliable index coding using absent receivers"
    - "tight information theoretic converse results for some pliable index coding problems"

Connected through hyperedge HE-2 (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"
    - "efficient algorithms for the data exchange problem"
    - "fundamental limits of caching in wireless d2d networks"
    - "coded cooperative data exchange in multihop networks"

Connected through hyperedge HE-3 (induced by source paper "optimal rate characterisation for pliable index coding using absent receivers"):
  with members:
    - "an information theoretic converse for the consecutive complete s picod problem"
    - "secure index coding existence and construction"
    - "the single uniprior index coding problem the single sender case and the multi sender extension"
    - "an equivalence between secure network and index coding"
    - "an equivalence between network coding and index coding"
    - "dynamic index coding for wireless broadcast networks"
    - "on the security of index coding with side information"
    - "on the index coding problem and its relation to network coding and matroid theory"

Connected through hyperedge HE-4 (induced by source paper "private pliable index coding"):
  with members:
    - "on pliable index coding"
    - "tight information theoretic converse results for some pliable index coding problems"
    - "private broadcasting an index coding approach"
    - "the capacity of private information retrieval"
    - "content type coding"
    - "topological interference management through index coding"
    - "on the security of index coding with side information"

Connected through hyperedge HE-5 (induced by source paper "a pliable index coding approach to data shuffling"):
  with members:
    - "speeding up distributed machine learning using codes"
    - "near optimal coded data shuffling for distributed learning"
    - "a fundamental tradeoff between computation and communication in distributed computing"
    - "a unified coding framework for distributed computing with straggling servers"
    - "information theoretic limits of data shuffling for distributed learning"
    - "the minrank of random graphs"
    - "content type coding"
    - "fundamental limits of caching"

Connected through hyperedge HE-6 (induced by source paper "making recommendations bandwidth aware"):
  with members:
    - "the minrank of random graphs"
    - "an equivalence between network coding and index coding"
    - "on linear index coding for random graphs"
    - "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)