{"schema":"https://pith.science/schemas/pith-integrity/v1.json","pith_number":"2607.28240","arxiv_id":"2607.28240","integrity":{"available":true,"endpoint":"/pith/2607.28240/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_title_agreement","version":"1.0.0","status":"completed","ran_at":"2026-08-07T18:08:59.037108Z","findings_count":0},{"name":"ai_meta_artifact","version":"1.0.0","status":"skipped","ran_at":"2026-08-07T04:08:47.455511Z","findings_count":0},{"name":"doi_compliance","version":"1.1.0","status":"completed","ran_at":"2026-08-06T14:39:06.204043Z","findings_count":2},{"name":"claim_evidence","version":"1.0.0","status":"completed","ran_at":"2026-08-05T12:48:04.143525Z","findings_count":0},{"name":"citation_quote_validity","version":"0.1.0","status":"skipped","ran_at":"2026-08-02T13:08:44.113090Z","findings_count":0},{"name":"shingle_duplication","version":"0.1.0","status":"skipped","ran_at":"2026-08-01T07:08:16.008675Z","findings_count":0},{"name":"cited_work_retraction","version":"1.0.0","status":"completed","ran_at":"2026-07-31T07:51:13.479488Z","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.1006/JCSS.2001.1774 resolves to 'Which Problems Have Strongly Exponential Complexity?'. A reader following the printed text alone cannot reach it.","detected_doi":"10.1006/JCSS.2001.1774","detected_arxiv_id":null,"ref_index":15,"audited_at":"2026-07-31T13:41:41.666753Z"},{"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.1016/J.COSREV.2025.100835 resolves to 'Computational Social Choice: Parameterized complexity and challenges'. A reader following the printed text alone cannot reach it.","detected_doi":"10.1016/J.COSREV.2025.100835","detected_arxiv_id":null,"ref_index":4,"audited_at":"2026-07-31T13:41:41.666753Z"}],"snapshot_sha256":"cc869ca5971a58d8f13ec9b94900a97a8f1f6e69d344e09000d6327f0c31c772"},"events":[{"event_id":14406,"event_type":"pith.integrity.v1","payload_sha256":"f57fe18c21ab9ee044c00583ae760a603706ba52a1e80a488ea3adbfbcee7e90","signature_b64":"Kvtm9qqoqwj5JU1pMc/pSxuowNuTp80+ajtiNl5DN9mfRt85BJ+X3abPgLRdkidi+AwbYZA4VwOw79r4WCm6BA==","signing_key_id":"pith-v1-2026-05","created_at":"2026-07-31T13:46:17.640701+00:00","payload":{"note":"DOI is split by whitespace or line breaks in the printed bibliography. Reconstructed DOI 10.1006/JCSS.2001.1774 resolves to 'Which Problems Have Strongly Exponential Complexity?'. A reader following the printed text alone cannot reach it.","snippet":"Russell Impagliazzo, Ramamohan Paturi, and Francis Zane. Which problems have strongly exponential complexity?J. Comput. Syst. Sci., 63(4):512–530, 2001.doi:10.1006/JCSS.2001. 1774","arxiv_id":"2607.28240","detector":"doi_compliance","evidence":{"ref_index":15,"verdict_class":"incontrovertible","resolved_title":"Which Problems Have Strongly Exponential Complexity?","printed_excerpt":"10.1006/jcss.2001","reconstructed_doi":"10.1006/JCSS.2001.1774"},"severity":"advisory","ref_index":15,"audited_at":"2026-07-31T13:41:41.666753Z","event_type":"pith.integrity.v1","detected_doi":"10.1006/JCSS.2001.1774","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"edd17bbe8a68a88daa81af89ab216f015b2d05cf8463f42417fd5d8cd4f3223a","paper_version":1,"verdict_class":"incontrovertible","resolved_title":"Which Problems Have Strongly Exponential Complexity?","detector_version":"1.1.0","detected_arxiv_id":null}},{"event_id":14405,"event_type":"pith.integrity.v1","payload_sha256":"fc0c6087b3cf7493ba9328aba6bae848266d218f6d79316c49b884615e2d8688","signature_b64":"WYMXSoqooEHzzP7luefxDYHxvH8odMS02Tg5gW50M73o1FCELBgq9wCBZ+wmCHO99UF9YKuRk1djHDiJA9NPDQ==","signing_key_id":"pith-v1-2026-05","created_at":"2026-07-31T13:46:17.502925+00:00","payload":{"note":"DOI is split by whitespace or line breaks in the printed bibliography. Reconstructed DOI 10.1016/J.COSREV.2025.100835 resolves to 'Computational Social Choice: Parameterized complexity and challenges'. A reader following the printed text alone cannot reach it.","snippet":"Jiehua Chen, Christian Hatschka, and Sofia Simola. Computational social choice: Parameterized complexity and challenges.Comput. Sci. Rev., 61:100835, 2026.doi:10.1016/J.COSREV.2025. 100835","arxiv_id":"2607.28240","detector":"doi_compliance","evidence":{"ref_index":4,"verdict_class":"incontrovertible","resolved_title":"Computational Social Choice: Parameterized complexity and challenges","printed_excerpt":"10.1016/j.cosrev.2025","reconstructed_doi":"10.1016/J.COSREV.2025.100835"},"severity":"advisory","ref_index":4,"audited_at":"2026-07-31T13:41:41.666753Z","event_type":"pith.integrity.v1","detected_doi":"10.1016/J.COSREV.2025.100835","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"9f8fbf457016c311af381f965b6c986d2bc845fccec34ddb2e517ef23d5cb6f4","paper_version":1,"verdict_class":"incontrovertible","resolved_title":"Computational Social Choice: Parameterized complexity and challenges","detector_version":"1.1.0","detected_arxiv_id":null}}],"endpoint_self":"/pith/2607.28240/integrity.json","protocol_url":"https://pith.science/pith-integrity-protocol"}