{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:RXFMLFX2IKIAIUWUTMY2YHHO3G","short_pith_number":"pith:RXFMLFX2","canonical_record":{"source":{"id":"1701.03757","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-01-13T17:52:07Z","cross_cats_sorted":["cs.AI","cs.LG","cs.PL","stat.CO"],"title_canon_sha256":"21d1b13a75c2e7d38f31fe96ced705bbb8d113eb0fbfb04e6c41b624573f575d","abstract_canon_sha256":"a0319a4c6f990a51c02c65164ca82bc1aba3b71f491a4cb8ef6e0e8a5ef9e2db"},"schema_version":"1.0"},"canonical_sha256":"8dcac596fa42900452d49b31ac1ceed9b2e259337f6a796da9dddf269543deb3","source":{"kind":"arxiv","id":"1701.03757","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.03757","created_at":"2026-05-18T00:49:22Z"},{"alias_kind":"arxiv_version","alias_value":"1701.03757v2","created_at":"2026-05-18T00:49:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.03757","created_at":"2026-05-18T00:49:22Z"},{"alias_kind":"pith_short_12","alias_value":"RXFMLFX2IKIA","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"RXFMLFX2IKIAIUWU","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"RXFMLFX2","created_at":"2026-05-18T12:31:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:RXFMLFX2IKIAIUWUTMY2YHHO3G","target":"record","payload":{"canonical_record":{"source":{"id":"1701.03757","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-01-13T17:52:07Z","cross_cats_sorted":["cs.AI","cs.LG","cs.PL","stat.CO"],"title_canon_sha256":"21d1b13a75c2e7d38f31fe96ced705bbb8d113eb0fbfb04e6c41b624573f575d","abstract_canon_sha256":"a0319a4c6f990a51c02c65164ca82bc1aba3b71f491a4cb8ef6e0e8a5ef9e2db"},"schema_version":"1.0"},"canonical_sha256":"8dcac596fa42900452d49b31ac1ceed9b2e259337f6a796da9dddf269543deb3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:49:22.730990Z","signature_b64":"pAIYlECHQIlySZhKKThbcg5HDQnxweNzGAVak4Cb3oWeMM4V5nJfGYUUuXdzOBwLTjienwNM4iBG8AjBn5+qBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8dcac596fa42900452d49b31ac1ceed9b2e259337f6a796da9dddf269543deb3","last_reissued_at":"2026-05-18T00:49:22.730356Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:49:22.730356Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1701.03757","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-18T00:49:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k/tuYx180jaVd+rtAMDO9uiMOKXWzAPolT3xEe65dIS7KkGrzDumCDZ536LsZ+7w/GyPvWVBf1KYOjlnwyJGDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T01:28:54.920333Z"},"content_sha256":"83d341a17c2b7e65ade1ac78f85c5afd9dd0187c56bdaebccbbb6a8a3cdef76a","schema_version":"1.0","event_id":"sha256:83d341a17c2b7e65ade1ac78f85c5afd9dd0187c56bdaebccbbb6a8a3cdef76a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:RXFMLFX2IKIAIUWUTMY2YHHO3G","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Deep Probabilistic Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG","cs.PL","stat.CO"],"primary_cat":"stat.ML","authors_text":"David M. Blei, Dustin Tran, Eugene Brevdo, Kevin Murphy, Matthew D. Hoffman, Rif A. Saurous","submitted_at":"2017-01-13T17:52:07Z","abstract_excerpt":"We propose Edward, a Turing-complete probabilistic programming language. Edward defines two compositional representations---random variables and inference. By treating inference as a first class citizen, on a par with modeling, we show that probabilistic programming can be as flexible and computationally efficient as traditional deep learning. For flexibility, Edward makes it easy to fit the same model using a variety of composable inference methods, ranging from point estimation to variational inference to MCMC. In addition, Edward can reuse the modeling representation as part of inference, f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.03757","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-18T00:49:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qXLo8xmhxbe74juCD8B2f7u+m3VMg729FKdwVhEvimI6MCXENp8yjoV7ORQ9Nk3w7bHVH3hDbemEBn07xwjqBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T01:28:54.921087Z"},"content_sha256":"5930ed0c67a737199add0001922248f9c803c5ce8e40a82695cf3eb73a546fb8","schema_version":"1.0","event_id":"sha256:5930ed0c67a737199add0001922248f9c803c5ce8e40a82695cf3eb73a546fb8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RXFMLFX2IKIAIUWUTMY2YHHO3G/bundle.json","state_url":"https://pith.science/pith/RXFMLFX2IKIAIUWUTMY2YHHO3G/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RXFMLFX2IKIAIUWUTMY2YHHO3G/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-20T01:28:54Z","links":{"resolver":"https://pith.science/pith/RXFMLFX2IKIAIUWUTMY2YHHO3G","bundle":"https://pith.science/pith/RXFMLFX2IKIAIUWUTMY2YHHO3G/bundle.json","state":"https://pith.science/pith/RXFMLFX2IKIAIUWUTMY2YHHO3G/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RXFMLFX2IKIAIUWUTMY2YHHO3G/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:RXFMLFX2IKIAIUWUTMY2YHHO3G","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":"a0319a4c6f990a51c02c65164ca82bc1aba3b71f491a4cb8ef6e0e8a5ef9e2db","cross_cats_sorted":["cs.AI","cs.LG","cs.PL","stat.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-01-13T17:52:07Z","title_canon_sha256":"21d1b13a75c2e7d38f31fe96ced705bbb8d113eb0fbfb04e6c41b624573f575d"},"schema_version":"1.0","source":{"id":"1701.03757","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.03757","created_at":"2026-05-18T00:49:22Z"},{"alias_kind":"arxiv_version","alias_value":"1701.03757v2","created_at":"2026-05-18T00:49:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.03757","created_at":"2026-05-18T00:49:22Z"},{"alias_kind":"pith_short_12","alias_value":"RXFMLFX2IKIA","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"RXFMLFX2IKIAIUWU","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"RXFMLFX2","created_at":"2026-05-18T12:31:43Z"}],"graph_snapshots":[{"event_id":"sha256:5930ed0c67a737199add0001922248f9c803c5ce8e40a82695cf3eb73a546fb8","target":"graph","created_at":"2026-05-18T00:49:22Z","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 propose Edward, a Turing-complete probabilistic programming language. Edward defines two compositional representations---random variables and inference. By treating inference as a first class citizen, on a par with modeling, we show that probabilistic programming can be as flexible and computationally efficient as traditional deep learning. For flexibility, Edward makes it easy to fit the same model using a variety of composable inference methods, ranging from point estimation to variational inference to MCMC. In addition, Edward can reuse the modeling representation as part of inference, f","authors_text":"David M. Blei, Dustin Tran, Eugene Brevdo, Kevin Murphy, Matthew D. Hoffman, Rif A. Saurous","cross_cats":["cs.AI","cs.LG","cs.PL","stat.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-01-13T17:52:07Z","title":"Deep Probabilistic Programming"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.03757","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:83d341a17c2b7e65ade1ac78f85c5afd9dd0187c56bdaebccbbb6a8a3cdef76a","target":"record","created_at":"2026-05-18T00:49:22Z","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":"a0319a4c6f990a51c02c65164ca82bc1aba3b71f491a4cb8ef6e0e8a5ef9e2db","cross_cats_sorted":["cs.AI","cs.LG","cs.PL","stat.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-01-13T17:52:07Z","title_canon_sha256":"21d1b13a75c2e7d38f31fe96ced705bbb8d113eb0fbfb04e6c41b624573f575d"},"schema_version":"1.0","source":{"id":"1701.03757","kind":"arxiv","version":2}},"canonical_sha256":"8dcac596fa42900452d49b31ac1ceed9b2e259337f6a796da9dddf269543deb3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8dcac596fa42900452d49b31ac1ceed9b2e259337f6a796da9dddf269543deb3","first_computed_at":"2026-05-18T00:49:22.730356Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:49:22.730356Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pAIYlECHQIlySZhKKThbcg5HDQnxweNzGAVak4Cb3oWeMM4V5nJfGYUUuXdzOBwLTjienwNM4iBG8AjBn5+qBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:49:22.730990Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.03757","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:83d341a17c2b7e65ade1ac78f85c5afd9dd0187c56bdaebccbbb6a8a3cdef76a","sha256:5930ed0c67a737199add0001922248f9c803c5ce8e40a82695cf3eb73a546fb8"],"state_sha256":"2fac6f392b0205123751c48baf3ddf354a563abc1a600cf809a2539ecc558fd0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JKHQGGiTdiOH4x93+0ppgsLaWUIBSAy3xcauojpmB8alsszS8Q+LR0D9zBBAnmorLJ2VJ1KUTcYzdvcWQSZsDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-20T01:28:54.930970Z","bundle_sha256":"177e02a7e9af560038e7a0aac17d28b66358f1ae92f2da032a84fde9f56cd219"}}