{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:AMEM2HJUG4JZZXV75HZIGPOIJU","short_pith_number":"pith:AMEM2HJU","schema_version":"1.0","canonical_sha256":"0308cd1d3437139cdebfe9f2833dc84d2d30f34f8939ceab83f283fa831d66e8","source":{"kind":"arxiv","id":"2407.06334","version":2},"attestation_state":"computed","paper":{"title":"Double-Ended Synthesis Planning with Goal-Constrained Bidirectional Search","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["q-bio.QM"],"primary_cat":"cs.AI","authors_text":"Connor W. Coley, Jihye Roh, Kevin Yu, Runzhong Wang, Wenhao Gao, Ziang Li","submitted_at":"2024-07-08T18:56:00Z","abstract_excerpt":"Computer-aided synthesis planning (CASP) algorithms have demonstrated expert-level abilities in planning retrosynthetic routes to molecules of low to moderate complexity. However, current search methods assume the sufficiency of reaching arbitrary building blocks, failing to address the common real-world constraint where using specific molecules is desired. To this end, we present a formulation of synthesis planning with starting material constraints. Under this formulation, we propose Double-Ended Synthesis Planning (DESP), a novel CASP algorithm under a bidirectional graph search scheme that"},"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":"2407.06334","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2024-07-08T18:56:00Z","cross_cats_sorted":["q-bio.QM"],"title_canon_sha256":"a659b90bfa3ce85fbcc138493c27e8ceca52543f1b934c4e19ab2785dffcf402","abstract_canon_sha256":"0eeecee539a89c7d46f926895879ade10b2300deb1883fa4156dabeb40ed1e21"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:29:31.540401Z","signature_b64":"JGosmuI+kPHkgxZLpbP6r3FW/le2fqfATyWINahKiVnBhkRVkrMEmyL/VqgLC7Ntwaux6N5KD2rl6hK8oVVKCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0308cd1d3437139cdebfe9f2833dc84d2d30f34f8939ceab83f283fa831d66e8","last_reissued_at":"2026-07-05T09:29:31.539918Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:29:31.539918Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Double-Ended Synthesis Planning with Goal-Constrained Bidirectional Search","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["q-bio.QM"],"primary_cat":"cs.AI","authors_text":"Connor W. Coley, Jihye Roh, Kevin Yu, Runzhong Wang, Wenhao Gao, Ziang Li","submitted_at":"2024-07-08T18:56:00Z","abstract_excerpt":"Computer-aided synthesis planning (CASP) algorithms have demonstrated expert-level abilities in planning retrosynthetic routes to molecules of low to moderate complexity. However, current search methods assume the sufficiency of reaching arbitrary building blocks, failing to address the common real-world constraint where using specific molecules is desired. To this end, we present a formulation of synthesis planning with starting material constraints. Under this formulation, we propose Double-Ended Synthesis Planning (DESP), a novel CASP algorithm under a bidirectional graph search scheme that"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.06334","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2407.06334/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2407.06334","created_at":"2026-07-05T09:29:31.539972+00:00"},{"alias_kind":"arxiv_version","alias_value":"2407.06334v2","created_at":"2026-07-05T09:29:31.539972+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.06334","created_at":"2026-07-05T09:29:31.539972+00:00"},{"alias_kind":"pith_short_12","alias_value":"AMEM2HJUG4JZ","created_at":"2026-07-05T09:29:31.539972+00:00"},{"alias_kind":"pith_short_16","alias_value":"AMEM2HJUG4JZZXV7","created_at":"2026-07-05T09:29:31.539972+00:00"},{"alias_kind":"pith_short_8","alias_value":"AMEM2HJU","created_at":"2026-07-05T09:29:31.539972+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2607.01061","citing_title":"Agentic generation of verifiable rules for deterministic, self-expanding reaction classification","ref_index":98,"is_internal_anchor":false},{"citing_arxiv_id":"2605.13101","citing_title":"Margin-calibrated Classifier Guidance for Property-driven Synthesis Planning","ref_index":126,"is_internal_anchor":false},{"citing_arxiv_id":"2605.13101","citing_title":"Margin-calibrated Classifier Guidance for Property-driven Synthesis Planning","ref_index":78,"is_internal_anchor":false},{"citing_arxiv_id":"2604.05075","citing_title":"MMORF: A Multi-agent Framework for Designing Multi-objective Retrosynthesis Planning Systems","ref_index":33,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/AMEM2HJUG4JZZXV75HZIGPOIJU","json":"https://pith.science/pith/AMEM2HJUG4JZZXV75HZIGPOIJU.json","graph_json":"https://pith.science/api/pith-number/AMEM2HJUG4JZZXV75HZIGPOIJU/graph.json","events_json":"https://pith.science/api/pith-number/AMEM2HJUG4JZZXV75HZIGPOIJU/events.json","paper":"https://pith.science/paper/AMEM2HJU"},"agent_actions":{"view_html":"https://pith.science/pith/AMEM2HJUG4JZZXV75HZIGPOIJU","download_json":"https://pith.science/pith/AMEM2HJUG4JZZXV75HZIGPOIJU.json","view_paper":"https://pith.science/paper/AMEM2HJU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2407.06334&json=true","fetch_graph":"https://pith.science/api/pith-number/AMEM2HJUG4JZZXV75HZIGPOIJU/graph.json","fetch_events":"https://pith.science/api/pith-number/AMEM2HJUG4JZZXV75HZIGPOIJU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AMEM2HJUG4JZZXV75HZIGPOIJU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AMEM2HJUG4JZZXV75HZIGPOIJU/action/storage_attestation","attest_author":"https://pith.science/pith/AMEM2HJUG4JZZXV75HZIGPOIJU/action/author_attestation","sign_citation":"https://pith.science/pith/AMEM2HJUG4JZZXV75HZIGPOIJU/action/citation_signature","submit_replication":"https://pith.science/pith/AMEM2HJUG4JZZXV75HZIGPOIJU/action/replication_record"}},"created_at":"2026-07-05T09:29:31.539972+00:00","updated_at":"2026-07-05T09:29:31.539972+00:00"}