{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:2DVN77TAQMANSO5CN63B4Z5VLN","short_pith_number":"pith:2DVN77TA","schema_version":"1.0","canonical_sha256":"d0eadffe608300d93ba26fb61e67b55b6904167764a92874c4e5b2aca679a5bf","source":{"kind":"arxiv","id":"2110.06389","version":2},"attestation_state":"computed","paper":{"title":"Amortized Tree Generation for Bottom-up Synthesis Planning and Synthesizable Molecular Design","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["q-bio.QM"],"primary_cat":"cs.LG","authors_text":"Connor W. Coley, Roc\\'io Mercado, Wenhao Gao","submitted_at":"2021-10-12T22:43:25Z","abstract_excerpt":"Molecular design and synthesis planning are two critical steps in the process of molecular discovery that we propose to formulate as a single shared task of conditional synthetic pathway generation. We report an amortized approach to generate synthetic pathways as a Markov decision process conditioned on a target molecular embedding. This approach allows us to conduct synthesis planning in a bottom-up manner and design synthesizable molecules by decoding from optimized conditional codes, demonstrating the potential to solve both problems of design and synthesis simultaneously. The approach lev"},"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":"2110.06389","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2021-10-12T22:43:25Z","cross_cats_sorted":["q-bio.QM"],"title_canon_sha256":"a1d01bf42a67e0ecbfd2870543bdc3a03d84311a46d1bb227e0bc8257ba77804","abstract_canon_sha256":"dae6b112e5c8c1381bba04875b0a82f8754b9cdbd97d1d4d93dbca2ad123e43a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:04:42.331342Z","signature_b64":"18mszfoaF1JTFOXPRqAvR3QU7zw2aFSfvae29Jro9UBLcZJxfp8hJ5bFguRM/QMaPwAZIjSVU4H3A6ytPzqbBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d0eadffe608300d93ba26fb61e67b55b6904167764a92874c4e5b2aca679a5bf","last_reissued_at":"2026-07-05T04:04:42.330915Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:04:42.330915Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Amortized Tree Generation for Bottom-up Synthesis Planning and Synthesizable Molecular Design","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["q-bio.QM"],"primary_cat":"cs.LG","authors_text":"Connor W. Coley, Roc\\'io Mercado, Wenhao Gao","submitted_at":"2021-10-12T22:43:25Z","abstract_excerpt":"Molecular design and synthesis planning are two critical steps in the process of molecular discovery that we propose to formulate as a single shared task of conditional synthetic pathway generation. We report an amortized approach to generate synthetic pathways as a Markov decision process conditioned on a target molecular embedding. This approach allows us to conduct synthesis planning in a bottom-up manner and design synthesizable molecules by decoding from optimized conditional codes, demonstrating the potential to solve both problems of design and synthesis simultaneously. The approach lev"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2110.06389","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/2110.06389/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":"2110.06389","created_at":"2026-07-05T04:04:42.330972+00:00"},{"alias_kind":"arxiv_version","alias_value":"2110.06389v2","created_at":"2026-07-05T04:04:42.330972+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2110.06389","created_at":"2026-07-05T04:04:42.330972+00:00"},{"alias_kind":"pith_short_12","alias_value":"2DVN77TAQMAN","created_at":"2026-07-05T04:04:42.330972+00:00"},{"alias_kind":"pith_short_16","alias_value":"2DVN77TAQMANSO5C","created_at":"2026-07-05T04:04:42.330972+00:00"},{"alias_kind":"pith_short_8","alias_value":"2DVN77TA","created_at":"2026-07-05T04:04:42.330972+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.23745","citing_title":"JEDEL: Zero-Shot DNA-Encoded Library Design for Early-Stage Drug Discovery","ref_index":6,"is_internal_anchor":false},{"citing_arxiv_id":"2409.09183","citing_title":"Quantum-inspired Reinforcement Learning for Synthesizable Drug Design","ref_index":18,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2DVN77TAQMANSO5CN63B4Z5VLN","json":"https://pith.science/pith/2DVN77TAQMANSO5CN63B4Z5VLN.json","graph_json":"https://pith.science/api/pith-number/2DVN77TAQMANSO5CN63B4Z5VLN/graph.json","events_json":"https://pith.science/api/pith-number/2DVN77TAQMANSO5CN63B4Z5VLN/events.json","paper":"https://pith.science/paper/2DVN77TA"},"agent_actions":{"view_html":"https://pith.science/pith/2DVN77TAQMANSO5CN63B4Z5VLN","download_json":"https://pith.science/pith/2DVN77TAQMANSO5CN63B4Z5VLN.json","view_paper":"https://pith.science/paper/2DVN77TA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2110.06389&json=true","fetch_graph":"https://pith.science/api/pith-number/2DVN77TAQMANSO5CN63B4Z5VLN/graph.json","fetch_events":"https://pith.science/api/pith-number/2DVN77TAQMANSO5CN63B4Z5VLN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2DVN77TAQMANSO5CN63B4Z5VLN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2DVN77TAQMANSO5CN63B4Z5VLN/action/storage_attestation","attest_author":"https://pith.science/pith/2DVN77TAQMANSO5CN63B4Z5VLN/action/author_attestation","sign_citation":"https://pith.science/pith/2DVN77TAQMANSO5CN63B4Z5VLN/action/citation_signature","submit_replication":"https://pith.science/pith/2DVN77TAQMANSO5CN63B4Z5VLN/action/replication_record"}},"created_at":"2026-07-05T04:04:42.330972+00:00","updated_at":"2026-07-05T04:04:42.330972+00:00"}