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: "linear index coding via semidefinite programming"
  Abstract: In the index coding problem, introduced by Birk and Kol (INFOCOM, 1998), the goal is to broadcast an n bit word to n receivers (one bit per receiver), where the receivers have side information represented by a graph G. The objective is to minimize the length of a codeword sent to all receivers which allows each receiver to learn its bit. For linear index coding, the minimum possible length is known to be equal to a graph parameter called minrank (Bar-Yossef et al., FOCS, 2006). #R##N#We show a polynomial time algorithm that, given an n vertex graph G with minrank k, finds a linear index code for G of length $\widetilde{O}(n^{f(k)})$, where f(k) depends only on k. For example, for k=3 we obtain f(3) ~ 0.2574. Our algorithm employs a semidefinite program (SDP) introduced by Karger, Motwani and Sudan (J. ACM, 1998) for graph coloring and its refined analysis due to Arora, Chlamtac and Charikar (STOC, 2006). Since the SDP we use is not a relaxation of the minimization problem we consider, a crucial component of our analysis is an upper bound on the objective value of the SDP in terms of the minrank. #R##N#At the heart of our analysis lies a combinatorial result which may be of independent interest. Namely, we show an exact expression for the maximum possible value of the Lovasz theta-function of a graph with minrank k. This yields a tight gap between two classical upper bounds on the Shannon capacity of a graph.

Connected through hyperedge HE-1 (induced by source paper "the generalized orthogonality dimension of generalized kneser graphs bounds and applications"):
  with members:
    - "improved hardness for h colourings of g colourable graphs"
    - "approximating the orthogonality dimension of graphs and hypergraphs"
    - "on a fractional version of haemers bound"
    - "algebraic approach to promise constraint satisfaction"
    - "on minrank and forbidden subgraphs"
    - "matrix rigidity and the croot lev pach lemma"
    - "probabilistic rank and matrix rigidity"
    - "conditional hardness for approximate coloring"

Connected through hyperedge HE-2 (induced by source paper "approximating the orthogonality dimension of graphs and hypergraphs"):
  with members:
    - "on a fractional version of haemers bound"
    - "algebraic approach to promise constraint satisfaction"
    - "conditional hardness for approximate coloring"
    - "coloring k colorable graphs using relatively small palettes"
    - "approximate graph coloring by semidefinite programming"

Connected through hyperedge HE-3 (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"
    - "on a duality between recoverable distributed storage and index coding"
    - "topological interference management through index coding"

Connected through hyperedge HE-4 (induced by source paper "a tutorial on clique problems in communications and signal processing"):
  with members:
    - "eptas for max clique on disks and unit balls"
    - "enhanced uplink resource allocation in non orthogonal multiple access systems"
    - "discovering patterns of interest in ip traffic using cliques in bipartite link streams"
    - "delivery time reduction for order constrained applications using binary network codes"
    - "data dissemination using instantly decodable binary codes in fog radio access networks"
    - "on multiaspect graphs"
    - "distributed hybrid scheduling in multi cloud networks using conflict graphs"
    - "resilient backhaul network design using hybrid radio free space optical technology"

Connected through hyperedge HE-5 (induced by source paper "linear programming approximations for index coding"):
  with members:
    - "the optimality of partial clique covering for index coding"
    - "approximate capacity of index coding for some classes of graphs"
    - "storage capacity of repairable networks"
    - "generalized interlinked cycle cover for index coding"
    - "a new index coding scheme exploiting interlinked cycles"
    - "graph theory versus minimum rank for index coding"
    - "local graph coloring and index coding"
    - "lexicographic products and the power of non linear network coding"

Connected through hyperedge HE-6 (induced by source paper "on minrank and forbidden subgraphs"):
  with members:
    - "on minrank and the lov asz theta function"
    - "the minrank of random graphs"

Connected through hyperedge HE-7 (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-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"
    - "on linear index coding for random graphs"
    - "min rank conjecture for log depth circuits"
    - "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.DS(Data Structures and Algorithms)