{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:D5C4XUOZW4EIDIBGZVF635ROKM","short_pith_number":"pith:D5C4XUOZ","canonical_record":{"source":{"id":"1509.00980","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-09-03T08:27:20Z","cross_cats_sorted":["q-fin.CP","stat.CO"],"title_canon_sha256":"e9a9e08433ca3b6e52dd3b04895cf5707269dbe5413ac3063f19d38beb99eb45","abstract_canon_sha256":"ffc906888a85680de600b4220596e58a5fe76f864bbf90a051a6fdcd1c9c4be2"},"schema_version":"1.0"},"canonical_sha256":"1f45cbd1d9b70881a026cd4bedf62e53269cd0908e35efb2a82f857b72028bf7","source":{"kind":"arxiv","id":"1509.00980","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.00980","created_at":"2026-05-18T00:32:55Z"},{"alias_kind":"arxiv_version","alias_value":"1509.00980v2","created_at":"2026-05-18T00:32:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.00980","created_at":"2026-05-18T00:32:55Z"},{"alias_kind":"pith_short_12","alias_value":"D5C4XUOZW4EI","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"D5C4XUOZW4EIDIBG","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"D5C4XUOZ","created_at":"2026-05-18T12:29:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:D5C4XUOZW4EIDIBGZVF635ROKM","target":"record","payload":{"canonical_record":{"source":{"id":"1509.00980","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-09-03T08:27:20Z","cross_cats_sorted":["q-fin.CP","stat.CO"],"title_canon_sha256":"e9a9e08433ca3b6e52dd3b04895cf5707269dbe5413ac3063f19d38beb99eb45","abstract_canon_sha256":"ffc906888a85680de600b4220596e58a5fe76f864bbf90a051a6fdcd1c9c4be2"},"schema_version":"1.0"},"canonical_sha256":"1f45cbd1d9b70881a026cd4bedf62e53269cd0908e35efb2a82f857b72028bf7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:32:55.714831Z","signature_b64":"hXUMLFyKUVCuulRa7lRGJdhq+VHDn92z9e0e6kGfRXff0yAK+/b9stW4qgC6hUPwW0uQ4bYKg1LoG2263xylAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1f45cbd1d9b70881a026cd4bedf62e53269cd0908e35efb2a82f857b72028bf7","last_reissued_at":"2026-05-18T00:32:55.714288Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:32:55.714288Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1509.00980","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:32:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"krKJ+bbdnoRb59cBoE76j6apb0CAN++zIr9TBHBrgV697EbSLNPr4XEoX39H1CuuBQ6QOB+4alObYi+mrRcdBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T17:12:16.086842Z"},"content_sha256":"6ef500e7fd410cfc468e4d9c3d6e3c4153f84cb077dabcc57b34053d1354bcca","schema_version":"1.0","event_id":"sha256:6ef500e7fd410cfc468e4d9c3d6e3c4153f84cb077dabcc57b34053d1354bcca"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:D5C4XUOZW4EIDIBGZVF635ROKM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sequential Design for Ranking Response Surfaces","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["q-fin.CP","stat.CO"],"primary_cat":"stat.ML","authors_text":"Mike Ludkovski, Ruimeng Hu","submitted_at":"2015-09-03T08:27:20Z","abstract_excerpt":"We propose and analyze sequential design methods for the problem of ranking several response surfaces. Namely, given $L \\ge 2$ response surfaces over a continuous input space $\\cal X$, the aim is to efficiently find the index of the minimal response across the entire $\\cal X$. The response surfaces are not known and have to be noisily sampled one-at-a-time. This setting is motivated by stochastic control applications and requires joint experimental design both in space and response-index dimensions. To generate sequential design heuristics we investigate stepwise uncertainty reduction approach"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.00980","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:32:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"X65+7NR9M8iuDOgP8dbzmeSlAP5WePHaBfTD6JFPVkGpoyZaTvU7tRJwK4gvnr7f+7d1AJGD9PXqaIJDuRGBBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T17:12:16.087184Z"},"content_sha256":"2adf8099010bba595653d0a3e6a32326b63ee4faccb0b1accca0d7b4f8a0a838","schema_version":"1.0","event_id":"sha256:2adf8099010bba595653d0a3e6a32326b63ee4faccb0b1accca0d7b4f8a0a838"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/D5C4XUOZW4EIDIBGZVF635ROKM/bundle.json","state_url":"https://pith.science/pith/D5C4XUOZW4EIDIBGZVF635ROKM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/D5C4XUOZW4EIDIBGZVF635ROKM/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-22T17:12:16Z","links":{"resolver":"https://pith.science/pith/D5C4XUOZW4EIDIBGZVF635ROKM","bundle":"https://pith.science/pith/D5C4XUOZW4EIDIBGZVF635ROKM/bundle.json","state":"https://pith.science/pith/D5C4XUOZW4EIDIBGZVF635ROKM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/D5C4XUOZW4EIDIBGZVF635ROKM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:D5C4XUOZW4EIDIBGZVF635ROKM","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":"ffc906888a85680de600b4220596e58a5fe76f864bbf90a051a6fdcd1c9c4be2","cross_cats_sorted":["q-fin.CP","stat.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-09-03T08:27:20Z","title_canon_sha256":"e9a9e08433ca3b6e52dd3b04895cf5707269dbe5413ac3063f19d38beb99eb45"},"schema_version":"1.0","source":{"id":"1509.00980","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.00980","created_at":"2026-05-18T00:32:55Z"},{"alias_kind":"arxiv_version","alias_value":"1509.00980v2","created_at":"2026-05-18T00:32:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.00980","created_at":"2026-05-18T00:32:55Z"},{"alias_kind":"pith_short_12","alias_value":"D5C4XUOZW4EI","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"D5C4XUOZW4EIDIBG","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"D5C4XUOZ","created_at":"2026-05-18T12:29:17Z"}],"graph_snapshots":[{"event_id":"sha256:2adf8099010bba595653d0a3e6a32326b63ee4faccb0b1accca0d7b4f8a0a838","target":"graph","created_at":"2026-05-18T00:32:55Z","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":"We propose and analyze sequential design methods for the problem of ranking several response surfaces. Namely, given $L \\ge 2$ response surfaces over a continuous input space $\\cal X$, the aim is to efficiently find the index of the minimal response across the entire $\\cal X$. The response surfaces are not known and have to be noisily sampled one-at-a-time. This setting is motivated by stochastic control applications and requires joint experimental design both in space and response-index dimensions. To generate sequential design heuristics we investigate stepwise uncertainty reduction approach","authors_text":"Mike Ludkovski, Ruimeng Hu","cross_cats":["q-fin.CP","stat.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-09-03T08:27:20Z","title":"Sequential Design for Ranking Response Surfaces"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.00980","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:6ef500e7fd410cfc468e4d9c3d6e3c4153f84cb077dabcc57b34053d1354bcca","target":"record","created_at":"2026-05-18T00:32:55Z","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":"ffc906888a85680de600b4220596e58a5fe76f864bbf90a051a6fdcd1c9c4be2","cross_cats_sorted":["q-fin.CP","stat.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-09-03T08:27:20Z","title_canon_sha256":"e9a9e08433ca3b6e52dd3b04895cf5707269dbe5413ac3063f19d38beb99eb45"},"schema_version":"1.0","source":{"id":"1509.00980","kind":"arxiv","version":2}},"canonical_sha256":"1f45cbd1d9b70881a026cd4bedf62e53269cd0908e35efb2a82f857b72028bf7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1f45cbd1d9b70881a026cd4bedf62e53269cd0908e35efb2a82f857b72028bf7","first_computed_at":"2026-05-18T00:32:55.714288Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:32:55.714288Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hXUMLFyKUVCuulRa7lRGJdhq+VHDn92z9e0e6kGfRXff0yAK+/b9stW4qgC6hUPwW0uQ4bYKg1LoG2263xylAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:32:55.714831Z","signed_message":"canonical_sha256_bytes"},"source_id":"1509.00980","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6ef500e7fd410cfc468e4d9c3d6e3c4153f84cb077dabcc57b34053d1354bcca","sha256:2adf8099010bba595653d0a3e6a32326b63ee4faccb0b1accca0d7b4f8a0a838"],"state_sha256":"17362e047d560a992867a4f80bc1edd445e4d49b6332e080dba580387d6ef9a2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iSNAk/2EiMqFPY56hWCcowyY+G+e/5aqu0OZac5YqoT1zMrD0FFQhGTRQ2o7f8USQv4J8mqIqv6H2Y7EaCP2Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T17:12:16.089126Z","bundle_sha256":"bf5077860b1002fc515589f8a752a9a2e98d65afe0cffbb906d933b9b6d17989"}}