{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:4MGPKPOUJZY2MCSRN7EPFYWKVU","short_pith_number":"pith:4MGPKPOU","schema_version":"1.0","canonical_sha256":"e30cf53dd44e71a60a516fc8f2e2caad273bad601f29a0912970a9165c37589a","source":{"kind":"arxiv","id":"1608.05815","version":2},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1608.05815","created_at":"2026-05-18T00:51:22.494258+00:00"},{"alias_kind":"arxiv_version","alias_value":"1608.05815v2","created_at":"2026-05-18T00:51:22.494258+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.05815","created_at":"2026-05-18T00:51:22.494258+00:00"},{"alias_kind":"pith_short_12","alias_value":"4MGPKPOUJZY2","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_16","alias_value":"4MGPKPOUJZY2MCSR","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_8","alias_value":"4MGPKPOU","created_at":"2026-05-18T12:29:58.707656+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4MGPKPOUJZY2MCSRN7EPFYWKVU","json":"https://pith.science/pith/4MGPKPOUJZY2MCSRN7EPFYWKVU.json","graph_json":"https://pith.science/api/pith-number/4MGPKPOUJZY2MCSRN7EPFYWKVU/graph.json","events_json":"https://pith.science/api/pith-number/4MGPKPOUJZY2MCSRN7EPFYWKVU/events.json","paper":"https://pith.science/paper/4MGPKPOU"},"agent_actions":{"view_html":"https://pith.science/pith/4MGPKPOUJZY2MCSRN7EPFYWKVU","download_json":"https://pith.science/pith/4MGPKPOUJZY2MCSRN7EPFYWKVU.json","view_paper":"https://pith.science/paper/4MGPKPOU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1608.05815&json=true","fetch_graph":"https://pith.science/api/pith-number/4MGPKPOUJZY2MCSRN7EPFYWKVU/graph.json","fetch_events":"https://pith.science/api/pith-number/4MGPKPOUJZY2MCSRN7EPFYWKVU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4MGPKPOUJZY2MCSRN7EPFYWKVU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4MGPKPOUJZY2MCSRN7EPFYWKVU/action/storage_attestation","attest_author":"https://pith.science/pith/4MGPKPOUJZY2MCSRN7EPFYWKVU/action/author_attestation","sign_citation":"https://pith.science/pith/4MGPKPOUJZY2MCSRN7EPFYWKVU/action/citation_signature","submit_replication":"https://pith.science/pith/4MGPKPOUJZY2MCSRN7EPFYWKVU/action/replication_record"}},"created_at":"2026-05-18T00:51:22.494258+00:00","updated_at":"2026-05-18T00:51:22.494258+00:00"}