Integrity report for Heuristic approaches for solving a bilevel optimistic scheduling problem on parallel machines

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

arXiv:2605.19760 · pith:2026:MQATEGZBI3BQFQZVB4KIPFSZJH

0Critical

0Advisory

6Detectors run

2026-05-27Last checked

Paper page arXiv integrity.json bundle.json

Detector runs

doi_title_agreement completed v1.0.0 · findings 0 · 2026-05-27 17:03:18.512646+00:00

ai_meta_artifact completed v1.0.0 · findings 0 · 2026-05-27 04:35:29.606153+00:00

claim_evidence completed v1.0.0 · findings 0 · 2026-05-25 09:03:45.680199+00:00

doi_compliance completed v1.0.0 · findings 0 · 2026-05-25 06:22:56.772939+00:00

citation_quote_validity completed v0.1.0 · findings 0 · 2026-05-20 11:50:02.669966+00:00

cited_work_retraction completed v1.0.0 · findings 0 · 2026-05-20 08:22:11.134382+00:00

Findings

No public integrity findings for this paper.

Signed record

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