{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:2EX5VCZTW2VM473KQE2ADHG7FD","short_pith_number":"pith:2EX5VCZT","canonical_record":{"source":{"id":"1507.02971","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2015-07-10T17:10:33Z","cross_cats_sorted":["stat.CO","stat.ML"],"title_canon_sha256":"dd0bcfd21df06260db407c59ee2f4e94471b211173777e499792e6b32fc41ff1","abstract_canon_sha256":"eba5dd2ddc288a9b201acf71ae0da04dcfde5e200d8fa9dd4277166280d331c6"},"schema_version":"1.0"},"canonical_sha256":"d12fda8b33b6aace7f6a8134019cdf28f3db5ea600f57b888fb8aa9b504503e7","source":{"kind":"arxiv","id":"1507.02971","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.02971","created_at":"2026-05-18T00:38:46Z"},{"alias_kind":"arxiv_version","alias_value":"1507.02971v3","created_at":"2026-05-18T00:38:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.02971","created_at":"2026-05-18T00:38:46Z"},{"alias_kind":"pith_short_12","alias_value":"2EX5VCZTW2VM","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"2EX5VCZTW2VM473K","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"2EX5VCZT","created_at":"2026-05-18T12:28:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:2EX5VCZTW2VM473KQE2ADHG7FD","target":"record","payload":{"canonical_record":{"source":{"id":"1507.02971","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2015-07-10T17:10:33Z","cross_cats_sorted":["stat.CO","stat.ML"],"title_canon_sha256":"dd0bcfd21df06260db407c59ee2f4e94471b211173777e499792e6b32fc41ff1","abstract_canon_sha256":"eba5dd2ddc288a9b201acf71ae0da04dcfde5e200d8fa9dd4277166280d331c6"},"schema_version":"1.0"},"canonical_sha256":"d12fda8b33b6aace7f6a8134019cdf28f3db5ea600f57b888fb8aa9b504503e7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:38:46.815668Z","signature_b64":"+h07O44UAPq2ji4JSMRGr/xQjKqonHpVzel+FzJX8S22UplVEYlMyEDO0j5byXnOiV4BAW+b/zm1Sdh8FosnCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d12fda8b33b6aace7f6a8134019cdf28f3db5ea600f57b888fb8aa9b504503e7","last_reissued_at":"2026-05-18T00:38:46.815189Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:38:46.815189Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1507.02971","source_version":3,"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:38:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VKajZ8xO2YmXEzRSmzJwSXZhoGlfPomDVDrt0dtNyZFCAJDFsyG2qSnnFaJvUySV+TfMya765jkOZz1xtbNUCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T16:15:31.730496Z"},"content_sha256":"2e0180eb6b004bb18dd870b748a1efcf4737d56c7073eea8d22a0a3dc349c346","schema_version":"1.0","event_id":"sha256:2e0180eb6b004bb18dd870b748a1efcf4737d56c7073eea8d22a0a3dc349c346"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:2EX5VCZTW2VM473KQE2ADHG7FD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Scalable MCMC for Large Data Problems using Data Subsampling and the Difference Estimator","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.CO","stat.ML"],"primary_cat":"stat.ME","authors_text":"Matias Quiroz, Mattias Villani, Robert Kohn","submitted_at":"2015-07-10T17:10:33Z","abstract_excerpt":"We propose a generic Markov Chain Monte Carlo (MCMC) algorithm to speed up computations for datasets with many observations. A key feature of our approach is the use of the highly efficient difference estimator from the survey sampling literature to estimate the log-likelihood accurately using only a small fraction of the data. Our algorithm improves on the $O(n)$ complexity of regular MCMC by operating over local data clusters instead of the full sample when computing the likelihood. The likelihood estimate is used in a Pseudo-marginal framework to sample from a perturbed posterior which is w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.02971","kind":"arxiv","version":3},"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:38:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IwyeRpH2mjrLB03odZkSUQEL1e9tP2U0fD4dJAJGcuojXgiogJGcLY3B0YTJ0koNpxqTO6VAxieDoMlkJapYBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T16:15:31.731201Z"},"content_sha256":"9ae2d8c4c5a412b060e7e7fe80b0ac409e5572c7e764e2a05039934becb05d4d","schema_version":"1.0","event_id":"sha256:9ae2d8c4c5a412b060e7e7fe80b0ac409e5572c7e764e2a05039934becb05d4d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2EX5VCZTW2VM473KQE2ADHG7FD/bundle.json","state_url":"https://pith.science/pith/2EX5VCZTW2VM473KQE2ADHG7FD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2EX5VCZTW2VM473KQE2ADHG7FD/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-27T16:15:31Z","links":{"resolver":"https://pith.science/pith/2EX5VCZTW2VM473KQE2ADHG7FD","bundle":"https://pith.science/pith/2EX5VCZTW2VM473KQE2ADHG7FD/bundle.json","state":"https://pith.science/pith/2EX5VCZTW2VM473KQE2ADHG7FD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2EX5VCZTW2VM473KQE2ADHG7FD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:2EX5VCZTW2VM473KQE2ADHG7FD","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":"eba5dd2ddc288a9b201acf71ae0da04dcfde5e200d8fa9dd4277166280d331c6","cross_cats_sorted":["stat.CO","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2015-07-10T17:10:33Z","title_canon_sha256":"dd0bcfd21df06260db407c59ee2f4e94471b211173777e499792e6b32fc41ff1"},"schema_version":"1.0","source":{"id":"1507.02971","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.02971","created_at":"2026-05-18T00:38:46Z"},{"alias_kind":"arxiv_version","alias_value":"1507.02971v3","created_at":"2026-05-18T00:38:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.02971","created_at":"2026-05-18T00:38:46Z"},{"alias_kind":"pith_short_12","alias_value":"2EX5VCZTW2VM","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"2EX5VCZTW2VM473K","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"2EX5VCZT","created_at":"2026-05-18T12:28:59Z"}],"graph_snapshots":[{"event_id":"sha256:9ae2d8c4c5a412b060e7e7fe80b0ac409e5572c7e764e2a05039934becb05d4d","target":"graph","created_at":"2026-05-18T00:38:46Z","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 a generic Markov Chain Monte Carlo (MCMC) algorithm to speed up computations for datasets with many observations. A key feature of our approach is the use of the highly efficient difference estimator from the survey sampling literature to estimate the log-likelihood accurately using only a small fraction of the data. Our algorithm improves on the $O(n)$ complexity of regular MCMC by operating over local data clusters instead of the full sample when computing the likelihood. The likelihood estimate is used in a Pseudo-marginal framework to sample from a perturbed posterior which is w","authors_text":"Matias Quiroz, Mattias Villani, Robert Kohn","cross_cats":["stat.CO","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2015-07-10T17:10:33Z","title":"Scalable MCMC for Large Data Problems using Data Subsampling and the Difference Estimator"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.02971","kind":"arxiv","version":3},"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:2e0180eb6b004bb18dd870b748a1efcf4737d56c7073eea8d22a0a3dc349c346","target":"record","created_at":"2026-05-18T00:38:46Z","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":"eba5dd2ddc288a9b201acf71ae0da04dcfde5e200d8fa9dd4277166280d331c6","cross_cats_sorted":["stat.CO","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2015-07-10T17:10:33Z","title_canon_sha256":"dd0bcfd21df06260db407c59ee2f4e94471b211173777e499792e6b32fc41ff1"},"schema_version":"1.0","source":{"id":"1507.02971","kind":"arxiv","version":3}},"canonical_sha256":"d12fda8b33b6aace7f6a8134019cdf28f3db5ea600f57b888fb8aa9b504503e7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d12fda8b33b6aace7f6a8134019cdf28f3db5ea600f57b888fb8aa9b504503e7","first_computed_at":"2026-05-18T00:38:46.815189Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:38:46.815189Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+h07O44UAPq2ji4JSMRGr/xQjKqonHpVzel+FzJX8S22UplVEYlMyEDO0j5byXnOiV4BAW+b/zm1Sdh8FosnCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:38:46.815668Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.02971","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2e0180eb6b004bb18dd870b748a1efcf4737d56c7073eea8d22a0a3dc349c346","sha256:9ae2d8c4c5a412b060e7e7fe80b0ac409e5572c7e764e2a05039934becb05d4d"],"state_sha256":"cc401e27d73bf018082f72f54dfd324571389286528bd30e2d34ca692dc4bb19"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Wer3ht2TUZC4ZBIwgU8YvKo3bJ29A+HhT8TO1Oo60BeVDAda74ZvczFrZP0XaAU9xtpIe68zVi1CEjdaUDhIDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T16:15:31.734863Z","bundle_sha256":"8a3a5bca004caa3bf3fa21297376a439b2bc09a0c65edd6c03689d57245f947f"}}