{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:KKKKMXMQPONMULIKQQ4IZKURAM","short_pith_number":"pith:KKKKMXMQ","canonical_record":{"source":{"id":"1606.06659","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2016-06-21T17:00:41Z","cross_cats_sorted":[],"title_canon_sha256":"2984ec40ac61ed95845568a1813350ca4f1609876f73f7b5b6b346af0b2cc067","abstract_canon_sha256":"9973df0f2bb1959889d4544e704701d30b34b5d9a2fc580909635ff5ceaf91c2"},"schema_version":"1.0"},"canonical_sha256":"5294a65d907b9aca2d0a84388caa910308e3eaf8e70094c77570895d4dd87b8d","source":{"kind":"arxiv","id":"1606.06659","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.06659","created_at":"2026-05-18T01:12:09Z"},{"alias_kind":"arxiv_version","alias_value":"1606.06659v1","created_at":"2026-05-18T01:12:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.06659","created_at":"2026-05-18T01:12:09Z"},{"alias_kind":"pith_short_12","alias_value":"KKKKMXMQPONM","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_16","alias_value":"KKKKMXMQPONMULIK","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_8","alias_value":"KKKKMXMQ","created_at":"2026-05-18T12:30:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:KKKKMXMQPONMULIKQQ4IZKURAM","target":"record","payload":{"canonical_record":{"source":{"id":"1606.06659","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2016-06-21T17:00:41Z","cross_cats_sorted":[],"title_canon_sha256":"2984ec40ac61ed95845568a1813350ca4f1609876f73f7b5b6b346af0b2cc067","abstract_canon_sha256":"9973df0f2bb1959889d4544e704701d30b34b5d9a2fc580909635ff5ceaf91c2"},"schema_version":"1.0"},"canonical_sha256":"5294a65d907b9aca2d0a84388caa910308e3eaf8e70094c77570895d4dd87b8d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:12:09.027958Z","signature_b64":"JSMngFXEM5rbFWU9Nt1UYx2UTcnA87jU7e9rlgIgj2AWHT1HTrtsvlCWdoh01l8k39GqbPb7kg+dvMyexT5oDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5294a65d907b9aca2d0a84388caa910308e3eaf8e70094c77570895d4dd87b8d","last_reissued_at":"2026-05-18T01:12:09.027512Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:12:09.027512Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1606.06659","source_version":1,"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:12:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DOM/BbJuRxhtIh5xQHNa5RzA+/KsHZaz+6DZ2MuGQm8DYCEI3+S6C3VTUHdd5vxISywYD+8j+nWxYbScFcCfCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T00:41:52.263333Z"},"content_sha256":"1231debd1bef1998e44c5bf87c39f7cccc24582337c9cab53bd491675f450e9e","schema_version":"1.0","event_id":"sha256:1231debd1bef1998e44c5bf87c39f7cccc24582337c9cab53bd491675f450e9e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:KKKKMXMQPONMULIKQQ4IZKURAM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A fully Bayesian strategy for high-dimensional hierarchical modeling using massively parallel computing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.CO","authors_text":"Jarad Niemi, Will Landau","submitted_at":"2016-06-21T17:00:41Z","abstract_excerpt":"Markov chain Monte Carlo (MCMC) is the predominant tool used in Bayesian parameter estimation for hierarchical models. When the model expands due to an increasing number of hierarchical levels, number of groups at a particular level, or number of observations in each group, a fully Bayesian analysis via MCMC can easily become computationally demanding, even intractable. We illustrate how the steps in an MCMC for hierarchical models are predominantly one of two types: conditionally independent draws or low-dimensional draws based on summary statistics of parameters at higher levels of the hiera"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.06659","kind":"arxiv","version":1},"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:12:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sgb+DhEu2VxVW2jAwZx1vDK59iNOxe173Z0vs9HS8ql+Z0PLNhoD27WK+wlEQ9/iEsuhhmDsXxDRnawgFnzvCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T00:41:52.263700Z"},"content_sha256":"bf41188af469e7c3afae965f9a58184fe73075e8ba7dc0b70bd2949a3a4d892a","schema_version":"1.0","event_id":"sha256:bf41188af469e7c3afae965f9a58184fe73075e8ba7dc0b70bd2949a3a4d892a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KKKKMXMQPONMULIKQQ4IZKURAM/bundle.json","state_url":"https://pith.science/pith/KKKKMXMQPONMULIKQQ4IZKURAM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KKKKMXMQPONMULIKQQ4IZKURAM/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-02T00:41:52Z","links":{"resolver":"https://pith.science/pith/KKKKMXMQPONMULIKQQ4IZKURAM","bundle":"https://pith.science/pith/KKKKMXMQPONMULIKQQ4IZKURAM/bundle.json","state":"https://pith.science/pith/KKKKMXMQPONMULIKQQ4IZKURAM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KKKKMXMQPONMULIKQQ4IZKURAM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:KKKKMXMQPONMULIKQQ4IZKURAM","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":"9973df0f2bb1959889d4544e704701d30b34b5d9a2fc580909635ff5ceaf91c2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2016-06-21T17:00:41Z","title_canon_sha256":"2984ec40ac61ed95845568a1813350ca4f1609876f73f7b5b6b346af0b2cc067"},"schema_version":"1.0","source":{"id":"1606.06659","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.06659","created_at":"2026-05-18T01:12:09Z"},{"alias_kind":"arxiv_version","alias_value":"1606.06659v1","created_at":"2026-05-18T01:12:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.06659","created_at":"2026-05-18T01:12:09Z"},{"alias_kind":"pith_short_12","alias_value":"KKKKMXMQPONM","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_16","alias_value":"KKKKMXMQPONMULIK","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_8","alias_value":"KKKKMXMQ","created_at":"2026-05-18T12:30:25Z"}],"graph_snapshots":[{"event_id":"sha256:bf41188af469e7c3afae965f9a58184fe73075e8ba7dc0b70bd2949a3a4d892a","target":"graph","created_at":"2026-05-18T01:12:09Z","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) is the predominant tool used in Bayesian parameter estimation for hierarchical models. When the model expands due to an increasing number of hierarchical levels, number of groups at a particular level, or number of observations in each group, a fully Bayesian analysis via MCMC can easily become computationally demanding, even intractable. We illustrate how the steps in an MCMC for hierarchical models are predominantly one of two types: conditionally independent draws or low-dimensional draws based on summary statistics of parameters at higher levels of the hiera","authors_text":"Jarad Niemi, Will Landau","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2016-06-21T17:00:41Z","title":"A fully Bayesian strategy for high-dimensional hierarchical modeling using massively parallel computing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.06659","kind":"arxiv","version":1},"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:1231debd1bef1998e44c5bf87c39f7cccc24582337c9cab53bd491675f450e9e","target":"record","created_at":"2026-05-18T01:12:09Z","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":"9973df0f2bb1959889d4544e704701d30b34b5d9a2fc580909635ff5ceaf91c2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2016-06-21T17:00:41Z","title_canon_sha256":"2984ec40ac61ed95845568a1813350ca4f1609876f73f7b5b6b346af0b2cc067"},"schema_version":"1.0","source":{"id":"1606.06659","kind":"arxiv","version":1}},"canonical_sha256":"5294a65d907b9aca2d0a84388caa910308e3eaf8e70094c77570895d4dd87b8d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5294a65d907b9aca2d0a84388caa910308e3eaf8e70094c77570895d4dd87b8d","first_computed_at":"2026-05-18T01:12:09.027512Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:12:09.027512Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JSMngFXEM5rbFWU9Nt1UYx2UTcnA87jU7e9rlgIgj2AWHT1HTrtsvlCWdoh01l8k39GqbPb7kg+dvMyexT5oDA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:12:09.027958Z","signed_message":"canonical_sha256_bytes"},"source_id":"1606.06659","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1231debd1bef1998e44c5bf87c39f7cccc24582337c9cab53bd491675f450e9e","sha256:bf41188af469e7c3afae965f9a58184fe73075e8ba7dc0b70bd2949a3a4d892a"],"state_sha256":"25154f9f77a3ab907451764c8ec1e554e78659bc71a02c015e81b9ba1a91e8bf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"R0fALwdFqY3I1g0GN+2bR86pgZyK+eZ3AIgSvhdJmkbj4XX/2FoCvhXG0kAgw5RygRPydU9ipHfxCDXgXYf9Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T00:41:52.265656Z","bundle_sha256":"bac8e08a9c075d162fd05b09f8342cc35e2cddcd5fa0bbd976bfd98d44fdaea5"}}