{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:E3VRH6YFKBXW3E25COFMQFHVX7","short_pith_number":"pith:E3VRH6YF","canonical_record":{"source":{"id":"1901.11515","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-01-31T18:35:56Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"76ebb130fe11ea252f7108d5bc267e38dec9dea30e2805d57a6c497b10944103","abstract_canon_sha256":"0b9536e15b778e185e90a08411be1ac47c8a4a6835a3dd82cd286f21a94de4d3"},"schema_version":"1.0"},"canonical_sha256":"26eb13fb05506f6d935d138ac814f5bffe6abf3840dd0a16341feef868f8cb7f","source":{"kind":"arxiv","id":"1901.11515","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.11515","created_at":"2026-05-17T23:41:30Z"},{"alias_kind":"arxiv_version","alias_value":"1901.11515v2","created_at":"2026-05-17T23:41:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.11515","created_at":"2026-05-17T23:41:30Z"},{"alias_kind":"pith_short_12","alias_value":"E3VRH6YFKBXW","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"E3VRH6YFKBXW3E25","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"E3VRH6YF","created_at":"2026-05-18T12:33:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:E3VRH6YFKBXW3E25COFMQFHVX7","target":"record","payload":{"canonical_record":{"source":{"id":"1901.11515","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-01-31T18:35:56Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"76ebb130fe11ea252f7108d5bc267e38dec9dea30e2805d57a6c497b10944103","abstract_canon_sha256":"0b9536e15b778e185e90a08411be1ac47c8a4a6835a3dd82cd286f21a94de4d3"},"schema_version":"1.0"},"canonical_sha256":"26eb13fb05506f6d935d138ac814f5bffe6abf3840dd0a16341feef868f8cb7f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:41:30.681866Z","signature_b64":"ibTzQfhRCYN9YLPMnocIzsQsrIIpsUVHXMvb4mGfl5gq1fALyzJovc+020h6+9QLSSPB3Q3JgLV/Hxlk+rPPBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"26eb13fb05506f6d935d138ac814f5bffe6abf3840dd0a16341feef868f8cb7f","last_reissued_at":"2026-05-17T23:41:30.681080Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:41:30.681080Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1901.11515","source_version":2,"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:41:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9MspO+PM7WW1r3Qs4Iwsa5v0rBukT1DQKSCOj80F7wBBbrgz4CJjgVJlWRAKDWypUVrBGJchiXmlNHDsnbl3Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T13:00:49.952105Z"},"content_sha256":"769bff2b992019efbe4f547d940ec6c305e425467dff86694a4fb0adc60df538","schema_version":"1.0","event_id":"sha256:769bff2b992019efbe4f547d940ec6c305e425467dff86694a4fb0adc60df538"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:E3VRH6YFKBXW3E25COFMQFHVX7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"ProBO: Versatile Bayesian Optimization Using Any Probabilistic Programming Language","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Barnabas Poczos, Eric Xing, Jeff Schneider, Kirthevasan Kandasamy, Willie Neiswanger","submitted_at":"2019-01-31T18:35:56Z","abstract_excerpt":"Optimizing an expensive-to-query function is a common task in science and engineering, where it is beneficial to keep the number of queries to a minimum. A popular strategy is Bayesian optimization (BO), which leverages probabilistic models for this task. Most BO today uses Gaussian processes (GPs), or a few other surrogate models. However, there is a broad set of Bayesian modeling techniques that could be used to capture complex systems and reduce the number of queries in BO. Probabilistic programming languages (PPLs) are modern tools that allow for flexible model definition, prior specificat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.11515","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":""},"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:41:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qxbuCxW+lJg1GNloqYSBJPuykIEw/A91lGSAgRBPnCDQ5hQd22hRZwKfgIo3pNzepmCmnI4FPzUeG7A/nym+Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T13:00:49.952623Z"},"content_sha256":"78577328add5a9b5729fd6ade6642a6f7164e6ef3325f6e5a797277e34476dce","schema_version":"1.0","event_id":"sha256:78577328add5a9b5729fd6ade6642a6f7164e6ef3325f6e5a797277e34476dce"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/E3VRH6YFKBXW3E25COFMQFHVX7/bundle.json","state_url":"https://pith.science/pith/E3VRH6YFKBXW3E25COFMQFHVX7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/E3VRH6YFKBXW3E25COFMQFHVX7/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-08-17T13:00:49Z","links":{"resolver":"https://pith.science/pith/E3VRH6YFKBXW3E25COFMQFHVX7","bundle":"https://pith.science/pith/E3VRH6YFKBXW3E25COFMQFHVX7/bundle.json","state":"https://pith.science/pith/E3VRH6YFKBXW3E25COFMQFHVX7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/E3VRH6YFKBXW3E25COFMQFHVX7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:E3VRH6YFKBXW3E25COFMQFHVX7","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":"0b9536e15b778e185e90a08411be1ac47c8a4a6835a3dd82cd286f21a94de4d3","cross_cats_sorted":["cs.AI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-01-31T18:35:56Z","title_canon_sha256":"76ebb130fe11ea252f7108d5bc267e38dec9dea30e2805d57a6c497b10944103"},"schema_version":"1.0","source":{"id":"1901.11515","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.11515","created_at":"2026-05-17T23:41:30Z"},{"alias_kind":"arxiv_version","alias_value":"1901.11515v2","created_at":"2026-05-17T23:41:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.11515","created_at":"2026-05-17T23:41:30Z"},{"alias_kind":"pith_short_12","alias_value":"E3VRH6YFKBXW","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"E3VRH6YFKBXW3E25","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"E3VRH6YF","created_at":"2026-05-18T12:33:15Z"}],"graph_snapshots":[{"event_id":"sha256:78577328add5a9b5729fd6ade6642a6f7164e6ef3325f6e5a797277e34476dce","target":"graph","created_at":"2026-05-17T23:41:30Z","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":"Optimizing an expensive-to-query function is a common task in science and engineering, where it is beneficial to keep the number of queries to a minimum. A popular strategy is Bayesian optimization (BO), which leverages probabilistic models for this task. Most BO today uses Gaussian processes (GPs), or a few other surrogate models. However, there is a broad set of Bayesian modeling techniques that could be used to capture complex systems and reduce the number of queries in BO. Probabilistic programming languages (PPLs) are modern tools that allow for flexible model definition, prior specificat","authors_text":"Barnabas Poczos, Eric Xing, Jeff Schneider, Kirthevasan Kandasamy, Willie Neiswanger","cross_cats":["cs.AI","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-01-31T18:35:56Z","title":"ProBO: Versatile Bayesian Optimization Using Any Probabilistic Programming Language"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.11515","kind":"arxiv","version":2},"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:769bff2b992019efbe4f547d940ec6c305e425467dff86694a4fb0adc60df538","target":"record","created_at":"2026-05-17T23:41:30Z","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":"0b9536e15b778e185e90a08411be1ac47c8a4a6835a3dd82cd286f21a94de4d3","cross_cats_sorted":["cs.AI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-01-31T18:35:56Z","title_canon_sha256":"76ebb130fe11ea252f7108d5bc267e38dec9dea30e2805d57a6c497b10944103"},"schema_version":"1.0","source":{"id":"1901.11515","kind":"arxiv","version":2}},"canonical_sha256":"26eb13fb05506f6d935d138ac814f5bffe6abf3840dd0a16341feef868f8cb7f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"26eb13fb05506f6d935d138ac814f5bffe6abf3840dd0a16341feef868f8cb7f","first_computed_at":"2026-05-17T23:41:30.681080Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:41:30.681080Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ibTzQfhRCYN9YLPMnocIzsQsrIIpsUVHXMvb4mGfl5gq1fALyzJovc+020h6+9QLSSPB3Q3JgLV/Hxlk+rPPBg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:41:30.681866Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.11515","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:769bff2b992019efbe4f547d940ec6c305e425467dff86694a4fb0adc60df538","sha256:78577328add5a9b5729fd6ade6642a6f7164e6ef3325f6e5a797277e34476dce"],"state_sha256":"ccc0da16afa67137507ab397fb7ff7777ddbefc692f8f966242437240c8449f4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"q6L0Gh8BNAXxFzrJwKb17XV0o9naOzRw43knoVpIbk/qCx7y4Dhqn/R0YSFxDQdBRPcLIWpxsv6uyDUUpMRjAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-17T13:00:49.958034Z","bundle_sha256":"83a61c791df9c749eb9f0bae94533a38baeac78d80abbb4b5badff129958bb1b"}}