{"schema":"https://pith.science/schemas/pith-integrity/v1.json","pith_number":"2604.20042","arxiv_id":"2604.20042","integrity":{"available":true,"endpoint":"/pith/2604.20042/integrity.json","summary":{"critical":0,"advisory":3,"informational":0,"by_detector":{"doi_compliance":{"total":3,"critical":0,"advisory":3,"informational":0}}},"clean":false,"detectors_run":[{"name":"doi_compliance","version":"1.0.0","status":"completed","ran_at":"2026-05-20T02:23:03.484577Z","findings_count":3}],"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.46298/fi.12237.8) was visible in the surrounding text but could not be confirmed against doi.org as printed.","detected_doi":"10.46298/fi.12237.8","detected_arxiv_id":null,"ref_index":5,"audited_at":"2026-05-20T02:23:03.484577Z"},{"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.endm.2013.10.006.10) was visible in the surrounding text but could not be confirmed against doi.org as printed.","detected_doi":"10.1016/j.endm.2013.10.006.10","detected_arxiv_id":null,"ref_index":6,"audited_at":"2026-05-20T02:23:03.484577Z"},{"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.ipl.2022.106284.19) was visible in the surrounding text but could not be confirmed against doi.org as printed.","detected_doi":"10.1016/j.ipl.2022.106284.19","detected_arxiv_id":null,"ref_index":12,"audited_at":"2026-05-20T02:23:03.484577Z"}],"snapshot_sha256":"6d6ace5f94dc2e9211d16b1ce2ab3cc702774ceda384a97d66c7526eb17f7335"},"events":[{"event_id":4323,"event_type":"pith.integrity.v1","payload_sha256":"f72a253d36d559a70f5cb1e1f374f40739d5ae9a9d40254f2dca4112bf161920","signature_b64":"CmeNTLGUglEaJyKXqu5A5UrFORmq2WjHiaxRg6IgpbUO8bUDcO+v5ZnAYSQqt3QimGd6z7KmmZEe9AYykqc/Aw==","signing_key_id":"pith-v1-2026-05","created_at":"2026-05-20T02:27:39.532173+00:00","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1016/j.ipl.2022.106284.19) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"URL: https://www. sciencedirect.com/science/article/pii/S0020019022000412, doi:10.1016/j.ipl.2022. 106284. 19 Seemab Hayat and Naveed Ahmed Azam. A method to generate multi-interval pairwise compatibility graphs.ArXiv, abs/2410.10525,","arxiv_id":"2604.20042","detector":"doi_compliance","evidence":{"ref_index":12,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"URL: https://www. sciencedirect.com/science/article/pii/S0020019022000412, doi:10.1016/j.ipl.2022. 106284. 19 Seemab Hayat and Naveed Ahmed Azam. A method to generate multi-interval pairwise compatibility graphs.ArXiv, abs/2410.10525,","reconstructed_doi":"10.1016/j.ipl.2022.106284.19"},"severity":"advisory","ref_index":12,"audited_at":"2026-05-20T02:23:03.484577Z","event_type":"pith.integrity.v1","detected_doi":"10.1016/j.ipl.2022.106284.19","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"0bc4d59fe71caaf806530a9cb6b175a06f546a621256cf95b7ede587269af850","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null}},{"event_id":4322,"event_type":"pith.integrity.v1","payload_sha256":"0de2cd590ef48ae19bc47327c1879de2a174e0f7cc1dc9bc2a20b4a9df5b921c","signature_b64":"YPJTyQmp6P75rMQdlCySTZy49M4lu0RH7NGiMuXN6dEUfm7pJvFsQhIOIRQw8YXoiUeYNEWHIxmbz706Co97Aw==","signing_key_id":"pith-v1-2026-05","created_at":"2026-05-20T02:27:39.527652+00:00","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1016/j.endm.2013.10.006.10) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"URL: https://doi.org/10.1016/j. endm.2013.10.006. 10 T. Calamoneri and R. Petreschi. On pairwise compatibility graphs having dilworth number two. Theor. Comput. Sci., 524:34–40,","arxiv_id":"2604.20042","detector":"doi_compliance","evidence":{"ref_index":6,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"URL: https://doi.org/10.1016/j. endm.2013.10.006. 10 T. Calamoneri and R. Petreschi. On pairwise compatibility graphs having dilworth number two. Theor. Comput. Sci., 524:34–40,","reconstructed_doi":"10.1016/j.endm.2013.10.006.10"},"severity":"advisory","ref_index":6,"audited_at":"2026-05-20T02:23:03.484577Z","event_type":"pith.integrity.v1","detected_doi":"10.1016/j.endm.2013.10.006.10","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"9dac19d9b688bc9425c55125fc91ca3fedf627cdc41b0ef06e307f20a2e70d55","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null}},{"event_id":4321,"event_type":"pith.integrity.v1","payload_sha256":"3b3f71276dde09eabdef662ccd4412bb194c9996bce15e6e9fd7837bcde056fd","signature_b64":"7GvjCsZwI5H02RAlkG1drqksh0VKIYwOselhZXkkwQkaiOgXL67ou+z9MF3OVfzr1cjMEARZ/cWqhNYO1jhLBA==","signing_key_id":"pith-v1-2026-05","created_at":"2026-05-20T02:27:39.520826+00:00","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.46298/fi.12237.8) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"URL:https://doi.org/10.46298/fi.12237. 8 T. Calamoneri, A. Monti, and B. Sinaimeri. On generalizations of pairwise compatibility graphs.Discret. Math. Theor. Comput. Sci., 26,","arxiv_id":"2604.20042","detector":"doi_compliance","evidence":{"ref_index":5,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"URL:https://doi.org/10.46298/fi.12237. 8 T. Calamoneri, A. Monti, and B. Sinaimeri. On generalizations of pairwise compatibility graphs.Discret. Math. Theor. Comput. Sci., 26,","reconstructed_doi":"10.46298/fi.12237.8"},"severity":"advisory","ref_index":5,"audited_at":"2026-05-20T02:23:03.484577Z","event_type":"pith.integrity.v1","detected_doi":"10.46298/fi.12237.8","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"45fe630f657d096dd502940b3675a6c1b46e54218789acc3e447bfadb6dc937a","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null}}],"endpoint_self":"/pith/2604.20042/integrity.json","protocol_url":"https://pith.science/pith-integrity-protocol"}