{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:ACDI7UNN34NE6D3UZ6IH5AT3EE","short_pith_number":"pith:ACDI7UNN","canonical_record":{"source":{"id":"1604.08320","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2016-04-28T06:32:27Z","cross_cats_sorted":["math.OC","stat.CO","stat.ML"],"title_canon_sha256":"05d829570a642af6c29cf2b99452d11908c3b00f121b306b5c9b033643b8f4bc","abstract_canon_sha256":"9ae5c5c03a272136d151f733b7f767b810ab4687f3ea0fe5f73f7783d7316bef"},"schema_version":"1.0"},"canonical_sha256":"00868fd1addf1a4f0f74cf907e827b211538d18d83926f3b93b36ddce7c99704","source":{"kind":"arxiv","id":"1604.08320","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.08320","created_at":"2026-05-18T01:16:04Z"},{"alias_kind":"arxiv_version","alias_value":"1604.08320v1","created_at":"2026-05-18T01:16:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.08320","created_at":"2026-05-18T01:16:04Z"},{"alias_kind":"pith_short_12","alias_value":"ACDI7UNN34NE","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_16","alias_value":"ACDI7UNN34NE6D3U","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_8","alias_value":"ACDI7UNN","created_at":"2026-05-18T12:30:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:ACDI7UNN34NE6D3UZ6IH5AT3EE","target":"record","payload":{"canonical_record":{"source":{"id":"1604.08320","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2016-04-28T06:32:27Z","cross_cats_sorted":["math.OC","stat.CO","stat.ML"],"title_canon_sha256":"05d829570a642af6c29cf2b99452d11908c3b00f121b306b5c9b033643b8f4bc","abstract_canon_sha256":"9ae5c5c03a272136d151f733b7f767b810ab4687f3ea0fe5f73f7783d7316bef"},"schema_version":"1.0"},"canonical_sha256":"00868fd1addf1a4f0f74cf907e827b211538d18d83926f3b93b36ddce7c99704","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:16:04.317854Z","signature_b64":"u1grQfZfzCldtQRXI0L429OfbVN0XmxP6+OilqK7lS5NKaguEMP4RTyeJ3F2DYLCzrLh2/ni6aJatM2rCXZ8Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"00868fd1addf1a4f0f74cf907e827b211538d18d83926f3b93b36ddce7c99704","last_reissued_at":"2026-05-18T01:16:04.317103Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:16:04.317103Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1604.08320","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:16:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GLoZ5PzQiIwGOQ3lOu2BXOthMvcEhF3OtA/BbXu5mFzL+iNYJ2hMl+EraHqjX0uT8JCY38FCO8sUZSMXgT4xCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T17:00:14.358525Z"},"content_sha256":"3d7137901330bd3e041be5adeb60ca4ea913f3d0b84a99175f163fb71ed9e73c","schema_version":"1.0","event_id":"sha256:3d7137901330bd3e041be5adeb60ca4ea913f3d0b84a99175f163fb71ed9e73c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:ACDI7UNN34NE6D3UZ6IH5AT3EE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sequential Bayesian optimal experimental design via approximate dynamic programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC","stat.CO","stat.ML"],"primary_cat":"stat.ME","authors_text":"Xun Huan, Youssef M. Marzouk","submitted_at":"2016-04-28T06:32:27Z","abstract_excerpt":"The design of multiple experiments is commonly undertaken via suboptimal strategies, such as batch (open-loop) design that omits feedback or greedy (myopic) design that does not account for future effects. This paper introduces new strategies for the optimal design of sequential experiments. First, we rigorously formulate the general sequential optimal experimental design (sOED) problem as a dynamic program. Batch and greedy designs are shown to result from special cases of this formulation. We then focus on sOED for parameter inference, adopting a Bayesian formulation with an information theo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.08320","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:16:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6cZ5q0h17p58Op//yR03P0h+rd9zJ+fDoimalfSoBUTtYFtyeCUI5FueqN028WjqHyEPKT3zG9YoWyBi0PoHAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T17:00:14.358964Z"},"content_sha256":"b74c9c880241c97bab2e3d2f00b44b24fd7f88d5770f1fde19404bb12af6ce00","schema_version":"1.0","event_id":"sha256:b74c9c880241c97bab2e3d2f00b44b24fd7f88d5770f1fde19404bb12af6ce00"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ACDI7UNN34NE6D3UZ6IH5AT3EE/bundle.json","state_url":"https://pith.science/pith/ACDI7UNN34NE6D3UZ6IH5AT3EE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ACDI7UNN34NE6D3UZ6IH5AT3EE/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-05-21T17:00:14Z","links":{"resolver":"https://pith.science/pith/ACDI7UNN34NE6D3UZ6IH5AT3EE","bundle":"https://pith.science/pith/ACDI7UNN34NE6D3UZ6IH5AT3EE/bundle.json","state":"https://pith.science/pith/ACDI7UNN34NE6D3UZ6IH5AT3EE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ACDI7UNN34NE6D3UZ6IH5AT3EE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:ACDI7UNN34NE6D3UZ6IH5AT3EE","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":"9ae5c5c03a272136d151f733b7f767b810ab4687f3ea0fe5f73f7783d7316bef","cross_cats_sorted":["math.OC","stat.CO","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2016-04-28T06:32:27Z","title_canon_sha256":"05d829570a642af6c29cf2b99452d11908c3b00f121b306b5c9b033643b8f4bc"},"schema_version":"1.0","source":{"id":"1604.08320","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.08320","created_at":"2026-05-18T01:16:04Z"},{"alias_kind":"arxiv_version","alias_value":"1604.08320v1","created_at":"2026-05-18T01:16:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.08320","created_at":"2026-05-18T01:16:04Z"},{"alias_kind":"pith_short_12","alias_value":"ACDI7UNN34NE","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_16","alias_value":"ACDI7UNN34NE6D3U","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_8","alias_value":"ACDI7UNN","created_at":"2026-05-18T12:30:07Z"}],"graph_snapshots":[{"event_id":"sha256:b74c9c880241c97bab2e3d2f00b44b24fd7f88d5770f1fde19404bb12af6ce00","target":"graph","created_at":"2026-05-18T01:16:04Z","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 design of multiple experiments is commonly undertaken via suboptimal strategies, such as batch (open-loop) design that omits feedback or greedy (myopic) design that does not account for future effects. This paper introduces new strategies for the optimal design of sequential experiments. First, we rigorously formulate the general sequential optimal experimental design (sOED) problem as a dynamic program. Batch and greedy designs are shown to result from special cases of this formulation. We then focus on sOED for parameter inference, adopting a Bayesian formulation with an information theo","authors_text":"Xun Huan, Youssef M. Marzouk","cross_cats":["math.OC","stat.CO","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2016-04-28T06:32:27Z","title":"Sequential Bayesian optimal experimental design via approximate dynamic programming"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.08320","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:3d7137901330bd3e041be5adeb60ca4ea913f3d0b84a99175f163fb71ed9e73c","target":"record","created_at":"2026-05-18T01:16:04Z","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":"9ae5c5c03a272136d151f733b7f767b810ab4687f3ea0fe5f73f7783d7316bef","cross_cats_sorted":["math.OC","stat.CO","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2016-04-28T06:32:27Z","title_canon_sha256":"05d829570a642af6c29cf2b99452d11908c3b00f121b306b5c9b033643b8f4bc"},"schema_version":"1.0","source":{"id":"1604.08320","kind":"arxiv","version":1}},"canonical_sha256":"00868fd1addf1a4f0f74cf907e827b211538d18d83926f3b93b36ddce7c99704","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"00868fd1addf1a4f0f74cf907e827b211538d18d83926f3b93b36ddce7c99704","first_computed_at":"2026-05-18T01:16:04.317103Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:16:04.317103Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"u1grQfZfzCldtQRXI0L429OfbVN0XmxP6+OilqK7lS5NKaguEMP4RTyeJ3F2DYLCzrLh2/ni6aJatM2rCXZ8Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:16:04.317854Z","signed_message":"canonical_sha256_bytes"},"source_id":"1604.08320","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3d7137901330bd3e041be5adeb60ca4ea913f3d0b84a99175f163fb71ed9e73c","sha256:b74c9c880241c97bab2e3d2f00b44b24fd7f88d5770f1fde19404bb12af6ce00"],"state_sha256":"383087092e4dbccd556ce0a44204de39cb263ecebdf8b8184425084722bcf486"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IEkIAEoW+niifUceZ92fGhQwDwI2eLQFPq8rCP9LmGE6t1bRCiYmFhWqBqDkP7V2IF1zy0gwuKXWlkglQ3ZpDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-21T17:00:14.361910Z","bundle_sha256":"8325e7dd7cc4115a958df98e98d1081518a0db12bd0491048f043ae5ea9443d8"}}