{"schema":"pith.reference-change-event.v1","doi":"10.1007/978-3-030-24658-7","canonical_url":"https://pith.science/event/10.1007/978-3-030-24658-7","json_url":"https://pith.science/event/10.1007/978-3-030-24658-7.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":186822,"doi":"10.1007/978-3-030-24658-7","event_type":"correction","event_type_label":"Correction","source":"crossref","source_label":"Crossref","event_date":"2019-11-19","title":"Correction to: Propositional Programs and Minimal Models","work_title":"Springer (2019)","work_doi":"10.1007/978-3-030-24658-7","work_arxiv_id":null,"notice_doi":"10.1007/978-3-030-24658-7_10","flag_count":0,"flags_open":0,"flags_disputed":0,"latest_flag_at":null,"human_href":"/event/10.1007/978-3-030-24658-7","json_href":"/event/10.1007/978-3-030-24658-7.json"},"events":[{"event_id":186822,"doi":"10.1007/978-3-030-24658-7","event_type":"correction","event_type_label":"Correction","source":"crossref","source_label":"Crossref","event_date":"2019-11-19","title":"Correction to: Propositional Programs and Minimal Models","work_title":"Springer (2019)","work_doi":"10.1007/978-3-030-24658-7","work_arxiv_id":null,"notice_doi":"10.1007/978-3-030-24658-7_10","flag_count":0,"flags_open":0,"flags_disputed":0,"latest_flag_at":null,"human_href":"/event/10.1007/978-3-030-24658-7","json_href":"/event/10.1007/978-3-030-24658-7.json"}],"flags":[{"id":1466,"status":"open","status_label":"Open","citing_arxiv_id":"2605.20172","citing_title":"Long-term Power Grid Planning via Answer Set Programming","ref_index":16,"evidence_raw":"Vladimir Lifschitz , title =. 2019 , url =. doi:10.1007/978-3-030-24658-7 , isbn =","evidence_cleaned":"Vladimir Lifschitz, title =. 2019, url =. doi:10.1007/978-3-030-24658-7, isbn =","evidence_source_label":"bibliography line","event_type":"correction","event_type_label":"Correction","source_label":"Crossref","event_date":"2019-11-19","work_title":"Springer (2019)","work_doi":"10.1007/978-3-030-24658-7","event_doi":"10.1007/978-3-030-24658-7","flag_href":"/flags/1466","event_href":"/event/10.1007/978-3-030-24658-7","paper_href":"/paper/2605.20172","created_at":"2026-07-11T03:18:55.272098Z","dispute_note":null,"disputed_at":null,"disputed_by":null},{"id":1468,"status":"open","status_label":"Open","citing_arxiv_id":"2605.29965","citing_title":"Meta-Programming for Linear-time Temporal Answer Set Programming","ref_index":24,"evidence_raw":"V. Lifschitz. Answer Set Programming. Springer-Verlag, 2019. doi:10.1007/978-3-030-24658-7","evidence_cleaned":null,"evidence_source_label":"bibliography line","event_type":"correction","event_type_label":"Correction","source_label":"Crossref","event_date":"2019-11-19","work_title":"Springer (2019)","work_doi":"10.1007/978-3-030-24658-7","event_doi":"10.1007/978-3-030-24658-7","flag_href":"/flags/1468","event_href":"/event/10.1007/978-3-030-24658-7","paper_href":"/paper/2605.29965","created_at":"2026-07-11T03:18:55.272098Z","dispute_note":null,"disputed_at":null,"disputed_by":null},{"id":1469,"status":"open","status_label":"Open","citing_arxiv_id":"2605.29965","citing_title":"Meta-Programming for Linear-time Temporal Answer Set Programming","ref_index":24,"evidence_raw":"V. Lifschitz. Answer Set Programming. Springer-Verlag, 2019. doi:10.1007/978-3-030-24658-7","evidence_cleaned":null,"evidence_source_label":"bibliography line","event_type":"correction","event_type_label":"Correction","source_label":"Crossref","event_date":"2019-11-19","work_title":"Springer (2019)","work_doi":"10.1007/978-3-030-24658-7","event_doi":"10.1007/978-3-030-24658-7","flag_href":"/flags/1469","event_href":"/event/10.1007/978-3-030-24658-7","paper_href":"/paper/2605.29965","created_at":"2026-07-11T03:18:55.272098Z","dispute_note":null,"disputed_at":null,"disputed_by":null},{"id":1467,"status":"open","status_label":"Open","citing_arxiv_id":"2606.06369","citing_title":"Visual Commonsense Driven Knowledge Refinements for Scene Graph Generation","ref_index":17,"evidence_raw":"Vladimir Lifschitz.Answer Set Programming. Springer, 2019. ISBN 978-3-030- 24657-0. doi: 10.1007/978-3-030-24658-7","evidence_cleaned":null,"evidence_source_label":"bibliography line","event_type":"correction","event_type_label":"Correction","source_label":"Crossref","event_date":"2019-11-19","work_title":"Springer (2019)","work_doi":"10.1007/978-3-030-24658-7","event_doi":"10.1007/978-3-030-24658-7","flag_href":"/flags/1467","event_href":"/event/10.1007/978-3-030-24658-7","paper_href":"/paper/2606.06369","created_at":"2026-07-11T03:18:55.272098Z","dispute_note":null,"disputed_at":null,"disputed_by":null},{"id":1470,"status":"open","status_label":"Open","citing_arxiv_id":"2607.08136","citing_title":"Answer Set Programming Energised! End-to-End Neurosymbolic Reasoning and Learning with ASP and Energy Based Models","ref_index":17,"evidence_raw":"Lifschitz, V.: Answer Set Programming. Springer (2019). https://doi.org/10.1007/ 978-3-030-24658-7, https://doi.org/10.1007/978-3-030-24658-7 18 Suchan et al","evidence_cleaned":null,"evidence_source_label":"bibliography line","event_type":"correction","event_type_label":"Correction","source_label":"Crossref","event_date":"2019-11-19","work_title":"Springer (2019)","work_doi":"10.1007/978-3-030-24658-7","event_doi":"10.1007/978-3-030-24658-7","flag_href":"/flags/1470","event_href":"/event/10.1007/978-3-030-24658-7","paper_href":"/paper/2607.08136","created_at":"2026-07-11T03:18:55.272098Z","dispute_note":null,"disputed_at":null,"disputed_by":null}],"flag_count":5,"flags_open":5,"flags_disputed":0,"desk_url":"https://pith.science/flags"}