{"schema":"https://pith.science/schemas/pith-integrity/v1.json","pith_number":"2607.21565","arxiv_id":"2607.21565","integrity":{"available":true,"endpoint":"/pith/2607.21565/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":"ai_meta_artifact","version":"1.0.0","status":"skipped","ran_at":"2026-08-07T08:09:32.753734Z","findings_count":0},{"name":"doi_title_agreement","version":"1.0.0","status":"completed","ran_at":"2026-08-03T08:38:57.045252Z","findings_count":0},{"name":"doi_compliance","version":"1.1.0","status":"completed","ran_at":"2026-08-03T07:40:02.924365Z","findings_count":2},{"name":"cited_work_retraction","version":"1.0.0","status":"completed","ran_at":"2026-08-01T06:38:06.506350Z","findings_count":0},{"name":"claim_evidence","version":"1.0.0","status":"completed","ran_at":"2026-07-30T17:30:53.706096Z","findings_count":0},{"name":"citation_quote_validity","version":"0.1.0","status":"skipped","ran_at":"2026-07-27T21:57:53.554265Z","findings_count":0},{"name":"external_links","version":"1.0.0","status":"completed","ran_at":"2026-07-26T23:34:33.617644Z","findings_count":0},{"name":"shingle_duplication","version":"0.1.0","status":"skipped","ran_at":"2026-07-24T01:53:56.119157Z","findings_count":0}],"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.5817/CZ.MUNI.EUROCOMB23-005) was visible in the surrounding text but could not be confirmed against doi.org as printed.","detected_doi":"10.5817/CZ.MUNI.EUROCOMB23-005","detected_arxiv_id":null,"ref_index":2,"audited_at":"2026-08-01T07:18:30.236621Z"},{"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.1112/jlms/s1-28.1.104 resolves to 'On Certain Sets of Integers'. A reader following the printed text alone cannot reach it.","detected_doi":"10.1112/jlms/s1-28.1.104","detected_arxiv_id":null,"ref_index":18,"audited_at":"2026-08-01T07:18:30.236621Z"}],"snapshot_sha256":"74f48c95ad5f95318f722bad05bfe8d83fcbadfc0dd5a7bc207b27d63aabcd73"},"events":[{"event_id":15369,"event_type":"pith.integrity.v1","payload_sha256":"f85f36611c0c5d14c660927be37870f6f9ac331a65e626ac649c9133a81b4c15","signature_b64":"E2LHkSStUCXTzc3y6CLNJUDbYext/86g+BC41pWcpgNMHTJ+8GD03dqB26E5o23XHtevJaeHoUthihcWcFCyAA==","signing_key_id":"pith-v1-2026-05","created_at":"2026-08-01T07:18:36.573480+00:00","payload":{"note":"DOI is split by whitespace or line breaks in the printed bibliography. Reconstructed DOI 10.1112/jlms/s1-28.1.104 resolves to 'On Certain Sets of Integers'. A reader following the printed text alone cannot reach it.","snippet":"K. F. Roth. On certain sets of integers.J. Lond. Math. Soc., 28:104–109, 1953.doi:10.1112/jlms/s1-28. 1.104","arxiv_id":"2607.21565","detector":"doi_compliance","evidence":{"ref_index":18,"verdict_class":"incontrovertible","resolved_title":"On Certain Sets of Integers","printed_excerpt":"10.1112/jlms/s1-28","reconstructed_doi":"10.1112/jlms/s1-28.1.104"},"severity":"advisory","ref_index":18,"audited_at":"2026-08-01T07:18:30.236621Z","event_type":"pith.integrity.v1","detected_doi":"10.1112/jlms/s1-28.1.104","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"57f521a6d2f1670514a71f8eff95bffc07334f146958fad06b4f33bd4a028740","paper_version":1,"verdict_class":"incontrovertible","resolved_title":"On Certain Sets of Integers","detector_version":"1.1.0","detected_arxiv_id":null}},{"event_id":15368,"event_type":"pith.integrity.v1","payload_sha256":"539b806a67bfa4b2cdd94f9ca569c5c38e7790f51ff91339e284078c2f5d7c6b","signature_b64":"PNxnSAushfnZLWJFtHaiIu54dlWjkwY9XFrEjaltNzzQAWOexwPbHYOB8xKoXOfBtXrr70aaMBL/uNhO/z9YBA==","signing_key_id":"pith-v1-2026-05","created_at":"2026-08-01T07:18:36.194282+00:00","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.5817/CZ.MUNI.EUROCOMB23-005) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"M. Anastos. Constructing hamilton cycles and perfect matchings efficiently (extended abstract). InPro- ceedings of the 12th European conference on combinatorics, graph theory and applications. EUROCOMB’23, Prague, August 28 – September 1, p","arxiv_id":"2607.21565","detector":"doi_compliance","evidence":{"ref_index":2,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"10.5817/cz.muni","reconstructed_doi":"10.5817/CZ.MUNI.EUROCOMB23-005"},"severity":"advisory","ref_index":2,"audited_at":"2026-08-01T07:18:30.236621Z","event_type":"pith.integrity.v1","detected_doi":"10.5817/CZ.MUNI.EUROCOMB23-005","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"1b3a38b134848bd532ea1096b9c14e6ea8e728bde99e5b279e440181c97e73ae","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.1.0","detected_arxiv_id":null}}],"endpoint_self":"/pith/2607.21565/integrity.json","protocol_url":"https://pith.science/pith-integrity-protocol"}