{"schema":"https://pith.science/schemas/pith-integrity/v1.json","pith_number":"2607.08789","arxiv_id":"2607.08789","integrity":{"available":true,"endpoint":"/pith/2607.08789/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":"doi_compliance","version":"1.0.0","status":"completed","ran_at":"2026-07-13T07:30:42.464568Z","findings_count":1},{"name":"ai_meta_artifact","version":"1.0.0","status":"skipped","ran_at":"2026-07-13T00:49:50.758965Z","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.5555/3041838.3041955.108) was visible in the surrounding text but could not be confirmed against doi.org as printed.","detected_doi":"10.5555/3041838.3041955.108","detected_arxiv_id":null,"ref_index":79,"audited_at":"2026-07-13T07:30:42.464568Z"}],"snapshot_sha256":"571bdcb05ec0267592fb8eb57072ca29b0a11dc91a236b20792a9a9eb747a835"},"events":[{"event_id":13027,"event_type":"pith.integrity.v1","payload_sha256":"7ecddab889324b16af491ea435dcd3d9cd81d5e28c690253628f917c90b54d8b","signature_b64":"+2Ey/9GV35AYaMipyeUb7rOn9XvX/NmIUpOH8KGczbJjIYiu2FWXnUxVhDkA7jxJRGP2t4xFGINbQvRHlMwiDQ==","signing_key_id":"pith-v1-2026-05","created_at":"2026-07-13T07:33:59.572163+00:00","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.5555/3041838.3041955.108) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"Martin Zinkevich. Online convex programming and generalized infinitesimal gradient ascent. In International Con- ference on Machine Learning (ICML), 2003. doi: 10.5555/3041838.3041955. 108","arxiv_id":"2607.08789","detector":"doi_compliance","evidence":{"ref_index":79,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"Martin Zinkevich. Online convex programming and generalized infinitesimal gradient ascent. In International Con- ference on Machine Learning (ICML), 2003. doi: 10.5555/3041838.3041955. 108","reconstructed_doi":"10.5555/3041838.3041955.108"},"severity":"advisory","ref_index":79,"audited_at":"2026-07-13T07:30:42.464568Z","event_type":"pith.integrity.v1","detected_doi":"10.5555/3041838.3041955.108","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"a77563a65e6eb7e75766911e4c368f0c99e2d0efb762baec993b6499841ee149","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null}}],"endpoint_self":"/pith/2607.08789/integrity.json","protocol_url":"https://pith.science/pith-integrity-protocol"}