{"schema":"https://pith.science/schemas/pith-integrity/v1.json","pith_number":"2604.20457","arxiv_id":"2604.20457","integrity":{"available":true,"endpoint":"/pith/2604.20457/integrity.json","summary":{"critical":0,"advisory":1,"informational":0,"by_detector":{"doi_compliance":{"total":1,"critical":0,"advisory":1,"informational":0}}},"clean":false,"detectors_run":[{"name":"ai_meta_artifact","version":"1.0.0","status":"completed","ran_at":"2026-05-21T14:40:42.328229Z","findings_count":0},{"name":"doi_compliance","version":"1.0.0","status":"completed","ran_at":"2026-05-20T01:53:45.088762Z","findings_count":1}],"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.1016/J.JCSS.2025.103631.10) was visible in the surrounding text but could not be confirmed against doi.org as printed.","detected_doi":"10.1016/J.JCSS.2025.103631.10","detected_arxiv_id":null,"ref_index":11,"audited_at":"2026-05-20T01:53:45.088762Z"}],"snapshot_sha256":"c1e6463a0560abcd93cbc32acc23df125a6757dfc4b4f4f17698f06c10f463fa"},"events":[{"event_id":4164,"event_type":"pith.integrity.v1","payload_sha256":"f82ef3e075b8012d66a956812bc447a389241a040333402527cb7982f8dc6552","signature_b64":"SIH02rMgkDmaiFiTg3v+rHTbAIHntqMvPM1Xz53M4qPGHFuhkRGfgf03gbko7sjZOrsgwmD7JbrZ+dL6ZhJ4Aw==","signing_key_id":"pith-v1-2026-05","created_at":"2026-05-20T01:57:39.136068+00:00","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1016/J.JCSS.2025.103631.10) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"Dishant Goyal, Ashwin Jacob, Kaushtubh Kumar, Diptapriyo Majumdar, and Venkatesh Raman. Parameterized complexity of dominating set variants in almost cluster and split graphs.Journal of Computer and System Sciences, 150:103631, 2025.doi:10.","arxiv_id":"2604.20457","detector":"doi_compliance","evidence":{"ref_index":11,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"Dishant Goyal, Ashwin Jacob, Kaushtubh Kumar, Diptapriyo Majumdar, and Venkatesh Raman. Parameterized complexity of dominating set variants in almost cluster and split graphs.Journal of Computer and System Sciences, 150:103631, 2025.doi:10.","reconstructed_doi":"10.1016/J.JCSS.2025.103631.10"},"severity":"advisory","ref_index":11,"audited_at":"2026-05-20T01:53:45.088762Z","event_type":"pith.integrity.v1","detected_doi":"10.1016/J.JCSS.2025.103631.10","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"e31885c7ddaf4eed57d5f77e398372f0fb172a7aa434f8b4850f9ef339cd0111","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null}}],"endpoint_self":"/pith/2604.20457/integrity.json","protocol_url":"https://pith.science/pith-integrity-protocol"}