{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:J5PCKIL2BIXIAS2352MYAU6M3Z","short_pith_number":"pith:J5PCKIL2","schema_version":"1.0","canonical_sha256":"4f5e25217a0a2e804b5bee998053ccde7146a0e90694a2e3206fae8eb64af83b","source":{"kind":"arxiv","id":"2605.07521","version":2},"attestation_state":"computed","paper":{"title":"From Feasible to Practical: Pareto-Optimal Synthesis Planning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"MORetro* recovers the true Pareto front of synthesis routes for any fixed single-step retrosynthesis model.","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Antonio del Rio Chanona, Dongda Zhang, Friedrich Hastedt","submitted_at":"2026-05-08T09:53:30Z","abstract_excerpt":"Current computer-aided synthesis planning (CASP) methods often treat retrosynthesis as solved once a single feasible route is identified, focusing primarily on convergence or shortest-path metrics. This view is misaligned with real-world practice, where chemists must balance competing objectives such as cost, sustainability, toxicity, and overall yield. To address this, we formulate synthesis planning as a multi-objective search problem and introduce MORetro*, an algorithm that generates a Pareto front of synthesis routes to explicitly capture trade-offs among user-defined criteria. MORetro* u"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2605.07521","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2026-05-08T09:53:30Z","cross_cats_sorted":[],"title_canon_sha256":"5f992c88456ee3061600988da999e87902b9de016bb6b8efed621913e45ed4cc","abstract_canon_sha256":"e4f39eb78d2bc5d174f07ffe83554865c8fe96e89fd2e64521bc2c7315d9425d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-27T01:05:56.500017Z","signature_b64":"AvM/UZIDlB3lUwBSUF7iQohj6FTaPQ1U3CkmxcQ0fHF4Ln/95NnyE4ETpMgsS7vH1MKtAyTun/2bFtFe6JymBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4f5e25217a0a2e804b5bee998053ccde7146a0e90694a2e3206fae8eb64af83b","last_reissued_at":"2026-05-27T01:05:56.499356Z","signature_status":"signed_v1","first_computed_at":"2026-05-27T01:05:56.499356Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"From Feasible to Practical: Pareto-Optimal Synthesis Planning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"MORetro* recovers the true Pareto front of synthesis routes for any fixed single-step retrosynthesis model.","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Antonio del Rio Chanona, Dongda Zhang, Friedrich Hastedt","submitted_at":"2026-05-08T09:53:30Z","abstract_excerpt":"Current computer-aided synthesis planning (CASP) methods often treat retrosynthesis as solved once a single feasible route is identified, focusing primarily on convergence or shortest-path metrics. This view is misaligned with real-world practice, where chemists must balance competing objectives such as cost, sustainability, toxicity, and overall yield. To address this, we formulate synthesis planning as a multi-objective search problem and introduce MORetro*, an algorithm that generates a Pareto front of synthesis routes to explicitly capture trade-offs among user-defined criteria. MORetro* u"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"Building on multi-objective A*-search, we provide optimality guarantees showing that, for a fixed single-step model, MORetro* recovers the true Pareto front.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That the single-step retrosynthesis model is fixed and sufficiently accurate, and that user-defined criteria can be meaningfully scalarized via weights without missing important non-convex trade-offs.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"MORetro* uses weighted scalarization and BO-informed sampling on multi-objective A* search to produce Pareto-optimal synthesis routes with optimality guarantees for fixed single-step models.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"MORetro* recovers the true Pareto front of synthesis routes for any fixed single-step retrosynthesis model.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"decf3acbd17ec65c386fed53d4af0085e36ec79fe7d15c911116d3d4aed16d20"},"source":{"id":"2605.07521","kind":"arxiv","version":2},"verdict":{"id":"8e56530f-496e-4e7f-ac09-4a7fd604bba7","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-11T01:48:05.362093Z","strongest_claim":"Building on multi-objective A*-search, we provide optimality guarantees showing that, for a fixed single-step model, MORetro* recovers the true Pareto front.","one_line_summary":"MORetro* uses weighted scalarization and BO-informed sampling on multi-objective A* search to produce Pareto-optimal synthesis routes with optimality guarantees for fixed single-step models.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That the single-step retrosynthesis model is fixed and sufficiently accurate, and that user-defined criteria can be meaningfully scalarized via weights without missing important non-convex trade-offs.","pith_extraction_headline":"MORetro* recovers the true Pareto front of synthesis routes for any fixed single-step retrosynthesis model."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.07521/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"claim_evidence","ran_at":"2026-05-20T10:42:02.883750Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"ai_meta_artifact","ran_at":"2026-05-20T05:41:18.962820Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_title_agreement","ran_at":"2026-05-19T16:31:18.715554Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T11:43:01.460095Z","status":"completed","version":"1.0.0","findings_count":0}],"snapshot_sha256":"8fa3cdbda794ca6b8f75f04bd3ace2651bcf6dedded783a06d082fa899b62c7d"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2605.07521","created_at":"2026-05-27T01:05:56.499477+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.07521v2","created_at":"2026-05-27T01:05:56.499477+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.07521","created_at":"2026-05-27T01:05:56.499477+00:00"},{"alias_kind":"pith_short_12","alias_value":"J5PCKIL2BIXI","created_at":"2026-05-27T01:05:56.499477+00:00"},{"alias_kind":"pith_short_16","alias_value":"J5PCKIL2BIXIAS23","created_at":"2026-05-27T01:05:56.499477+00:00"},{"alias_kind":"pith_short_8","alias_value":"J5PCKIL2","created_at":"2026-05-27T01:05:56.499477+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/J5PCKIL2BIXIAS2352MYAU6M3Z","json":"https://pith.science/pith/J5PCKIL2BIXIAS2352MYAU6M3Z.json","graph_json":"https://pith.science/api/pith-number/J5PCKIL2BIXIAS2352MYAU6M3Z/graph.json","events_json":"https://pith.science/api/pith-number/J5PCKIL2BIXIAS2352MYAU6M3Z/events.json","paper":"https://pith.science/paper/J5PCKIL2"},"agent_actions":{"view_html":"https://pith.science/pith/J5PCKIL2BIXIAS2352MYAU6M3Z","download_json":"https://pith.science/pith/J5PCKIL2BIXIAS2352MYAU6M3Z.json","view_paper":"https://pith.science/paper/J5PCKIL2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.07521&json=true","fetch_graph":"https://pith.science/api/pith-number/J5PCKIL2BIXIAS2352MYAU6M3Z/graph.json","fetch_events":"https://pith.science/api/pith-number/J5PCKIL2BIXIAS2352MYAU6M3Z/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/J5PCKIL2BIXIAS2352MYAU6M3Z/action/timestamp_anchor","attest_storage":"https://pith.science/pith/J5PCKIL2BIXIAS2352MYAU6M3Z/action/storage_attestation","attest_author":"https://pith.science/pith/J5PCKIL2BIXIAS2352MYAU6M3Z/action/author_attestation","sign_citation":"https://pith.science/pith/J5PCKIL2BIXIAS2352MYAU6M3Z/action/citation_signature","submit_replication":"https://pith.science/pith/J5PCKIL2BIXIAS2352MYAU6M3Z/action/replication_record"}},"created_at":"2026-05-27T01:05:56.499477+00:00","updated_at":"2026-05-27T01:05:56.499477+00:00"}