{"schema":"https://pith.science/schemas/pith-integrity/v1.json","pith_number":"2608.08616","arxiv_id":"2608.08616","integrity":{"available":true,"endpoint":"/pith/2608.08616/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-18T09:38:26.348769Z","findings_count":0},{"name":"doi_compliance","version":"1.1.0","status":"completed","ran_at":"2026-08-18T08:28:57.705812Z","findings_count":2},{"name":"ai_meta_artifact","version":"1.0.0","status":"skipped","ran_at":"2026-08-18T08:08:45.905603Z","findings_count":0},{"name":"claim_evidence","version":"1.0.0","status":"completed","ran_at":"2026-08-16T14:08:06.709865Z","findings_count":0},{"name":"cited_work_retraction","version":"1.0.0","status":"completed","ran_at":"2026-08-11T23:08:16.384752Z","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.1002/(sici)1098-2418(199805)12:3<253::AID-RSA3>3.0.CO;2-U resolves to 'Approximating the unsatisfiability threshold of random formulas'. A reader following the printed text alone cannot reach it.","detected_doi":"10.1002/(sici)1098-2418(199805)12:3<253::AID-RSA3>3.0.CO;2-U","detected_arxiv_id":null,"ref_index":203,"audited_at":"2026-08-14T05:09:17.753387Z"},{"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.1002/1098-2418(200010/12)17:3/4<213::AID-RSA3>3.0.CO;2-Y resolves to 'Coloring nonuniform hypergraphs: A new algorithmic approach to the general Lov�sz local lemma'. A reader following the printed text alone cannot reach it.","detected_doi":"10.1002/1098-2418(200010/12)17:3/4<213::AID-RSA3>3.0.CO;2-Y","detected_arxiv_id":null,"ref_index":101,"audited_at":"2026-08-14T05:09:17.753387Z"}],"snapshot_sha256":"ef5390cdec1d41930a407e563c2fe6a95327b6636623f2fd4b4895b6e6119958"},"events":[{"event_id":19610,"event_type":"pith.integrity.v1","payload_sha256":"439c35353b371d9148992cb799e5c9dd0a7ba988848c64978205dea1c52db876","signature_b64":"tbov0tpVWx8JrflEAeQm65xEymB67XTdt/pO8Zv/mRZ14WT4xnCJJBRSfUjf94P6eO1iAdJUJQG/r6xKTNBeCw==","signing_key_id":"pith-v1-2026-05","created_at":"2026-08-14T05:13:31.193848+00:00","payload":{"note":"DOI is split by whitespace or line breaks in the printed bibliography. Reconstructed DOI 10.1002/(sici)1098-2418(199805)12:3<253::AID-RSA3>3.0.CO;2-U resolves to 'Approximating the unsatisfiability threshold of random formulas'. A reader following the printed text alone cannot reach it.","snippet":"Kirousis, Lefteris M. and Kranakis, Evangelos and Krizanc, Danny and Stamatiou, Yannis C. , title =. Random Struct. Algorithms , volume =. doi:https://doi.org/10.1002/(SICI)1098-2418(199805)12:3<253::AID-RSA3>3.0.CO;2-U , year =","arxiv_id":"2608.08616","detector":"doi_compliance","evidence":{"ref_index":203,"verdict_class":"incontrovertible","resolved_title":"Approximating the unsatisfiability threshold of random formulas","printed_excerpt":"10.1002/(sici)1098-2418(199805)12:3","reconstructed_doi":"10.1002/(sici)1098-2418(199805)12:3<253::AID-RSA3>3.0.CO;2-U"},"severity":"advisory","ref_index":203,"audited_at":"2026-08-14T05:09:17.753387Z","event_type":"pith.integrity.v1","detected_doi":"10.1002/(sici)1098-2418(199805)12:3<253::AID-RSA3>3.0.CO;2-U","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"b6758e92c4cba7adb00d3bc1c6e58f28ba589d1bb0ae626dce317e4126a75d58","paper_version":1,"verdict_class":"incontrovertible","resolved_title":"Approximating the unsatisfiability threshold of random formulas","detector_version":"1.1.0","detected_arxiv_id":null}},{"event_id":19609,"event_type":"pith.integrity.v1","payload_sha256":"b5cd16ffcdb07c17ec329d3fd81c476e47123544931d08a731fd6a943d939550","signature_b64":"jghpou6vEIp/pUh/lX30KkT5hnhst++8ocYG2Phx7ioCGZnKsIdvJC6yUJIZgNDkSdL2Xpo7VPZ/ahPyvDdQCg==","signing_key_id":"pith-v1-2026-05","created_at":"2026-08-14T05:13:31.134108+00:00","payload":{"note":"DOI is split by whitespace or line breaks in the printed bibliography. Reconstructed DOI 10.1002/1098-2418(200010/12)17:3/4<213::AID-RSA3>3.0.CO;2-Y resolves to 'Coloring nonuniform hypergraphs: A new algorithmic approach to the general Lov�sz local lemma'. A reader following the printed text alone cannot reach it.","snippet":"Czumaj, Artur and Scheideler, Christian , title =. Random Struct. Algorithms , volume =. 2000 , number =. doi:10.1002/1098-2418(200010/12)17:3/4<213::AID-RSA3>3.0.CO;2-Y , note =","arxiv_id":"2608.08616","detector":"doi_compliance","evidence":{"ref_index":101,"verdict_class":"incontrovertible","resolved_title":"Coloring nonuniform hypergraphs: A new algorithmic approach to the general Lov�sz local lemma","printed_excerpt":"10.1002/1098-2418(200010/12)17:3/4","reconstructed_doi":"10.1002/1098-2418(200010/12)17:3/4<213::AID-RSA3>3.0.CO;2-Y"},"severity":"advisory","ref_index":101,"audited_at":"2026-08-14T05:09:17.753387Z","event_type":"pith.integrity.v1","detected_doi":"10.1002/1098-2418(200010/12)17:3/4<213::AID-RSA3>3.0.CO;2-Y","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"e08d357b0548a5a5c119c18a9a424a2652d28b90e5b1e949438ef783173ff048","paper_version":1,"verdict_class":"incontrovertible","resolved_title":"Coloring nonuniform hypergraphs: A new algorithmic approach to the general Lov�sz local lemma","detector_version":"1.1.0","detected_arxiv_id":null}}],"endpoint_self":"/pith/2608.08616/integrity.json","protocol_url":"https://pith.science/pith-integrity-protocol"}