{"schema":"https://pith.science/schemas/pith-integrity/v1.json","pith_number":"2605.15506","arxiv_id":"2605.15506","integrity":{"available":true,"endpoint":"/pith/2605.15506/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_compliance","version":"1.0.0","status":"completed","ran_at":"2026-05-20T15:33:49.518305Z","findings_count":2},{"name":"doi_title_agreement","version":"1.0.0","status":"completed","ran_at":"2026-05-20T15:31:25.331549Z","findings_count":0},{"name":"claim_evidence","version":"1.0.0","status":"completed","ran_at":"2026-05-20T14:22:04.665640Z","findings_count":0},{"name":"cited_work_retraction","version":"1.0.0","status":"completed","ran_at":"2026-05-19T14:51:55.472797Z","findings_count":0},{"name":"shingle_duplication","version":"0.1.0","status":"skipped","ran_at":"2026-05-19T13:49:41.851320Z","findings_count":0},{"name":"citation_quote_validity","version":"0.1.0","status":"skipped","ran_at":"2026-05-19T13:49:41.390244Z","findings_count":0},{"name":"ai_meta_artifact","version":"1.0.0","status":"skipped","ran_at":"2026-05-19T13:33:22.638071Z","findings_count":0}],"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-319-24318-418) was visible in the surrounding text but could not be confirmed against doi.org as printed.","detected_doi":"10.1007/978-3-319-24318-418","detected_arxiv_id":null,"ref_index":27,"audited_at":"2026-05-19T15:30:41.489213Z"},{"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-319-98334-930) was visible in the surrounding text but could not be confirmed against doi.org as printed.","detected_doi":"10.1007/978-3-319-98334-930","detected_arxiv_id":null,"ref_index":29,"audited_at":"2026-05-19T15:30:41.489213Z"}],"snapshot_sha256":"011a7248b3ef7d57f9f6fa4c887e3d12a34b19a3a80c8c8fa9b209599e66c1cd"},"events":[{"event_id":1867,"event_type":"pith.integrity.v1","payload_sha256":"c1d8c5236f8c5e91e5bea1e1a7c2093aa5944371b426248bdd6517b752b09528","signature_b64":"KFX80mEyvRaAIt0XtEmvwqR6EziQaGg1DZQDhLDwSoLcmD10L6ridT3dk7de5ToVo8lbndh74PAqy1zL4OT2CA==","signing_key_id":"pith-v1-2026-05","created_at":"2026-05-19T15:32:16.875657+00:00","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1007/978-3-319-98334-930) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"Edward Zulkoski et al. “Learning-Sensitive Back- doors with Restarts”. In:Principles and Prac- tice of Constraint Programming – CP 2018. Ed. by John N. Hooker. V ol. 11008. Lecture Notes in Computer Science. Cham: Springer, 2018, pp. 453–46","arxiv_id":"2605.15506","detector":"doi_compliance","evidence":{"ref_index":29,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"Edward Zulkoski et al. “Learning-Sensitive Back- doors with Restarts”. In:Principles and Prac- tice of Constraint Programming – CP 2018. Ed. by John N. Hooker. V ol. 11008. Lecture Notes in Computer Science. Cham: Springer, 2018, pp. 453–46","reconstructed_doi":"10.1007/978-3-319-98334-930"},"severity":"advisory","ref_index":29,"audited_at":"2026-05-19T15:30:41.489213Z","event_type":"pith.integrity.v1","detected_doi":"10.1007/978-3-319-98334-930","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"2710165d0beb5e233defceabaf6372cb19cf3f24cf9e842c66bfc80041133884","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null}},{"event_id":1866,"event_type":"pith.integrity.v1","payload_sha256":"734513dd3eb49d485a78f75e70857d32588361f8a75754dce40d33f7ac1f8cf4","signature_b64":"DublB7En5Ye9gOyVQOPJIynmkRLCxhzobPtp7+H5yzqZSEdgrMmgHwee6txbp/ukBQZGDnDuH8G+l1zdL/o4Bw==","signing_key_id":"pith-v1-2026-05","created_at":"2026-05-19T15:32:16.873826+00:00","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1007/978-3-319-24318-418) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"Carlos Ans ´otegui et al. “Using Community Struc- ture to Detect Relevant Learnt Clauses”. In: Theory and Applications of Satisfiability Testing (SAT). 2015, pp. 238–254.DOI: 10.1007/978-3- 319-24318-4 18","arxiv_id":"2605.15506","detector":"doi_compliance","evidence":{"ref_index":27,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"Carlos Ans ´otegui et al. “Using Community Struc- ture to Detect Relevant Learnt Clauses”. In: Theory and Applications of Satisfiability Testing (SAT). 2015, pp. 238–254.DOI: 10.1007/978-3- 319-24318-4 18","reconstructed_doi":"10.1007/978-3-319-24318-418"},"severity":"advisory","ref_index":27,"audited_at":"2026-05-19T15:30:41.489213Z","event_type":"pith.integrity.v1","detected_doi":"10.1007/978-3-319-24318-418","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"8cbe0557f1eb99935512c992e35e3d77727fcc8ff8c4f2b1ace0d34e428799d6","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null}}],"endpoint_self":"/pith/2605.15506/integrity.json","protocol_url":"https://pith.science/pith-integrity-protocol"}