{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T14:17:01Z","timestamp":1772893021754,"version":"3.50.1"},"reference-count":9,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Inf. &amp; Syst."],"published-print":{"date-parts":[[2025,3,1]]},"DOI":"10.1587\/transinf.2024fcl0002","type":"journal-article","created":{"date-parts":[[2024,8,4]],"date-time":"2024-08-04T22:14:02Z","timestamp":1722809642000},"page":"263-265","source":"Crossref","is-referenced-by-count":2,"title":["(15\/14)&lt;i&gt;n&lt;\/i&gt; Flips are (Almost) Sufficient to Sort Heydari and Sudborough\u2019s Pancake Stack"],"prefix":"10.1587","volume":"E108.D","author":[{"given":"Kazuyuki","family":"AMANO","sequence":"first","affiliation":[{"name":"Gunma University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"532","reference":[{"key":"1","doi-asserted-by":"publisher","unstructured":"[1] L. Bulteau, G. Fertin, and I. Rusu, \u201cPancake flipping is hard,\u201d J. Comput. Syst. Sci., vol.81, no.8, pp.1556-1574, 2015. 10.1016\/j.jcss.2015.02.003","DOI":"10.1016\/j.jcss.2015.02.003"},{"key":"2","doi-asserted-by":"publisher","unstructured":"[2] B. Chitturi, W. Fahle, Z. Meng, L. Morales, C.O. Shields Jr., I.H. Sudborough, and W. Voit, \u201cAn (18\/11)n upper bound for sorting by prefix reversals,\u201d Theor. Comput. Sci., vol.410, no.36, pp.3372-3390, 2009. 10.1016\/j.tcs.2008.04.045","DOI":"10.1016\/j.tcs.2008.04.045"},{"key":"3","doi-asserted-by":"publisher","unstructured":"[3] J. Cibulka, \u201cOn average and highest number of flips in pancake sorting,\u201d Theor. Comput. Sci., vol.412, no.8-10, pp.822-834, 2011. 10.1016\/j.tcs.2010.11.028","DOI":"10.1016\/j.tcs.2010.11.028"},{"key":"4","doi-asserted-by":"crossref","unstructured":"[4] H. Dweighter, Problem E2569, Amer. Math. Monthly, vol.82, no.10, 1010, 1975.","DOI":"10.2307\/2318261"},{"key":"5","doi-asserted-by":"crossref","unstructured":"[5] W.H. Gates and C.H. Papadimitriou, \u201cBounds for sorting by prefix reversal,\u201d Discret. Math., vol.27, no.1, pp.47-57, 1979. 10.1016\/0012-365x(79)90068-2","DOI":"10.1016\/0012-365X(79)90068-2"},{"key":"6","unstructured":"[6] E. Gy\u00f6ri and G. Tur\u00e1n, \u201cStack of pancakes,\u201d Studia Scientiarum Mathematicarum Hungarica, vol.13, pp.133-137, 1978."},{"key":"7","doi-asserted-by":"crossref","unstructured":"[7] M.H. Heydari and I.H. Sudborough, \u201cOn the diameter of the pancake network,\u201d J. Algorithms, vol.25, no.1, pp.67-94, 1997. 10.1006\/jagm.1997.0874","DOI":"10.1006\/jagm.1997.0874"},{"key":"8","doi-asserted-by":"crossref","unstructured":"[8] Y. Komano and T. Mizuki, \u201cCard-based zero-knowledge proof protocol for pancake sorting,\u201d Innovative Security Solutions for Information Technology and Communications - 15th International Conference, SecITC 2022, volume 13809 of Lecture Notes in Computer Science, pp.222-239, Springer, 2022. 10.1007\/978-3-031-32636-3_13","DOI":"10.1007\/978-3-031-32636-3_13"},{"key":"9","unstructured":"[9] OEIS Foundation Inc., The On-Line Encyclopedia of Integer Sequences, 2024. Published electronically at http:\/\/oeis.org."}],"container-title":["IEICE Transactions on Information and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E108.D\/3\/E108.D_2024FCL0002\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,1]],"date-time":"2025-03-01T03:33:04Z","timestamp":1740799984000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E108.D\/3\/E108.D_2024FCL0002\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,3,1]]},"references-count":9,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025]]}},"URL":"https:\/\/doi.org\/10.1587\/transinf.2024fcl0002","relation":{},"ISSN":["0916-8532","1745-1361"],"issn-type":[{"value":"0916-8532","type":"print"},{"value":"1745-1361","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,3,1]]},"article-number":"2024FCL0002"}}