{"schema":"https://pith.science/schemas/pith-integrity/v1.json","pith_number":"2605.04629","arxiv_id":"2605.04629","integrity":{"available":true,"endpoint":"/pith/2605.04629/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-20T11:36:34.681362Z","findings_count":0},{"name":"doi_title_agreement","version":"1.0.0","status":"completed","ran_at":"2026-05-19T22:31:19.951269Z","findings_count":0},{"name":"doi_compliance","version":"1.0.0","status":"completed","ran_at":"2026-05-19T14:17:55.895827Z","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.1016/S0304-3975(98) was visible in the surrounding text but could not be confirmed against doi.org as printed.","detected_doi":"10.1016/S0304-3975(98","detected_arxiv_id":null,"ref_index":5,"audited_at":"2026-05-19T14:17:55.895827Z"}],"snapshot_sha256":"97cd038e5c5f7955b486bf062cdfacb58446f19f1f780cebdb276cbf833eaa11"},"events":[{"event_id":1643,"event_type":"pith.integrity.v1","payload_sha256":"91d6ccb12f88f1cb6efc448958b2be9a8787f0422cc01e84822fbf8fba6e0d2b","signature_b64":"+h3HgmzciLlXccMVa2G1oIQPXq+r2y5u+4XJG5yZWRY6BEp5ZTvWMHlwYhrnr+1/ATiCCIHwlZo3wLETW6LSBg==","signing_key_id":"pith-v1-2026-05","created_at":"2026-05-19T14:22:06.477257+00:00","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1016/S0304-3975(98) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"Denise, A., Zimmermann, P.: Uniform random generation of decom- posable structures using floating-point arithmetic. Theoretical Computer 7 Science218(2), 233–248 (May 1999). https://doi.org/10.1016/S0304- 3975(98)00323-5","arxiv_id":"2605.04629","detector":"doi_compliance","evidence":{"ref_index":5,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"Denise, A., Zimmermann, P.: Uniform random generation of decom- posable structures using floating-point arithmetic. Theoretical Computer 7 Science218(2), 233–248 (May 1999). https://doi.org/10.1016/S0304- 3975(98)00323-5","reconstructed_doi":"10.1016/S0304-3975(98"},"severity":"advisory","ref_index":5,"audited_at":"2026-05-19T14:17:55.895827Z","event_type":"pith.integrity.v1","detected_doi":"10.1016/S0304-3975(98","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"100f220beb99f78d8112f01db285edfd4d953b87b3dd282a68f6c290aa2d9d14","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null}}],"endpoint_self":"/pith/2605.04629/integrity.json","protocol_url":"https://pith.science/pith-integrity-protocol"}