{"schema":"https://pith.science/schemas/pith-integrity/v1.json","pith_number":"2606.24415","arxiv_id":"2606.24415","integrity":{"available":true,"endpoint":"/pith/2606.24415/integrity.json","summary":{"critical":3,"advisory":1,"informational":0,"by_detector":{"doi_compliance":{"total":4,"critical":3,"advisory":1,"informational":0}}},"clean":false,"detectors_run":[{"name":"doi_compliance","version":"1.0.0","status":"completed","ran_at":"2026-07-13T03:44:36.304328Z","findings_count":4},{"name":"ai_meta_artifact","version":"1.0.0","status":"completed","ran_at":"2026-07-10T15:51:02.464174Z","findings_count":0},{"name":"doi_title_agreement","version":"1.0.0","status":"completed","ran_at":"2026-07-10T02:31:08.953073Z","findings_count":0}],"findings":[{"detector":"doi_compliance","finding_type":"broken_identifier","severity":"critical","verdict_class":"incontrovertible","note":"DOI '10.26021/2479' as printed in the bibliography is syntactically invalid and cannot resolve.","detected_doi":"10.26021/2479","detected_arxiv_id":null,"ref_index":3,"audited_at":"2026-07-09T17:16:31.660799Z"},{"detector":"doi_compliance","finding_type":"unresolvable_identifier","severity":"critical","verdict_class":"cross_source","note":"Identifier '10.1016/s0166-218x(02' is syntactically valid but the DOI registry (doi.org) returned 404, and Crossref / OpenAlex / internal corpus also have no record. The cited work could not be located through any authoritative source.","detected_doi":"10.1016/s0166-218x(02","detected_arxiv_id":null,"ref_index":5,"audited_at":"2026-07-09T17:16:31.660799Z"},{"detector":"doi_compliance","finding_type":"broken_identifier","severity":"critical","verdict_class":"incontrovertible","note":"DOI '10.1016/j.tcs' as printed in the bibliography is syntactically invalid and cannot resolve.","detected_doi":"10.1016/j.tcs","detected_arxiv_id":null,"ref_index":30,"audited_at":"2026-07-09T17:16:31.660799Z"},{"detector":"doi_compliance","finding_type":"recoverable_identifier","severity":"advisory","verdict_class":"incontrovertible","note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1007/978-3-540-30219-333) was visible in the surrounding text but could not be confirmed against doi.org as printed.","detected_doi":"10.1007/978-3-540-30219-333","detected_arxiv_id":null,"ref_index":19,"audited_at":"2026-07-09T17:16:31.660799Z"}],"snapshot_sha256":"67bc77793c9b3ad1f21b90bd74ab5cd5fe8e09256995fdbb0e3624d9b7d1c813"},"events":[{"event_id":10094,"event_type":"pith.integrity.v1","payload_sha256":"f914219a9cd304bc6b5bbe3079ec8360e787c3e4fda74994f1fe97a724ec0be3","signature_b64":"0fRJ1T8u+m20LzUV6EolPX1EA7R/UqFUKvfVkPix3m2mksh5GxQGpbNPNLnG0LQI7KQA7zHku34HaeaN/RNSCQ==","signing_key_id":"pith-v1-2026-05","created_at":"2026-07-09T17:17:57.716237+00:00","payload":{"note":"DOI '10.1016/j.tcs' as printed in the bibliography is syntactically invalid and cannot resolve.","snippet":"Lindeberg A, Alfonsson A, Moulton V, Scholz GE, Hellmuth M (2026) Inferring DAGs and phylogenetic networks from least common ancestors. Theoretical Computer Science 1082:116114, DOI 10.1016/j.tcs. 2026.116114","arxiv_id":"2606.24415","detector":"doi_compliance","evidence":{"ref_index":30,"raw_excerpt":"Lindeberg A, Alfonsson A, Moulton V, Scholz GE, Hellmuth M (2026) Inferring DAGs and phylogenetic networks from least common ancestors. Theoretical Computer Science 1082:116114, DOI 10.1016/j.tcs. 2026.116114","verdict_class":"incontrovertible","doi_as_printed":"10.1016/j.tcs"},"severity":"critical","ref_index":30,"audited_at":"2026-07-09T17:16:31.660799Z","event_type":"pith.integrity.v1","detected_doi":"10.1016/j.tcs","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"broken_identifier","evidence_hash":"ea8c5774d34c743b1abc0a97bc190af2340db209f71311b51c9dd2c49e690eaf","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null}},{"event_id":10093,"event_type":"pith.integrity.v1","payload_sha256":"a9c3f606911ef28b455be974fe17b0239ec5438e9cccb5e2bf9685aa2b6074c7","signature_b64":"j179e5U+/t4U3etlT7YSsQymNfH/J/2PeY5q6vvqVNPfr/trVQo7up2SEl5dzSPgUzbCKlaTX9hqnk10iMzJAw==","signing_key_id":"pith-v1-2026-05","created_at":"2026-07-09T17:17:57.714493+00:00","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1007/978-3-540-30219-333) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"Huson DH, Dezulian T, Kl ¨opper T, Steel MA (2004) Phylogenetic super-networks from partial trees. In: Jonassen I, Kim J (eds) Algorithms in Bioinformatics, Springer Berlin Heidelberg, Berlin, Heidelberg, pp 388–399, DOI 10.1007/978-3-540-3","arxiv_id":"2606.24415","detector":"doi_compliance","evidence":{"ref_index":19,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"Huson DH, Dezulian T, Kl ¨opper T, Steel MA (2004) Phylogenetic super-networks from partial trees. In: Jonassen I, Kim J (eds) Algorithms in Bioinformatics, Springer Berlin Heidelberg, Berlin, Heidelberg, pp 388–399, DOI 10.1007/978-3-540-3","reconstructed_doi":"10.1007/978-3-540-30219-333"},"severity":"advisory","ref_index":19,"audited_at":"2026-07-09T17:16:31.660799Z","event_type":"pith.integrity.v1","detected_doi":"10.1007/978-3-540-30219-333","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"ef60aa166afb5a4cbb8ab90bbe8e9b6dac682141025495a3b3f8dfeae00aa0d5","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null}},{"event_id":10092,"event_type":"pith.integrity.v1","payload_sha256":"a5c389a8573bd9f7061a499d044be707a358072ee6c14fb5d1775aa24a237795","signature_b64":"JSfae+cOX3zsd2ySToVXakSpMruC0sIpMYdtLk1OEuhCQObIsrx6MuqO/ifn9PtY2nB3vExZDNXhz1ciINPSAA==","signing_key_id":"pith-v1-2026-05","created_at":"2026-07-09T17:17:57.709603+00:00","payload":{"note":"Identifier '10.1016/s0166-218x(02' is syntactically valid but the DOI registry (doi.org) returned 404, and Crossref / OpenAlex / internal corpus also have no record. The cited work could not be located through any authoritative source.","snippet":"Caspard N, Monjardet B (2003) The lattices of closure systems, closure operators, and implicational systems on a finite set: a survey. Discrete Applied Mathematics 127(2):241–269, DOI 10.1016/S0166-218X(02) 00209-3","arxiv_id":"2606.24415","detector":"doi_compliance","evidence":{"doi":"10.1016/s0166-218x(02","arxiv_id":null,"ref_index":5,"raw_excerpt":"Caspard N, Monjardet B (2003) The lattices of closure systems, closure operators, and implicational systems on a finite set: a survey. Discrete Applied Mathematics 127(2):241–269, DOI 10.1016/S0166-218X(02) 00209-3","verdict_class":"cross_source","checked_sources":["crossref_by_doi","openalex_by_doi","doi_org_head"]},"severity":"critical","ref_index":5,"audited_at":"2026-07-09T17:16:31.660799Z","event_type":"pith.integrity.v1","detected_doi":"10.1016/s0166-218x(02","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"unresolvable_identifier","evidence_hash":"6ec971d402b6aac8769f64344f6cfac76c0ae357bddea871bbb8395fa439d87c","paper_version":1,"verdict_class":"cross_source","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null}},{"event_id":10091,"event_type":"pith.integrity.v1","payload_sha256":"e8f892a97147dbb07efc3533f6921ecfd72dbc26a80f19fd85f322fd6d0d3551","signature_b64":"5/v8Lgry9le2bKsqOrMFs3z4uqvm67tQC/7UVIqWA9ef+/deTWxkcTsiIINnG5ploEeN1Tpt6PaomqTsGXVlDA==","signing_key_id":"pith-v1-2026-05","created_at":"2026-07-09T17:17:57.708388+00:00","payload":{"note":"DOI '10.26021/2479' as printed in the bibliography is syntactically invalid and cannot resolve.","snippet":"Bryant D (1997) Building trees, hunting for trees, and comparing trees. theory and methods in phylogenetic analysis. PhD thesis, University of Canterbury, DOI 10.26021/2479","arxiv_id":"2606.24415","detector":"doi_compliance","evidence":{"ref_index":3,"raw_excerpt":"Bryant D (1997) Building trees, hunting for trees, and comparing trees. theory and methods in phylogenetic analysis. PhD thesis, University of Canterbury, DOI 10.26021/2479","verdict_class":"incontrovertible","doi_as_printed":"10.26021/2479"},"severity":"critical","ref_index":3,"audited_at":"2026-07-09T17:16:31.660799Z","event_type":"pith.integrity.v1","detected_doi":"10.26021/2479","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"broken_identifier","evidence_hash":"5a875d5162fefab19c64aaca6b4a680d11721af7d3b7f5e9257ac7dd4aa78dd8","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null}}],"endpoint_self":"/pith/2606.24415/integrity.json","protocol_url":"https://pith.science/pith-integrity-protocol"}