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 a duality between recoverable distributed storage and index coding"
  Abstract: In this paper, we introduce a model of a single-failure locally recoverable distributed storage system. This model appears to give rise to a problem seemingly dual of the well-studied index coding problem. The relation between the dimensions of an optimal index code and optimal distributed storage code of our model has been established in this paper. We also show some extensions to vector codes.

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 "cooperative multi sender index coding"):
  with members:
    - "interlinked cycles for index coding generalizing cycles and cliques"
    - "optimal finite length and asymptotic index codes for five or fewer receivers"
    - "on the capacity for distributed index coding"
    - "the single uniprior index coding problem the single sender case and the multi sender extension"
    - "graph theoretic approaches to two sender index coding"
    - "distributed index coding"
    - "three stories on a two sided coin index coding locally recoverable distributed storage and guessing games on graphs"
    - "structural properties of index coding capacity using fractional graph theory"

Connected through hyperedge HE-3 (induced by source paper "linear index coding with multiple senders and extension to a cellular network"):
  with members:
    - "cooperative multi sender index coding"
    - "index coding with erroneous side information"
    - "structural characteristics of two sender index coding"
    - "interlinked cycles for index coding generalizing cycles and cliques"
    - "the single uniprior index coding problem the single sender case and the multi sender extension"
    - "graph theoretic approaches to two sender index coding"
    - "distributed index coding"
    - "three stories on a two sided coin index coding locally recoverable distributed storage and guessing games on graphs"

Connected through hyperedge HE-4 (induced by source paper "index codes with minimum locality for three receiver unicast problems"):
  with members:
    - "locality in index coding for large min rank"
    - "reduced complexity index codes and improved upperbound on broadcast rate for neighboring interference problems"
    - "privacy in index coding k limited access schemes"
    - "speeding up distributed machine learning using codes"
    - "on locally decodable index codes"
    - "the single uniprior index coding problem the single sender case and the multi sender extension"
    - "bounding multiple unicasts through index coding and locally repairable codes"
    - "local graph coloring and index coding"

Connected through hyperedge HE-5 (induced by source paper "code equivalences between network codes with link errors and index codes with side information errors"):
  with members:
    - "index coding with erroneous side information"
    - "an equivalence between secure network and index coding"
    - "a relation between network computation and functional index coding problems"
    - "error correcting functional index codes generalized exclusive laws and graph coloring"
    - "index coding with coded side information"
    - "blind index coding"
    - "topological interference management through index coding"
    - "on the capacity region for index coding"

Connected through hyperedge HE-6 (induced by source paper "locality in index coding for large min rank"):
  with members:
    - "privacy in index coding k limited access schemes"
    - "on locally decodable index codes"
    - "bounding multiple unicasts through index coding and locally repairable codes"
    - "fundamental limits of caching"
    - "an equivalence between network coding and index coding"
    - "on linear index coding for random graphs"
    - "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-7 (induced by source paper "task based solutions to embedded index coding"):
  with members:
    - "embedded index coding"
    - "the single uniprior index coding problem the single sender case and the multi sender extension"
    - "topological interference management through index coding"
    - "linear index coding via semidefinite programming"

Connected through hyperedge HE-8 (induced by source paper "on locally decodable index codes"):
  with members:
    - "reduced complexity index codes and improved upperbound on broadcast rate for neighboring interference problems"
    - "privacy in index coding k limited access schemes"
    - "speeding up distributed machine learning using codes"
    - "preserving privacy while broadcasting k limited access schemes"
    - "local partial clique covers for index coding"
    - "graph theory versus minimum rank for index coding"
    - "topological interference management through index coding"
    - "bounding multiple unicasts through index coding and locally repairable codes"

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)