{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:HMBJHLMX7F6VSNFDIIPRD47SG7","short_pith_number":"pith:HMBJHLMX","canonical_record":{"source":{"id":"1605.08576","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2016-05-27T10:51:48Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"ed2d7641508d48f1dd89b8201787b3e063eba78532b08b50c77ec494e2674f37","abstract_canon_sha256":"36e20d53651a13212d3039802648e6a50435f441afac0b5a9869c261cb6a49cc"},"schema_version":"1.0"},"canonical_sha256":"3b0293ad97f97d5934a3421f11f3f237ff259c4150cdf69bce90eb87e272594a","source":{"kind":"arxiv","id":"1605.08576","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.08576","created_at":"2026-05-18T00:40:13Z"},{"alias_kind":"arxiv_version","alias_value":"1605.08576v2","created_at":"2026-05-18T00:40:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.08576","created_at":"2026-05-18T00:40:13Z"},{"alias_kind":"pith_short_12","alias_value":"HMBJHLMX7F6V","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"HMBJHLMX7F6VSNFD","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"HMBJHLMX","created_at":"2026-05-18T12:30:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:HMBJHLMX7F6VSNFDIIPRD47SG7","target":"record","payload":{"canonical_record":{"source":{"id":"1605.08576","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2016-05-27T10:51:48Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"ed2d7641508d48f1dd89b8201787b3e063eba78532b08b50c77ec494e2674f37","abstract_canon_sha256":"36e20d53651a13212d3039802648e6a50435f441afac0b5a9869c261cb6a49cc"},"schema_version":"1.0"},"canonical_sha256":"3b0293ad97f97d5934a3421f11f3f237ff259c4150cdf69bce90eb87e272594a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:40:13.913127Z","signature_b64":"ZNv+qkSlRNEqe+tdt7nJfHVKW1QCVPTsBBUkpuJqtoMIHGsIHYFxpL5Lf4cDR0wb6vjwXKZdO2SR1yX67c5FDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3b0293ad97f97d5934a3421f11f3f237ff259c4150cdf69bce90eb87e272594a","last_reissued_at":"2026-05-18T00:40:13.912505Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:40:13.912505Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1605.08576","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-18T00:40:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YW91trApYXH5umD1Fjv6T02lQniAvafqEEDAAyXASlszPXx90s93qW8tIkO3fIQIzRCYOeiPnZ5nA4awjrutBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T13:55:08.304723Z"},"content_sha256":"af6109541a92146d72a9af0321ea551f36b3e933ef3ea60fa1a89b40918814fe","schema_version":"1.0","event_id":"sha256:af6109541a92146d72a9af0321ea551f36b3e933ef3ea60fa1a89b40918814fe"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:HMBJHLMX7F6VSNFDIIPRD47SG7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Merging MCMC Subposteriors through Gaussian-Process Approximations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"stat.CO","authors_text":"Chris Sherlock, Christopher Nemeth","submitted_at":"2016-05-27T10:51:48Z","abstract_excerpt":"Markov chain Monte Carlo (MCMC) algorithms have become powerful tools for Bayesian inference. However, they do not scale well to large-data problems. Divide-and-conquer strategies, which split the data into batches and, for each batch, run independent MCMC algorithms targeting the corresponding subposterior, can spread the computational burden across a number of separate workers. The challenge with such strategies is in recombining the subposteriors to approximate the full posterior. By creating a Gaussian-process approximation for each log-subposterior density we create a tractable approximat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.08576","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-18T00:40:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IhQ2AobJuTh0w1oVoH9VJ0xjTGuLMIkYNDG9icgZ1H9RbLawwwP6S9+qTa9H4FXz4NlZ46KQKfD5+zQjWpj5BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T13:55:08.305063Z"},"content_sha256":"fb447014e31531c86bbc301f4a0929b6e49e6ef8849419fa4c5d606b143f0862","schema_version":"1.0","event_id":"sha256:fb447014e31531c86bbc301f4a0929b6e49e6ef8849419fa4c5d606b143f0862"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HMBJHLMX7F6VSNFDIIPRD47SG7/bundle.json","state_url":"https://pith.science/pith/HMBJHLMX7F6VSNFDIIPRD47SG7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HMBJHLMX7F6VSNFDIIPRD47SG7/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-03T13:55:08Z","links":{"resolver":"https://pith.science/pith/HMBJHLMX7F6VSNFDIIPRD47SG7","bundle":"https://pith.science/pith/HMBJHLMX7F6VSNFDIIPRD47SG7/bundle.json","state":"https://pith.science/pith/HMBJHLMX7F6VSNFDIIPRD47SG7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HMBJHLMX7F6VSNFDIIPRD47SG7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:HMBJHLMX7F6VSNFDIIPRD47SG7","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":"36e20d53651a13212d3039802648e6a50435f441afac0b5a9869c261cb6a49cc","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2016-05-27T10:51:48Z","title_canon_sha256":"ed2d7641508d48f1dd89b8201787b3e063eba78532b08b50c77ec494e2674f37"},"schema_version":"1.0","source":{"id":"1605.08576","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.08576","created_at":"2026-05-18T00:40:13Z"},{"alias_kind":"arxiv_version","alias_value":"1605.08576v2","created_at":"2026-05-18T00:40:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.08576","created_at":"2026-05-18T00:40:13Z"},{"alias_kind":"pith_short_12","alias_value":"HMBJHLMX7F6V","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"HMBJHLMX7F6VSNFD","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"HMBJHLMX","created_at":"2026-05-18T12:30:19Z"}],"graph_snapshots":[{"event_id":"sha256:fb447014e31531c86bbc301f4a0929b6e49e6ef8849419fa4c5d606b143f0862","target":"graph","created_at":"2026-05-18T00:40: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) algorithms have become powerful tools for Bayesian inference. However, they do not scale well to large-data problems. Divide-and-conquer strategies, which split the data into batches and, for each batch, run independent MCMC algorithms targeting the corresponding subposterior, can spread the computational burden across a number of separate workers. The challenge with such strategies is in recombining the subposteriors to approximate the full posterior. By creating a Gaussian-process approximation for each log-subposterior density we create a tractable approximat","authors_text":"Chris Sherlock, Christopher Nemeth","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2016-05-27T10:51:48Z","title":"Merging MCMC Subposteriors through Gaussian-Process Approximations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.08576","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:af6109541a92146d72a9af0321ea551f36b3e933ef3ea60fa1a89b40918814fe","target":"record","created_at":"2026-05-18T00:40: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":"36e20d53651a13212d3039802648e6a50435f441afac0b5a9869c261cb6a49cc","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2016-05-27T10:51:48Z","title_canon_sha256":"ed2d7641508d48f1dd89b8201787b3e063eba78532b08b50c77ec494e2674f37"},"schema_version":"1.0","source":{"id":"1605.08576","kind":"arxiv","version":2}},"canonical_sha256":"3b0293ad97f97d5934a3421f11f3f237ff259c4150cdf69bce90eb87e272594a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3b0293ad97f97d5934a3421f11f3f237ff259c4150cdf69bce90eb87e272594a","first_computed_at":"2026-05-18T00:40:13.912505Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:40:13.912505Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZNv+qkSlRNEqe+tdt7nJfHVKW1QCVPTsBBUkpuJqtoMIHGsIHYFxpL5Lf4cDR0wb6vjwXKZdO2SR1yX67c5FDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:40:13.913127Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.08576","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:af6109541a92146d72a9af0321ea551f36b3e933ef3ea60fa1a89b40918814fe","sha256:fb447014e31531c86bbc301f4a0929b6e49e6ef8849419fa4c5d606b143f0862"],"state_sha256":"c2ea999343a442d42cd2f2ce25cd5128dfc8d2de19461c843d4793f754b87905"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gNET4bdwX7wH7lD6fp2cBNamLiXrrL5/IQEzWTp72LFQ1lTNnQ8M/XSQ0sCN+a3PVHq/cKqf60ORbE4OfeqSCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T13:55:08.307246Z","bundle_sha256":"203f6feca8c44f0e97d9e9d600d62cfcf2e2ea0b0d0bd95bcc8a6089d5ec4098"}}