{"schema":"https://pith.science/schemas/pith-integrity/v1.json","pith_number":"2604.27939","arxiv_id":"2604.27939","integrity":{"available":true,"endpoint":"/pith/2604.27939/integrity.json","summary":{"critical":0,"advisory":3,"informational":0,"by_detector":{"doi_compliance":{"total":3,"critical":0,"advisory":3,"informational":0}}},"clean":false,"detectors_run":[{"name":"ai_meta_artifact","version":"1.0.0","status":"completed","ran_at":"2026-05-20T21:35:45.068513Z","findings_count":0},{"name":"doi_compliance","version":"1.0.0","status":"completed","ran_at":"2026-05-19T18:45:27.563858Z","findings_count":3}],"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.1093/logcom/exv05960) was visible in the surrounding text but could not be confirmed against doi.org as printed.","detected_doi":"10.1093/logcom/exv05960","detected_arxiv_id":null,"ref_index":41,"audited_at":"2026-05-19T18:45:27.563858Z"},{"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-24771-513) was visible in the surrounding text but could not be confirmed against doi.org as printed.","detected_doi":"10.1007/978-3-540-24771-513","detected_arxiv_id":null,"ref_index":4,"audited_at":"2026-05-19T18:45:27.563858Z"},{"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-25929-916) was visible in the surrounding text but could not be confirmed against doi.org as printed.","detected_doi":"10.1007/978-3-540-25929-916","detected_arxiv_id":null,"ref_index":23,"audited_at":"2026-05-19T18:45:27.563858Z"}],"snapshot_sha256":"d6060e1d8b6b7c57b68abaef85673c7269395cb600464b0bf835f8ffe0999117"},"events":[{"event_id":2585,"event_type":"pith.integrity.v1","payload_sha256":"8cab31a702d5bb308369a542ff83039b53999d37a7896f6f395323984b66fdc1","signature_b64":"J0MDcv9iVl0p2mFcvsej10HoshseM/6p+dCBO76y3OKqL9Jma4QsHh/KuY+c6/pwBvor7IGCV50OZkW64LQxBQ==","signing_key_id":"pith-v1-2026-05","created_at":"2026-05-19T18:47:18.117871+00:00","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1093/logcom/exv05960) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"Eberhard, S., Hetzl, S., Weller, D.: Boolean unification with predicates. Journal of Logic and Computation27(1), 109–128 (2017) https://doi.org/10.1093/logcom/ exv059 60","arxiv_id":"2604.27939","detector":"doi_compliance","evidence":{"ref_index":41,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"Eberhard, S., Hetzl, S., Weller, D.: Boolean unification with predicates. Journal of Logic and Computation27(1), 109–128 (2017) https://doi.org/10.1093/logcom/ exv059 60","reconstructed_doi":"10.1093/logcom/exv05960"},"severity":"advisory","ref_index":41,"audited_at":"2026-05-19T18:45:27.563858Z","event_type":"pith.integrity.v1","detected_doi":"10.1093/logcom/exv05960","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"724c18bd19e6309c4b266e007c2a0ca4d284164ecba515079d04f820a2591a35","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null}},{"event_id":2584,"event_type":"pith.integrity.v1","payload_sha256":"defdde62f0712deec0932a6bbd0272f7660d41b09afddb4ba886e237b214a966","signature_b64":"CA3Aw3mhd9m1mMaAF1UzaiVJU2DMFYkSBmDLGxMxWVxyHEUDbA5MpbUcbgV+StLGO5ejVNxCcyl+S8zio7oHBw==","signing_key_id":"pith-v1-2026-05","created_at":"2026-05-19T18:47:18.116823+00:00","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1007/978-3-540-25929-916) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"Doherty, P., Szalas, A.: On the correspondence between approximations and sim- ilarity. In: Tsumoto, S., Slowinski, R., Komorowski, H.J., Grzymala-Busse, J.W. (eds.) Rough Sets and Current Trends in Computing (RSCTC 2004). Lecture Notes in ","arxiv_id":"2604.27939","detector":"doi_compliance","evidence":{"ref_index":23,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"Doherty, P., Szalas, A.: On the correspondence between approximations and sim- ilarity. In: Tsumoto, S., Slowinski, R., Komorowski, H.J., Grzymala-Busse, J.W. (eds.) Rough Sets and Current Trends in Computing (RSCTC 2004). Lecture Notes in ","reconstructed_doi":"10.1007/978-3-540-25929-916"},"severity":"advisory","ref_index":23,"audited_at":"2026-05-19T18:45:27.563858Z","event_type":"pith.integrity.v1","detected_doi":"10.1007/978-3-540-25929-916","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"a5d9ba90a1e1278ea75ca07e0645e8466551c4cfe09e39d7578b833ba734b68f","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null}},{"event_id":2583,"event_type":"pith.integrity.v1","payload_sha256":"c64523e65d4262cfc653c7e76f8c614796fe5d2fe3e1347194362cc72edb9161","signature_b64":"GAFJRnUlyIxhn1fZtrp7erywbz490xrH1wzJbZuBhsBw2Caw3FX/AoVRpkXy6eMA07A4MB4+GB/NkTa2YTjxCg==","signing_key_id":"pith-v1-2026-05","created_at":"2026-05-19T18:47:18.115831+00:00","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1007/978-3-540-24771-513) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"Goranko, V., Hustadt, U., Schmidt, R.A., Vakarelov, D.: SCAN is complete for all Sahlqvist formulae. In: Berghammer, R., M¨ oller, B., Struth, G. (eds.) Relational and Kleene-Algebraic Methods in Computer Science (RelMiCS 7). Lecture Notes ","arxiv_id":"2604.27939","detector":"doi_compliance","evidence":{"ref_index":4,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"Goranko, V., Hustadt, U., Schmidt, R.A., Vakarelov, D.: SCAN is complete for all Sahlqvist formulae. In: Berghammer, R., M¨ oller, B., Struth, G. (eds.) Relational and Kleene-Algebraic Methods in Computer Science (RelMiCS 7). Lecture Notes ","reconstructed_doi":"10.1007/978-3-540-24771-513"},"severity":"advisory","ref_index":4,"audited_at":"2026-05-19T18:45:27.563858Z","event_type":"pith.integrity.v1","detected_doi":"10.1007/978-3-540-24771-513","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"02fe38c7d6a1519d9ae5de88ec079bdd1098757de76daf9c00a281344cc7f36e","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null}}],"endpoint_self":"/pith/2604.27939/integrity.json","protocol_url":"https://pith.science/pith-integrity-protocol"}