{"schema":"https://pith.science/schemas/pith-integrity/v1.json","pith_number":"2604.24571","arxiv_id":"2604.24571","integrity":{"available":true,"endpoint":"/pith/2604.24571/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":"ai_meta_artifact","version":"1.0.0","status":"completed","ran_at":"2026-05-21T06:38:12.684226Z","findings_count":0},{"name":"doi_compliance","version":"1.0.0","status":"completed","ran_at":"2026-05-19T21:56:09.064917Z","findings_count":2}],"findings":[{"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-45138-9\\_20) was visible in the surrounding text but could not be confirmed against doi.org as printed.","detected_doi":"10.1007/978-3-540-45138-9\\_20","detected_arxiv_id":null,"ref_index":6,"audited_at":"2026-05-19T21:56:09.064917Z"},{"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-45078-8\\_41) was visible in the surrounding text but could not be confirmed against doi.org as printed.","detected_doi":"10.1007/978-3-540-45078-8\\_41","detected_arxiv_id":null,"ref_index":42,"audited_at":"2026-05-19T21:56:09.064917Z"}],"snapshot_sha256":"5d99040c0c7f876917bd29ef411d783dbd98297f2a75207ed30d770f54953c5f"},"events":[{"event_id":3274,"event_type":"pith.integrity.v1","payload_sha256":"85c8f3ffe7cef05250591f81c418e9e77341344bbd4a72f85c892e0405dd5d5a","signature_b64":"HgxM/2gbY3trwkHsNjp9vncwDG766ULlOvB18mtryKCa3sdN5a5wnFADBXLbutKPX+2qDwSR34SspNY1XvvNBw==","signing_key_id":"pith-v1-2026-05","created_at":"2026-05-19T21:57:24.212982+00:00","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1007/978-3-540-45078-8\\_41) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"Elena Prieto - Rodriguez and Christian Sloper. Either/or: Using vertex cover structure in designing fpt-algorithms - the case of k-internal spanning tree. In Frank K. H. A. Dehne, J \\\" o rg - R \\\" u diger Sack, and Michiel H. M. Smid, edito","arxiv_id":"2604.24571","detector":"doi_compliance","evidence":{"ref_index":42,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"Elena Prieto - Rodriguez and Christian Sloper. Either/or: Using vertex cover structure in designing fpt-algorithms - the case of k-internal spanning tree. In Frank K. H. A. Dehne, J \\\" o rg - R \\\" u diger Sack, and Michiel H. M. Smid, edito","reconstructed_doi":"10.1007/978-3-540-45078-8\\_41"},"severity":"advisory","ref_index":42,"audited_at":"2026-05-19T21:56:09.064917Z","event_type":"pith.integrity.v1","detected_doi":"10.1007/978-3-540-45078-8\\_41","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"d94571c49a196bc80323724fa7de378fa836f7ebe1a175cb10a8f4ac6864b5f0","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null}},{"event_id":3273,"event_type":"pith.integrity.v1","payload_sha256":"addcbb1ae0b751a7d647e4e265912c330125c02149c6fd6ba033454aea0db545","signature_b64":"cpPovNozkOxgzgAu5XSNnvH8EN8sFFgX510GgwmZyjg8FWdMVxulemWpltWr3/bGZUSddgtf3wZNaKX/MjRvAQ==","signing_key_id":"pith-v1-2026-05","created_at":"2026-05-19T21:57:24.211945+00:00","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1007/978-3-540-45138-9\\_20) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"Paul S. Bonsma, Tobias Br \\\" u ggemann, and Gerhard J. Woeginger. A faster FPT algorithm for finding spanning trees with many leaves. In Branislav Rovan and Peter Vojt \\' a s, editors, Mathematical Foundations of Computer Science 2003, 28th","arxiv_id":"2604.24571","detector":"doi_compliance","evidence":{"ref_index":6,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"Paul S. Bonsma, Tobias Br \\\" u ggemann, and Gerhard J. Woeginger. A faster FPT algorithm for finding spanning trees with many leaves. In Branislav Rovan and Peter Vojt \\' a s, editors, Mathematical Foundations of Computer Science 2003, 28th","reconstructed_doi":"10.1007/978-3-540-45138-9\\_20"},"severity":"advisory","ref_index":6,"audited_at":"2026-05-19T21:56:09.064917Z","event_type":"pith.integrity.v1","detected_doi":"10.1007/978-3-540-45138-9\\_20","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"3de180f9a83555f02449e4a939f3bc24d0b9a5c9155be1d7c08f1ca20522e277","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null}}],"endpoint_self":"/pith/2604.24571/integrity.json","protocol_url":"https://pith.science/pith-integrity-protocol"}