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: "communication lower bounds of bilinear algorithms for symmetric tensor contractions"
  Abstract: Accurate numerical calculations of electronic structure are often dominated in cost by tensor contractions. These tensors are typically symmetric under interchange of modes, enabling reduced-size representations as well as a reduced computation cost. Direct evaluation algorithms for such contractions use matrix and vector unfoldings of the tensors, computing and accumulating products of input elements. Symmetry preserving algorithms reduce the number of products by multiplying linear combinations of input elements. The two schemes can be encoded via sparse matrices as bilinear algorithms. We formulate a general notion of expansion for bilinear algorithms in terms of the rank of submatrices of the sparse matrix encoding. This expansion bounds the number of products that can be computed provided a bounded amount of data. Consequently, we derive communication lower bounds for any sequential or parallel schedule of a bilinear algorithm with a given expansion. After deriving such expansion bounds for the tensor contraction algorithms, we obtain new results that demonstrate asymptotic communication overheads associated with exploiting symmetries. Computing a nonsymmetric tensor contraction requires less communication than either method for symmetric contractions when either (1) computing a symmetrized tensor-product of tensors of different orders or (2) the tensor unfolding of the contraction corresponds to a matrix-vector product with a nonsquare matrix. Further, when the unfolding is a product of two non-square matrices, asymptotically more communication is needed by the symmetry preserving algorithm than the traditional algorithm, despite its lower computation cost.

Connected through hyperedge HE-1 (induced by source paper "a tight i o lower bound for matrix multiplication"):
  with members:
    - "communication optimal convolutional neural nets"
    - "a lower bound technique for communication in bsp"
    - "communication lower bounds for matricized tensor times khatri rao product"
    - "communication lower bounds for distributed memory computations"
    - "communication lower bounds for distributed memory computations"
    - "minimizing communication in linear algebra"
    - "revisiting matrix product on master worker platforms"

Connected through hyperedge HE-2 (induced by source paper "pushing the bounds for matrix matrix multiplication"):
  with members:
    - "a lower bound technique for communication in bsp"
    - "communication lower bounds for matricized tensor times khatri rao product"
    - "communication lower bounds for distributed memory computations"
    - "communication lower bounds for distributed memory computations"
    - "minimizing communication in linear algebra"
    - "revisiting matrix product on master worker platforms"

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.DC(Distributed, Parallel, and Cluster Computing)