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 linear index coding for random graphs"
  Abstract: A sender wishes to broadcast an n character word x in F^n (for a field F) to n receivers R_1,...,R_n. Every receiver has some side information on x consisting of a subset of the characters of x. The side information of the receivers is represented by a graph G on n vertices in which {i,j} is an edge if R_i knows x_j. In the index coding problem the goal is to encode x using a minimum number of characters in F in a way that enables every R_i to retrieve the ith character x_i using the encoded message and the side information. An index code is linear if the encoding is linear, and in this case the minimum possible length is known to be equal to a graph parameter called minrank (Bar-Yossef et al., FOCS'06). Several bounds on the minimum length of an index code for side information graphs G were shown in the study of index coding. However, the minimum length of an index code for the random graph G(n,p) is far from being understood. In this paper we initiate the study of the typical minimum length of a linear index code for G(n,p) over a field F. First, we prove that for every constant size field F and a constant p, the minimum length of a linear index code for G(n,p) over F is almost surely Omega(\sqrt{n}). Second, we introduce and study the following two restricted models of index coding: 1. A locally decodable index code is an index code in which the receivers are allowed to query at most q characters from the encoded message. 2. A low density index code is a linear index code in which every character of the word x affects at most q characters in the encoded message. Equivalently, it is a linear code whose generator matrix has at most q nonzero entries in each row.

Connected through hyperedge HE-1 (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"
    - "on a duality between recoverable distributed storage and index coding"
    - "bounding multiple unicasts through index coding and locally repairable codes"

Connected through hyperedge HE-2 (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"
    - "on a duality between recoverable distributed storage and index coding"
    - "bounding multiple unicasts through index coding and locally repairable codes"
    - "fundamental limits of caching"
    - "an equivalence between network coding and index coding"
    - "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-3 (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"
    - "on a duality between recoverable distributed storage and index coding"
    - "graph theory versus minimum rank for index coding"
    - "topological interference management through index coding"

Connected through hyperedge HE-4 (induced by source paper "on minrank and the lov asz theta function"):
  with members:
    - "the minrank of random graphs"
    - "caching and coded multicasting multiple groupcast index coding"
    - "on a duality between recoverable distributed storage and index coding"
    - "topological interference management through index coding"
    - "approximate graph coloring by semidefinite programming"

Connected through hyperedge HE-5 (induced by source paper "multihop caching aided coded multicasting for the next generation of cellular networks"):
  with members:
    - "coded caching for delay sensitive content"
    - "hierarchical coded caching"
    - "fundamental limits of caching in wireless d2d networks"
    - "online coded caching"
    - "five disruptive technology directions for 5g"
    - "decentralized coded caching attains order optimal memory rate tradeoff"
    - "fundamental limits of caching"
    - "an equivalence between network coding and index coding"

Connected through hyperedge HE-6 (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"
    - "a polynomial time algorithm for pliable index coding"
    - "content type coding"

Connected through hyperedge HE-7 (induced by source paper "a polynomial time algorithm for pliable index coding"):
  with members:
    - "the minrank of random graphs"
    - "content type coding"
    - "on the capacity region for index coding"
    - "an equivalence between network coding and index coding"
    - "index coding an interference alignment perspective"
    - "on the security of index coding with side information"
    - "index coding via linear programming"
    - "on the index coding problem and its relation to network coding and matroid theory"

Connected through hyperedge HE-8 (induced by source paper "the minrank of random graphs"):
  with members:
    - "three stories on a two sided coin index coding locally recoverable distributed storage and guessing games on graphs"
    - "on a duality between recoverable distributed storage and index coding"
    - "an equivalence between network coding and index coding"
    - "min rank conjecture for log depth circuits"
    - "linear index coding via semidefinite programming"
    - "non linear index coding outperforming the linear optimum"

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)