{"schema":"https://pith.science/schemas/pith-integrity/v1.json","pith_number":"2606.16087","arxiv_id":"2606.16087","integrity":{"available":true,"endpoint":"/pith/2606.16087/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-11T08:51:27.604154Z","findings_count":0},{"name":"doi_compliance","version":"1.0.0","status":"completed","ran_at":"2026-07-09T23:54:50.929268Z","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.1109/AC-CESS.2023.3281266) was visible in the surrounding text but could not be confirmed against doi.org as printed.","detected_doi":"10.1109/AC-CESS.2023.3281266","detected_arxiv_id":null,"ref_index":14,"audited_at":"2026-07-09T23:54:50.929268Z"}],"snapshot_sha256":"e3f2d7bbb7db90feb3a698daf31bbd4b9a48dd7101e613d460979ff1f21fd2e5"},"events":[{"event_id":11341,"event_type":"pith.integrity.v1","payload_sha256":"b6050a63785881cd918e157bbb27c7d90fd469256f86719699d1818b00b632b2","signature_b64":"3gvjc+xGwSgUDsKUURNjG6fHFP0SZlFDgx+QzrGDJLT4nHYadakCF91IiWwlIvywGiH4ocpJ5oGi1RWiukYHDg==","signing_key_id":"pith-v1-2026-05","created_at":"2026-07-09T23:58:25.668192+00:00","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1109/AC-CESS.2023.3281266) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"D. Dahiphale, ”MapReduce for Graphs Processing: New Big Data Algorithm for 2-Edge Connected Components and Future Ideas,” in IEEE Access, vol. 11, pp. 54986-55001, 2023, doi: 10.1109/AC- CESS.2023.3281266","arxiv_id":"2606.16087","detector":"doi_compliance","evidence":{"ref_index":14,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"D. Dahiphale, ”MapReduce for Graphs Processing: New Big Data Algorithm for 2-Edge Connected Components and Future Ideas,” in IEEE Access, vol. 11, pp. 54986-55001, 2023, doi: 10.1109/AC- CESS.2023.3281266","reconstructed_doi":"10.1109/AC-CESS.2023.3281266"},"severity":"advisory","ref_index":14,"audited_at":"2026-07-09T23:54:50.929268Z","event_type":"pith.integrity.v1","detected_doi":"10.1109/AC-CESS.2023.3281266","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"6f53c06e775819480ca18fa3145aeb4457b2fbe7c15d6b210976cc5dfc2d834e","paper_version":2,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null}}],"endpoint_self":"/pith/2606.16087/integrity.json","protocol_url":"https://pith.science/pith-integrity-protocol"}