{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:J5PCKIL2BIXIAS2352MYAU6M3Z","short_pith_number":"pith:J5PCKIL2","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"},"canonical_sha256":"4f5e25217a0a2e804b5bee998053ccde7146a0e90694a2e3206fae8eb64af83b","source":{"kind":"arxiv","id":"2605.07521","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.07521","created_at":"2026-05-27T01:05:56Z"},{"alias_kind":"arxiv_version","alias_value":"2605.07521v2","created_at":"2026-05-27T01:05:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.07521","created_at":"2026-05-27T01:05:56Z"},{"alias_kind":"pith_short_12","alias_value":"J5PCKIL2BIXI","created_at":"2026-05-27T01:05:56Z"},{"alias_kind":"pith_short_16","alias_value":"J5PCKIL2BIXIAS23","created_at":"2026-05-27T01:05:56Z"},{"alias_kind":"pith_short_8","alias_value":"J5PCKIL2","created_at":"2026-05-27T01:05:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:J5PCKIL2BIXIAS2352MYAU6M3Z","target":"record","payload":{"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"},"canonical_sha256":"4f5e25217a0a2e804b5bee998053ccde7146a0e90694a2e3206fae8eb64af83b","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"},"source_kind":"arxiv","source_id":"2605.07521","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-27T01:05:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I7WKTyeZT3JWmD//XCUiReeCfbsZbEgk6m5QkWBZU+5di0T0HL9XD0KqgNhxP9/XiGLK89ah+vsQf9i0LLWIBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T12:34:23.982425Z"},"content_sha256":"077543212944ab5d43d3fcc1500b4c8271e2ba7278b0fda6c6fa57c87bed25fe","schema_version":"1.0","event_id":"sha256:077543212944ab5d43d3fcc1500b4c8271e2ba7278b0fda6c6fa57c87bed25fe"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:J5PCKIL2BIXIAS2352MYAU6M3Z","target":"graph","payload":{"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"},"verdict_id":"8e56530f-496e-4e7f-ac09-4a7fd604bba7"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-27T01:05:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4iAAADhGUVMc3HvAFQ5KhLbgcXoX860Uo1B5kg9IAxVuRtw00XwYI8SprmomJjOVowSPWCXzYsmbllhC27bPCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T12:34:23.982918Z"},"content_sha256":"f0fd603fd240aa7438ba767200d41b7667902e2f793c2db94926ff9d0e177a1c","schema_version":"1.0","event_id":"sha256:f0fd603fd240aa7438ba767200d41b7667902e2f793c2db94926ff9d0e177a1c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/J5PCKIL2BIXIAS2352MYAU6M3Z/bundle.json","state_url":"https://pith.science/pith/J5PCKIL2BIXIAS2352MYAU6M3Z/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/J5PCKIL2BIXIAS2352MYAU6M3Z/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-30T12:34:23Z","links":{"resolver":"https://pith.science/pith/J5PCKIL2BIXIAS2352MYAU6M3Z","bundle":"https://pith.science/pith/J5PCKIL2BIXIAS2352MYAU6M3Z/bundle.json","state":"https://pith.science/pith/J5PCKIL2BIXIAS2352MYAU6M3Z/state.json","well_known_bundle":"https://pith.science/.well-known/pith/J5PCKIL2BIXIAS2352MYAU6M3Z/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:J5PCKIL2BIXIAS2352MYAU6M3Z","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"e4f39eb78d2bc5d174f07ffe83554865c8fe96e89fd2e64521bc2c7315d9425d","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2026-05-08T09:53:30Z","title_canon_sha256":"5f992c88456ee3061600988da999e87902b9de016bb6b8efed621913e45ed4cc"},"schema_version":"1.0","source":{"id":"2605.07521","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.07521","created_at":"2026-05-27T01:05:56Z"},{"alias_kind":"arxiv_version","alias_value":"2605.07521v2","created_at":"2026-05-27T01:05:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.07521","created_at":"2026-05-27T01:05:56Z"},{"alias_kind":"pith_short_12","alias_value":"J5PCKIL2BIXI","created_at":"2026-05-27T01:05:56Z"},{"alias_kind":"pith_short_16","alias_value":"J5PCKIL2BIXIAS23","created_at":"2026-05-27T01:05:56Z"},{"alias_kind":"pith_short_8","alias_value":"J5PCKIL2","created_at":"2026-05-27T01:05:56Z"}],"graph_snapshots":[{"event_id":"sha256:f0fd603fd240aa7438ba767200d41b7667902e2f793c2db94926ff9d0e177a1c","target":"graph","created_at":"2026-05-27T01:05:56Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","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."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","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."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","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."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"MORetro* recovers the true Pareto front of synthesis routes for any fixed single-step retrosynthesis model."}],"snapshot_sha256":"decf3acbd17ec65c386fed53d4af0085e36ec79fe7d15c911116d3d4aed16d20"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"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"}],"endpoint":"/pith/2605.07521/integrity.json","findings":[],"snapshot_sha256":"8fa3cdbda794ca6b8f75f04bd3ace2651bcf6dedded783a06d082fa899b62c7d","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Antonio del Rio Chanona, Dongda Zhang, Friedrich Hastedt","cross_cats":[],"headline":"MORetro* recovers the true Pareto front of synthesis routes for any fixed single-step retrosynthesis model.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2026-05-08T09:53:30Z","title":"From Feasible to Practical: Pareto-Optimal Synthesis Planning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.07521","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-11T01:48:05.362093Z","id":"8e56530f-496e-4e7f-ac09-4a7fd604bba7","model_set":{"reader":"grok-4.3"},"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","pith_extraction_headline":"MORetro* recovers the true Pareto front of synthesis routes for any fixed single-step retrosynthesis model.","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.","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."}},"verdict_id":"8e56530f-496e-4e7f-ac09-4a7fd604bba7"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:077543212944ab5d43d3fcc1500b4c8271e2ba7278b0fda6c6fa57c87bed25fe","target":"record","created_at":"2026-05-27T01:05:56Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"e4f39eb78d2bc5d174f07ffe83554865c8fe96e89fd2e64521bc2c7315d9425d","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2026-05-08T09:53:30Z","title_canon_sha256":"5f992c88456ee3061600988da999e87902b9de016bb6b8efed621913e45ed4cc"},"schema_version":"1.0","source":{"id":"2605.07521","kind":"arxiv","version":2}},"canonical_sha256":"4f5e25217a0a2e804b5bee998053ccde7146a0e90694a2e3206fae8eb64af83b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4f5e25217a0a2e804b5bee998053ccde7146a0e90694a2e3206fae8eb64af83b","first_computed_at":"2026-05-27T01:05:56.499356Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-27T01:05:56.499356Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AvM/UZIDlB3lUwBSUF7iQohj6FTaPQ1U3CkmxcQ0fHF4Ln/95NnyE4ETpMgsS7vH1MKtAyTun/2bFtFe6JymBg==","signature_status":"signed_v1","signed_at":"2026-05-27T01:05:56.500017Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.07521","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:077543212944ab5d43d3fcc1500b4c8271e2ba7278b0fda6c6fa57c87bed25fe","sha256:f0fd603fd240aa7438ba767200d41b7667902e2f793c2db94926ff9d0e177a1c"],"state_sha256":"95e58509aa40489047ffc884098f6c894de3e51e87ee3c41fc3ec7637fcf7fe1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"58LDP3yI/wgRZGT1t/E6zlveIv7LkuXIQ+KJCulUt60B5r0P5RpWAtasGn4WDuLkNmj7xULsBCAJFpi13h5FBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T12:34:23.985265Z","bundle_sha256":"0fe5f03e35b999155c1240af51efd283b4586335402277ed6ac69097c4f38ec9"}}