{"schema":"https://pith.science/schemas/pith-integrity/v1.json","pith_number":"2607.20022","arxiv_id":"2607.20022","integrity":{"available":true,"endpoint":"/pith/2607.20022/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":"doi_title_agreement","version":"1.0.0","status":"completed","ran_at":"2026-08-03T14:08:47.111753Z","findings_count":0},{"name":"doi_compliance","version":"1.1.0","status":"completed","ran_at":"2026-08-03T11:30:55.953341Z","findings_count":3},{"name":"ai_meta_artifact","version":"1.0.0","status":"skipped","ran_at":"2026-07-30T03:51:43.308928Z","findings_count":0},{"name":"claim_evidence","version":"1.0.0","status":"completed","ran_at":"2026-07-29T20:11:14.739950Z","findings_count":0},{"name":"citation_quote_validity","version":"0.1.0","status":"skipped","ran_at":"2026-07-23T09:57:28.361462Z","findings_count":0},{"name":"cited_work_retraction","version":"1.0.0","status":"completed","ran_at":"2026-07-23T08:22:39.769319Z","findings_count":0}],"findings":[{"detector":"doi_compliance","finding_type":"unresolvable_identifier","severity":"critical","verdict_class":"cross_source","note":"Identifier '10.1007/978-3-540-32275-7' 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.1007/978-3-540-32275-7","detected_arxiv_id":null,"ref_index":4,"audited_at":"2026-08-01T11:10:02.487414Z"},{"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.1609/aaai.v38i8.28638 resolves to 'Parallel Empirical Evaluations: Resilience despite Concurrency'. A reader following the printed text alone cannot reach it.","detected_doi":"10.1609/aaai.v38i8.28638","detected_arxiv_id":null,"ref_index":18,"audited_at":"2026-08-01T11:10:02.487414Z"},{"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.3233/fAIA230278) was visible in the surrounding text but could not be confirmed against doi.org as printed.","detected_doi":"10.3233/fAIA230278","detected_arxiv_id":null,"ref_index":30,"audited_at":"2026-08-01T11:10:02.487414Z"}],"snapshot_sha256":"ad5ef76b383c763063ca38874f2b071fd4e62fea947b372827a20159df59493f"},"events":[{"event_id":15695,"event_type":"pith.integrity.v1","payload_sha256":"62c6bc23526e85ddd17f2b8ff3f5efd94368d337b69d5ff30111e35e40c5619c","signature_b64":"kD6HZtqhnwOZDOVECKjBrpGkXMQ4HFSX2KerC/Tdt6HSFDyimJF8n72EaebK6X0uUDVyVrvfQY9EaE4dr0iiCA==","signing_key_id":"pith-v1-2026-05","created_at":"2026-08-01T11:13:37.393007+00:00","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.3233/fAIA230278) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"Bit-Monnot, A.: Enhancing hybrid CP-SAT search for disjunctive scheduling. In: Gal, K., Now´ e, A., Nalepa, G.J., Fairstein, R., R˘ adulescu, R. (eds.) 26th Euro- pean Conference on Artificial Intelligence (ECAI 2023)), pp. 255–262. IOS Pre","arxiv_id":"2607.20022","detector":"doi_compliance","evidence":{"ref_index":30,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"10.3233/f","reconstructed_doi":"10.3233/fAIA230278"},"severity":"advisory","ref_index":30,"audited_at":"2026-08-01T11:10:02.487414Z","event_type":"pith.integrity.v1","detected_doi":"10.3233/fAIA230278","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"da68932aee93ce9ec9c39a3e2e00c7a47c62b9cf55f91d460a4bb7cde60334c7","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.1.0","detected_arxiv_id":null}},{"event_id":15694,"event_type":"pith.integrity.v1","payload_sha256":"234a35475d41c1eb2e0a59da338640c60509d3e07e54f37dad9970e485ef1fa7","signature_b64":"TTZ9WabCFgEmsWRtgbePeX+dY/dKCikYP6JXSqTGHIiqh09ZWkfp5Ap8zZBW7i7ZJvlNPAzTeWN2SAGBCJ7YAw==","signing_key_id":"pith-v1-2026-05","created_at":"2026-08-01T11:13:37.132927+00:00","payload":{"note":"DOI is split by whitespace or line breaks in the printed bibliography. Reconstructed DOI 10.1609/aaai.v38i8.28638 resolves to 'Parallel Empirical Evaluations: Resilience despite Concurrency'. A reader following the printed text alone cannot reach it.","snippet":"Fichte, J.K., Geibinger, T., Hecher, M., Schl¨ ogel, M.: Parallel empirical eval- uations: Resilience despite concurrency. Proceedings of the AAAI Conference on Artificial Intelligence38(8), 8004–8012 (2024) https://doi.org/10.1609/aaai. v3","arxiv_id":"2607.20022","detector":"doi_compliance","evidence":{"ref_index":18,"verdict_class":"incontrovertible","resolved_title":"Parallel Empirical Evaluations: Resilience despite Concurrency","printed_excerpt":"10.1609/aaai","reconstructed_doi":"10.1609/aaai.v38i8.28638"},"severity":"advisory","ref_index":18,"audited_at":"2026-08-01T11:10:02.487414Z","event_type":"pith.integrity.v1","detected_doi":"10.1609/aaai.v38i8.28638","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"1ae6c2ed2621e0844aca554856807d515b627cf6e58497c6fb4e191fdb580850","paper_version":1,"verdict_class":"incontrovertible","resolved_title":"Parallel Empirical Evaluations: Resilience despite Concurrency","detector_version":"1.1.0","detected_arxiv_id":null}},{"event_id":15693,"event_type":"pith.integrity.v1","payload_sha256":"af7be5e6baad019026321bf99d9da62328381abac7099c860b439fe2e600333d","signature_b64":"5EIKRW5S8RULIX4RpKtWr3jJxpLpjf0/QXqpMVeqfP/ib1EQTt0IRFQ7Mi5U99/CUqtSpH9KkcdKPhYr9uWPBA==","signing_key_id":"pith-v1-2026-05","created_at":"2026-08-01T11:13:36.900739+00:00","payload":{"note":"Identifier '10.1007/978-3-540-32275-7' 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":"Nieuwenhuis, R., Oliveras, A., Tinelli, C.: Abstract DPLL and abstract DPLL modulo theories. In: Baader, F., Voronkov, A. (eds.) Logic for Programming, Ar- tificial Intelligence, and Reasoning, 11th International Conference, LPAR 2004, Mont","arxiv_id":"2607.20022","detector":"doi_compliance","evidence":{"doi":"10.1007/978-3-540-32275-7","arxiv_id":null,"ref_index":4,"raw_excerpt":"Nieuwenhuis, R., Oliveras, A., Tinelli, C.: Abstract DPLL and abstract DPLL modulo theories. In: Baader, F., Voronkov, A. (eds.) Logic for Programming, Ar- tificial Intelligence, and Reasoning, 11th International Conference, LPAR 2004, Montevideo, Uruguay, March 14-18, 2005, Proceedings. Lecture Notes in Com- puter Science, vol. 3452, pp. 36–50. Springer, Berlin, Heidelberg (2004). https: //doi.or","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":4,"audited_at":"2026-08-01T11:10:02.487414Z","event_type":"pith.integrity.v1","detected_doi":"10.1007/978-3-540-32275-7","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"unresolvable_identifier","evidence_hash":"0ed9bc444483234f2baa4a51ab40c780a3802cfef73e709383adcf7519469f3b","paper_version":1,"verdict_class":"cross_source","resolved_title":null,"detector_version":"1.1.0","detected_arxiv_id":null}}],"endpoint_self":"/pith/2607.20022/integrity.json","protocol_url":"https://pith.science/pith-integrity-protocol"}