{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:6JOOXJRMW3GWXH7I7GIBJT7K5C","short_pith_number":"pith:6JOOXJRM","canonical_record":{"source":{"id":"1707.04314","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-07-13T20:49:29Z","cross_cats_sorted":["cs.AI","cs.PL","stat.CO"],"title_canon_sha256":"7f9b66ac8d2e81ab22c2f64fb5101ec8148c8e3b19ad887aaf86e9dbda191382","abstract_canon_sha256":"0e0a02aecf5d86f2900c5f425413f0796688ce1d1c66c938547f1ffccc146451"},"schema_version":"1.0"},"canonical_sha256":"f25ceba62cb6cd6b9fe8f99014cfeae88f78bc966ecba24dcbb8e4871a86bf8e","source":{"kind":"arxiv","id":"1707.04314","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.04314","created_at":"2026-05-18T00:40:18Z"},{"alias_kind":"arxiv_version","alias_value":"1707.04314v1","created_at":"2026-05-18T00:40:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.04314","created_at":"2026-05-18T00:40:18Z"},{"alias_kind":"pith_short_12","alias_value":"6JOOXJRMW3GW","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"6JOOXJRMW3GWXH7I","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"6JOOXJRM","created_at":"2026-05-18T12:31:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:6JOOXJRMW3GWXH7I7GIBJT7K5C","target":"record","payload":{"canonical_record":{"source":{"id":"1707.04314","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-07-13T20:49:29Z","cross_cats_sorted":["cs.AI","cs.PL","stat.CO"],"title_canon_sha256":"7f9b66ac8d2e81ab22c2f64fb5101ec8148c8e3b19ad887aaf86e9dbda191382","abstract_canon_sha256":"0e0a02aecf5d86f2900c5f425413f0796688ce1d1c66c938547f1ffccc146451"},"schema_version":"1.0"},"canonical_sha256":"f25ceba62cb6cd6b9fe8f99014cfeae88f78bc966ecba24dcbb8e4871a86bf8e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:40:18.673030Z","signature_b64":"I/arxcvw6r5220Hrkyrw0u9U4UEsswiLaUgtldQLS8ry9KMKGW7yt9tAMl0xhtEuHHi5XP7I/ztdezb5Ji3EAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f25ceba62cb6cd6b9fe8f99014cfeae88f78bc966ecba24dcbb8e4871a86bf8e","last_reissued_at":"2026-05-18T00:40:18.672385Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:40:18.672385Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1707.04314","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-18T00:40:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ggHpdqqJm8VpTY3uHPdb8efGzWWTmFfwXvZ+lx7USyo8yjfyb5ESEzXb/6nV/N/ScjyDMDtwqCMZk6Fz4/DXCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T19:50:21.351090Z"},"content_sha256":"69bbe513d382b3ab3034113cb9e17d2eec74a5bd9f856ce279fb383adeef16cc","schema_version":"1.0","event_id":"sha256:69bbe513d382b3ab3034113cb9e17d2eec74a5bd9f856ce279fb383adeef16cc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:6JOOXJRMW3GWXH7I7GIBJT7K5C","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Bayesian Optimization for Probabilistic Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.PL","stat.CO"],"primary_cat":"stat.ML","authors_text":"Frank Wood, Jan-Willem van de Meent, Michael A. Osborne, Tom Rainforth, Tuan Anh Le","submitted_at":"2017-07-13T20:49:29Z","abstract_excerpt":"We present the first general purpose framework for marginal maximum a posteriori estimation of probabilistic program variables. By using a series of code transformations, the evidence of any probabilistic program, and therefore of any graphical model, can be optimized with respect to an arbitrary subset of its sampled variables. To carry out this optimization, we develop the first Bayesian optimization package to directly exploit the source code of its target, leading to innovations in problem-independent hyperpriors, unbounded optimization, and implicit constraint satisfaction; delivering sig"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.04314","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-18T00:40:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oJzSHswkKTjcR7OPc/ZveE8mORU+7Hx6cTESEChGpBJSuByG5Y79Q8AXEgXJlNuCxiqhAZzRTeiImbii74YRDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T19:50:21.351458Z"},"content_sha256":"f3210955c514cfd893d51f79d66757244fba3019e0750d1ac83932e3bd72a2cc","schema_version":"1.0","event_id":"sha256:f3210955c514cfd893d51f79d66757244fba3019e0750d1ac83932e3bd72a2cc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6JOOXJRMW3GWXH7I7GIBJT7K5C/bundle.json","state_url":"https://pith.science/pith/6JOOXJRMW3GWXH7I7GIBJT7K5C/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6JOOXJRMW3GWXH7I7GIBJT7K5C/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-05-27T19:50:21Z","links":{"resolver":"https://pith.science/pith/6JOOXJRMW3GWXH7I7GIBJT7K5C","bundle":"https://pith.science/pith/6JOOXJRMW3GWXH7I7GIBJT7K5C/bundle.json","state":"https://pith.science/pith/6JOOXJRMW3GWXH7I7GIBJT7K5C/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6JOOXJRMW3GWXH7I7GIBJT7K5C/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:6JOOXJRMW3GWXH7I7GIBJT7K5C","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":"0e0a02aecf5d86f2900c5f425413f0796688ce1d1c66c938547f1ffccc146451","cross_cats_sorted":["cs.AI","cs.PL","stat.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-07-13T20:49:29Z","title_canon_sha256":"7f9b66ac8d2e81ab22c2f64fb5101ec8148c8e3b19ad887aaf86e9dbda191382"},"schema_version":"1.0","source":{"id":"1707.04314","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.04314","created_at":"2026-05-18T00:40:18Z"},{"alias_kind":"arxiv_version","alias_value":"1707.04314v1","created_at":"2026-05-18T00:40:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.04314","created_at":"2026-05-18T00:40:18Z"},{"alias_kind":"pith_short_12","alias_value":"6JOOXJRMW3GW","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"6JOOXJRMW3GWXH7I","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"6JOOXJRM","created_at":"2026-05-18T12:31:03Z"}],"graph_snapshots":[{"event_id":"sha256:f3210955c514cfd893d51f79d66757244fba3019e0750d1ac83932e3bd72a2cc","target":"graph","created_at":"2026-05-18T00:40:18Z","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 the first general purpose framework for marginal maximum a posteriori estimation of probabilistic program variables. By using a series of code transformations, the evidence of any probabilistic program, and therefore of any graphical model, can be optimized with respect to an arbitrary subset of its sampled variables. To carry out this optimization, we develop the first Bayesian optimization package to directly exploit the source code of its target, leading to innovations in problem-independent hyperpriors, unbounded optimization, and implicit constraint satisfaction; delivering sig","authors_text":"Frank Wood, Jan-Willem van de Meent, Michael A. Osborne, Tom Rainforth, Tuan Anh Le","cross_cats":["cs.AI","cs.PL","stat.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-07-13T20:49:29Z","title":"Bayesian Optimization for Probabilistic Programs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.04314","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:69bbe513d382b3ab3034113cb9e17d2eec74a5bd9f856ce279fb383adeef16cc","target":"record","created_at":"2026-05-18T00:40:18Z","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":"0e0a02aecf5d86f2900c5f425413f0796688ce1d1c66c938547f1ffccc146451","cross_cats_sorted":["cs.AI","cs.PL","stat.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-07-13T20:49:29Z","title_canon_sha256":"7f9b66ac8d2e81ab22c2f64fb5101ec8148c8e3b19ad887aaf86e9dbda191382"},"schema_version":"1.0","source":{"id":"1707.04314","kind":"arxiv","version":1}},"canonical_sha256":"f25ceba62cb6cd6b9fe8f99014cfeae88f78bc966ecba24dcbb8e4871a86bf8e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f25ceba62cb6cd6b9fe8f99014cfeae88f78bc966ecba24dcbb8e4871a86bf8e","first_computed_at":"2026-05-18T00:40:18.672385Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:40:18.672385Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"I/arxcvw6r5220Hrkyrw0u9U4UEsswiLaUgtldQLS8ry9KMKGW7yt9tAMl0xhtEuHHi5XP7I/ztdezb5Ji3EAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:40:18.673030Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.04314","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:69bbe513d382b3ab3034113cb9e17d2eec74a5bd9f856ce279fb383adeef16cc","sha256:f3210955c514cfd893d51f79d66757244fba3019e0750d1ac83932e3bd72a2cc"],"state_sha256":"88b91fb94549d7c4fde3d005e8dfd2b0314567962441963c3a6e77ba5e089cce"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+I8T61iBH7bMKj3CsVDF0DoHq++ofxUI8Ogicy0j5HiagedS9JD5vccUQnz9vHLYgG4N/sBjGVT43PFWi4CTAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T19:50:21.353664Z","bundle_sha256":"4b24b6bd063cb182f92b6a0a034ed2ec61ceacdc870d1f7515b9919eac804985"}}