human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "forbidden time travel characterization of time consistent tree reconciliation maps"):
  Abstract: In the absence of horizontal gene transfer it is possible to reconstruct the history of gene families from empirically determined orthology relations, which are equivalent to event-labeled gene trees. Knowledge of the event labels considerably simplifies the problem of reconciling a gene tree T with a species trees S, relative to the reconciliation problem without prior knowledge of the event types. It is well-known that optimal reconciliations in the unlabeled case may violate time-consistency and thus are not biologically feasible. Here we investigate the mathematical structure of the event labeled reconciliation problem with horizontal transfer. We investigate the issue of time-consistency for the event-labeled version of the reconciliation problem, provide a convenient axiomatic framework, and derive a complete characterization of time-consistent reconciliations. This characterization depends on certain weak conditions on the event-labeled gene trees that reflect conditions under which evolutionary events are observable at least in principle. We give an O(|V(T)|log(|V(S)|))-time algorithm to decide whether a time-consistent reconciliation map exists. It does not require the construction of explicit timing maps, but relies entirely on the comparably easy task of checking whether a small auxiliary graph is acyclic. The combinatorial characterization of time consistency and thus biologically feasible reconciliation is an important step towards the inference of gene family histories with horizontal transfer from orthology data, i.e., without presupposed gene and species trees. The fast algorithm to decide time consistency is useful in a broader context because it constitutes an attractive component for all tools that address tree reconciliation problems.

Includes members:
  Member "from event labeled gene trees to species trees":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "reconstruction of time consistent species trees")
  Member "from event labeled gene trees with horizontal gene transfer to species trees":
    also connected through other hyperedges:
      (none)
  Member "the mathematics of xenology di cographs symbolic ultrametrics 2 structures and tree representable systems of binary relations":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "generalized fitch graphs iii symmetrized fitch maps and sets of symmetric binary relations that are explained by unrooted edge labeled trees")
  Member "phylogenomics with paralogs":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "faster and enhanced inclusion minimal cograph completion")
  Member "on symbolic ultrametrics cotree representations and cograph edge decompositions and partitions":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "cograph editing merging modules is equivalent to editing p4 s")
  Member "on tree representations of relations and graphs symbolic ultrametrics and cograph edge decompositions":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "cograph editing merging modules is equivalent to editing p4 s")

Question: Please tell me which class the source paper 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)