{"schema":"https://pith.science/schemas/pith-integrity/v1.json","pith_number":"2607.24145","arxiv_id":"2607.24145","integrity":{"available":true,"endpoint":"/pith/2607.24145/integrity.json","summary":{"critical":1,"advisory":1,"informational":0,"by_detector":{"doi_compliance":{"total":2,"critical":1,"advisory":1,"informational":0}}},"clean":false,"detectors_run":[{"name":"doi_compliance","version":"1.1.0","status":"completed","ran_at":"2026-08-04T23:30:50.768476Z","findings_count":2},{"name":"ai_meta_artifact","version":"1.0.0","status":"skipped","ran_at":"2026-08-04T07:08:50.858295Z","findings_count":0},{"name":"doi_title_agreement","version":"1.0.0","status":"completed","ran_at":"2026-08-04T00:08:44.266635Z","findings_count":0},{"name":"claim_evidence","version":"1.0.0","status":"completed","ran_at":"2026-08-03T19:08:27.215278Z","findings_count":0},{"name":"citation_quote_validity","version":"0.1.0","status":"skipped","ran_at":"2026-07-28T01:57:54.934908Z","findings_count":0},{"name":"shingle_duplication","version":"0.1.0","status":"skipped","ran_at":"2026-07-28T01:54:06.484854Z","findings_count":0},{"name":"cited_work_retraction","version":"1.0.0","status":"completed","ran_at":"2026-07-28T01:54:01.011310Z","findings_count":0}],"findings":[{"detector":"doi_compliance","finding_type":"unresolvable_identifier","severity":"critical","verdict_class":"cross_source","note":"Identifier '10.1016/s0004-3702(97' 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/s0004-3702(97","detected_arxiv_id":null,"ref_index":13,"audited_at":"2026-07-31T22:41:40.447477Z"},{"detector":"doi_compliance","finding_type":"recoverable_identifier","severity":"advisory","verdict_class":"incontrovertible","note":"DOI is split by whitespace or line breaks in the printed bibliography. Reconstructed DOI 10.1016/j.eswa.2024.126254 resolves to 'Randomized PCA forest for approximate k-nearest neighbor search'. A reader following the printed text alone cannot reach it.","detected_doi":"10.1016/j.eswa.2024.126254","detected_arxiv_id":null,"ref_index":26,"audited_at":"2026-07-31T22:41:40.447477Z"}],"snapshot_sha256":"e4257b79f83650d1048a627e4d57ed4b4c2781c174f97cd554478c11292e871a"},"events":[{"event_id":14550,"event_type":"pith.integrity.v1","payload_sha256":"d430f485a8d6d749419ff7d53d72380fa3f1aed04dfae9161f24b6f5f8ea1f01","signature_b64":"q+aqOPifo6hpsL1f8FvXfApp13lMhW2Amlap7L6rLaQab3Xo/z8MdjkCwE14Zm6m1UEsLrqWcPOMEjgH/iwVBA==","signing_key_id":"pith-v1-2026-05","created_at":"2026-07-31T22:46:17.136811+00:00","payload":{"note":"DOI is split by whitespace or line breaks in the printed bibliography. Reconstructed DOI 10.1016/j.eswa.2024.126254 resolves to 'Randomized PCA forest for approximate k-nearest neighbor search'. A reader following the printed text alone cannot reach it.","snippet":"Rajabinasab, M., Pakdaman, F., Zimek, A., Gabbouj, M.: Randomized pca for- est for approximate k-nearest neighbor search. Expert Systems with Applications 281, 126254 (2025).https://doi.org/https://doi.org/10.1016/j.eswa.2024. 126254","arxiv_id":"2607.24145","detector":"doi_compliance","evidence":{"ref_index":26,"verdict_class":"incontrovertible","resolved_title":"Randomized PCA forest for approximate k-nearest neighbor search","printed_excerpt":"10.1016/j.eswa.2024","reconstructed_doi":"10.1016/j.eswa.2024.126254"},"severity":"advisory","ref_index":26,"audited_at":"2026-07-31T22:41:40.447477Z","event_type":"pith.integrity.v1","detected_doi":"10.1016/j.eswa.2024.126254","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"eb593fcf650be49adc99b1199eb3f9e7d8a7a9ecd5076b612287e7b96bb02a41","paper_version":1,"verdict_class":"incontrovertible","resolved_title":"Randomized PCA forest for approximate k-nearest neighbor search","detector_version":"1.1.0","detected_arxiv_id":null}},{"event_id":14549,"event_type":"pith.integrity.v1","payload_sha256":"b32abc20244e97cf908e0f6902bd08ef17125aaf5395a02c50b9385f742e510c","signature_b64":"pi1PQ0zPwS8rqHmXLv6tbA1RM61wGCTxFdu+jEz3G0lC0kU2/p3DO+4Au1k7HNVrmgEyuKVc8f/TqXmAe+cMBQ==","signing_key_id":"pith-v1-2026-05","created_at":"2026-07-31T22:46:16.964676+00:00","payload":{"note":"Identifier '10.1016/s0004-3702(97' 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":"Kohavi, R., John, G.H.: Wrappers for feature subset selection. Artificial In- telligence97(1-2), 273–324 (1997).https://doi.org/10.1016/S0004-3702(97) 00043-X,https://doi.org/10.1016/S0004-3702(97)00043-X","arxiv_id":"2607.24145","detector":"doi_compliance","evidence":{"doi":"10.1016/s0004-3702(97","arxiv_id":null,"ref_index":13,"raw_excerpt":"Kohavi, R., John, G.H.: Wrappers for feature subset selection. Artificial In- telligence97(1-2), 273–324 (1997).https://doi.org/10.1016/S0004-3702(97) 00043-X,https://doi.org/10.1016/S0004-3702(97)00043-X","parse_status":"well_formed","verdict_class":"cross_source","checked_sources":["crossref_by_doi","openalex_by_doi","doi_org_head"],"resolution_status":"hard_miss"},"severity":"critical","ref_index":13,"audited_at":"2026-07-31T22:41:40.447477Z","event_type":"pith.integrity.v1","detected_doi":"10.1016/s0004-3702(97","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"unresolvable_identifier","evidence_hash":"174e5f068f327f01f928e4648273b4ef66a4c2587bffc0c3f3ce2cc4fa34512a","paper_version":1,"verdict_class":"cross_source","resolved_title":null,"detector_version":"1.1.0","detected_arxiv_id":null}}],"endpoint_self":"/pith/2607.24145/integrity.json","protocol_url":"https://pith.science/pith-integrity-protocol"}