{"schema":"pith.reference-change-event.v1","doi":"10.1007/s00453-024-01285-6","canonical_url":"https://pith.science/event/10.1007/s00453-024-01285-6","json_url":"https://pith.science/event/10.1007/s00453-024-01285-6.json","not_a_judgment":"This page records that a citing paper's bibliography includes a work with a published notice. It is not a judgment on the citing paper.","primary":{"event_id":307667,"doi":"10.1007/s00453-024-01285-6","event_type":"correction","event_type_label":"Correction","source":"crossref","source_label":"Crossref","event_date":"2025-01-29","title":"Correction: Galloping in Fast-Growth Natural Merge Sorts","work_title":"Ghasemi, V","work_doi":"10.1007/s00453-024-01285-6","work_arxiv_id":null,"notice_doi":"10.1007/s00453-025-01297-w","flag_count":0,"flags_open":0,"flags_disputed":0,"latest_flag_at":null,"human_href":"/event/10.1007/s00453-024-01285-6","json_href":"/event/10.1007/s00453-024-01285-6.json"},"events":[{"event_id":307667,"doi":"10.1007/s00453-024-01285-6","event_type":"correction","event_type_label":"Correction","source":"crossref","source_label":"Crossref","event_date":"2025-01-29","title":"Correction: Galloping in Fast-Growth Natural Merge Sorts","work_title":"Ghasemi, V","work_doi":"10.1007/s00453-024-01285-6","work_arxiv_id":null,"notice_doi":"10.1007/s00453-025-01297-w","flag_count":0,"flags_open":0,"flags_disputed":0,"latest_flag_at":null,"human_href":"/event/10.1007/s00453-024-01285-6","json_href":"/event/10.1007/s00453-024-01285-6.json"}],"flags":[{"id":7817,"status":"open","status_label":"Open","citing_arxiv_id":"2605.27147","citing_title":"Virtual-Memory Powersort","ref_index":4,"evidence_raw":"11 E. Ghasemi, V. Jugé, G. Khalighinejad, and H. Yazdanyar. Galloping in fast-growth natural merge sorts.Algorithmica, 87(2):242–291, Dec. 2024.doi:10.1007/s00453-024-01285-6. 12 G. Graefe. Implementing sorting in database systems.ACM Computing Surveys, 38(3):10, 2006.doi:10.1145/1132960.1132964. 13 B.-C. Huang and M. A. Langston. Practical in-place merging.Communications of the ACM, 31(3):348–352, Mar. 1988.doi:10.1145/42392.42403. F. Moltmann, T.-V. Nakajima and S. Wild 17 14 B.-C. Huang and M. A. Langston. Fast stable merging and sorting in constant extra space. The Computer Journal, 35(6):643–650, Dec. 1992.doi:10.1093/comjnl/35.6.643. 15 J. Katajainen, T. Pasanen, and J. Teuhola. Practical in-place mergesort.Nordic Journal of Computing, 3(1):27–40,","evidence_cleaned":"11 E. Ghasemi, V. Jugé, G. Khalighinejad, and H. Yazdanyar. Galloping in fast-growth natural merge sorts.Algorithmica, 87(2):242–291, Dec. 2024.doi:10.1007/s00453-024-01285-6. 12 G. Graefe. Implementing sorting in database systems.ACM Computing Surveys, 38(3):10, 2006.doi:10.1145/1132960.1132964. 13 B.-C. Huang and M. A. Langston. Practical in-place merging.Communications of the ACM, 31(3):348–352, Mar. 1988.doi:10.1145/42392.42403. F. Moltmann, T.-V. Nakajima and S. Wild 17 14 B.-C. Huang and M. A. Langston. Fast stable merging and sorting in constant extra space. The Computer Journal, 35(6):643–650, Dec. 1992.doi:10.1093/comjnl/35.6.643. 15 J. Katajainen, T. Pasanen, and J. Teuhola. Practical in-place mergesort.Nordic Journal of Computing, 3(1):27–40","evidence_source_label":"bibliography line","event_type":"correction","event_type_label":"Correction","source_label":"Crossref","event_date":"2025-01-29","work_title":"Ghasemi, V","work_doi":"10.1007/s00453-024-01285-6","event_doi":"10.1007/s00453-024-01285-6","flag_href":"/flags/7817","event_href":"/event/10.1007/s00453-024-01285-6","paper_href":"/paper/2605.27147","created_at":"2026-07-13T06:30:08.493450Z","dispute_note":null,"disputed_at":null,"disputed_by":null}],"flag_count":1,"flags_open":1,"flags_disputed":0,"desk_url":"https://pith.science/flags"}