{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:VDJBZFJ5KB2C4BIO57NFWOZQNZ","short_pith_number":"pith:VDJBZFJ5","canonical_record":{"source":{"id":"1512.04387","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2015-12-14T16:18:32Z","cross_cats_sorted":["stat.AP","stat.ML"],"title_canon_sha256":"ddc2813b8508da855ee129352618c2e41c14209a031f2d3de4333e8287cbbbe6","abstract_canon_sha256":"626d1a6656ac64b01b60bcc320d95afb3a0b5f28437f5536c8a0c024817dec8e"},"schema_version":"1.0"},"canonical_sha256":"a8d21c953d50742e050eefda5b3b306e67103b9ba2ab000989a9f57a69933bd7","source":{"kind":"arxiv","id":"1512.04387","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.04387","created_at":"2026-05-18T01:14:52Z"},{"alias_kind":"arxiv_version","alias_value":"1512.04387v2","created_at":"2026-05-18T01:14:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.04387","created_at":"2026-05-18T01:14:52Z"},{"alias_kind":"pith_short_12","alias_value":"VDJBZFJ5KB2C","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"VDJBZFJ5KB2C4BIO","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"VDJBZFJ5","created_at":"2026-05-18T12:29:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:VDJBZFJ5KB2C4BIO57NFWOZQNZ","target":"record","payload":{"canonical_record":{"source":{"id":"1512.04387","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2015-12-14T16:18:32Z","cross_cats_sorted":["stat.AP","stat.ML"],"title_canon_sha256":"ddc2813b8508da855ee129352618c2e41c14209a031f2d3de4333e8287cbbbe6","abstract_canon_sha256":"626d1a6656ac64b01b60bcc320d95afb3a0b5f28437f5536c8a0c024817dec8e"},"schema_version":"1.0"},"canonical_sha256":"a8d21c953d50742e050eefda5b3b306e67103b9ba2ab000989a9f57a69933bd7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:14:52.650204Z","signature_b64":"oizFE/zGsAyfNXkZD+G4bJXOKfpNdultVuEddt1h1laSYqPjJjw9lNLsqsNzsxnR2Oc/rVRISamHRZtF8IU3AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a8d21c953d50742e050eefda5b3b306e67103b9ba2ab000989a9f57a69933bd7","last_reissued_at":"2026-05-18T01:14:52.649651Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:14:52.649651Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1512.04387","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-18T01:14:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x81F1oYyXw91R6s8mdz0ASSPF55r3XyIamImXLX75t1no/E+4XhZMfKCvUKXnbm7cM+tXqOtOWVsSvN5g2bJBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T22:13:56.613562Z"},"content_sha256":"177826d15678195b55c1aeae4b7d9c6bfbd3ae9f7d8f4eb6249b6ee67fc40839","schema_version":"1.0","event_id":"sha256:177826d15678195b55c1aeae4b7d9c6bfbd3ae9f7d8f4eb6249b6ee67fc40839"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:VDJBZFJ5KB2C4BIO57NFWOZQNZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Data-driven Sequential Monte Carlo in Probabilistic Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.AP","stat.ML"],"primary_cat":"cs.AI","authors_text":"Frank Wood, Tuan Anh Le, Yura N Perov","submitted_at":"2015-12-14T16:18:32Z","abstract_excerpt":"Most of Markov Chain Monte Carlo (MCMC) and sequential Monte Carlo (SMC) algorithms in existing probabilistic programming systems suboptimally use only model priors as proposal distributions. In this work, we describe an approach for training a discriminative model, namely a neural network, in order to approximate the optimal proposal by using posterior estimates from previous runs of inference. We show an example that incorporates a data-driven proposal for use in a non-parametric model in the Anglican probabilistic programming system. Our results show that data-driven proposals can significa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.04387","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-18T01:14:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"y3C3F7cwcHTgkc7Vm+r+2GbTpMNiEijhidGs8qAnqe/04N7M43kuFy/H9mbGADsDuI/Lo/eyS1Ld3/Vvfm7fCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T22:13:56.613968Z"},"content_sha256":"9ed95470aab4fce280a56e59bf126e1368371cbf79c8a9bfab1d8b18888045c5","schema_version":"1.0","event_id":"sha256:9ed95470aab4fce280a56e59bf126e1368371cbf79c8a9bfab1d8b18888045c5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VDJBZFJ5KB2C4BIO57NFWOZQNZ/bundle.json","state_url":"https://pith.science/pith/VDJBZFJ5KB2C4BIO57NFWOZQNZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VDJBZFJ5KB2C4BIO57NFWOZQNZ/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-27T22:13:56Z","links":{"resolver":"https://pith.science/pith/VDJBZFJ5KB2C4BIO57NFWOZQNZ","bundle":"https://pith.science/pith/VDJBZFJ5KB2C4BIO57NFWOZQNZ/bundle.json","state":"https://pith.science/pith/VDJBZFJ5KB2C4BIO57NFWOZQNZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VDJBZFJ5KB2C4BIO57NFWOZQNZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:VDJBZFJ5KB2C4BIO57NFWOZQNZ","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":"626d1a6656ac64b01b60bcc320d95afb3a0b5f28437f5536c8a0c024817dec8e","cross_cats_sorted":["stat.AP","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2015-12-14T16:18:32Z","title_canon_sha256":"ddc2813b8508da855ee129352618c2e41c14209a031f2d3de4333e8287cbbbe6"},"schema_version":"1.0","source":{"id":"1512.04387","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.04387","created_at":"2026-05-18T01:14:52Z"},{"alias_kind":"arxiv_version","alias_value":"1512.04387v2","created_at":"2026-05-18T01:14:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.04387","created_at":"2026-05-18T01:14:52Z"},{"alias_kind":"pith_short_12","alias_value":"VDJBZFJ5KB2C","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"VDJBZFJ5KB2C4BIO","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"VDJBZFJ5","created_at":"2026-05-18T12:29:44Z"}],"graph_snapshots":[{"event_id":"sha256:9ed95470aab4fce280a56e59bf126e1368371cbf79c8a9bfab1d8b18888045c5","target":"graph","created_at":"2026-05-18T01:14:52Z","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":"Most of Markov Chain Monte Carlo (MCMC) and sequential Monte Carlo (SMC) algorithms in existing probabilistic programming systems suboptimally use only model priors as proposal distributions. In this work, we describe an approach for training a discriminative model, namely a neural network, in order to approximate the optimal proposal by using posterior estimates from previous runs of inference. We show an example that incorporates a data-driven proposal for use in a non-parametric model in the Anglican probabilistic programming system. Our results show that data-driven proposals can significa","authors_text":"Frank Wood, Tuan Anh Le, Yura N Perov","cross_cats":["stat.AP","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2015-12-14T16:18:32Z","title":"Data-driven Sequential Monte Carlo in Probabilistic Programming"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.04387","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:177826d15678195b55c1aeae4b7d9c6bfbd3ae9f7d8f4eb6249b6ee67fc40839","target":"record","created_at":"2026-05-18T01:14:52Z","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":"626d1a6656ac64b01b60bcc320d95afb3a0b5f28437f5536c8a0c024817dec8e","cross_cats_sorted":["stat.AP","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2015-12-14T16:18:32Z","title_canon_sha256":"ddc2813b8508da855ee129352618c2e41c14209a031f2d3de4333e8287cbbbe6"},"schema_version":"1.0","source":{"id":"1512.04387","kind":"arxiv","version":2}},"canonical_sha256":"a8d21c953d50742e050eefda5b3b306e67103b9ba2ab000989a9f57a69933bd7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a8d21c953d50742e050eefda5b3b306e67103b9ba2ab000989a9f57a69933bd7","first_computed_at":"2026-05-18T01:14:52.649651Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:14:52.649651Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"oizFE/zGsAyfNXkZD+G4bJXOKfpNdultVuEddt1h1laSYqPjJjw9lNLsqsNzsxnR2Oc/rVRISamHRZtF8IU3AA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:14:52.650204Z","signed_message":"canonical_sha256_bytes"},"source_id":"1512.04387","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:177826d15678195b55c1aeae4b7d9c6bfbd3ae9f7d8f4eb6249b6ee67fc40839","sha256:9ed95470aab4fce280a56e59bf126e1368371cbf79c8a9bfab1d8b18888045c5"],"state_sha256":"2e96493b0152c647be7d3a3ee12c172e8b77ea02ad536447fc3f88e4487662db"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BkbcYyJUzJ+7TMe60WYFCWwzipevbtGMtkAemCosm1NAmpx9N+Xuoanji/11YGNXu+zRAGuYfFdSwATzj0/EDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T22:13:56.617265Z","bundle_sha256":"4160e3028de9bd3dfae9f9dc5d4d6cf01ea2afe6baa25b669b3f1c8ea039ed80"}}