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 index codes with near extreme rates"
  Abstract: The min-rank of a digraph was shown by Bar-Yossef et al. (2006) to represent the length of an optimal scalar linear solution of the corresponding instance of the Index Coding with Side Information (ICSI) problem. In this work, the graphs and digraphs of near-extreme min-ranks are characterized. Those graphs and digraphs correspond to the ICSI instances having near-extreme transmission rates when using optimal scalar linear index codes. In particular, it is shown that the decision problem whether a digraph has min-rank two is NP-complete. By contrast, the same question for graphs can be answered in polynomial time. #R##N#Additionally, a new upper bound on the min-rank of a digraph, the circuit-packing bound, is presented. This bound is often tighter than the previously known bounds. By employing this new bound, we present several families of digraphs whose min-ranks can be found in polynomial time.

Connected through hyperedge HE-1 (induced by source paper "an optimal linear error correcting delivery scheme for coded caching with shared caches"):
  with members:
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "optimal error correcting delivery scheme for an optimal coded caching scheme with small buffers"
    - "fundamental limits of caching in heterogeneous networks with uncoded prefetching"
    - "optimal error correcting delivery scheme for coded caching with symmetric batch prefetching"
    - "noisy broadcast networks with receiver caching"
    - "caching and delivery via interference elimination"
    - "online coded caching"
    - "coded caching with nonuniform demands"

Connected through hyperedge HE-2 (induced by source paper "on the optimality of ali niesen decentralized coded caching scheme with and without error correction"):
  with members:
    - "the exact rate memory tradeoff for caching with uncoded prefetching"
    - "optimal error correcting delivery scheme for an optimal coded caching scheme with small buffers"
    - "optimal error correcting delivery scheme for coded caching with symmetric batch prefetching"
    - "noisy broadcast networks with receiver caching"
    - "fundamental limits of caching improved bounds with coded prefetching"
    - "online coded caching"
    - "decentralized coded caching attains order optimal memory rate tradeoff"
    - "fundamental limits of caching"

Connected through hyperedge HE-3 (induced by source paper "optimal scalar linear codes for some classes of the two sender groupcast index coding problem"):
  with members:
    - "cooperative multi sender index coding"
    - "linear index coding with multiple senders and extension to a cellular network"
    - "on the optimal broadcast rate of the two sender unicast index coding problem with fully participated interactions"
    - "structural characteristics of two sender index coding"
    - "index coding rank invariant extensions"
    - "on the capacity for distributed index coding"
    - "joint latency and cost optimization for erasure coded data center storage"
    - "coded caching with distributed storage"

Connected through hyperedge HE-4 (induced by source paper "groupcast index coding problem joint extensions"):
  with members:
    - "linear codes for broadcasting with noisy side information"
    - "optimal scalar linear codes for some classes of the two sender groupcast index coding problem"
    - "low complexity decoding for symmetric neighboring and consecutive side information index coding problems"
    - "index coding rank invariant extensions"
    - "structural properties of index coding capacity"
    - "the single uniprior index coding problem the single sender case and the multi sender extension"
    - "generalized lexicographic products and the index coding capacity"
    - "optimal vector linear index codes for some symmetric side information problems"

Connected through hyperedge HE-5 (induced by source paper "interlinked cycles for index coding generalizing cycles and cliques"):
  with members:
    - "on critical index coding problems"
    - "structural properties of index coding capacity using fractional graph theory"
    - "graph theory versus minimum rank for index coding"
    - "topological interference management through index coding"
    - "linear codes are optimal for index coding instances with five or fewer receivers"
    - "critical graphs in index coding"
    - "on the capacity region for index coding"
    - "duality codes and the integrality gap bound for index coding"

Connected through hyperedge HE-6 (induced by source paper "optimal finite length and asymptotic index codes for five or fewer receivers"):
  with members:
    - "interlinked cycles for index coding generalizing cycles and cliques"
    - "the single uniprior index coding problem the single sender case and the multi sender extension"
    - "a rate distortion approach to index coding"
    - "a new class of index coding instances where linear coding is optimal"
    - "critical graphs in index coding"
    - "on the capacity region for index coding"
    - "duality codes and the integrality gap bound for index coding"
    - "local graph coloring and index coding"

Connected through hyperedge HE-7 (induced by source paper "index coding rank invariant extensions"):
  with members:
    - "uniprior index coding"
    - "structural properties of index coding capacity"
    - "the single uniprior index coding problem the single sender case and the multi sender extension"
    - "structural properties of index coding capacity using fractional graph theory"
    - "optimal vector linear index codes for some symmetric side information problems"
    - "on a duality between recoverable distributed storage and index coding"
    - "topological interference management through index coding"
    - "on index coding and graph homomorphism"

Connected through hyperedge HE-8 (induced by source paper "optimal index codes via a duality between index coding and network coding"):
  with members:
    - "on a duality between recoverable distributed storage and index coding"
    - "bounding multiple unicasts through index coding and locally repairable codes"
    - "a new class of index coding instances where linear coding is optimal"
    - "index coding via linear programming"
    - "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)