{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:MKA3CJYXBF4U5DBDMY7FO7SMQ2","short_pith_number":"pith:MKA3CJYX","schema_version":"1.0","canonical_sha256":"6281b1271709794e8c23663e577e4c8682cdd4f2edf03f701c7a83f112cd36b7","source":{"kind":"arxiv","id":"2002.03230","version":2},"attestation_state":"computed","paper":{"title":"Hierarchical Generation of Molecular Graphs using Structural Motifs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Regina Barzilay, Tommi Jaakkola, Wengong Jin","submitted_at":"2020-02-08T21:21:04Z","abstract_excerpt":"Graph generation techniques are increasingly being adopted for drug discovery. Previous graph generation approaches have utilized relatively small molecular building blocks such as atoms or simple cycles, limiting their effectiveness to smaller molecules. Indeed, as we demonstrate, their performance degrades significantly for larger molecules. In this paper, we propose a new hierarchical graph encoder-decoder that employs significantly larger and more flexible graph motifs as basic building blocks. Our encoder produces a multi-resolution representation for each molecule in a fine-to-coarse fas"},"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":"2002.03230","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-02-08T21:21:04Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"06228397d129064617b45a85cc24f0a85e7a9e924f57f954bfdfe7a2c19c4ae2","abstract_canon_sha256":"5f89e3b47ff205124f7821c272fa29c78ff6223ea3ab448425168a6d6d18e380"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:56:02.771464Z","signature_b64":"dK/ZQ1tUE8fTD5eeiIrELE10nyG0B73ZsuiAFUnKQx+3sK7w7G8Z3AonUjVW1rag/TK0hYRBBpANddwRqS8VDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6281b1271709794e8c23663e577e4c8682cdd4f2edf03f701c7a83f112cd36b7","last_reissued_at":"2026-07-05T00:56:02.771063Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:56:02.771063Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hierarchical Generation of Molecular Graphs using Structural Motifs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Regina Barzilay, Tommi Jaakkola, Wengong Jin","submitted_at":"2020-02-08T21:21:04Z","abstract_excerpt":"Graph generation techniques are increasingly being adopted for drug discovery. Previous graph generation approaches have utilized relatively small molecular building blocks such as atoms or simple cycles, limiting their effectiveness to smaller molecules. Indeed, as we demonstrate, their performance degrades significantly for larger molecules. In this paper, we propose a new hierarchical graph encoder-decoder that employs significantly larger and more flexible graph motifs as basic building blocks. Our encoder produces a multi-resolution representation for each molecule in a fine-to-coarse fas"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2002.03230","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/2002.03230/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":"2002.03230","created_at":"2026-07-05T00:56:02.771128+00:00"},{"alias_kind":"arxiv_version","alias_value":"2002.03230v2","created_at":"2026-07-05T00:56:02.771128+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2002.03230","created_at":"2026-07-05T00:56:02.771128+00:00"},{"alias_kind":"pith_short_12","alias_value":"MKA3CJYXBF4U","created_at":"2026-07-05T00:56:02.771128+00:00"},{"alias_kind":"pith_short_16","alias_value":"MKA3CJYXBF4U5DBD","created_at":"2026-07-05T00:56:02.771128+00:00"},{"alias_kind":"pith_short_8","alias_value":"MKA3CJYX","created_at":"2026-07-05T00:56:02.771128+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.00807","citing_title":"Generative Model for Synthesizing Ionizable Lipids: A Monte Carlo Tree Search Approach","ref_index":18,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MKA3CJYXBF4U5DBDMY7FO7SMQ2","json":"https://pith.science/pith/MKA3CJYXBF4U5DBDMY7FO7SMQ2.json","graph_json":"https://pith.science/api/pith-number/MKA3CJYXBF4U5DBDMY7FO7SMQ2/graph.json","events_json":"https://pith.science/api/pith-number/MKA3CJYXBF4U5DBDMY7FO7SMQ2/events.json","paper":"https://pith.science/paper/MKA3CJYX"},"agent_actions":{"view_html":"https://pith.science/pith/MKA3CJYXBF4U5DBDMY7FO7SMQ2","download_json":"https://pith.science/pith/MKA3CJYXBF4U5DBDMY7FO7SMQ2.json","view_paper":"https://pith.science/paper/MKA3CJYX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2002.03230&json=true","fetch_graph":"https://pith.science/api/pith-number/MKA3CJYXBF4U5DBDMY7FO7SMQ2/graph.json","fetch_events":"https://pith.science/api/pith-number/MKA3CJYXBF4U5DBDMY7FO7SMQ2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MKA3CJYXBF4U5DBDMY7FO7SMQ2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MKA3CJYXBF4U5DBDMY7FO7SMQ2/action/storage_attestation","attest_author":"https://pith.science/pith/MKA3CJYXBF4U5DBDMY7FO7SMQ2/action/author_attestation","sign_citation":"https://pith.science/pith/MKA3CJYXBF4U5DBDMY7FO7SMQ2/action/citation_signature","submit_replication":"https://pith.science/pith/MKA3CJYXBF4U5DBDMY7FO7SMQ2/action/replication_record"}},"created_at":"2026-07-05T00:56:02.771128+00:00","updated_at":"2026-07-05T00:56:02.771128+00:00"}