{"schema":"https://pith.science/schemas/pith-integrity/v1.json","pith_number":"2605.02015","arxiv_id":"2605.02015","integrity":{"available":true,"endpoint":"/pith/2605.02015/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":"ai_meta_artifact","version":"1.0.0","status":"completed","ran_at":"2026-05-20T16:39:57.726646Z","findings_count":0},{"name":"doi_title_agreement","version":"1.0.0","status":"completed","ran_at":"2026-05-20T04:31:22.274337Z","findings_count":0},{"name":"doi_compliance","version":"1.0.0","status":"completed","ran_at":"2026-05-19T16:47:46.042338Z","findings_count":1}],"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.1023/A%) was visible in the surrounding text but could not be confirmed against doi.org as printed.","detected_doi":"10.1023/A%","detected_arxiv_id":null,"ref_index":15,"audited_at":"2026-05-19T16:47:46.042338Z"}],"snapshot_sha256":"fbeca143057f276bdf7178c30c88f1f59a0d76c6ba2863243f5ae47d9bd4d29f"},"events":[{"event_id":2138,"event_type":"pith.integrity.v1","payload_sha256":"d67e58bd5c4d5e00829fb9229fd7106a784361dcd0f252eeff9de5e13be8e8b4","signature_b64":"QXJ7MdJB+/ZM4+NzIPty2Size1P5IlmA5xMOApxkg8N9iqDmdkM6pNC3WhMcvp3xzPl+yWDum/VTZZ4tabJDDg==","signing_key_id":"pith-v1-2026-05","created_at":"2026-05-19T16:52:14.673443+00:00","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1023/A%) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"——, “Random Forests,”Machine Learning, vol. 45, no. 1, pp. 5–32, 2001. [Online]. Available: http://dx.doi.org/10.1023/A% 3A1010933404324","arxiv_id":"2605.02015","detector":"doi_compliance","evidence":{"ref_index":15,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"——, “Random Forests,”Machine Learning, vol. 45, no. 1, pp. 5–32, 2001. [Online]. Available: http://dx.doi.org/10.1023/A% 3A1010933404324","reconstructed_doi":"10.1023/A%"},"severity":"advisory","ref_index":15,"audited_at":"2026-05-19T16:47:46.042338Z","event_type":"pith.integrity.v1","detected_doi":"10.1023/A%","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"73c7150a3d4222e559f6ed11383f481d0d8373e4b92e28fcdc5733d4dabba616","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null}}],"endpoint_self":"/pith/2605.02015/integrity.json","protocol_url":"https://pith.science/pith-integrity-protocol"}