{"schema":"https://pith.science/schemas/pith-integrity/v1.json","pith_number":"2607.17582","arxiv_id":"2607.17582","integrity":{"available":true,"endpoint":"/pith/2607.17582/integrity.json","summary":{"critical":0,"advisory":2,"informational":0,"by_detector":{"doi_compliance":{"total":2,"critical":0,"advisory":2,"informational":0}}},"clean":false,"detectors_run":[{"name":"doi_compliance","version":"1.1.0","status":"completed","ran_at":"2026-08-03T18:41:26.672157Z","findings_count":2},{"name":"doi_title_agreement","version":"1.0.0","status":"completed","ran_at":"2026-08-02T18:39:10.328324Z","findings_count":0},{"name":"ai_meta_artifact","version":"1.0.0","status":"skipped","ran_at":"2026-07-28T05:52:22.776621Z","findings_count":0},{"name":"claim_evidence","version":"1.0.0","status":"completed","ran_at":"2026-07-27T12:12:25.079069Z","findings_count":0},{"name":"citation_quote_validity","version":"0.1.0","status":"skipped","ran_at":"2026-07-21T01:57:18.105759Z","findings_count":0},{"name":"cited_work_retraction","version":"1.0.0","status":"completed","ran_at":"2026-07-21T01:21:56.981791Z","findings_count":0}],"findings":[{"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.1137/1.9781611977042.16 resolves to 'Parallel Nearest Neighbors in Low Dimensions with Batch Updates'. A reader following the printed text alone cannot reach it.","detected_doi":"10.1137/1.9781611977042.16","detected_arxiv_id":null,"ref_index":13,"audited_at":"2026-08-01T17:49:23.863743Z"},{"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.48550/arXiv.2206.01382) was visible in the surrounding text but could not be confirmed against doi.org as printed.","detected_doi":"10.48550/arXiv.2206.01382","detected_arxiv_id":null,"ref_index":47,"audited_at":"2026-08-01T17:49:23.863743Z"}],"snapshot_sha256":"d6d62a78187841cee48a624d0aa8e21555817db234b51774b74c140d575d94a8"},"events":[{"event_id":16321,"event_type":"pith.integrity.v1","payload_sha256":"7283ab41d3dc3eb6ce75afc70a47d2fa6f62395b51b85dc3e3e2e1c535939bd9","signature_b64":"CssjLmMrx1dWkVJPOGR8fflOsVFwfni1xBt+xe1DyOjF6Gpa29+ObXTryvCk6uRKRoBjkH26eB41I3OYMdGGAw==","signing_key_id":"pith-v1-2026-05","created_at":"2026-08-01T17:53:33.629054+00:00","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.48550/arXiv.2206.01382) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"Ninh Pham and Tao Liu. 2022. Falconn++: A Locality-sensitive Filtering Approach for Approximate Nearest Neighbor Search. CoRRabs/2206.01382 (2022). https://doi.org/10.48550/arXiv.2206. 01382 arXiv:2206.01382","arxiv_id":"2607.17582","detector":"doi_compliance","evidence":{"ref_index":47,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"10.48550/arxiv.2206","reconstructed_doi":"10.48550/arXiv.2206.01382"},"severity":"advisory","ref_index":47,"audited_at":"2026-08-01T17:49:23.863743Z","event_type":"pith.integrity.v1","detected_doi":"10.48550/arXiv.2206.01382","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"af137ca043a740d4659eb6825980b274bf7e9dcc271bc6003c77bc761a7c3275","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.1.0","detected_arxiv_id":null}},{"event_id":16320,"event_type":"pith.integrity.v1","payload_sha256":"c7eca9ee124732ebd8916e9e653c9fd198b95a78037a6a13ae7727d3a46eec76","signature_b64":"2kfv/E4XI9aMEB1v+3NsIMUVOcoNjykM++oBppl8ewMvrodIn8RevYmZ+uRH/xsW7EnAStf6npHUbEupYTsaBA==","signing_key_id":"pith-v1-2026-05","created_at":"2026-08-01T17:53:33.405951+00:00","payload":{"note":"DOI is split by whitespace or line breaks in the printed bibliography. Reconstructed DOI 10.1137/1.9781611977042.16 resolves to 'Parallel Nearest Neighbors in Low Dimensions with Batch Updates'. A reader following the printed text alone cannot reach it.","snippet":"Guy E. Blelloch and Magdalen Dobson. 2022. Parallel Nearest Neighbors in Low Dimensions with Batch Updates. InProceed- ings of the Symposium on Algorithm Engineering and Experi- ments (ALENEX). SIAM, 195–208. https://doi.org/10.1137/1. 9781","arxiv_id":"2607.17582","detector":"doi_compliance","evidence":{"ref_index":13,"verdict_class":"incontrovertible","resolved_title":"Parallel Nearest Neighbors in Low Dimensions with Batch Updates","printed_excerpt":"10.1137/1","reconstructed_doi":"10.1137/1.9781611977042.16"},"severity":"advisory","ref_index":13,"audited_at":"2026-08-01T17:49:23.863743Z","event_type":"pith.integrity.v1","detected_doi":"10.1137/1.9781611977042.16","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"ac7bb39a243095b311280f71d94375d4a6a96c356c2fbdaec5b7f6dd5cf286bd","paper_version":1,"verdict_class":"incontrovertible","resolved_title":"Parallel Nearest Neighbors in Low Dimensions with Batch Updates","detector_version":"1.1.0","detected_arxiv_id":null}}],"endpoint_self":"/pith/2607.17582/integrity.json","protocol_url":"https://pith.science/pith-integrity-protocol"}