{"schema":"https://pith.science/schemas/pith-integrity/v1.json","pith_number":"2607.18758","arxiv_id":"2607.18758","integrity":{"available":true,"endpoint":"/pith/2607.18758/integrity.json","summary":{"critical":0,"advisory":2,"informational":0,"by_detector":{"doi_compliance":{"total":2,"critical":0,"advisory":2,"informational":0}}},"clean":false,"detectors_run":[{"name":"doi_title_agreement","version":"1.0.0","status":"completed","ran_at":"2026-08-03T20:38:37.751241Z","findings_count":0},{"name":"doi_compliance","version":"1.1.0","status":"completed","ran_at":"2026-08-03T15:01:04.920433Z","findings_count":2},{"name":"ai_meta_artifact","version":"1.0.0","status":"skipped","ran_at":"2026-07-29T03:52:31.901716Z","findings_count":0},{"name":"claim_evidence","version":"1.0.0","status":"completed","ran_at":"2026-07-28T13:33:05.354913Z","findings_count":0},{"name":"citation_quote_validity","version":"0.1.0","status":"skipped","ran_at":"2026-07-22T15:57:24.631728Z","findings_count":0},{"name":"cited_work_retraction","version":"1.0.0","status":"completed","ran_at":"2026-07-22T11:22:21.220019Z","findings_count":0}],"findings":[{"detector":"doi_compliance","finding_type":"recoverable_identifier","severity":"advisory","verdict_class":"incontrovertible","note":"DOI is split by whitespace or line breaks in the printed bibliography. Reconstructed DOI 10.1016/j.laa.2019.04.004 resolves to 'The ancestral matrix of a rooted tree'. A reader following the printed text alone cannot reach it.","detected_doi":"10.1016/j.laa.2019.04.004","detected_arxiv_id":null,"ref_index":3,"audited_at":"2026-08-01T14:39:51.663703Z"},{"detector":"doi_compliance","finding_type":"recoverable_identifier","severity":"advisory","verdict_class":"incontrovertible","note":"DOI is split by whitespace or line breaks in the printed bibliography. Reconstructed DOI 10.1016/j.parco.2015.09.001 resolves to 'Numerical reproducibility for the parallel reduction on multi- and many-core architectures'. A reader following the printed text alone cannot reach it.","detected_doi":"10.1016/j.parco.2015.09.001","detected_arxiv_id":null,"ref_index":19,"audited_at":"2026-08-01T14:39:51.663703Z"}],"snapshot_sha256":"0a1a7588a323f080a5136b865b60136e484debf286de698bde60c8b9cd2d51cb"},"events":[{"event_id":15972,"event_type":"pith.integrity.v1","payload_sha256":"a0c415c1558de5104055017a9e243f9db15da112eddd066a7f2a636a33fced32","signature_b64":"SOiukXUjvNCg8AJzTfmAdMW0lM9TktTcgI9Zs3FPX6HQKESWPpYvsWojbyp7bqZ6nUxLb0/3NGgFSBh0dlNaAA==","signing_key_id":"pith-v1-2026-05","created_at":"2026-08-01T14:43:28.326554+00:00","payload":{"note":"DOI is split by whitespace or line breaks in the printed bibliography. Reconstructed DOI 10.1016/j.parco.2015.09.001 resolves to 'Numerical reproducibility for the parallel reduction on multi- and many-core architectures'. A reader following the printed text alone cannot reach it.","snippet":"Caroline Collange et al. “Numerical reproducibility for the parallel reduction on multi- and many-core architectures”. In: Parallel Computing49 (2015), pp. 83–97.DOI: 10.1016/j.parco. 2015.09.001","arxiv_id":"2607.18758","detector":"doi_compliance","evidence":{"ref_index":19,"verdict_class":"incontrovertible","resolved_title":"Numerical reproducibility for the parallel reduction on multi- and many-core architectures","printed_excerpt":"10.1016/j.parco","reconstructed_doi":"10.1016/j.parco.2015.09.001"},"severity":"advisory","ref_index":19,"audited_at":"2026-08-01T14:39:51.663703Z","event_type":"pith.integrity.v1","detected_doi":"10.1016/j.parco.2015.09.001","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"eef026d42e083e6967bddb20ea9f690fd25e89147505feb1dcd2c1a831f0a8e8","paper_version":1,"verdict_class":"incontrovertible","resolved_title":"Numerical reproducibility for the parallel reduction on multi- and many-core architectures","detector_version":"1.1.0","detected_arxiv_id":null}},{"event_id":15971,"event_type":"pith.integrity.v1","payload_sha256":"d07fc210129e3e1b67a51bcd0c1d6666685ed3823b9473326ad506c1b1ceb6ad","signature_b64":"7m/jUXoJLWhstxTbZhRYJEl3JcOIyUmGYIzhFVauDurKpQ/7KJMXh0t4e4onYR8tuAQ+3RcdykZSZhnSbQmiCg==","signing_key_id":"pith-v1-2026-05","created_at":"2026-08-01T14:43:28.223985+00:00","payload":{"note":"DOI is split by whitespace or line breaks in the printed bibliography. Reconstructed DOI 10.1016/j.laa.2019.04.004 resolves to 'The ancestral matrix of a rooted tree'. A reader following the printed text alone cannot reach it.","snippet":"Eric O. D. Andriantiana, Kenneth Dadedzi, and Stephan Wag- ner. “The Ancestral Matrix of a Rooted Tree”. In:Linear Algebra and its Applications575 (2019), pp. 35–65.DOI: 10.1016/j.laa. 2019.04.004","arxiv_id":"2607.18758","detector":"doi_compliance","evidence":{"ref_index":3,"verdict_class":"incontrovertible","resolved_title":"The ancestral matrix of a rooted tree","printed_excerpt":"10.1016/j.laa","reconstructed_doi":"10.1016/j.laa.2019.04.004"},"severity":"advisory","ref_index":3,"audited_at":"2026-08-01T14:39:51.663703Z","event_type":"pith.integrity.v1","detected_doi":"10.1016/j.laa.2019.04.004","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"e9c71e46e63ce23511687ab1a0ca6ab40ed13bbde4e037bf069adce4bfa2d51e","paper_version":1,"verdict_class":"incontrovertible","resolved_title":"The ancestral matrix of a rooted tree","detector_version":"1.1.0","detected_arxiv_id":null}}],"endpoint_self":"/pith/2607.18758/integrity.json","protocol_url":"https://pith.science/pith-integrity-protocol"}