{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:VDBXAOLFXI63DI5MWFAWB3PNAT","short_pith_number":"pith:VDBXAOLF","schema_version":"1.0","canonical_sha256":"a8c3703965ba3db1a3acb14160eded04c0f323ff67b404f43f37c642a8345ec9","source":{"kind":"arxiv","id":"2012.11522","version":1},"attestation_state":"computed","paper":{"title":"Barking up the right tree: an approach to search over molecule synthesis DAGs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["q-bio.BM","q-bio.QM"],"primary_cat":"cs.LG","authors_text":"Brooks Paige, John Bradshaw, Jos\\'e Miguel Hern\\'andez-Lobato, Marwin H. S. Segler, Matt J. Kusner","submitted_at":"2020-12-21T17:35:06Z","abstract_excerpt":"When designing new molecules with particular properties, it is not only important what to make but crucially how to make it. These instructions form a synthesis directed acyclic graph (DAG), describing how a large vocabulary of simple building blocks can be recursively combined through chemical reactions to create more complicated molecules of interest. In contrast, many current deep generative models for molecules ignore synthesizability. We therefore propose a deep generative model that better represents the real world process, by directly outputting molecule synthesis DAGs. We argue that th"},"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":"2012.11522","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-12-21T17:35:06Z","cross_cats_sorted":["q-bio.BM","q-bio.QM"],"title_canon_sha256":"ca406a2d46fb525ff31f4955c9df2e93ac0dd1b90b470a193c6c3c1aab91915b","abstract_canon_sha256":"c46be9213ba30303d4230db18551c339614829f8ea3ed3805285a49781fbcac0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:01:02.521009Z","signature_b64":"+r+n6rHInGYMn9b1UqlALMxLP80DXNKoNVjSmAkLd/D6yHVS7IfslZBtVMnJkl5FITEBURgmqK+8Z1w+2BlhDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a8c3703965ba3db1a3acb14160eded04c0f323ff67b404f43f37c642a8345ec9","last_reissued_at":"2026-07-05T02:01:02.520638Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:01:02.520638Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Barking up the right tree: an approach to search over molecule synthesis DAGs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["q-bio.BM","q-bio.QM"],"primary_cat":"cs.LG","authors_text":"Brooks Paige, John Bradshaw, Jos\\'e Miguel Hern\\'andez-Lobato, Marwin H. S. Segler, Matt J. Kusner","submitted_at":"2020-12-21T17:35:06Z","abstract_excerpt":"When designing new molecules with particular properties, it is not only important what to make but crucially how to make it. These instructions form a synthesis directed acyclic graph (DAG), describing how a large vocabulary of simple building blocks can be recursively combined through chemical reactions to create more complicated molecules of interest. In contrast, many current deep generative models for molecules ignore synthesizability. We therefore propose a deep generative model that better represents the real world process, by directly outputting molecule synthesis DAGs. We argue that th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2012.11522","kind":"arxiv","version":1},"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/2012.11522/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":"2012.11522","created_at":"2026-07-05T02:01:02.520691+00:00"},{"alias_kind":"arxiv_version","alias_value":"2012.11522v1","created_at":"2026-07-05T02:01:02.520691+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2012.11522","created_at":"2026-07-05T02:01:02.520691+00:00"},{"alias_kind":"pith_short_12","alias_value":"VDBXAOLFXI63","created_at":"2026-07-05T02:01:02.520691+00:00"},{"alias_kind":"pith_short_16","alias_value":"VDBXAOLFXI63DI5M","created_at":"2026-07-05T02:01:02.520691+00:00"},{"alias_kind":"pith_short_8","alias_value":"VDBXAOLF","created_at":"2026-07-05T02:01:02.520691+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2411.15900","citing_title":"Finding Thermodynamically Favorable Pathways in Chemical Reaction Networks Using Flows in Hypergraphs and Mixed-Integer Linear Programming","ref_index":14,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VDBXAOLFXI63DI5MWFAWB3PNAT","json":"https://pith.science/pith/VDBXAOLFXI63DI5MWFAWB3PNAT.json","graph_json":"https://pith.science/api/pith-number/VDBXAOLFXI63DI5MWFAWB3PNAT/graph.json","events_json":"https://pith.science/api/pith-number/VDBXAOLFXI63DI5MWFAWB3PNAT/events.json","paper":"https://pith.science/paper/VDBXAOLF"},"agent_actions":{"view_html":"https://pith.science/pith/VDBXAOLFXI63DI5MWFAWB3PNAT","download_json":"https://pith.science/pith/VDBXAOLFXI63DI5MWFAWB3PNAT.json","view_paper":"https://pith.science/paper/VDBXAOLF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2012.11522&json=true","fetch_graph":"https://pith.science/api/pith-number/VDBXAOLFXI63DI5MWFAWB3PNAT/graph.json","fetch_events":"https://pith.science/api/pith-number/VDBXAOLFXI63DI5MWFAWB3PNAT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VDBXAOLFXI63DI5MWFAWB3PNAT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VDBXAOLFXI63DI5MWFAWB3PNAT/action/storage_attestation","attest_author":"https://pith.science/pith/VDBXAOLFXI63DI5MWFAWB3PNAT/action/author_attestation","sign_citation":"https://pith.science/pith/VDBXAOLFXI63DI5MWFAWB3PNAT/action/citation_signature","submit_replication":"https://pith.science/pith/VDBXAOLFXI63DI5MWFAWB3PNAT/action/replication_record"}},"created_at":"2026-07-05T02:01:02.520691+00:00","updated_at":"2026-07-05T02:01:02.520691+00:00"}