{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:3W2AGPZQ7BIN3VRNZPKNBRS4J6","short_pith_number":"pith:3W2AGPZQ","canonical_record":{"source":{"id":"1605.02113","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-05-06T22:43:15Z","cross_cats_sorted":["stat.CO"],"title_canon_sha256":"bc384969a4b7bb77419f0435bd3be4253e7f94e68f46d87c8f84b3cc49dc80a1","abstract_canon_sha256":"c0b7cd2785f9a2c275751f1b216966d9913d72a6a760f121ba17105081936942"},"schema_version":"1.0"},"canonical_sha256":"ddb4033f30f850ddd62dcbd4d0c65c4facb19a6ee812031896480e6865cc0ed6","source":{"kind":"arxiv","id":"1605.02113","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.02113","created_at":"2026-05-18T00:41:13Z"},{"alias_kind":"arxiv_version","alias_value":"1605.02113v3","created_at":"2026-05-18T00:41:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.02113","created_at":"2026-05-18T00:41:13Z"},{"alias_kind":"pith_short_12","alias_value":"3W2AGPZQ7BIN","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_16","alias_value":"3W2AGPZQ7BIN3VRN","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_8","alias_value":"3W2AGPZQ","created_at":"2026-05-18T12:29:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:3W2AGPZQ7BIN3VRNZPKNBRS4J6","target":"record","payload":{"canonical_record":{"source":{"id":"1605.02113","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-05-06T22:43:15Z","cross_cats_sorted":["stat.CO"],"title_canon_sha256":"bc384969a4b7bb77419f0435bd3be4253e7f94e68f46d87c8f84b3cc49dc80a1","abstract_canon_sha256":"c0b7cd2785f9a2c275751f1b216966d9913d72a6a760f121ba17105081936942"},"schema_version":"1.0"},"canonical_sha256":"ddb4033f30f850ddd62dcbd4d0c65c4facb19a6ee812031896480e6865cc0ed6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:41:13.025204Z","signature_b64":"tG7997L7uGDQTLpzd98sVelRIQZ5OpS4LsGw4dOecdhiy181nTaqc/6+qn4Z1KC8WXzzvR6pJFT2/0D5rb7OCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ddb4033f30f850ddd62dcbd4d0c65c4facb19a6ee812031896480e6865cc0ed6","last_reissued_at":"2026-05-18T00:41:13.024481Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:41:13.024481Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1605.02113","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:41:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I8gwzmK5RRAoZtF4+X1r7nA6oNRf2/AD0DGQeyVXRfDHIjG4f9kucnaN4i3Mi4CpF6t/qEm3TWXv9X+NZTB6AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T18:52:27.079783Z"},"content_sha256":"8cf0285ce0bbd5e418b368f67cca20b4e60c89e498c21f889a979b32cf0ab27b","schema_version":"1.0","event_id":"sha256:8cf0285ce0bbd5e418b368f67cca20b4e60c89e498c21f889a979b32cf0ab27b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:3W2AGPZQ7BIN3VRNZPKNBRS4J6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Likelihood Inflating Sampling Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.CO"],"primary_cat":"stat.ML","authors_text":"Jeffrey S. Rosenthal, Radu V. Craiu, Reihaneh Entezari","submitted_at":"2016-05-06T22:43:15Z","abstract_excerpt":"Markov Chain Monte Carlo (MCMC) sampling from a posterior distribution corresponding to a massive data set can be computationally prohibitive since producing one sample requires a number of operations that is linear in the data size. In this paper, we introduce a new communication-free parallel method, the Likelihood Inflating Sampling Algorithm (LISA), that significantly reduces computational costs by randomly splitting the dataset into smaller subsets and running MCMC methods independently in parallel on each subset using different processors. Each processor will be used to run an MCMC chain"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.02113","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:41:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/3lkIQi8oErNmq2DYFgXu19C27oJeOtD8l80vz9bep4OJh3sGv9/HYNqrOFsAbrNjlZp7CqcmcPtnzE1E/y2Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T18:52:27.080175Z"},"content_sha256":"102a9f32c3f4db906f0f806e3583434665742f68021b092e7f1817212dfc31dc","schema_version":"1.0","event_id":"sha256:102a9f32c3f4db906f0f806e3583434665742f68021b092e7f1817212dfc31dc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3W2AGPZQ7BIN3VRNZPKNBRS4J6/bundle.json","state_url":"https://pith.science/pith/3W2AGPZQ7BIN3VRNZPKNBRS4J6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3W2AGPZQ7BIN3VRNZPKNBRS4J6/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-06-08T18:52:27Z","links":{"resolver":"https://pith.science/pith/3W2AGPZQ7BIN3VRNZPKNBRS4J6","bundle":"https://pith.science/pith/3W2AGPZQ7BIN3VRNZPKNBRS4J6/bundle.json","state":"https://pith.science/pith/3W2AGPZQ7BIN3VRNZPKNBRS4J6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3W2AGPZQ7BIN3VRNZPKNBRS4J6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:3W2AGPZQ7BIN3VRNZPKNBRS4J6","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":"c0b7cd2785f9a2c275751f1b216966d9913d72a6a760f121ba17105081936942","cross_cats_sorted":["stat.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-05-06T22:43:15Z","title_canon_sha256":"bc384969a4b7bb77419f0435bd3be4253e7f94e68f46d87c8f84b3cc49dc80a1"},"schema_version":"1.0","source":{"id":"1605.02113","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.02113","created_at":"2026-05-18T00:41:13Z"},{"alias_kind":"arxiv_version","alias_value":"1605.02113v3","created_at":"2026-05-18T00:41:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.02113","created_at":"2026-05-18T00:41:13Z"},{"alias_kind":"pith_short_12","alias_value":"3W2AGPZQ7BIN","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_16","alias_value":"3W2AGPZQ7BIN3VRN","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_8","alias_value":"3W2AGPZQ","created_at":"2026-05-18T12:29:58Z"}],"graph_snapshots":[{"event_id":"sha256:102a9f32c3f4db906f0f806e3583434665742f68021b092e7f1817212dfc31dc","target":"graph","created_at":"2026-05-18T00:41:13Z","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":"Markov Chain Monte Carlo (MCMC) sampling from a posterior distribution corresponding to a massive data set can be computationally prohibitive since producing one sample requires a number of operations that is linear in the data size. In this paper, we introduce a new communication-free parallel method, the Likelihood Inflating Sampling Algorithm (LISA), that significantly reduces computational costs by randomly splitting the dataset into smaller subsets and running MCMC methods independently in parallel on each subset using different processors. Each processor will be used to run an MCMC chain","authors_text":"Jeffrey S. Rosenthal, Radu V. Craiu, Reihaneh Entezari","cross_cats":["stat.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-05-06T22:43:15Z","title":"Likelihood Inflating Sampling Algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.02113","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:8cf0285ce0bbd5e418b368f67cca20b4e60c89e498c21f889a979b32cf0ab27b","target":"record","created_at":"2026-05-18T00:41:13Z","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":"c0b7cd2785f9a2c275751f1b216966d9913d72a6a760f121ba17105081936942","cross_cats_sorted":["stat.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-05-06T22:43:15Z","title_canon_sha256":"bc384969a4b7bb77419f0435bd3be4253e7f94e68f46d87c8f84b3cc49dc80a1"},"schema_version":"1.0","source":{"id":"1605.02113","kind":"arxiv","version":3}},"canonical_sha256":"ddb4033f30f850ddd62dcbd4d0c65c4facb19a6ee812031896480e6865cc0ed6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ddb4033f30f850ddd62dcbd4d0c65c4facb19a6ee812031896480e6865cc0ed6","first_computed_at":"2026-05-18T00:41:13.024481Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:41:13.024481Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tG7997L7uGDQTLpzd98sVelRIQZ5OpS4LsGw4dOecdhiy181nTaqc/6+qn4Z1KC8WXzzvR6pJFT2/0D5rb7OCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:41:13.025204Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.02113","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8cf0285ce0bbd5e418b368f67cca20b4e60c89e498c21f889a979b32cf0ab27b","sha256:102a9f32c3f4db906f0f806e3583434665742f68021b092e7f1817212dfc31dc"],"state_sha256":"4d64418a0972a829c5fb855ade7c3c8dfa9b5b77e8655777841ee156b5386b65"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xHzn76h5Tvpfx/cSXSIemlPAZAOhpdClK8kS4laSR/AlHlECTE93n7BhqXvC9I8Hn4KhXKoft59mBo6tRO/BDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T18:52:27.082205Z","bundle_sha256":"94d0883c05bf1d6864d4faa6c4693a864af76dc764b3bcd7e1b109605b96553b"}}