{"schema":"pith.reference-change-event.v1","doi":"10.1016/j.dam.2018.08.017","canonical_url":"https://pith.science/event/10.1016/j.dam.2018.08.017","json_url":"https://pith.science/event/10.1016/j.dam.2018.08.017.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":359293,"doi":"10.1016/j.dam.2018.08.017","event_type":"correction","event_type_label":"Correction","source":"crossref","source_label":"Crossref","event_date":"2024-05-11","title":"Corrigendum to “An algorithm to find maximum area polygons circumscribed about a convex polygon” [Discrete Appl. Math. 255 (2019) 98–108]","work_title":"An algorithm to find maximum area polygons circumscribed about a convex polygon , url =","work_doi":"10.1016/j.dam.2018.08.017","work_arxiv_id":null,"notice_doi":"10.1016/j.dam.2024.04.013","flag_count":0,"flags_open":0,"flags_disputed":0,"latest_flag_at":null,"human_href":"/event/10.1016/j.dam.2018.08.017","json_href":"/event/10.1016/j.dam.2018.08.017.json"},"events":[{"event_id":359293,"doi":"10.1016/j.dam.2018.08.017","event_type":"correction","event_type_label":"Correction","source":"crossref","source_label":"Crossref","event_date":"2024-05-11","title":"Corrigendum to “An algorithm to find maximum area polygons circumscribed about a convex polygon” [Discrete Appl. Math. 255 (2019) 98–108]","work_title":"An algorithm to find maximum area polygons circumscribed about a convex polygon , url =","work_doi":"10.1016/j.dam.2018.08.017","work_arxiv_id":null,"notice_doi":"10.1016/j.dam.2024.04.013","flag_count":0,"flags_open":0,"flags_disputed":0,"latest_flag_at":null,"human_href":"/event/10.1016/j.dam.2018.08.017","json_href":"/event/10.1016/j.dam.2018.08.017.json"}],"flags":[{"id":10946,"status":"open","status_label":"Open","citing_arxiv_id":"2609.10467","citing_title":"Couplings Farthest from the Independent Gaussian","ref_index":229,"evidence_raw":"Ausserhofer, Markus and Dann, Susanna and L\\'. An algorithm to find maximum area polygons circumscribed about a convex polygon , url =. Discrete Appl. Math. , mrclass =. 2019 , bdsk-url-1 =. doi:10.1016/j.dam.2018.08.017 , fjournal =","evidence_cleaned":"Ausserhofer, Markus and Dann, Susanna and L . An algorithm to find maximum area polygons circumscribed about a convex polygon, url =. Discrete Appl. Math., mrclass =. 2019, bdsk-url-1 =. doi:10.1016/j.dam.2018.08.017, fjournal =","evidence_source_label":"bibliography line","event_type":"correction","event_type_label":"Correction","source_label":"Crossref","event_date":"2024-05-11","work_title":"An algorithm to find maximum area polygons circumscribed about a convex polygon , url =","work_doi":"10.1016/j.dam.2018.08.017","event_doi":"10.1016/j.dam.2018.08.017","flag_href":"/flags/10946","event_href":"/event/10.1016/j.dam.2018.08.017","paper_href":"/paper/2609.10467","created_at":"2026-09-10T06:33:56.711434Z","dispute_note":null,"disputed_at":null,"disputed_by":null}],"flag_count":1,"flags_open":1,"flags_disputed":0,"desk_url":"https://pith.science/flags"}