{"schema":"https://pith.science/schemas/pith-integrity/v1.json","pith_number":"2604.26709","arxiv_id":"2604.26709","integrity":{"available":true,"endpoint":"/pith/2604.26709/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":"ai_meta_artifact","version":"1.0.0","status":"completed","ran_at":"2026-05-20T23:43:44.388252Z","findings_count":0},{"name":"doi_compliance","version":"1.0.0","status":"completed","ran_at":"2026-05-19T19:55:32.703433Z","findings_count":2}],"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.1007/11513988\\_33) was visible in the surrounding text but could not be confirmed against doi.org as printed.","detected_doi":"10.1007/11513988\\_33","detected_arxiv_id":null,"ref_index":32,"audited_at":"2026-05-19T19:55:32.703433Z"},{"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/S0022-4049(99) was visible in the surrounding text but could not be confirmed against doi.org as printed.","detected_doi":"10.1016/S0022-4049(99","detected_arxiv_id":null,"ref_index":14,"audited_at":"2026-05-19T19:55:32.703433Z"}],"snapshot_sha256":"fb7ea785e5dfe8803469006fa97ccf0de643ab09f4b9d8602a94afbab0218f6f"},"events":[{"event_id":2792,"event_type":"pith.integrity.v1","payload_sha256":"d31d7e4bd51c42b207d184f806381c4c5f39b526a12ad98891bc5f1bdd3e1ca2","signature_b64":"KTosWYO1essuvljKho6Sdl+wrglAqO/EeDOMG/2EseJktKJDVCG8Oj2mNOXb28DsDq3lz/XqR4jDq2o9awgzBQ==","signing_key_id":"pith-v1-2026-05","created_at":"2026-05-19T19:57:20.541382+00:00","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1007/11513988\\_33) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"Nieuwenhuis, R., Oliveras, A.: DPLL(T) with exhaustive theory propagation and its application to difference logic. In: Etessami, K., Rajam ani, S.K. (eds.) Com- puter Aided Verification, 17th International Conference, C A V 2005, Edinburgh, S","arxiv_id":"2604.26709","detector":"doi_compliance","evidence":{"ref_index":32,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"Nieuwenhuis, R., Oliveras, A.: DPLL(T) with exhaustive theory propagation and its application to difference logic. In: Etessami, K., Rajam ani, S.K. (eds.) Com- puter Aided Verification, 17th International Conference, C A V 2005, Edinburgh, S","reconstructed_doi":"10.1007/11513988\\_33"},"severity":"advisory","ref_index":32,"audited_at":"2026-05-19T19:55:32.703433Z","event_type":"pith.integrity.v1","detected_doi":"10.1007/11513988\\_33","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"288b62ca494345d1470068ddd680c1307ada55fb382745c0693b0ef18ae358d9","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null}},{"event_id":2791,"event_type":"pith.integrity.v1","payload_sha256":"aad3e2d4760d090e677196217a7bc2af5ca5dfa20524a471063f609c320f2011","signature_b64":"bpZtXtIKmoWypH0EtlyjuQeLms0H8BGvla0IchzbvolqJPpt7EwUaDoWaWqfnh7gkJEe4YGPJaZNU2jh0PvkAA==","signing_key_id":"pith-v1-2026-05","created_at":"2026-05-19T19:57:20.540257+00:00","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1016/S0022-4049(99) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"Faugère, J.C.: A new efficient algorithm for computing grö bner bases (f4). Journal of Pure and Applied Algebra 139(1), 61–88 (1999). https://doi.org/https://doi.org/10.1016/S002 2-4049(99)00005-5, https://www.sciencedirect.com/science/articl","arxiv_id":"2604.26709","detector":"doi_compliance","evidence":{"ref_index":14,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"Faugère, J.C.: A new efficient algorithm for computing grö bner bases (f4). Journal of Pure and Applied Algebra 139(1), 61–88 (1999). https://doi.org/https://doi.org/10.1016/S002 2-4049(99)00005-5, https://www.sciencedirect.com/science/articl","reconstructed_doi":"10.1016/S0022-4049(99"},"severity":"advisory","ref_index":14,"audited_at":"2026-05-19T19:55:32.703433Z","event_type":"pith.integrity.v1","detected_doi":"10.1016/S0022-4049(99","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"ec09c4fe18e461d374309a20aade8906f37a711c83e86acdefe66040a9796f57","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null}}],"endpoint_self":"/pith/2604.26709/integrity.json","protocol_url":"https://pith.science/pith-integrity-protocol"}