Reference change · event page

SN Computer Science3(3), 193 (2022) https: //doi.org/10.1007/s42979-022-01084-2

Published notice on a work cited in the Pith corpus. Exact quotes below. No model judges whether any citation was load-bearing.

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.

Correction Crossref 1 open · 1 total · 0 disputed

DOI: 10.1007/s42979-022-01084-2
Notice DOI: 10.1007/s42979-022-01141-w
Event date: 2022-04-19
Machine twin: JSON

01One-hop citing occurrences

Correction Open

Extended Depth-First Representations of $k^2$-trees

ref [22] · 2607.28136 · notice #7942 · dispute

Raw extraction · bibliography line

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

Status lifecycle on notices: open → disputed → (response attached on the notice page). Repaired counts matter as much as open counts. There is no “safe,” “invalid,” or “resolved” badge.