{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:4MGPKPOUJZY2MCSRN7EPFYWKVU","short_pith_number":"pith:4MGPKPOU","canonical_record":{"source":{"id":"1608.05815","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2016-08-20T13:00:42Z","cross_cats_sorted":[],"title_canon_sha256":"af98c6ad497c656224e9f55f8f3ba637eec7e62b82152ef0d16cbd4eca0a3094","abstract_canon_sha256":"741c6111c6803c78f860ad17d094943c65862be3976c48aae5674f8b5fd8f2f0"},"schema_version":"1.0"},"canonical_sha256":"e30cf53dd44e71a60a516fc8f2e2caad273bad601f29a0912970a9165c37589a","source":{"kind":"arxiv","id":"1608.05815","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.05815","created_at":"2026-05-18T00:51:22Z"},{"alias_kind":"arxiv_version","alias_value":"1608.05815v2","created_at":"2026-05-18T00:51:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.05815","created_at":"2026-05-18T00:51:22Z"},{"alias_kind":"pith_short_12","alias_value":"4MGPKPOUJZY2","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_16","alias_value":"4MGPKPOUJZY2MCSR","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_8","alias_value":"4MGPKPOU","created_at":"2026-05-18T12:29:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:4MGPKPOUJZY2MCSRN7EPFYWKVU","target":"record","payload":{"canonical_record":{"source":{"id":"1608.05815","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2016-08-20T13:00:42Z","cross_cats_sorted":[],"title_canon_sha256":"af98c6ad497c656224e9f55f8f3ba637eec7e62b82152ef0d16cbd4eca0a3094","abstract_canon_sha256":"741c6111c6803c78f860ad17d094943c65862be3976c48aae5674f8b5fd8f2f0"},"schema_version":"1.0"},"canonical_sha256":"e30cf53dd44e71a60a516fc8f2e2caad273bad601f29a0912970a9165c37589a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:51:22.494864Z","signature_b64":"neC4PDwGHesiSo4QFFDkSMRMRyHa7n0+b1Lgva5+9vFSLhrfSrVjuqVlpDAA3f3t6vCnBUzcGY/YCmQsPGe1Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e30cf53dd44e71a60a516fc8f2e2caad273bad601f29a0912970a9165c37589a","last_reissued_at":"2026-05-18T00:51:22.494166Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:51:22.494166Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1608.05815","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:51:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HdZGUPQJ07xfTM26/5jcAJTvMUhulvrIZyruIOtoCPGeIj47jyfTpm6D67tsqkYGJkw4Q0Q9NF+KkMQIxLjYBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T11:00:01.761566Z"},"content_sha256":"ded3f8c96345f3e2cf9a25081f40fb7ae74d2068287670d1a4c97fa332749b18","schema_version":"1.0","event_id":"sha256:ded3f8c96345f3e2cf9a25081f40fb7ae74d2068287670d1a4c97fa332749b18"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:4MGPKPOUJZY2MCSRN7EPFYWKVU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An approach for finding fully Bayesian optimal designs using normal-based approximations to loss functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ME","authors_text":"Antony M. Overstall, Christopher C. Drovandi, James M. McGree","submitted_at":"2016-08-20T13:00:42Z","abstract_excerpt":"The generation of decision-theoretic Bayesian optimal designs is complicated by the significant computational challenge of minimising an analytically intractable expected loss function over a, potentially, high-dimensional design space. A new general approach for approximately finding Bayesian optimal designs is proposed which uses computationally efficient normal-based approximations to posterior summaries to aid in approximating the expected loss. This new approach is demonstrated on illustrative, yet challenging, examples including hierarchical models for blocked experiments, and experiment"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.05815","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:51:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4GaHmdnMjthMTzTM2rwtVkShT80oU/c2JPVY8LnXC0hcqaHcSRrlZKJHC+/sBRi7nyVRyCIA+WGD8kH4AYnNCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T11:00:01.762467Z"},"content_sha256":"f62a6c24fe60d458501052a97bf04616adde8bd49d1edf2ece91f03100451ce1","schema_version":"1.0","event_id":"sha256:f62a6c24fe60d458501052a97bf04616adde8bd49d1edf2ece91f03100451ce1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4MGPKPOUJZY2MCSRN7EPFYWKVU/bundle.json","state_url":"https://pith.science/pith/4MGPKPOUJZY2MCSRN7EPFYWKVU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4MGPKPOUJZY2MCSRN7EPFYWKVU/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-07-01T11:00:01Z","links":{"resolver":"https://pith.science/pith/4MGPKPOUJZY2MCSRN7EPFYWKVU","bundle":"https://pith.science/pith/4MGPKPOUJZY2MCSRN7EPFYWKVU/bundle.json","state":"https://pith.science/pith/4MGPKPOUJZY2MCSRN7EPFYWKVU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4MGPKPOUJZY2MCSRN7EPFYWKVU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:4MGPKPOUJZY2MCSRN7EPFYWKVU","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":"741c6111c6803c78f860ad17d094943c65862be3976c48aae5674f8b5fd8f2f0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2016-08-20T13:00:42Z","title_canon_sha256":"af98c6ad497c656224e9f55f8f3ba637eec7e62b82152ef0d16cbd4eca0a3094"},"schema_version":"1.0","source":{"id":"1608.05815","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.05815","created_at":"2026-05-18T00:51:22Z"},{"alias_kind":"arxiv_version","alias_value":"1608.05815v2","created_at":"2026-05-18T00:51:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.05815","created_at":"2026-05-18T00:51:22Z"},{"alias_kind":"pith_short_12","alias_value":"4MGPKPOUJZY2","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_16","alias_value":"4MGPKPOUJZY2MCSR","created_at":"2026-05-18T12:29:58Z"},{"alias_kind":"pith_short_8","alias_value":"4MGPKPOU","created_at":"2026-05-18T12:29:58Z"}],"graph_snapshots":[{"event_id":"sha256:f62a6c24fe60d458501052a97bf04616adde8bd49d1edf2ece91f03100451ce1","target":"graph","created_at":"2026-05-18T00:51:22Z","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":"The generation of decision-theoretic Bayesian optimal designs is complicated by the significant computational challenge of minimising an analytically intractable expected loss function over a, potentially, high-dimensional design space. A new general approach for approximately finding Bayesian optimal designs is proposed which uses computationally efficient normal-based approximations to posterior summaries to aid in approximating the expected loss. This new approach is demonstrated on illustrative, yet challenging, examples including hierarchical models for blocked experiments, and experiment","authors_text":"Antony M. Overstall, Christopher C. Drovandi, James M. McGree","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2016-08-20T13:00:42Z","title":"An approach for finding fully Bayesian optimal designs using normal-based approximations to loss functions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.05815","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:ded3f8c96345f3e2cf9a25081f40fb7ae74d2068287670d1a4c97fa332749b18","target":"record","created_at":"2026-05-18T00:51:22Z","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":"741c6111c6803c78f860ad17d094943c65862be3976c48aae5674f8b5fd8f2f0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2016-08-20T13:00:42Z","title_canon_sha256":"af98c6ad497c656224e9f55f8f3ba637eec7e62b82152ef0d16cbd4eca0a3094"},"schema_version":"1.0","source":{"id":"1608.05815","kind":"arxiv","version":2}},"canonical_sha256":"e30cf53dd44e71a60a516fc8f2e2caad273bad601f29a0912970a9165c37589a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e30cf53dd44e71a60a516fc8f2e2caad273bad601f29a0912970a9165c37589a","first_computed_at":"2026-05-18T00:51:22.494166Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:51:22.494166Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"neC4PDwGHesiSo4QFFDkSMRMRyHa7n0+b1Lgva5+9vFSLhrfSrVjuqVlpDAA3f3t6vCnBUzcGY/YCmQsPGe1Dw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:51:22.494864Z","signed_message":"canonical_sha256_bytes"},"source_id":"1608.05815","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ded3f8c96345f3e2cf9a25081f40fb7ae74d2068287670d1a4c97fa332749b18","sha256:f62a6c24fe60d458501052a97bf04616adde8bd49d1edf2ece91f03100451ce1"],"state_sha256":"f0ed50a050ed8a8af4038d89afaf306847445ce97694d876b1321c286917c791"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yyUCjJO9wHO+Lw4zWBMRvJ5EQ7+rvR2GG6p5lHThm9XmGupz5oyyHsBW5BuDZxZP3zvIUvq3kDRVafwSlLuDAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-01T11:00:01.765843Z","bundle_sha256":"67b2141ceb505749f58f1551f33aa95e097d84e3050ff4ee862f4a3e9c8a958b"}}