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: "embedded index coding"
  Abstract: Motivated by applications in distributed storage and distributed computation, we introduce embedded index coding (EIC). EIC is a type of distributed index coding in which nodes in a distributed system act as both senders and receivers of information. We show how embedded index coding is related to index coding in general, and give characterizations and bounds on the communication costs of optimal embedded index codes. We also define task-based EIC, in which each sending node encodes and sends data blocks independently of the other nodes. Task-based EIC is more computationally tractable and has advantages in applications such as distributed storage, in which senders may complete their broadcasts at different times. Finally, we give heuristic algorithms for approximating optimal embedded index codes, and demonstrate empirically that these algorithms perform well.

Connected through hyperedge HE-1 (induced by source paper "secure decentralized pliable index coding"):
  with members:
    - "task based solutions to 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"
    - "capacity theorems for distributed index coding"

Connected through hyperedge HE-2 (induced by source paper "fundamental limits of device to device private caching with trusted server"):
  with members:
    - "on coded caching with private demands"
    - "subpacketization in coded caching with demand privacy"
    - "private pliable index coding"
    - "demand private coded caching and the exact trade off for n k 2"
    - "on the optimality of d2d coded caching with uncoded cache placement and one shot delivery"
    - "demand private coded caching"
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "private information retrieval from coded storage systems with colluding byzantine and unresponsive servers"

Connected through hyperedge HE-3 (induced by source paper "task based solutions to embedded index coding"):
  with members:
    - "the single uniprior index coding problem the single sender case and the multi sender extension"
    - "on a duality between recoverable distributed storage and index coding"
    - "topological interference management through index coding"
    - "linear index coding via semidefinite programming"

Connected through hyperedge HE-4 (induced by source paper "fundamental limits of decentralized data shuffling"):
  with members:
    - "coded distributed computing with heterogeneous function assignments"
    - "cascaded coded distributed computing on heterogeneous networks"
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "leveraging coding techniques for speeding up distributed computing"
    - "speeding up distributed machine learning using codes"
    - "storage computation and communication a fundamental tradeoff in distributed computing"
    - "coded computing for distributed graph analytics"
    - "on the fundamental limits of coded data shuffling for distributed learning systems"

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)