Integrity report for Problem of Finding an Optimal Piecewise Linear Path Connecting Two Given Points with the Possibility of Making n Turns

A machine-verified record of the checks Pith has run against this paper: detector runs, findings, signed bundle events, and canonical identifiers.

arXiv:2605.15449 · pith:2026:BONJSSDX5CAW4IRTLQ2SYLXCH3

0Critical

0Advisory

6Detectors run

2026-05-26Last checked

Paper page arXiv integrity.json bundle.json

Detector runs

ai_meta_artifact completed v1.0.0 · findings 0 · 2026-05-26 13:36:11.039804+00:00

doi_title_agreement completed v1.0.0 · findings 0 · 2026-05-24 17:02:36.248826+00:00

doi_compliance completed v1.0.0 · findings 0 · 2026-05-21 15:04:47.390123+00:00

claim_evidence completed v1.0.0 · findings 0 · 2026-05-21 14:42:28.515134+00:00

cited_work_retraction completed v1.0.0 · findings 0 · 2026-05-19 15:51:56.241280+00:00

citation_quote_validity completed v0.1.0 · findings 0 · 2026-05-19 15:50:05.014142+00:00

Findings

No public integrity findings for this paper.

Signed record

The machine-readable record for this paper lives at /pith/BONJSSDX/integrity.json. Pith Number bundles also include signed pith.integrity.v1 events where a Pith Number exists.