{"schema":"https://pith.science/schemas/pith-integrity/v1.json","pith_number":"2605.00192","arxiv_id":"2605.00192","integrity":{"available":true,"endpoint":"/pith/2605.00192/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":"ai_meta_artifact","version":"1.0.0","status":"completed","ran_at":"2026-05-20T20:36:49.173720Z","findings_count":0},{"name":"doi_compliance","version":"1.0.0","status":"completed","ran_at":"2026-05-19T18:24:46.322169Z","findings_count":2}],"findings":[{"detector":"doi_compliance","finding_type":"unresolvable_identifier","severity":"critical","verdict_class":"cross_source","note":"Identifier '10.1016/j.jctb.2009.07' 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/j.jctb.2009.07","detected_arxiv_id":null,"ref_index":20,"audited_at":"2026-05-19T18:24:46.322169Z"},{"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.1016/j.jctb.2020.09.010.13) was visible in the surrounding text but could not be confirmed against doi.org as printed.","detected_doi":"10.1016/j.jctb.2020.09.010.13","detected_arxiv_id":null,"ref_index":4,"audited_at":"2026-05-19T18:24:46.322169Z"}],"snapshot_sha256":"cc087db5d4ed61dc3326dac04b7d2023ed4dd7ff4cf7cacaccc0700257c5a50a"},"events":[{"event_id":2448,"event_type":"pith.integrity.v1","payload_sha256":"f3ed58b9d62f4e8071222b0fdf6324325fad7771014dec93f904864f5f8d19de","signature_b64":"XxLLq075N1EOsLk7oLxmzMaQJ/GDRxSRqjsDMtY34eaqwWpd+vpC67YhdKi0gFhU40QUqc1iTxfHyZ5RcbxTCw==","signing_key_id":"pith-v1-2026-05","created_at":"2026-05-19T18:27:17.433835+00:00","payload":{"note":"Identifier '10.1016/j.jctb.2009.07' 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":"doi:10.1016/j.jctb.2009.07","arxiv_id":"2605.00192","detector":"doi_compliance","evidence":{"doi":"10.1016/j.jctb.2009.07","arxiv_id":null,"ref_index":20,"raw_excerpt":"doi:10.1016/j.jctb.2009.07","verdict_class":"cross_source","checked_sources":["crossref_by_doi","openalex_by_doi","doi_org_head"]},"severity":"critical","ref_index":20,"audited_at":"2026-05-19T18:24:46.322169Z","event_type":"pith.integrity.v1","detected_doi":"10.1016/j.jctb.2009.07","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"unresolvable_identifier","evidence_hash":"4d1170c8fa1bb55eda984ef26fd474a9c28feb0ba4a9941d75b4b743e549c6d1","paper_version":1,"verdict_class":"cross_source","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null}},{"event_id":2447,"event_type":"pith.integrity.v1","payload_sha256":"81fe56ba61007eb339e16d0884052a1c05ed7a52347afc202ef92f35bfda8d47","signature_b64":"F2iDxRyLsGAPxE9Na3Vpfe9lweFZUn0M4yIT4vQM1yf306M1BFMMa4bb0A6EGwkgNz00vMFlJDexxfcitx9ODA==","signing_key_id":"pith-v1-2026-05","created_at":"2026-05-19T18:27:17.432550+00:00","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1016/j.jctb.2020.09.010.13) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"doi:10.1016/j.jctb.2020. 09.010. 13 Bruno Courcelle. The monadic second-order logic of graphs. I. recognizable sets of finite graphs. Information and Computation, 85(1):12–75, 1990.doi:10.1016/0890-5401(90)90043-H. 14 Bruno Courcelle. The M","arxiv_id":"2605.00192","detector":"doi_compliance","evidence":{"ref_index":4,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"doi:10.1016/j.jctb.2020. 09.010. 13 Bruno Courcelle. The monadic second-order logic of graphs. I. recognizable sets of finite graphs. Information and Computation, 85(1):12–75, 1990.doi:10.1016/0890-5401(90)90043-H. 14 Bruno Courcelle. The M","reconstructed_doi":"10.1016/j.jctb.2020.09.010.13"},"severity":"advisory","ref_index":4,"audited_at":"2026-05-19T18:24:46.322169Z","event_type":"pith.integrity.v1","detected_doi":"10.1016/j.jctb.2020.09.010.13","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"312fc340572cf79a190d0690baf83c89c1f8e465e085989e7dc629c373f44544","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null}}],"endpoint_self":"/pith/2605.00192/integrity.json","protocol_url":"https://pith.science/pith-integrity-protocol"}