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: "phylogenomics with paralogs"
  Abstract: Phylogenomics heavily relies on well-curated sequence data sets that comprise, for each gene, exclusively 1:1 orthologos. Paralogs are treated as a dangerous nuisance that has to be detected and removed. We show here that this severe restriction of the data sets is not necessary. Building upon recent advances in mathematical phylogenetics, we demonstrate that gene duplications convey meaningful phylogenetic information and allow the inference of plausible phylogenetic trees, provided orthologs and paralogs can be distinguished with a degree of certainty. Starting from tree-free estimates of orthology, cograph editing can sufficiently reduce the noise to find correct event-annotated gene trees. The information of gene trees can then directly be translated into constraints on the species trees. Although the resolution is very poor for individual gene families, we show that genome-wide data sets are sufficient to generate fully resolved phylogenetic trees, even in the presence of horizontal gene transfer.

Connected through hyperedge HE-1 (induced by source paper "faster and enhanced inclusion minimal cograph completion"):
  with members:
    - "techniques for the cograph editing problem module merge is equivalent to editing p4s"
    - "fast quasi threshold editing"
    - "on the threshold of intractability"
    - "on the non existence of polynomial kernels for p l free edge modification problems"

Connected through hyperedge HE-2 (induced by source paper "generalized fitch graphs ii sets of binary relations that are explained by edge labeled trees"):
  with members:
    - "generalized fitch graphs iii symmetrized fitch maps and sets of symmetric binary relations that are explained by unrooted edge labeled trees"
    - "generalized fitch graphs edge labeled graphs that are explained by edge labeled trees"
    - "reconstructing gene trees from fitch s xenology relation"
    - "the mathematics of xenology di cographs symbolic ultrametrics 2 structures and tree representable systems of binary relations"
    - "beyond representing orthology relations by trees"

Connected through hyperedge HE-3 (induced by source paper "reconstruction of time consistent species trees"):
  with members:
    - "from event labeled gene trees to species trees"
    - "reconstructing gene trees from fitch s xenology relation"
    - "the mathematics of xenology di cographs symbolic ultrametrics 2 structures and tree representable systems of binary relations"

Connected through hyperedge HE-4 (induced by source paper "destroying bicolored p_3 s by deleting few edges"):
  with members:
    - "on the relation of strong triadic closure and cluster deletion"
    - "fast quasi threshold editing"
    - "tight running time lower bounds for vertex deletion problems"

Connected through hyperedge HE-5 (induced by source paper "complexity of modification problems for reciprocal best match graphs"):
  with members:
    - "correlation clustering and biclustering with locally bounded errors"
    - "fast biclustering by dual parameterization"

Connected through hyperedge HE-6 (induced by source paper "generalized fitch graphs edge labeled graphs that are explained by edge labeled trees"):
  with members:
    - "a short note on undirected fitch graphs"
    - "reconstructing gene trees from fitch s xenology relation"
    - "the mathematics of xenology di cographs symbolic ultrametrics 2 structures and tree representable systems of binary relations"

Connected through hyperedge HE-7 (induced by source paper "cograph editing merging modules is equivalent to editing p4 s"):
  with members:
    - "exact and heuristic algorithms for cograph editing"
    - "reconstructing gene trees from fitch s xenology relation"
    - "partial homology relations satisfiability in terms of di cographs"
    - "the mathematics of xenology di cographs symbolic ultrametrics 2 structures and tree representable systems of binary relations"
    - "on symbolic ultrametrics cotree representations and cograph edge decompositions and partitions"
    - "on tree representations of relations and graphs symbolic ultrametrics and cograph edge decompositions"
    - "parameterized algorithms for modular width"
    - "on the non existence of polynomial kernels for p l free edge modification problems"

Connected through hyperedge HE-8 (induced by source paper "forbidden time travel characterization of time consistent tree reconciliation maps"):
  with members:
    - "from event labeled gene trees to species trees"
    - "from event labeled gene trees with horizontal gene transfer to species trees"
    - "the mathematics of xenology di cographs symbolic ultrametrics 2 structures and tree representable systems of binary relations"
    - "on symbolic ultrametrics cotree representations and cograph edge decompositions and partitions"
    - "on tree representations of relations and graphs symbolic ultrametrics and cograph edge decompositions"

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)