{"schema":"https://pith.science/schemas/pith-integrity/v1.json","pith_number":"2606.31979","arxiv_id":"2606.31979","integrity":{"available":true,"endpoint":"/pith/2606.31979/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-07-17T20:58:06.580098Z","findings_count":0},{"name":"doi_title_agreement","version":"1.0.0","status":"completed","ran_at":"2026-07-13T20:02:24.357609Z","findings_count":0},{"name":"doi_compliance","version":"1.0.0","status":"completed","ran_at":"2026-07-13T14:24:26.630947Z","findings_count":1},{"name":"claim_evidence","version":"1.0.0","status":"completed","ran_at":"2026-07-13T06:43:48.092687Z","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.1016/0020-0190(78) was visible in the surrounding text but could not be confirmed against doi.org as printed.","detected_doi":"10.1016/0020-0190(78","detected_arxiv_id":null,"ref_index":3,"audited_at":"2026-07-09T10:25:25.476194Z"}],"snapshot_sha256":"188fc1ba19bc4d95ff870f4a2048d92aa73c0f864fc8bb2f68d8fe41aff8f592"},"events":[{"event_id":8395,"event_type":"pith.integrity.v1","payload_sha256":"810420586352a5e3349994286223caa6d316f30bf708b2a031988b262ff1892b","signature_b64":"P4xNs+HQtyHNRv9BgodkzCa7csbQ/7hsnWEqwQvQEsQ8wUg+bvmDLtUNPU7bl0rythFQ7XvUazEholwjfRbpCA==","signing_key_id":"pith-v1-2026-05","created_at":"2026-07-09T10:27:35.482555+00:00","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1016/0020-0190(78) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"Camerini, P.M.: The min-max spanning tree problem and some extensions. In- formation Processing Letters7(1), 10 (1978). https://doi.org/10.1016/0020- 0190(78)90030-3","arxiv_id":"2606.31979","detector":"doi_compliance","evidence":{"ref_index":3,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"Camerini, P.M.: The min-max spanning tree problem and some extensions. In- formation Processing Letters7(1), 10 (1978). https://doi.org/10.1016/0020- 0190(78)90030-3","reconstructed_doi":"10.1016/0020-0190(78"},"severity":"advisory","ref_index":3,"audited_at":"2026-07-09T10:25:25.476194Z","event_type":"pith.integrity.v1","detected_doi":"10.1016/0020-0190(78","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"62c35219463df65bbdf9a92e0db12b442c1779c1c76a18a7e946eed6a690ce46","paper_version":2,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null}}],"endpoint_self":"/pith/2606.31979/integrity.json","protocol_url":"https://pith.science/pith-integrity-protocol"}