{"schema":"https://pith.science/schemas/pith-integrity/v1.json","pith_number":"2608.13268","arxiv_id":"2608.13268","integrity":{"available":true,"endpoint":"/pith/2608.13268/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-21T16:18:15.333496Z","findings_count":3},{"name":"ai_meta_artifact","version":"1.0.0","status":"skipped","ran_at":"2026-08-21T04:08:49.336278Z","findings_count":0},{"name":"doi_title_agreement","version":"1.0.0","status":"completed","ran_at":"2026-08-20T17:38:27.983030Z","findings_count":0},{"name":"claim_evidence","version":"1.0.0","status":"completed","ran_at":"2026-08-20T16:08:14.110637Z","findings_count":0},{"name":"citation_quote_validity","version":"0.1.0","status":"skipped","ran_at":"2026-08-16T11:08:39.570117Z","findings_count":0},{"name":"shingle_duplication","version":"0.1.0","status":"skipped","ran_at":"2026-08-14T23:08:16.347799Z","findings_count":0},{"name":"cited_work_retraction","version":"1.0.0","status":"completed","ran_at":"2026-08-14T05:38:07.824370Z","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.1007/978-3-030-61739-4_5) was visible in the surrounding text but could not be confirmed against doi.org as printed.","detected_doi":"10.1007/978-3-030-61739-4_5","detected_arxiv_id":null,"ref_index":17,"audited_at":"2026-08-14T15:18:11.942496Z"},{"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.1287/IJOC.1100.0419 resolves to 'Enhancement of Sandwich Algorithms for Approximating Higher-Dimensional Convex Pareto Sets'. A reader following the printed text alone cannot reach it.","detected_doi":"10.1287/IJOC.1100.0419","detected_arxiv_id":null,"ref_index":32,"audited_at":"2026-08-14T15:18:11.942496Z"},{"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/s1571-0661(05)80746-7 resolves to 'Convex Power Constructions for Continuous D-Cones'. A reader following the printed text alone cannot reach it.","detected_doi":"10.1016/s1571-0661(05)80746-7","detected_arxiv_id":null,"ref_index":1998,"audited_at":"2026-08-14T15:18:11.942496Z"}],"snapshot_sha256":"32ccc120ca58c79058e3d3127ac89c8f3a00a1c5946c1405e4eafce82e85d137"},"events":[{"event_id":19735,"event_type":"pith.integrity.v1","payload_sha256":"4e6edce393650c090f964e06aabb08282af57103406f383eb453b14c81372871","signature_b64":"hXz5s/+/iUiRKNUP8ZHzTmmmneKzQglLAHKNpX87V0HIh3FQgxfuoGiu5rhl9zBlNE2bUYNPa6xfC1HcQ403Cg==","signing_key_id":"pith-v1-2026-05","created_at":"2026-08-14T15:18:33.642203+00:00","payload":{"note":"DOI is split by whitespace or line breaks in the printed bibliography. Reconstructed DOI 10.1016/s1571-0661(05)80746-7 resolves to 'Convex Power Constructions for Continuous D-Cones'. A reader following the printed text alone cannot reach it.","snippet":"Convex power constructions for continuous d-cones. InWorkshop on Domains IV 1998, Haus Humboldtstein, Remagen-Rolandseck, Germany, October 2-4, 1998 (Electronic Notes in Theoretical Computer Science, Vol. 35), Dieter Spreen, Ralf Greb, Holg","arxiv_id":"2608.13268","detector":"doi_compliance","evidence":{"ref_index":1998,"verdict_class":"incontrovertible","resolved_title":"Convex Power Constructions for Continuous D-Cones","printed_excerpt":"10.1016/s1571-0661(05)80746-","reconstructed_doi":"10.1016/s1571-0661(05)80746-7"},"severity":"advisory","ref_index":1998,"audited_at":"2026-08-14T15:18:11.942496Z","event_type":"pith.integrity.v1","detected_doi":"10.1016/s1571-0661(05)80746-7","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"0d5934d5c729fe70bd4bf9bd70afe86cb2b3318628a88d8e26054fa2256b91bc","paper_version":1,"verdict_class":"incontrovertible","resolved_title":"Convex Power Constructions for Continuous D-Cones","detector_version":"1.1.0","detected_arxiv_id":null}},{"event_id":19734,"event_type":"pith.integrity.v1","payload_sha256":"1cd5c40d620c85aa45c7941890fdfb1c1e8db22a41abaa9710d2956cc4e2856d","signature_b64":"NedezFBBuT3ldAnF+esd5mRvZQ12izRKDJA/AdB/o/yK+ZcAxs7HqwE2zl5FWuAZxcmKg0a9nzgT7vWaT/wNCA==","signing_key_id":"pith-v1-2026-05","created_at":"2026-08-14T15:18:33.635032+00:00","payload":{"note":"DOI is split by whitespace or line breaks in the printed bibliography. Reconstructed DOI 10.1287/IJOC.1100.0419 resolves to 'Enhancement of Sandwich Algorithms for Approximating Higher-Dimensional Convex Pareto Sets'. A reader following the printed text alone cannot reach it.","snippet":"Enhancement of Sandwich Algorithms for Approximating Higher-Dimensional Convex Pareto Sets.INFORMS J. Comput.23, 4 (2011), 493–517. https://doi.org/10.1287/IJOC.1100. 0419 R. Tyrrell Rockafellar. 1970.Convex Analysis. Princeton University P","arxiv_id":"2608.13268","detector":"doi_compliance","evidence":{"ref_index":32,"verdict_class":"incontrovertible","resolved_title":"Enhancement of Sandwich Algorithms for Approximating Higher-Dimensional Convex Pareto Sets","printed_excerpt":"10.1287/ijoc.1100","reconstructed_doi":"10.1287/IJOC.1100.0419"},"severity":"advisory","ref_index":32,"audited_at":"2026-08-14T15:18:11.942496Z","event_type":"pith.integrity.v1","detected_doi":"10.1287/IJOC.1100.0419","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"ac564beb00c63a8f331fbe30d4e5af933ded53b86386d8c70a09f80f1dc52608","paper_version":1,"verdict_class":"incontrovertible","resolved_title":"Enhancement of Sandwich Algorithms for Approximating Higher-Dimensional Convex Pareto Sets","detector_version":"1.1.0","detected_arxiv_id":null}},{"event_id":19733,"event_type":"pith.integrity.v1","payload_sha256":"7685fb0077223a1a7e26326a17e4b9248dda5d7ef926888f1aa62f35f742260a","signature_b64":"TKa4XgS9D0ineMjKjGPMgJPSKsLvj6tpktn5C/9szPq3dLJovTmN8qeUO/zUdxAya/KvGXShT7MF9Bqt8QbuDg==","signing_key_id":"pith-v1-2026-05","created_at":"2026-08-14T15:18:33.346776+00:00","payload":{"note":"DOI in the printed bibliography is fragmented by whitespace or line breaks. A longer candidate (10.1007/978-3-030-61739-4_5) was visible in the surrounding text but could not be confirmed against doi.org as printed.","snippet":"Qualitative Multi-objective Reachability for Ordered Branching MDPs. In Reachability Problems - 14th International Conference, RP 2020, Paris, France, October 19-21, 2020, Proceedings (Lecture Notes in Computer Science, Vol. 12448), Sylvain","arxiv_id":"2608.13268","detector":"doi_compliance","evidence":{"ref_index":17,"verdict_class":"incontrovertible","resolved_title":null,"printed_excerpt":"10.1007/978-3-","reconstructed_doi":"10.1007/978-3-030-61739-4_5"},"severity":"advisory","ref_index":17,"audited_at":"2026-08-14T15:18:11.942496Z","event_type":"pith.integrity.v1","detected_doi":"10.1007/978-3-030-61739-4_5","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"recoverable_identifier","evidence_hash":"4a057ddffce78545afb26eb60d213e6363e2c7039707a395f95aeb2076756c31","paper_version":1,"verdict_class":"incontrovertible","resolved_title":null,"detector_version":"1.1.0","detected_arxiv_id":null}}],"endpoint_self":"/pith/2608.13268/integrity.json","protocol_url":"https://pith.science/pith-integrity-protocol"}