{"schema":"https://pith.science/schemas/pith-integrity/v1.json","pith_number":"2608.09546","arxiv_id":"2608.09546","integrity":{"available":true,"endpoint":"/pith/2608.09546/integrity.json","summary":{"critical":0,"advisory":1,"informational":0,"by_detector":{"doi_compliance":{"total":1,"critical":0,"advisory":1,"informational":0}}},"clean":false,"detectors_run":[{"name":"claim_evidence","version":"1.0.0","status":"completed","ran_at":"2026-08-14T08:28:05.046547Z","findings_count":0},{"name":"doi_title_agreement","version":"1.0.0","status":"completed","ran_at":"2026-08-13T16:38:34.423420Z","findings_count":0},{"name":"doi_compliance","version":"1.1.0","status":"completed","ran_at":"2026-08-13T15:58:23.464828Z","findings_count":1},{"name":"citation_quote_validity","version":"0.1.0","status":"skipped","ran_at":"2026-08-11T11:08:35.490574Z","findings_count":0},{"name":"cited_work_retraction","version":"1.0.0","status":"completed","ran_at":"2026-08-11T08:38:13.250679Z","findings_count":0},{"name":"ai_meta_artifact","version":"1.0.0","status":"skipped","ran_at":"2026-08-11T03:08:37.028029Z","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.JCSS.2014.04.015 resolves to 'Tight bounds for parameterized complexity of Cluster Editing with a small number of clusters'. A reader following the printed text alone cannot reach it.","detected_doi":"10.1016/J.JCSS.2014.04.015","detected_arxiv_id":null,"ref_index":2014,"audited_at":"2026-08-11T15:48:04.940288Z"}],"snapshot_sha256":"b3c1eb71776739c6d57df9ffdc6044c3f5b36d7ed0e58d75482786936eb8e72e"},"events":[{"event_id":19030,"event_type":"pith.integrity.v1","payload_sha256":"080ec74b1990882bf1102390ddd9e906e28176957737822c00ad7b6ce1c3b249","signature_b64":"DuDJJxRSspWdsdvS1HzWHSwOEgr5l9iOzqGsfVQ0PlY0qsoGCYHkA15mgcbrGWFYEt6HBwrr41RT+NlN8UO6AQ==","signing_key_id":"pith-v1-2026-05","created_at":"2026-08-11T15:48:29.382987+00:00","payload":{"note":"DOI is split by whitespace or line breaks in the printed bibliography. Reconstructed DOI 10.1016/J.JCSS.2014.04.015 resolves to 'Tight bounds for parameterized complexity of Cluster Editing with a small number of clusters'. A reader following the printed text alone cannot reach it.","snippet":"URL:https://doi.org/10.1016/j.jcss.2014. 04.015,doi:10.1016/J.JCSS.2014.04.015. 44 Fedor V Fomin, Daniel Lokshtanov, Saket Saurabh, and Meirav Zehavi.Kernelization: theory of parameterized preprocessing. Cambridge University Press,","arxiv_id":"2608.09546","detector":"doi_compliance","evidence":{"ref_index":2014,"verdict_class":"incontrovertible","resolved_title":"Tight bounds for parameterized complexity of Cluster Editing with a small number of clusters","printed_excerpt":"10.1016/j.jcss.2014","reconstructed_doi":"10.1016/J.JCSS.2014.04.015"},"severity":"advisory","ref_index":2014,"audited_at":"2026-08-11T15:48:04.940288Z","event_type":"pith.integrity.v1","detected_doi":"10.1016/J.JCSS.2014.04.015","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"193e9a1f61dd265c2ba092f8c2b5a1e057f594abc8bab9076c408801a170e242","paper_version":1,"verdict_class":"incontrovertible","resolved_title":"Tight bounds for parameterized complexity of Cluster Editing with a small number of clusters","detector_version":"1.1.0","detected_arxiv_id":null}}],"endpoint_self":"/pith/2608.09546/integrity.json","protocol_url":"https://pith.science/pith-integrity-protocol"}