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: "the minrank of random graphs"
  Abstract: The minrank of a graph $G$ is the minimum rank of a matrix $M$ that can be obtained from the adjacency matrix of $G$ by switching some ones to zeros (i.e., deleting edges) and then setting all diagonal entries to one. This quantity is closely related to the fundamental information-theoretic problems of (linear) index coding (Bar-Yossef et al., FOCS'06), network coding and distributed storage, and to Valiant's approach for proving superlinear circuit lower bounds (Valiant, Boolean Function Complexity '92). #R##N#We prove tight bounds on the minrank of random Erd\H{o}s-R\'enyi graphs $G(n,p)$ for all regimes of $p\in[0,1]$. In particular, for any constant $p$, we show that $\mathsf{minrk}(G) = \Theta(n/\log n)$ with high probability, where $G$ is chosen from $G(n,p)$. This bound gives a near quadratic improvement over the previous best lower bound of $\Omega(\sqrt{n})$ (Haviv and Langberg, ISIT'12), and partially settles an open problem raised by Lubetzky and Stav (FOCS '07). Our lower bound matches the well-known upper bound obtained by the "clique covering" solution, and settles the linear index coding problem for random graphs. #R##N#Finally, our result suggests a new avenue of attack, via derandomization, on Valiant's approach for proving superlinear lower bounds for logarithmic-depth semilinear circuits.

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

Connected through hyperedge HE-2 (induced by source paper "on minrank and forbidden subgraphs"):
  with members:
    - "on minrank and the lov asz theta function"
    - "linear index coding via semidefinite programming"

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

Connected through hyperedge HE-4 (induced by source paper "the benefit of being flexible in distributed computation"):
  with members:
    - "speeding up distributed machine learning using codes"
    - "a pliable index coding approach to data shuffling"
    - "information theoretic limits of data shuffling for distributed learning"
    - "fundamental limits of caching"

Connected through hyperedge HE-5 (induced by source paper "a polynomial time algorithm for pliable index coding"):
  with members:
    - "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 linear index coding for random graphs"
    - "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-6 (induced by source paper "making recommendations bandwidth aware"):
  with members:
    - "a polynomial time algorithm for pliable index coding"
    - "an equivalence between network coding and index coding"
    - "on linear index coding for random graphs"
    - "on the index coding problem and its relation to network coding and matroid theory"

Connected through hyperedge HE-7 (induced by source paper "the minimum rank of typical fooling set matrices"):
  with members:
    - "on linear index coding for random graphs"

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.CC(Computational Complexity)