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: "exploring biological network structure with clustered random networks"
  Abstract: Complex biological systems are often modeled as networks of interacting units. Networks of biochemical interactions among proteins, epidemiological contacts among hosts, and trophic interactions in ecosystems, to name a few, have provided useful insights into the dynamical processes that shape and traverse these systems. The degrees of nodes (numbers of interactions) and the extent of clustering (the tendency for a set of three nodes to be interconnected) are two of many well-studied network properties that can fundamentally shape a system. Disentangling the interdependent effects of the various network properties, however, can be difficult. Simple network models can help us quantify the structure of empirical networked systems and understand the impact of various topological properties on dynamics. Here we develop and implement a new Markov chain simulation algorithm to generate simple, connected random graphs that have a specified degree sequence and level of clustering, but are random in all other respects. The implementation of the algorithm (ClustRNet: Clustered Random Networks) provides the generation of random graphs optimized according to a local or global, and relative or absolute measure of clustering. We compare our algorithm to other similar methods and show that ours more successfully produces desired network characteristics. Finding appropriate null models is crucial in bioinformatics research, and is often difficult, particularly for biological networks. As we demonstrate, the networks generated by ClustRNet can serve as random controls when investigating the impacts of complex network features beyond the byproduct of degree and clustering in empirical networks. ClustRNet generates ensembles of graphs of specified edge structure and clustering. These graphs allow for systematic study of the impacts of connectivity and redundancies on network function and dynamics. This process is a key step in unraveling the functional consequences of the structural properties of empirical biological systems and uncovering the mechanisms that drive these systems.

Connected through hyperedge HE-1 (induced by source paper "rich club ordering and the dyadic effect two interrelated phenomena"):
  with members:
    - "the rich club phenomenon in the internet topology"
    - "accurately modeling the internet topology"

Connected through hyperedge HE-2 (induced by source paper "generating realistic scaled complex networks"):
  with members:
    - "engineering parallel algorithms for community detection in massive networks"
    - "snap a general purpose network analysis and graph mining library"
    - "structure preserving sparsification methods for social networks"
    - "generating scaled replicas of real world complex networks"
    - "drawing large graphs by multilevel maxent stress optimization"
    - "networkit a tool suite for large scale complex network analysis"
    - "a scalable generative graph model with community structure"
    - "tree based coarsening and partitioning of complex networks"

Connected through hyperedge HE-3 (induced by source paper "handbook of network analysis konect the koblenz network collection"):
  with members:
    - "the slashdot zoo mining a social network with negative edges"
    - "recommender system for online dating service"

Connected through hyperedge HE-4 (induced by source paper "2 5k graphs from sampling to generation"):
  with members:
    - "social structure of facebook networks"
    - "constructing and sampling graphs with a prescribed joint degree distribution"
    - "walking on a graph with a magnifying glass stratified sampling via weighted random walks"
    - "multigraph sampling of online social networks"
    - "estimating and sampling graphs with multidimensional random walks"
    - "systematic topology analysis and generation using degree correlations"

Connected through hyperedge HE-5 (induced by source paper "multiscale network generation"):
  with members:
    - "systematic topology analysis and generation using degree correlations"

Connected through hyperedge HE-6 (induced by source paper "generating constrained random graphs using multiple edge switches"):
  with members:
    - "systematic topology analysis and generation using degree correlations"
    - "a study of the edge switching markov chain method for the generation of 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.DM(Discrete Mathematics)