{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:2VP66H6YWPMIQVWPX56D3QELTN","short_pith_number":"pith:2VP66H6Y","canonical_record":{"source":{"id":"1407.2646","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-07-09T22:06:18Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"d577189c6c157012f9674e47197d2e13e458aa72b14e0345c27b589327b493b5","abstract_canon_sha256":"07ae11d85ad7eda654641ba5eca48a36b3fa604ebb9ce1ec135072894516f701"},"schema_version":"1.0"},"canonical_sha256":"d55fef1fd8b3d88856cfbf7c3dc08b9b6af02f2e9b09908b754eb299c2592135","source":{"kind":"arxiv","id":"1407.2646","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.2646","created_at":"2026-05-18T02:47:54Z"},{"alias_kind":"arxiv_version","alias_value":"1407.2646v1","created_at":"2026-05-18T02:47:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.2646","created_at":"2026-05-18T02:47:54Z"},{"alias_kind":"pith_short_12","alias_value":"2VP66H6YWPMI","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"2VP66H6YWPMIQVWP","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"2VP66H6Y","created_at":"2026-05-18T12:28:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:2VP66H6YWPMIQVWPX56D3QELTN","target":"record","payload":{"canonical_record":{"source":{"id":"1407.2646","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-07-09T22:06:18Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"d577189c6c157012f9674e47197d2e13e458aa72b14e0345c27b589327b493b5","abstract_canon_sha256":"07ae11d85ad7eda654641ba5eca48a36b3fa604ebb9ce1ec135072894516f701"},"schema_version":"1.0"},"canonical_sha256":"d55fef1fd8b3d88856cfbf7c3dc08b9b6af02f2e9b09908b754eb299c2592135","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:47:54.023454Z","signature_b64":"jEikEgdPQP6QV2l8rwGXXA7EgN4ZP1C2KVkfRZvyPSYqBMei1TTBHIh4P53TRqsbzFeXmXR/1ywQQsUec7WLCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d55fef1fd8b3d88856cfbf7c3dc08b9b6af02f2e9b09908b754eb299c2592135","last_reissued_at":"2026-05-18T02:47:54.023024Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:47:54.023024Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1407.2646","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-18T02:47:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EsGN0hk//217kpS3E5JiJhUwOXJsULynfBEj6yaDFPKJzF+E77DLMIBCM7/JdF1H80ykhe23ZkKRbN4iwk/gAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T13:25:27.109335Z"},"content_sha256":"8fc3333b2448969daf8317478431aebec332f500baf5897f6d2bf1ea69f5dbd3","schema_version":"1.0","event_id":"sha256:8fc3333b2448969daf8317478431aebec332f500baf5897f6d2bf1ea69f5dbd3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:2VP66H6YWPMIQVWPX56D3QELTN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Learning Probabilistic Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.AI","authors_text":"Frank D. Wood, Yura N. Perov","submitted_at":"2014-07-09T22:06:18Z","abstract_excerpt":"We develop a technique for generalising from data in which models are samplers represented as program text. We establish encouraging empirical results that suggest that Markov chain Monte Carlo probabilistic programming inference techniques coupled with higher-order probabilistic programming languages are now sufficiently powerful to enable successful inference of this kind in nontrivial domains. We also introduce a new notion of probabilistic program compilation and show how the same machinery might be used in the future to compile probabilistic programs for efficient reusable predictive infe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.2646","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-18T02:47:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Mv3tSYiKR3D9DDXO4rpdvIHyxry9yjWMbPpsu7yz2v/9zvAo2C26+aRspWkge0wShvKeujziQoKUITQ1IBQmDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T13:25:27.109887Z"},"content_sha256":"a5240f6cf29b0dfa4af9dc39b098fff2b42377403b569ac04c90ec56415cf83b","schema_version":"1.0","event_id":"sha256:a5240f6cf29b0dfa4af9dc39b098fff2b42377403b569ac04c90ec56415cf83b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2VP66H6YWPMIQVWPX56D3QELTN/bundle.json","state_url":"https://pith.science/pith/2VP66H6YWPMIQVWPX56D3QELTN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2VP66H6YWPMIQVWPX56D3QELTN/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-26T13:25:27Z","links":{"resolver":"https://pith.science/pith/2VP66H6YWPMIQVWPX56D3QELTN","bundle":"https://pith.science/pith/2VP66H6YWPMIQVWPX56D3QELTN/bundle.json","state":"https://pith.science/pith/2VP66H6YWPMIQVWPX56D3QELTN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2VP66H6YWPMIQVWPX56D3QELTN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:2VP66H6YWPMIQVWPX56D3QELTN","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":"07ae11d85ad7eda654641ba5eca48a36b3fa604ebb9ce1ec135072894516f701","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-07-09T22:06:18Z","title_canon_sha256":"d577189c6c157012f9674e47197d2e13e458aa72b14e0345c27b589327b493b5"},"schema_version":"1.0","source":{"id":"1407.2646","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.2646","created_at":"2026-05-18T02:47:54Z"},{"alias_kind":"arxiv_version","alias_value":"1407.2646v1","created_at":"2026-05-18T02:47:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.2646","created_at":"2026-05-18T02:47:54Z"},{"alias_kind":"pith_short_12","alias_value":"2VP66H6YWPMI","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"2VP66H6YWPMIQVWP","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"2VP66H6Y","created_at":"2026-05-18T12:28:11Z"}],"graph_snapshots":[{"event_id":"sha256:a5240f6cf29b0dfa4af9dc39b098fff2b42377403b569ac04c90ec56415cf83b","target":"graph","created_at":"2026-05-18T02:47:54Z","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 develop a technique for generalising from data in which models are samplers represented as program text. We establish encouraging empirical results that suggest that Markov chain Monte Carlo probabilistic programming inference techniques coupled with higher-order probabilistic programming languages are now sufficiently powerful to enable successful inference of this kind in nontrivial domains. We also introduce a new notion of probabilistic program compilation and show how the same machinery might be used in the future to compile probabilistic programs for efficient reusable predictive infe","authors_text":"Frank D. Wood, Yura N. Perov","cross_cats":["cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-07-09T22:06:18Z","title":"Learning Probabilistic Programs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.2646","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:8fc3333b2448969daf8317478431aebec332f500baf5897f6d2bf1ea69f5dbd3","target":"record","created_at":"2026-05-18T02:47:54Z","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":"07ae11d85ad7eda654641ba5eca48a36b3fa604ebb9ce1ec135072894516f701","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-07-09T22:06:18Z","title_canon_sha256":"d577189c6c157012f9674e47197d2e13e458aa72b14e0345c27b589327b493b5"},"schema_version":"1.0","source":{"id":"1407.2646","kind":"arxiv","version":1}},"canonical_sha256":"d55fef1fd8b3d88856cfbf7c3dc08b9b6af02f2e9b09908b754eb299c2592135","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d55fef1fd8b3d88856cfbf7c3dc08b9b6af02f2e9b09908b754eb299c2592135","first_computed_at":"2026-05-18T02:47:54.023024Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:47:54.023024Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jEikEgdPQP6QV2l8rwGXXA7EgN4ZP1C2KVkfRZvyPSYqBMei1TTBHIh4P53TRqsbzFeXmXR/1ywQQsUec7WLCg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:47:54.023454Z","signed_message":"canonical_sha256_bytes"},"source_id":"1407.2646","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8fc3333b2448969daf8317478431aebec332f500baf5897f6d2bf1ea69f5dbd3","sha256:a5240f6cf29b0dfa4af9dc39b098fff2b42377403b569ac04c90ec56415cf83b"],"state_sha256":"d996612e7a34eba55a49184ded04baf2cf504adf0d6946eb4fbaafed8ef3bad5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SPwN/5oIo9TQxjiWuL5Fn78Z5sqNmJtVfufpSyKVV1BiWL7f79LyTVyVvVE/YcXVV0bV4YkfATkXGDSytdIxCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T13:25:27.113379Z","bundle_sha256":"a7d339260aaf6070f0ceba4349bf7e28aafb2fc5bd6533a7e89a7d9419e91cc0"}}