{"schema":"https://pith.science/schemas/pith-integrity/v1.json","pith_number":"2607.17005","arxiv_id":"2607.17005","integrity":{"available":true,"endpoint":"/pith/2607.17005/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":"doi_compliance","version":"1.1.0","status":"completed","ran_at":"2026-08-03T20:40:38.975815Z","findings_count":1},{"name":"doi_title_agreement","version":"1.0.0","status":"completed","ran_at":"2026-08-02T20:08:46.191340Z","findings_count":0},{"name":"ai_meta_artifact","version":"1.0.0","status":"skipped","ran_at":"2026-07-28T06:52:23.416524Z","findings_count":0},{"name":"claim_evidence","version":"1.0.0","status":"completed","ran_at":"2026-07-26T12:31:42.618139Z","findings_count":0},{"name":"cited_work_retraction","version":"1.0.0","status":"completed","ran_at":"2026-07-21T21:22:12.729841Z","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.1016/j.cor.2006.03.022 resolves to 'Modeling and solving the rooted distance-constrained minimum spanning tree problem'. A reader following the printed text alone cannot reach it.","detected_doi":"10.1016/j.cor.2006.03.022","detected_arxiv_id":null,"ref_index":12,"audited_at":"2026-08-01T19:39:17.201087Z"}],"snapshot_sha256":"6685b10deb73949c79d1b4023f79f808df5160dbc6e54c8fc4d9086de177b42c"},"events":[{"event_id":16473,"event_type":"pith.integrity.v1","payload_sha256":"1a53aea7fde21848fa4ba90140d42336ce324078e63997192128e64189525a2d","signature_b64":"/WdefzK66zxiIdQXxX/SheSAX8e/rhngqaNc3720qEsyRQJCzSSAfeQxHhs3aBbtZzdeo2IY/0PDXm6OJ/+7BA==","signing_key_id":"pith-v1-2026-05","created_at":"2026-08-01T19:43:31.933686+00:00","payload":{"note":"DOI is split by whitespace or line breaks in the printed bibliography. Reconstructed DOI 10.1016/j.cor.2006.03.022 resolves to 'Modeling and solving the rooted distance-constrained minimum spanning tree problem'. A reader following the printed text alone cannot reach it.","snippet":"Luis Gouveia, Ana Paias, and Dushyant Sharma. 2008. Modeling and Solving the Rooted Distance-Constrained Minimum Spanning Tree Problem.Computers & Operations Research35, 2 (2008), 600–613. https://doi.org/10.1016/j.cor.2006.03. 022","arxiv_id":"2607.17005","detector":"doi_compliance","evidence":{"ref_index":12,"verdict_class":"incontrovertible","resolved_title":"Modeling and solving the rooted distance-constrained minimum spanning tree problem","printed_excerpt":"10.1016/j.cor.2006.03","reconstructed_doi":"10.1016/j.cor.2006.03.022"},"severity":"advisory","ref_index":12,"audited_at":"2026-08-01T19:39:17.201087Z","event_type":"pith.integrity.v1","detected_doi":"10.1016/j.cor.2006.03.022","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"5d201d552b2753c5ce0380c80db6ad13cae88da584f14d4e222e2679c0b94b66","paper_version":1,"verdict_class":"incontrovertible","resolved_title":"Modeling and solving the rooted distance-constrained minimum spanning tree problem","detector_version":"1.1.0","detected_arxiv_id":null}}],"endpoint_self":"/pith/2607.17005/integrity.json","protocol_url":"https://pith.science/pith-integrity-protocol"}