{"schema":"https://pith.science/schemas/pith-integrity/v1.json","pith_number":"2604.21745","arxiv_id":"2604.21745","integrity":{"available":true,"endpoint":"/pith/2604.21745/integrity.json","summary":{"critical":1,"advisory":2,"informational":0,"by_detector":{"doi_compliance":{"total":3,"critical":1,"advisory":2,"informational":0}}},"clean":false,"detectors_run":[{"name":"ai_meta_artifact","version":"1.0.0","status":"completed","ran_at":"2026-05-21T12:35:08.309269Z","findings_count":0},{"name":"doi_compliance","version":"1.0.0","status":"completed","ran_at":"2026-05-20T00:42:40.111017Z","findings_count":3}],"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.5555/3458064.3458135.2) was visible in the surrounding text but could not be confirmed against doi.org as printed.","detected_doi":"10.5555/3458064.3458135.2","detected_arxiv_id":null,"ref_index":9,"audited_at":"2026-05-20T00:42:40.111017Z"},{"detector":"doi_compliance","finding_type":"unresolvable_identifier","severity":"critical","verdict_class":"cross_source","note":"Identifier '10.1515/crll.1909.136' 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.1515/crll.1909.136","detected_arxiv_id":null,"ref_index":28,"audited_at":"2026-05-20T00:42:40.111017Z"},{"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/TASSP.1978.1163055.21) was visible in the surrounding text but could not be confirmed against doi.org as printed.","detected_doi":"10.1109/TASSP.1978.1163055.21","detected_arxiv_id":null,"ref_index":43,"audited_at":"2026-05-20T00:42:40.111017Z"}],"snapshot_sha256":"4391ac61f41f333f0e924765282706e579f424667a3d32fa249718e15ba80862"},"events":[{"event_id":3882,"event_type":"pith.integrity.v1","payload_sha256":"c437ab5abde3a993c161fa9452aeacdf9d340f7f27c1e2895e7597a419e6df3d","signature_b64":"8VhxuIwPbuB7pFRyU5Emg33Hwf5Cs+CxRmC2usuz2B0SXfykGjeG1oQczY4eIovakw+Y4dRpyy2IvGj0dbs5Dg==","signing_key_id":"pith-v1-2026-05","created_at":"2026-05-20T00:47:29.747707+00:00","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1109/TASSP.1978.1163055.21) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"H. Sakoe and S. Chiba. Dynamic programming algorithm optimization for spoken word recognition. IEEE Transactions on Acoustics, Speech, and Signal Processing, 26(1):43–49, 1978.DOI: 10.1109/TASSP. 1978.1163055. 21","arxiv_id":"2604.21745","detector":"doi_compliance","evidence":{"ref_index":43,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"H. Sakoe and S. Chiba. Dynamic programming algorithm optimization for spoken word recognition. IEEE Transactions on Acoustics, Speech, and Signal Processing, 26(1):43–49, 1978.DOI: 10.1109/TASSP. 1978.1163055. 21","reconstructed_doi":"10.1109/TASSP.1978.1163055.21"},"severity":"advisory","ref_index":43,"audited_at":"2026-05-20T00:42:40.111017Z","event_type":"pith.integrity.v1","detected_doi":"10.1109/TASSP.1978.1163055.21","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"9f3dd4cf38490c7cb6664bc9db2d1227938922a196b06311200901c48a906c92","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null}},{"event_id":3881,"event_type":"pith.integrity.v1","payload_sha256":"f68d559e97d3eec827a29b741b001fda1838cc312e26f30eb4fcdac212135caa","signature_b64":"p+VgzeoIlKuMjOj9MvQ3gfmNxg4boaH7bVsNJpT1WMdwEL89lSZTBChZy9paKa7nGyWLJh/01Ytd23igYBbXBQ==","signing_key_id":"pith-v1-2026-05","created_at":"2026-05-20T00:47:29.740753+00:00","payload":{"note":"Identifier '10.1515/crll.1909.136' 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":"E. Hellinger. Neue begründung der theorie quadratischer formen von unendlichvielen veränderlichen. Journal für die reine und angewandte Mathematik, 136:210–271, 1909.DOI: 10.1515/crll.1909.136","arxiv_id":"2604.21745","detector":"doi_compliance","evidence":{"doi":"10.1515/crll.1909.136","arxiv_id":null,"ref_index":28,"raw_excerpt":"E. Hellinger. Neue begründung der theorie quadratischer formen von unendlichvielen veränderlichen. Journal für die reine und angewandte Mathematik, 136:210–271, 1909.DOI: 10.1515/crll.1909.136","verdict_class":"cross_source","checked_sources":["crossref_by_doi","openalex_by_doi","doi_org_head"]},"severity":"critical","ref_index":28,"audited_at":"2026-05-20T00:42:40.111017Z","event_type":"pith.integrity.v1","detected_doi":"10.1515/crll.1909.136","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"unresolvable_identifier","evidence_hash":"ef43a4baac74535dbc603e884f3950c9a9d004571d9be39f2b5882de9b99dcb5","paper_version":1,"verdict_class":"cross_source","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null}},{"event_id":3880,"event_type":"pith.integrity.v1","payload_sha256":"302cd761f270b2b2dfbda06dd1714df3e329299eaee90a6315974808f030eee5","signature_b64":"Yb7xKbJ31+8HPt9rlHvkm2Rok7F3mn1LCpgSuCE/G0vfJAYcp0q0nh64ZqHXcJ+wtVDm8J/gx5WBKXsGnXKEAw==","signing_key_id":"pith-v1-2026-05","created_at":"2026-05-20T00:47:29.733436+00:00","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.5555/3458064.3458135.2) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"K. Buchin, T. Ophelders, and B. Speckmann. SETH says: Weak Fréchet distance is faster, but only if it is continuous and in one dimension. InProceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 2887–2901. SIAM","arxiv_id":"2604.21745","detector":"doi_compliance","evidence":{"ref_index":9,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"K. Buchin, T. Ophelders, and B. Speckmann. SETH says: Weak Fréchet distance is faster, but only if it is continuous and in one dimension. InProceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 2887–2901. SIAM","reconstructed_doi":"10.5555/3458064.3458135.2"},"severity":"advisory","ref_index":9,"audited_at":"2026-05-20T00:42:40.111017Z","event_type":"pith.integrity.v1","detected_doi":"10.5555/3458064.3458135.2","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"a260ac6e56e7cfb884ec757fada96e5bb53f08edba5d41f406d66f9e37b1d3a0","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null}}],"endpoint_self":"/pith/2604.21745/integrity.json","protocol_url":"https://pith.science/pith-integrity-protocol"}