{"schema":"https://pith.science/schemas/pith-integrity/v1.json","pith_number":"2607.25917","arxiv_id":"2607.25917","integrity":{"available":true,"endpoint":"/pith/2607.25917/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.1.0","status":"completed","ran_at":"2026-08-05T07:30:55.738999Z","findings_count":2},{"name":"doi_title_agreement","version":"1.0.0","status":"completed","ran_at":"2026-08-05T06:38:23.975693Z","findings_count":0},{"name":"ai_meta_artifact","version":"1.0.0","status":"skipped","ran_at":"2026-08-05T04:08:34.898191Z","findings_count":0},{"name":"claim_evidence","version":"1.0.0","status":"completed","ran_at":"2026-08-04T15:28:01.536704Z","findings_count":0},{"name":"external_links","version":"1.0.0","status":"completed","ran_at":"2026-07-29T23:51:24.264569Z","findings_count":0},{"name":"shingle_duplication","version":"0.1.0","status":"skipped","ran_at":"2026-07-29T11:51:18.962017Z","findings_count":0},{"name":"citation_quote_validity","version":"0.1.0","status":"skipped","ran_at":"2026-07-29T03:57:59.833763Z","findings_count":0},{"name":"cited_work_retraction","version":"1.0.0","status":"completed","ran_at":"2026-07-29T03:54:34.856039Z","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.1007/s10878-022-00863-0 resolves to 'Constructing tri-CISTs in shuffle-cubes'. A reader following the printed text alone cannot reach it.","detected_doi":"10.1007/s10878-022-00863-0","detected_arxiv_id":null,"ref_index":5,"audited_at":"2026-08-03T01:40:30.150285Z"},{"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/0012-365x(76)90039-X resolves to 'On decomposition of r-partite graphs into edge-disjoint hamilton circuits'. A reader following the printed text alone cannot reach it.","detected_doi":"10.1016/0012-365x(76)90039-X","detected_arxiv_id":null,"ref_index":13,"audited_at":"2026-08-01T01:22:02.254151Z"},{"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/s10878-022-00863-0) was visible in the surrounding text but could not be confirmed against doi.org as printed.","detected_doi":"10.1007/s10878-022-00863-0","detected_arxiv_id":null,"ref_index":5,"audited_at":"2026-08-01T01:22:02.254151Z"}],"snapshot_sha256":"b8a774edbe733cc653b29afb23147c423cbe00c596733aa0c079dbec3fb83219"},"events":[{"event_id":17516,"event_type":"pith.integrity.v1","payload_sha256":"e0435e7a357a958e42ba6f105da11e412361c4a56f312c113e220bf8229b82a8","signature_b64":"DR4DyVZTdjnSysCh9PeaAhyztJoX6sxrcJZRP17/CJ7y8kNdUUNwZ4MCH9omAcylNs5bbhCkdTcW90Bt52iVBw==","signing_key_id":"pith-v1-2026-05","created_at":"2026-08-03T01:43:36.839918+00:00","payload":{"note":"DOI is split by whitespace or line breaks in the printed bibliography. Reconstructed DOI 10.1007/s10878-022-00863-0 resolves to 'Constructing tri-CISTs in shuffle-cubes'. A reader following the printed text alone cannot reach it.","snippet":"Y.-H. Chen, K.-J. Pai, H.-J. Lin, and J.-M. Chang. Constructing tri-CISTs in shuffle-cubes. Journal of Combinatorial Optimization, 44(5):3194–3211, Dec. 2022. doi:10.1007/s10878- 022-00863-0","arxiv_id":"2607.25917","detector":"doi_compliance","evidence":{"ref_index":5,"verdict_class":"incontrovertible","resolved_title":"Constructing tri-CISTs in shuffle-cubes","printed_excerpt":"10.1007/s10878-","reconstructed_doi":"10.1007/s10878-022-00863-0"},"severity":"advisory","ref_index":5,"audited_at":"2026-08-03T01:40:30.150285Z","event_type":"pith.integrity.v1","detected_doi":"10.1007/s10878-022-00863-0","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"2ee3b23aef1cd42cb5730802240189b08afcf1d537f4e84cd12647c100b0d4eb","paper_version":1,"verdict_class":"incontrovertible","resolved_title":"Constructing tri-CISTs in shuffle-cubes","detector_version":"1.1.0","detected_arxiv_id":null}},{"event_id":14831,"event_type":"pith.integrity.v1","payload_sha256":"f7638c2d886234742e4aaefc2a1163a208fd051608036d98f98c4cecdabbbc3c","signature_b64":"T02lVLNj2Igm8pyd/Ku7vD2qOtKnf8KHWebjfQWx/0fH0ToyksmFfVqNTLAyCwq9fZu9iVo4mJs+f4rep9yFBw==","signing_key_id":"pith-v1-2026-05","created_at":"2026-08-01T01:26:15.565616+00:00","payload":{"note":"DOI is split by whitespace or line breaks in the printed bibliography. Reconstructed DOI 10.1016/0012-365x(76)90039-X resolves to 'On decomposition of r-partite graphs into edge-disjoint hamilton circuits'. A reader following the printed text alone cannot reach it.","snippet":"R. Laskar and B. Auerbach. On decomposition of r-partite graphs into edge-disjoint hamilton circuits.Discrete Mathematics, 14(3):265–268, Jan. 1976. doi:10.1016/0012-365X(76)90039- X","arxiv_id":"2607.25917","detector":"doi_compliance","evidence":{"ref_index":13,"verdict_class":"incontrovertible","resolved_title":"On decomposition of r-partite graphs into edge-disjoint hamilton circuits","printed_excerpt":"10.1016/0012-365x(76)90039-","reconstructed_doi":"10.1016/0012-365x(76)90039-X"},"severity":"advisory","ref_index":13,"audited_at":"2026-08-01T01:22:02.254151Z","event_type":"pith.integrity.v1","detected_doi":"10.1016/0012-365x(76)90039-X","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"cdf584351bab0a92e0627ef3b47db0a0d7ba6b039241d59326e82d875806218f","paper_version":1,"verdict_class":"incontrovertible","resolved_title":"On decomposition of r-partite graphs into edge-disjoint hamilton circuits","detector_version":"1.1.0","detected_arxiv_id":null}},{"event_id":14830,"event_type":"pith.integrity.v1","payload_sha256":"200c86b4987001fedd863995162645145068d4afc07e53df73f8f01209668e27","signature_b64":"5kA6V1vy49AwQ+41nkfMLIfEs/hbbwIZJDUosmhwehVX75TYaEAKdcQWZwp8JAfPDKtwSyuPhSTDCcdu9wmrAA==","signing_key_id":"pith-v1-2026-05","created_at":"2026-08-01T01:26:15.246050+00:00","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1007/s10878-022-00863-0) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"Y.-H. Chen, K.-J. Pai, H.-J. Lin, and J.-M. Chang. Constructing tri-CISTs in shuffle-cubes. Journal of Combinatorial Optimization, 44(5):3194–3211, Dec. 2022. doi:10.1007/s10878- 022-00863-0","arxiv_id":"2607.25917","detector":"doi_compliance","evidence":{"ref_index":5,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"10.1007/s10878-","reconstructed_doi":"10.1007/s10878-022-00863-0"},"severity":"advisory","ref_index":5,"audited_at":"2026-08-01T01:22:02.254151Z","event_type":"pith.integrity.v1","detected_doi":"10.1007/s10878-022-00863-0","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"a5c80e0bc9da9066397c33a23ad55af4280722bfffda128e20712d0a16372866","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.1.0","detected_arxiv_id":null}}],"endpoint_self":"/pith/2607.25917/integrity.json","protocol_url":"https://pith.science/pith-integrity-protocol"}