{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:BJKYCRFWLXWYT5EAPHL6UPRVTR","short_pith_number":"pith:BJKYCRFW","canonical_record":{"source":{"id":"1906.01845","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-06-05T06:41:01Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"8233c9f3dacc9aa1131bf08b952847d828aae67a9f1a0a876ae79d13cecac1d9","abstract_canon_sha256":"a1c05684bae926610bc2ff550c8d0946e0d2ea08d5cf77a6c0d5bfd58b2814d1"},"schema_version":"1.0"},"canonical_sha256":"0a558144b65ded89f48079d7ea3e359c4b98e93242d533f7dcc81fbfae7a06d2","source":{"kind":"arxiv","id":"1906.01845","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.01845","created_at":"2026-05-17T23:44:06Z"},{"alias_kind":"arxiv_version","alias_value":"1906.01845v1","created_at":"2026-05-17T23:44:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.01845","created_at":"2026-05-17T23:44:06Z"},{"alias_kind":"pith_short_12","alias_value":"BJKYCRFWLXWY","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"BJKYCRFWLXWYT5EA","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"BJKYCRFW","created_at":"2026-05-18T12:33:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:BJKYCRFWLXWYT5EAPHL6UPRVTR","target":"record","payload":{"canonical_record":{"source":{"id":"1906.01845","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-06-05T06:41:01Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"8233c9f3dacc9aa1131bf08b952847d828aae67a9f1a0a876ae79d13cecac1d9","abstract_canon_sha256":"a1c05684bae926610bc2ff550c8d0946e0d2ea08d5cf77a6c0d5bfd58b2814d1"},"schema_version":"1.0"},"canonical_sha256":"0a558144b65ded89f48079d7ea3e359c4b98e93242d533f7dcc81fbfae7a06d2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:06.001774Z","signature_b64":"cFW094x35Kluprg3vvRcawxnKP7afA3WtMoq20QB79iGFNgEZbx549wzzuylNeMjqQJ6RWqvBufvqaG24cSRDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0a558144b65ded89f48079d7ea3e359c4b98e93242d533f7dcc81fbfae7a06d2","last_reissued_at":"2026-05-17T23:44:06.001095Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:06.001095Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1906.01845","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:44:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9Zkdzu8mzR4XIQ3aoV9Pb5UkZ1LWd1E1QMX6PU11tGcmjzzuMZD3A58Hi/rwf7I+bt8IgGXPEl2nHhxhQqpgDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T05:46:36.800665Z"},"content_sha256":"0083622561ac52e4dbcd7f08381a4e298f64879892990073ac94734eae0d5023","schema_version":"1.0","event_id":"sha256:0083622561ac52e4dbcd7f08381a4e298f64879892990073ac94734eae0d5023"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:BJKYCRFWLXWYT5EAPHL6UPRVTR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Probabilistic hypergraph grammars for efficient molecular optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Egor Kraev, Mark Harley","submitted_at":"2019-06-05T06:41:01Z","abstract_excerpt":"We present an approach to make molecular optimization more efficient. We infer a hypergraph replacement grammar from the ChEMBL database, count the frequencies of particular rules being used to expand particular nonterminals in other rules, and use these as conditional priors for the policy model. Simulating random molecules from the resulting probabilistic grammar, we show that conditional priors result in a molecular distribution closer to the training set than using equal rule probabilities or unconditional priors. We then treat molecular optimization as a reinforcement learning problem, us"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.01845","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":""},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:44:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BTnOKJa3mUio6UoVrDl/vyJfGYtApr2hF8GlUoDZ3fFHH6mKf/GTSq7rbwgpFVpU0ds/1nYls3pZs/HvFoqWAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T05:46:36.800997Z"},"content_sha256":"138e20e6d6c6a759c27f55fa74498c8048ce4ff949ed78c3491783050c17abed","schema_version":"1.0","event_id":"sha256:138e20e6d6c6a759c27f55fa74498c8048ce4ff949ed78c3491783050c17abed"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BJKYCRFWLXWYT5EAPHL6UPRVTR/bundle.json","state_url":"https://pith.science/pith/BJKYCRFWLXWYT5EAPHL6UPRVTR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BJKYCRFWLXWYT5EAPHL6UPRVTR/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-28T05:46:36Z","links":{"resolver":"https://pith.science/pith/BJKYCRFWLXWYT5EAPHL6UPRVTR","bundle":"https://pith.science/pith/BJKYCRFWLXWYT5EAPHL6UPRVTR/bundle.json","state":"https://pith.science/pith/BJKYCRFWLXWYT5EAPHL6UPRVTR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BJKYCRFWLXWYT5EAPHL6UPRVTR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:BJKYCRFWLXWYT5EAPHL6UPRVTR","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"a1c05684bae926610bc2ff550c8d0946e0d2ea08d5cf77a6c0d5bfd58b2814d1","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-06-05T06:41:01Z","title_canon_sha256":"8233c9f3dacc9aa1131bf08b952847d828aae67a9f1a0a876ae79d13cecac1d9"},"schema_version":"1.0","source":{"id":"1906.01845","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.01845","created_at":"2026-05-17T23:44:06Z"},{"alias_kind":"arxiv_version","alias_value":"1906.01845v1","created_at":"2026-05-17T23:44:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.01845","created_at":"2026-05-17T23:44:06Z"},{"alias_kind":"pith_short_12","alias_value":"BJKYCRFWLXWY","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"BJKYCRFWLXWYT5EA","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"BJKYCRFW","created_at":"2026-05-18T12:33:12Z"}],"graph_snapshots":[{"event_id":"sha256:138e20e6d6c6a759c27f55fa74498c8048ce4ff949ed78c3491783050c17abed","target":"graph","created_at":"2026-05-17T23:44:06Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"We present an approach to make molecular optimization more efficient. We infer a hypergraph replacement grammar from the ChEMBL database, count the frequencies of particular rules being used to expand particular nonterminals in other rules, and use these as conditional priors for the policy model. Simulating random molecules from the resulting probabilistic grammar, we show that conditional priors result in a molecular distribution closer to the training set than using equal rule probabilities or unconditional priors. We then treat molecular optimization as a reinforcement learning problem, us","authors_text":"Egor Kraev, Mark Harley","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-06-05T06:41:01Z","title":"Probabilistic hypergraph grammars for efficient molecular optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.01845","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:0083622561ac52e4dbcd7f08381a4e298f64879892990073ac94734eae0d5023","target":"record","created_at":"2026-05-17T23:44:06Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"a1c05684bae926610bc2ff550c8d0946e0d2ea08d5cf77a6c0d5bfd58b2814d1","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-06-05T06:41:01Z","title_canon_sha256":"8233c9f3dacc9aa1131bf08b952847d828aae67a9f1a0a876ae79d13cecac1d9"},"schema_version":"1.0","source":{"id":"1906.01845","kind":"arxiv","version":1}},"canonical_sha256":"0a558144b65ded89f48079d7ea3e359c4b98e93242d533f7dcc81fbfae7a06d2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0a558144b65ded89f48079d7ea3e359c4b98e93242d533f7dcc81fbfae7a06d2","first_computed_at":"2026-05-17T23:44:06.001095Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:44:06.001095Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cFW094x35Kluprg3vvRcawxnKP7afA3WtMoq20QB79iGFNgEZbx549wzzuylNeMjqQJ6RWqvBufvqaG24cSRDQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:44:06.001774Z","signed_message":"canonical_sha256_bytes"},"source_id":"1906.01845","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0083622561ac52e4dbcd7f08381a4e298f64879892990073ac94734eae0d5023","sha256:138e20e6d6c6a759c27f55fa74498c8048ce4ff949ed78c3491783050c17abed"],"state_sha256":"8f7619e3b36040fc5c68046d29065460ef2af5cf110868ad25b0a764d0c14ec7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"34NBZfxJFxnLriOuifSyMo4XgmJ5cWgjlCEKm2jnmWz/kPCAv8kKzWzmnWlnjq4yO4QM9vUKYgSE3ewDjBE/Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T05:46:36.802837Z","bundle_sha256":"1ff53ad261a3bcb02ce2078dc122f0a2c97c9c5b78d497774ddfbf1226039eee"}}