{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:2W4VINV4QBFJIA55U5WABTFFEN","short_pith_number":"pith:2W4VINV4","canonical_record":{"source":{"id":"1411.1690","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-11-06T18:32:24Z","cross_cats_sorted":[],"title_canon_sha256":"5abb7b6ec5c466e3e4f39c3c3d295448ab3cedf59d5d7f50ea2a47f5abc4b73f","abstract_canon_sha256":"cbbfb23710afbb9074fddb7b40134f1bd11d3a9bbad29b0020a97e06082d1019"},"schema_version":"1.0"},"canonical_sha256":"d5b95436bc804a9403bda76c00cca52344062b8d3801561926759ac63534972f","source":{"kind":"arxiv","id":"1411.1690","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.1690","created_at":"2026-05-18T02:25:19Z"},{"alias_kind":"arxiv_version","alias_value":"1411.1690v2","created_at":"2026-05-18T02:25:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.1690","created_at":"2026-05-18T02:25:19Z"},{"alias_kind":"pith_short_12","alias_value":"2W4VINV4QBFJ","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"2W4VINV4QBFJIA55","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"2W4VINV4","created_at":"2026-05-18T12:28:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:2W4VINV4QBFJIA55U5WABTFFEN","target":"record","payload":{"canonical_record":{"source":{"id":"1411.1690","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-11-06T18:32:24Z","cross_cats_sorted":[],"title_canon_sha256":"5abb7b6ec5c466e3e4f39c3c3d295448ab3cedf59d5d7f50ea2a47f5abc4b73f","abstract_canon_sha256":"cbbfb23710afbb9074fddb7b40134f1bd11d3a9bbad29b0020a97e06082d1019"},"schema_version":"1.0"},"canonical_sha256":"d5b95436bc804a9403bda76c00cca52344062b8d3801561926759ac63534972f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:25:19.775117Z","signature_b64":"jIyHVCf24+5pOMfCqzjlp0WwvQRtkyAXk2iM/A8XJbkyQO/U0kv1FAqPM2oGsdFIm98Zy4y1hj0nn6Ggu1HsDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d5b95436bc804a9403bda76c00cca52344062b8d3801561926759ac63534972f","last_reissued_at":"2026-05-18T02:25:19.774747Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:25:19.774747Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1411.1690","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-18T02:25:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VELe9OXfPeKGSpAX3GRyvf90g8JnzBOysHGyhMv/tah4cedtCMRIXBK/gLaHXy2x2oCch55FY0XJg0PFmuUKDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T08:37:23.073677Z"},"content_sha256":"f3756851b9fbe5a642774cc6ab9be041d021be5ba75435285522fb7f00279154","schema_version":"1.0","event_id":"sha256:f3756851b9fbe5a642774cc6ab9be041d021be5ba75435285522fb7f00279154"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:2W4VINV4QBFJIA55U5WABTFFEN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sublinear-Time Approximate MCMC Transitions for Probabilistic Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Vikash Mansinghka, Yutian Chen, Zoubin Ghahramani","submitted_at":"2014-11-06T18:32:24Z","abstract_excerpt":"Probabilistic programming languages can simplify the development of machine learning techniques, but only if inference is sufficiently scalable. Unfortunately, Bayesian parameter estimation for highly coupled models such as regressions and state-space models still scales poorly; each MCMC transition takes linear time in the number of observations. This paper describes a sublinear-time algorithm for making Metropolis-Hastings (MH) updates to latent variables in probabilistic programs. The approach generalizes recently introduced approximate MH techniques: instead of subsampling data items assum"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.1690","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-18T02:25:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vEkwXLLv3XAF7la4ajR6nvjtmDrJr3UOv6YEip5/77z1CuRbcvjQQGcNHUyg3KmxIfX0vo3/H4RgE2a1lARQDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T08:37:23.074021Z"},"content_sha256":"9744dc5a401a50944f77844851743c7b77a5a1ef4e07299b5d7195461116dd93","schema_version":"1.0","event_id":"sha256:9744dc5a401a50944f77844851743c7b77a5a1ef4e07299b5d7195461116dd93"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2W4VINV4QBFJIA55U5WABTFFEN/bundle.json","state_url":"https://pith.science/pith/2W4VINV4QBFJIA55U5WABTFFEN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2W4VINV4QBFJIA55U5WABTFFEN/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-28T08:37:23Z","links":{"resolver":"https://pith.science/pith/2W4VINV4QBFJIA55U5WABTFFEN","bundle":"https://pith.science/pith/2W4VINV4QBFJIA55U5WABTFFEN/bundle.json","state":"https://pith.science/pith/2W4VINV4QBFJIA55U5WABTFFEN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2W4VINV4QBFJIA55U5WABTFFEN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:2W4VINV4QBFJIA55U5WABTFFEN","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":"cbbfb23710afbb9074fddb7b40134f1bd11d3a9bbad29b0020a97e06082d1019","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-11-06T18:32:24Z","title_canon_sha256":"5abb7b6ec5c466e3e4f39c3c3d295448ab3cedf59d5d7f50ea2a47f5abc4b73f"},"schema_version":"1.0","source":{"id":"1411.1690","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1411.1690","created_at":"2026-05-18T02:25:19Z"},{"alias_kind":"arxiv_version","alias_value":"1411.1690v2","created_at":"2026-05-18T02:25:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.1690","created_at":"2026-05-18T02:25:19Z"},{"alias_kind":"pith_short_12","alias_value":"2W4VINV4QBFJ","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"2W4VINV4QBFJIA55","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"2W4VINV4","created_at":"2026-05-18T12:28:11Z"}],"graph_snapshots":[{"event_id":"sha256:9744dc5a401a50944f77844851743c7b77a5a1ef4e07299b5d7195461116dd93","target":"graph","created_at":"2026-05-18T02:25:19Z","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":"Probabilistic programming languages can simplify the development of machine learning techniques, but only if inference is sufficiently scalable. Unfortunately, Bayesian parameter estimation for highly coupled models such as regressions and state-space models still scales poorly; each MCMC transition takes linear time in the number of observations. This paper describes a sublinear-time algorithm for making Metropolis-Hastings (MH) updates to latent variables in probabilistic programs. The approach generalizes recently introduced approximate MH techniques: instead of subsampling data items assum","authors_text":"Vikash Mansinghka, Yutian Chen, Zoubin Ghahramani","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-11-06T18:32:24Z","title":"Sublinear-Time Approximate MCMC Transitions for Probabilistic Programs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.1690","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:f3756851b9fbe5a642774cc6ab9be041d021be5ba75435285522fb7f00279154","target":"record","created_at":"2026-05-18T02:25:19Z","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":"cbbfb23710afbb9074fddb7b40134f1bd11d3a9bbad29b0020a97e06082d1019","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-11-06T18:32:24Z","title_canon_sha256":"5abb7b6ec5c466e3e4f39c3c3d295448ab3cedf59d5d7f50ea2a47f5abc4b73f"},"schema_version":"1.0","source":{"id":"1411.1690","kind":"arxiv","version":2}},"canonical_sha256":"d5b95436bc804a9403bda76c00cca52344062b8d3801561926759ac63534972f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d5b95436bc804a9403bda76c00cca52344062b8d3801561926759ac63534972f","first_computed_at":"2026-05-18T02:25:19.774747Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:25:19.774747Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jIyHVCf24+5pOMfCqzjlp0WwvQRtkyAXk2iM/A8XJbkyQO/U0kv1FAqPM2oGsdFIm98Zy4y1hj0nn6Ggu1HsDA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:25:19.775117Z","signed_message":"canonical_sha256_bytes"},"source_id":"1411.1690","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f3756851b9fbe5a642774cc6ab9be041d021be5ba75435285522fb7f00279154","sha256:9744dc5a401a50944f77844851743c7b77a5a1ef4e07299b5d7195461116dd93"],"state_sha256":"d48cde163bcffd191553e07ee41fedb31f1d808741695692db83887b25d1dc95"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ETLqAXF9Ue3dqOK0tp+JRdLz5Ih0Wxn/Wa5GLQXaJZcoFnJ/v/d6zR9bNtFmnLWE50ar3Ju8YCVnKyEfgh5wCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T08:37:23.076081Z","bundle_sha256":"d2f27cf3c2f6880abe7481995fd1bb2d34a36eae76b422e25fe552473a4d599e"}}