{"schema":"https://pith.science/schemas/pith-integrity/v1.json","pith_number":"2608.07407","arxiv_id":"2608.07407","integrity":{"available":true,"endpoint":"/pith/2608.07407/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":"doi_title_agreement","version":"1.0.0","status":"completed","ran_at":"2026-08-17T17:38:32.569695Z","findings_count":0},{"name":"cited_work_retraction","version":"1.0.0","status":"completed","ran_at":"2026-08-17T17:38:18.374626Z","findings_count":0},{"name":"doi_compliance","version":"1.1.0","status":"completed","ran_at":"2026-08-17T15:39:23.375898Z","findings_count":3},{"name":"ai_meta_artifact","version":"1.0.0","status":"skipped","ran_at":"2026-08-17T03:08:45.487027Z","findings_count":0},{"name":"claim_evidence","version":"1.0.0","status":"completed","ran_at":"2026-08-13T11:28:06.251657Z","findings_count":0},{"name":"external_links","version":"1.0.0","status":"completed","ran_at":"2026-08-10T21:08:45.958049Z","findings_count":0},{"name":"shingle_duplication","version":"0.1.0","status":"skipped","ran_at":"2026-08-10T07:08:20.387040Z","findings_count":0},{"name":"citation_quote_validity","version":"0.1.0","status":"skipped","ran_at":"2026-08-10T03:08:34.736654Z","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/s10107-023-01973-1) was visible in the surrounding text but could not be confirmed against doi.org as printed.","detected_doi":"10.1007/s10107-023-01973-1","detected_arxiv_id":null,"ref_index":14,"audited_at":"2026-08-15T15:09:53.951426Z"},{"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/s10107-015-0949-3) was visible in the surrounding text but could not be confirmed against doi.org as printed.","detected_doi":"10.1007/s10107-015-0949-3","detected_arxiv_id":null,"ref_index":30,"audited_at":"2026-08-15T15:09:53.951426Z"},{"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/s10107-022-01839-y) was visible in the surrounding text but could not be confirmed against doi.org as printed.","detected_doi":"10.1007/s10107-022-01839-y","detected_arxiv_id":null,"ref_index":62,"audited_at":"2026-08-15T15:09:53.951426Z"}],"snapshot_sha256":"dc6d4af169fa00570205599d1a0ea8894ba046913efc4e9e36237aee155018d6"},"events":[{"event_id":19925,"event_type":"pith.integrity.v1","payload_sha256":"af445288fc5365e9749ed31a4e60f77a0956214504ad9978f7b98785687b0ae2","signature_b64":"gJn0OQWJBuYLlDmQlsldTnX2rhCD+T3MZNdb2VBVRS9fo2Lbz214Lhdp6ZLR69B9cXM7IehEiVQj37A0XfM5AA==","signing_key_id":"pith-v1-2026-05","created_at":"2026-08-15T15:13:29.862881+00:00","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1007/s10107-022-01839-y) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"Adrien B. Taylor and Yoel Drori. An optimal gradient method for smooth strongly convex minimization. Mathematical Programming, 199(1–2):557–594, 2023. doi:10.1007/s10107-0 22-01839-y","arxiv_id":"2608.07407","detector":"doi_compliance","evidence":{"ref_index":62,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"10.1007/s10107-0","reconstructed_doi":"10.1007/s10107-022-01839-y"},"severity":"advisory","ref_index":62,"audited_at":"2026-08-15T15:09:53.951426Z","event_type":"pith.integrity.v1","detected_doi":"10.1007/s10107-022-01839-y","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"578f60028fbaedb0cd1c9e912e5fd47a8ad4e0fd4276ebcd3cd15979c5f02f53","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.1.0","detected_arxiv_id":null}},{"event_id":19924,"event_type":"pith.integrity.v1","payload_sha256":"04b35c1fc0d1fb00bc44374766bc3f81204ef87f81fc6ecce1a4ab4f0047e34b","signature_b64":"CSWrNd1F70Vt/0OD3SuBtcGfNOpuCIo6fNd9BUZCn9FDw5Xj2FzdDXkQHek8NhfNlx+E4YDUsE3GKQqyy4wgAA==","signing_key_id":"pith-v1-2026-05","created_at":"2026-08-15T15:13:29.855351+00:00","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1007/s10107-015-0949-3) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"Donghwan Kim and Jeffrey A. Fessler. Optimized first-order methods for smooth convex minimization. Mathematical Programming, 159(1-2):81–107, 2016. doi:10.1007/s10107-015 -0949-3","arxiv_id":"2608.07407","detector":"doi_compliance","evidence":{"ref_index":30,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"10.1007/s10107-015","reconstructed_doi":"10.1007/s10107-015-0949-3"},"severity":"advisory","ref_index":30,"audited_at":"2026-08-15T15:09:53.951426Z","event_type":"pith.integrity.v1","detected_doi":"10.1007/s10107-015-0949-3","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"6b6c17aa4bad9fd0e0497a098a3c870cce7ffdbe3f280c41ddd9a31f01d1fb02","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.1.0","detected_arxiv_id":null}},{"event_id":19923,"event_type":"pith.integrity.v1","payload_sha256":"43d8be9dc66adb4796d7b3be1b83a42be007946948a1bd2bdd990a582eb421c4","signature_b64":"2Z1jWtPbqPGD/DHMQjBQzCUXRtEuz9d/7/ed2yGCwQwWVekquZ8LgAv4ssRIgdLLdOlnSt6jPM9GQ14e/HN1AQ==","signing_key_id":"pith-v1-2026-05","created_at":"2026-08-15T15:13:29.847569+00:00","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1007/s10107-023-01973-1) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"Shuvomoy Das Gupta, Bart P. G. Van Parys, and Ernest K. Ryu. Branch-and-bound perfor- mance estimation programming: A unified methodology for constructing optimal optimization methods. Mathematical Programming, 204(1–2):567–639, 2024. doi:1","arxiv_id":"2608.07407","detector":"doi_compliance","evidence":{"ref_index":14,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"10.1007/s10107-023-0","reconstructed_doi":"10.1007/s10107-023-01973-1"},"severity":"advisory","ref_index":14,"audited_at":"2026-08-15T15:09:53.951426Z","event_type":"pith.integrity.v1","detected_doi":"10.1007/s10107-023-01973-1","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"5f4e2c98d23fa9764d33363bfc7e4bb69cbbfcd84c68e9b01738ed7a62cdeec2","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.1.0","detected_arxiv_id":null}}],"endpoint_self":"/pith/2608.07407/integrity.json","protocol_url":"https://pith.science/pith-integrity-protocol"}