{"schema":"https://pith.science/schemas/pith-integrity/v1.json","pith_number":"2605.23550","arxiv_id":"2605.23550","integrity":{"available":true,"endpoint":"/pith/2605.23550/integrity.json","summary":{"critical":3,"advisory":0,"informational":0,"by_detector":{"doi_compliance":{"total":3,"critical":3,"advisory":0,"informational":0}}},"clean":false,"detectors_run":[{"name":"doi_compliance","version":"1.0.0","status":"completed","ran_at":"2026-06-05T04:56:21.262262Z","findings_count":3},{"name":"doi_title_agreement","version":"1.0.0","status":"completed","ran_at":"2026-06-05T04:36:07.756297Z","findings_count":0},{"name":"ai_meta_artifact","version":"1.0.0","status":"completed","ran_at":"2026-06-01T04:35:54.143823Z","findings_count":0},{"name":"claim_evidence","version":"1.0.0","status":"completed","ran_at":"2026-05-28T13:04:50.530376Z","findings_count":0},{"name":"citation_quote_validity","version":"0.1.0","status":"completed","ran_at":"2026-05-25T11:52:11.595105Z","findings_count":0},{"name":"cited_work_retraction","version":"1.0.0","status":"completed","ran_at":"2026-05-25T07:55:31.332825Z","findings_count":0}],"findings":[{"detector":"doi_compliance","finding_type":"broken_identifier","severity":"critical","verdict_class":"incontrovertible","note":"DOI '10.1016/j.patcog' as printed in the bibliography is syntactically invalid and cannot resolve.","detected_doi":"10.1016/j.patcog","detected_arxiv_id":null,"ref_index":18,"audited_at":"2026-05-25T04:28:43.451370Z"},{"detector":"doi_compliance","finding_type":"broken_identifier","severity":"critical","verdict_class":"incontrovertible","note":"DOI '10.1287/moor' as printed in the bibliography is syntactically invalid and cannot resolve.","detected_doi":"10.1287/moor","detected_arxiv_id":null,"ref_index":29,"audited_at":"2026-05-25T04:28:43.451370Z"},{"detector":"doi_compliance","finding_type":"broken_identifier","severity":"critical","verdict_class":"incontrovertible","note":"DOI '10.1016/j' as printed in the bibliography is syntactically invalid and cannot resolve.","detected_doi":"10.1016/j","detected_arxiv_id":null,"ref_index":3,"audited_at":"2026-05-25T04:28:43.451370Z"}],"snapshot_sha256":"d47eef302a4706140f7fbfe65d2a259016b1d906fdd91e9d29e1061878bf3251"},"events":[{"event_id":7357,"event_type":"pith.integrity.v1","payload_sha256":"12a648394d325cb31c99a5b48bc5064fd54938fc228bfd08c2b68b72ccadc12b","signature_b64":"rkp+D1cZZLV8Kja4LCur1qmThf2CXkSEYhMfqeOvmXqzi9LWzR70SFsYFr46LVpN8T0dSATKKK3OZ9xqppvVCg==","signing_key_id":"pith-v1-2026-05","created_at":"2026-05-25T04:29:50.723517+00:00","payload":{"note":"DOI '10.1287/moor' as printed in the bibliography is syntactically invalid and cannot resolve.","snippet":"Pang, J.S., Razaviyayn, M., Alvarado, A.: Computing B-stationary points of nonsmooth DC programs. Mathematics of Operations Research42(1), 95–118 (2017). DOI 10.1287/moor. 2016.0795","arxiv_id":"2605.23550","detector":"doi_compliance","evidence":{"ref_index":29,"raw_excerpt":"Pang, J.S., Razaviyayn, M., Alvarado, A.: Computing B-stationary points of nonsmooth DC programs. Mathematics of Operations Research42(1), 95–118 (2017). DOI 10.1287/moor. 2016.0795","verdict_class":"incontrovertible","doi_as_printed":"10.1287/moor"},"severity":"critical","ref_index":29,"audited_at":"2026-05-25T04:28:43.451370Z","event_type":"pith.integrity.v1","detected_doi":"10.1287/moor","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"broken_identifier","evidence_hash":"a50a65738e62db7904957e37a716ff8034b25debef58250d2812b1dc89e55c14","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null}},{"event_id":7356,"event_type":"pith.integrity.v1","payload_sha256":"e84364e625a85a732651a3a8a915b424e0d88901db004e57a6dfaf05390b967c","signature_b64":"u610Zo1vMnOCQzfr3mdx2RpD/guYaxNfhA/FAH7uE55iHSTz1FjDDbltxkxveZmFVXYqF3aYTnMcIPkcqjuCCQ==","signing_key_id":"pith-v1-2026-05","created_at":"2026-05-25T04:29:50.721438+00:00","payload":{"note":"DOI '10.1016/j.patcog' as printed in the bibliography is syntactically invalid and cannot resolve.","snippet":"Le Thi, H.A., Le, H.M., Pham Dinh, T.: New and efficient DCA based algorithms for minimum sum-of-squares clustering. Pattern Recognition47(1), 388–401 (2014). DOI 10.1016/j.patcog. 2013.07.012","arxiv_id":"2605.23550","detector":"doi_compliance","evidence":{"ref_index":18,"raw_excerpt":"Le Thi, H.A., Le, H.M., Pham Dinh, T.: New and efficient DCA based algorithms for minimum sum-of-squares clustering. Pattern Recognition47(1), 388–401 (2014). DOI 10.1016/j.patcog. 2013.07.012","verdict_class":"incontrovertible","doi_as_printed":"10.1016/j.patcog"},"severity":"critical","ref_index":18,"audited_at":"2026-05-25T04:28:43.451370Z","event_type":"pith.integrity.v1","detected_doi":"10.1016/j.patcog","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"broken_identifier","evidence_hash":"7125005802427aed363679113c5ad9cf44b301bef3febec1770dc9abe9c43a3c","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null}},{"event_id":7355,"event_type":"pith.integrity.v1","payload_sha256":"4135a99b722d892c892d931c040c1a4eba38e2f9e23e8c7d7c8b4308b2954900","signature_b64":"BFNUFg5t2iDSdmlyo0IZbBDpOMcOxVzjluI2wzFNR8n682B84D3yHIlcDlE4KCUSAok04+ezzVIXJABSTWmMAA==","signing_key_id":"pith-v1-2026-05","created_at":"2026-05-25T04:29:50.719034+00:00","payload":{"note":"DOI '10.1016/j' as printed in the bibliography is syntactically invalid and cannot resolve.","snippet":"Bagirov, A.M., Taheri, S., Ugon, J.: Nonsmooth DC programming approach to the minimum sum-of-squares clustering problems. Pattern Recognition53, 12–24 (2016). DOI 10.1016/j. patcog.2015.11.011","arxiv_id":"2605.23550","detector":"doi_compliance","evidence":{"ref_index":3,"raw_excerpt":"Bagirov, A.M., Taheri, S., Ugon, J.: Nonsmooth DC programming approach to the minimum sum-of-squares clustering problems. Pattern Recognition53, 12–24 (2016). DOI 10.1016/j. patcog.2015.11.011","verdict_class":"incontrovertible","doi_as_printed":"10.1016/j"},"severity":"critical","ref_index":3,"audited_at":"2026-05-25T04:28:43.451370Z","event_type":"pith.integrity.v1","detected_doi":"10.1016/j","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"broken_identifier","evidence_hash":"bf86152112832221e2edfa1d686b8f9e3cba6a47f0cd0870af0ec09b48371fca","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null}}],"endpoint_self":"/pith/2605.23550/integrity.json","protocol_url":"https://pith.science/pith-integrity-protocol"}