{"schema":"https://pith.science/schemas/pith-integrity/v1.json","pith_number":"2605.03431","arxiv_id":"2605.03431","integrity":{"available":true,"endpoint":"/pith/2605.03431/integrity.json","summary":{"critical":1,"advisory":0,"informational":0,"by_detector":{"doi_compliance":{"total":1,"critical":1,"advisory":0,"informational":0}}},"clean":false,"detectors_run":[{"name":"ai_meta_artifact","version":"1.0.0","status":"completed","ran_at":"2026-05-20T13:41:49.116538Z","findings_count":0},{"name":"doi_title_agreement","version":"1.0.0","status":"completed","ran_at":"2026-05-20T01:01:22.077762Z","findings_count":0},{"name":"doi_compliance","version":"1.0.0","status":"completed","ran_at":"2026-05-19T15:25:33.971491Z","findings_count":1}],"findings":[{"detector":"doi_compliance","finding_type":"unresolvable_identifier","severity":"critical","verdict_class":"cross_source","note":"Identifier '10.1016/s0304-3975(01' is syntactically valid but the DOI registry (doi.org) returned 404, and Crossref / OpenAlex / internal corpus also have no record. The cited work could not be located through any authoritative source.","detected_doi":"10.1016/s0304-3975(01","detected_arxiv_id":null,"ref_index":5,"audited_at":"2026-05-19T15:25:33.971491Z"}],"snapshot_sha256":"9d9c86898ec087ddc8c7378ab6709bd93ba8a38e062a15cad82c0c65d808237d"},"events":[{"event_id":1845,"event_type":"pith.integrity.v1","payload_sha256":"26e1eb30be8428cae1e9de2b7a8948fcd4b84f286ad47b0b7063bf851aa853b7","signature_b64":"rRsG4GZWPRIkRyJ1Iw7mGC1YgowjqzZyXxZNSjOs7kzRbpsDPJmozGiHSQNE5B809FWFkh/4gTdc6CRJnpsPAg==","signing_key_id":"pith-v1-2026-05","created_at":"2026-05-19T15:27:10.279790+00:00","payload":{"note":"Identifier '10.1016/s0304-3975(01' is syntactically valid but the DOI registry (doi.org) returned 404, and Crossref / OpenAlex / internal corpus also have no record. The cited work could not be located through any authoritative source.","snippet":"Harry Buhrman and Ronald de Wolf. Complexity measures and decision tree complexity: A survey.Theoretical Computer Science, 288(1):21–43, 2002. doi:10.1016/S0304-3975(01) 00144-X","arxiv_id":"2605.03431","detector":"doi_compliance","evidence":{"doi":"10.1016/s0304-3975(01","arxiv_id":null,"ref_index":5,"raw_excerpt":"Harry Buhrman and Ronald de Wolf. Complexity measures and decision tree complexity: A survey.Theoretical Computer Science, 288(1):21–43, 2002. doi:10.1016/S0304-3975(01) 00144-X","verdict_class":"cross_source","checked_sources":["crossref_by_doi","openalex_by_doi","doi_org_head"]},"severity":"critical","ref_index":5,"audited_at":"2026-05-19T15:25:33.971491Z","event_type":"pith.integrity.v1","detected_doi":"10.1016/s0304-3975(01","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"unresolvable_identifier","evidence_hash":"03cea65756a548358ad54fda0aa9d8646cb2a998db4a993a2a2099f38bc5c6f3","paper_version":1,"verdict_class":"cross_source","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null}}],"endpoint_self":"/pith/2605.03431/integrity.json","protocol_url":"https://pith.science/pith-integrity-protocol"}