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 "cycles in the burnt pancake graphs"):
  Abstract: The pancake graph of $S_n$, the symmetric group on $n$ elements, has been shown to have many interesting properties that makes it a useful network scheme for parallel processors. For example, it is $(n-1)$-regular, vertex-transitive, and pancyclic (one can find cycles of any length from its girth up to the number of vertices of the graph). The burnt pancake graph $BP_n$, which is obtained as the Cayley graph of the group $B_n$ of signed permutations on $n$ elements using prefix reversal as generators, has similar properties. Indeed, $BP_n$ is $n$-regular and vertex-transitive. In this paper, we show that $BP_n$ is also pancyclic. Our proof is a recursive construction of the cycles. #R##N#We also present a complete characterization of all the $8$-cycles in $BP_n$ for $n \geq 2$ by presenting their canonical forms as products of the prefix reversal generators.

Includes members:
  Member "pancake flipping is hard":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "shortest reconfiguration of perfect matchings via alternating cycles")
  Member "on average and highest number of flips in pancake sorting":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "on the number of pancake stacks requiring four flips to be sorted")

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)