{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:3ZKPPXIWLG3Y5AUK5SXCGXTKTC","short_pith_number":"pith:3ZKPPXIW","schema_version":"1.0","canonical_sha256":"de54f7dd1659b78e828aecae235e6a989ade65f0ea69ab5f5dfd101555258866","source":{"kind":"arxiv","id":"1812.01070","version":3},"attestation_state":"computed","paper":{"title":"Learning Multimodal Graph-to-Graph Translation for Molecular Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.NE","stat.ML"],"primary_cat":"cs.LG","authors_text":"Kevin Yang, Regina Barzilay, Tommi Jaakkola, Wengong Jin","submitted_at":"2018-12-03T20:28:09Z","abstract_excerpt":"We view molecular optimization as a graph-to-graph translation problem. The goal is to learn to map from one molecular graph to another with better properties based on an available corpus of paired molecules. Since molecules can be optimized in different ways, there are multiple viable translations for each input graph. A key challenge is therefore to model diverse translation outputs. Our primary contributions include a junction tree encoder-decoder for learning diverse graph translations along with a novel adversarial training method for aligning distributions of molecules. Diverse output di"},"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":"1812.01070","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-12-03T20:28:09Z","cross_cats_sorted":["cs.AI","cs.NE","stat.ML"],"title_canon_sha256":"269baab4d73b20ec55b01ded59f901d6d3ed230798adea9054fd1f3d736cfacd","abstract_canon_sha256":"f8336241f40597238089e83b208e070161a234115bd283a073200f1020b4f5a5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:55:18.955293Z","signature_b64":"Xmx9NJo2ZudS2QS0w09V9SdjPdeWu0yJlJqCr3MWrUIEf0pyxk6F2I7eVOuzmlAAc0VmVgKb1BE/kzdOwJbOBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"de54f7dd1659b78e828aecae235e6a989ade65f0ea69ab5f5dfd101555258866","last_reissued_at":"2026-05-17T23:55:18.954892Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:55:18.954892Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning Multimodal Graph-to-Graph Translation for Molecular Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.NE","stat.ML"],"primary_cat":"cs.LG","authors_text":"Kevin Yang, Regina Barzilay, Tommi Jaakkola, Wengong Jin","submitted_at":"2018-12-03T20:28:09Z","abstract_excerpt":"We view molecular optimization as a graph-to-graph translation problem. The goal is to learn to map from one molecular graph to another with better properties based on an available corpus of paired molecules. Since molecules can be optimized in different ways, there are multiple viable translations for each input graph. A key challenge is therefore to model diverse translation outputs. Our primary contributions include a junction tree encoder-decoder for learning diverse graph translations along with a novel adversarial training method for aligning distributions of molecules. Diverse output di"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.01070","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"1812.01070","created_at":"2026-05-17T23:55:18.954954+00:00"},{"alias_kind":"arxiv_version","alias_value":"1812.01070v3","created_at":"2026-05-17T23:55:18.954954+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.01070","created_at":"2026-05-17T23:55:18.954954+00:00"},{"alias_kind":"pith_short_12","alias_value":"3ZKPPXIWLG3Y","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_16","alias_value":"3ZKPPXIWLG3Y5AUK","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_8","alias_value":"3ZKPPXIW","created_at":"2026-05-18T12:32:05.422762+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.10230","citing_title":"FORGE: Fragment-Oriented Ranking and Generation for Context-Aware Molecular Optimization","ref_index":48,"is_internal_anchor":false},{"citing_arxiv_id":"2605.01484","citing_title":"Evaluating LLMs on Large-Scale Graph Property Estimation via Random Walks","ref_index":142,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3ZKPPXIWLG3Y5AUK5SXCGXTKTC","json":"https://pith.science/pith/3ZKPPXIWLG3Y5AUK5SXCGXTKTC.json","graph_json":"https://pith.science/api/pith-number/3ZKPPXIWLG3Y5AUK5SXCGXTKTC/graph.json","events_json":"https://pith.science/api/pith-number/3ZKPPXIWLG3Y5AUK5SXCGXTKTC/events.json","paper":"https://pith.science/paper/3ZKPPXIW"},"agent_actions":{"view_html":"https://pith.science/pith/3ZKPPXIWLG3Y5AUK5SXCGXTKTC","download_json":"https://pith.science/pith/3ZKPPXIWLG3Y5AUK5SXCGXTKTC.json","view_paper":"https://pith.science/paper/3ZKPPXIW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1812.01070&json=true","fetch_graph":"https://pith.science/api/pith-number/3ZKPPXIWLG3Y5AUK5SXCGXTKTC/graph.json","fetch_events":"https://pith.science/api/pith-number/3ZKPPXIWLG3Y5AUK5SXCGXTKTC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3ZKPPXIWLG3Y5AUK5SXCGXTKTC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3ZKPPXIWLG3Y5AUK5SXCGXTKTC/action/storage_attestation","attest_author":"https://pith.science/pith/3ZKPPXIWLG3Y5AUK5SXCGXTKTC/action/author_attestation","sign_citation":"https://pith.science/pith/3ZKPPXIWLG3Y5AUK5SXCGXTKTC/action/citation_signature","submit_replication":"https://pith.science/pith/3ZKPPXIWLG3Y5AUK5SXCGXTKTC/action/replication_record"}},"created_at":"2026-05-17T23:55:18.954954+00:00","updated_at":"2026-05-17T23:55:18.954954+00:00"}