{"schema":"pith.reference-change-event.v1","doi":"10.1007/s42979-022-01084-2","canonical_url":"https://pith.science/event/10.1007/s42979-022-01084-2","json_url":"https://pith.science/event/10.1007/s42979-022-01084-2.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":146827,"doi":"10.1007/s42979-022-01084-2","event_type":"correction","event_type_label":"Correction","source":"crossref","source_label":"Crossref","event_date":"2022-04-19","title":"Correction to: Graph Compression for Adjacency-Matrix Multiplication","work_title":"SN Computer Science3(3), 193 (2022) https: //doi.org/10.1007/s42979-022-01084-2","work_doi":"10.1007/s42979-022-01084-2","work_arxiv_id":null,"notice_doi":"10.1007/s42979-022-01141-w","flag_count":0,"flags_open":0,"flags_disputed":0,"latest_flag_at":null,"human_href":"/event/10.1007/s42979-022-01084-2","json_href":"/event/10.1007/s42979-022-01084-2.json"},"events":[{"event_id":146827,"doi":"10.1007/s42979-022-01084-2","event_type":"correction","event_type_label":"Correction","source":"crossref","source_label":"Crossref","event_date":"2022-04-19","title":"Correction to: Graph Compression for Adjacency-Matrix Multiplication","work_title":"SN Computer Science3(3), 193 (2022) https: //doi.org/10.1007/s42979-022-01084-2","work_doi":"10.1007/s42979-022-01084-2","work_arxiv_id":null,"notice_doi":"10.1007/s42979-022-01141-w","flag_count":0,"flags_open":0,"flags_disputed":0,"latest_flag_at":null,"human_href":"/event/10.1007/s42979-022-01084-2","json_href":"/event/10.1007/s42979-022-01084-2.json"}],"flags":[{"id":7942,"status":"open","status_label":"Open","citing_arxiv_id":"2607.28136","citing_title":"Extended Depth-First Representations of $k^2$-trees","ref_index":22,"evidence_raw":"Francisco, A.P., Gagie, T., K¨ oppl, D., Ladra, S., Navarro, G.: Graph compression for adjacency-matrix multiplication. SN Computer Science3(3), 193 (2022) https: //doi.org/10.1007/s42979-022-01084-2","evidence_cleaned":null,"evidence_source_label":"bibliography line","event_type":"correction","event_type_label":"Correction","source_label":"Crossref","event_date":"2022-04-19","work_title":"SN Computer Science3(3), 193 (2022) https: //doi.org/10.1007/s42979-022-01084-2","work_doi":"10.1007/s42979-022-01084-2","event_doi":"10.1007/s42979-022-01084-2","flag_href":"/flags/7942","event_href":"/event/10.1007/s42979-022-01084-2","paper_href":"/paper/2607.28136","created_at":"2026-07-31T18:17:46.887895Z","dispute_note":null,"disputed_at":null,"disputed_by":null}],"flag_count":1,"flags_open":1,"flags_disputed":0,"desk_url":"https://pith.science/flags"}