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: "change sensitive algorithms for maintaining maximal cliques in a dynamic graph"
  Abstract: We consider the maintenance of the set of all maximal cliques in a dynamic graph that is changing through the addition or deletion of edges. We present nearly tight bounds on the magnitude of change in the set of maximal cliques, as well as the first change-sensitive algorithms for clique maintenance, whose runtime is proportional to the magnitude of the change in the set of maximal cliques. We present experimental results showing that these algorithms are efficient in practice.

Connected through hyperedge HE-1 (induced by source paper "enumerating top k quasi cliques"):
  with members:
    - "enumerating maximal bicliques from a large graph using mapreduce"
    - "a novel approach to finding near cliques the triangle densest subgraph problem"
    - "mining attribute structure correlated patterns in large attributed graphs"
    - "listing all maximal cliques in sparse graphs in near optimal time"
    - "an o m algorithm for cores decomposition of networks"

Connected through hyperedge HE-2 (induced by source paper "shared memory parallel maximal clique enumeration"):
  with members:
    - "local algorithms for hierarchical dense subgraph discovery"
    - "shared memory graph truss decomposition"
    - "enumerating maximal bicliques from a large graph using mapreduce"
    - "listing all maximal cliques in large sparse real world graphs"
    - "listing all maximal cliques in sparse graphs in near optimal time"

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)