{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:FY4FRGKGC3IMF3N65GXEOMXLRI","short_pith_number":"pith:FY4FRGKG","schema_version":"1.0","canonical_sha256":"2e3858994616d0c2edbee9ae4732eb8a20175343871158ce8e4fcaff83229711","source":{"kind":"arxiv","id":"2408.04570","version":2},"attestation_state":"computed","paper":{"title":"Optimization-Driven Adaptive Experimentation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Daniel R. Jiang, Ethan Che, Hongseok Namkoong, Jimmy Wang","submitted_at":"2024-08-08T16:29:09Z","abstract_excerpt":"Real-world experiments involve batched & delayed feedback, non-stationarity, multiple objectives & constraints, and (often some) personalization. Tailoring adaptive methods to address these challenges on a per-problem basis is infeasible, and static designs remain the de facto standard. Focusing on short-horizon ($\\le 10$) adaptive experiments, we move away from bespoke algorithms and present a mathematical programming formulation that can flexibly incorporate a wide range of objectives, constraints, and statistical procedures. We formulating a dynamic program based on central limit approximat"},"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":"2408.04570","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-08-08T16:29:09Z","cross_cats_sorted":[],"title_canon_sha256":"67ae55311d4f9922305c56bd7a34b9242ae5a82a7d861007169459a3ef0b27ae","abstract_canon_sha256":"d977377942e5d6a7849a904d4127a7c0d980f1cbf8121fb1e76946a0ee9723e4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:32:47.490681Z","signature_b64":"5mm/7Z/lMveKBbLF7F338EGftHheUpCD2QJO60g7J0w7RTCOQlrW6RpRBfkVoXfMnCS1AqOoq9dEbLpXXfQjDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2e3858994616d0c2edbee9ae4732eb8a20175343871158ce8e4fcaff83229711","last_reissued_at":"2026-07-05T09:32:47.490160Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:32:47.490160Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimization-Driven Adaptive Experimentation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Daniel R. Jiang, Ethan Che, Hongseok Namkoong, Jimmy Wang","submitted_at":"2024-08-08T16:29:09Z","abstract_excerpt":"Real-world experiments involve batched & delayed feedback, non-stationarity, multiple objectives & constraints, and (often some) personalization. Tailoring adaptive methods to address these challenges on a per-problem basis is infeasible, and static designs remain the de facto standard. Focusing on short-horizon ($\\le 10$) adaptive experiments, we move away from bespoke algorithms and present a mathematical programming formulation that can flexibly incorporate a wide range of objectives, constraints, and statistical procedures. We formulating a dynamic program based on central limit approximat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.04570","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2408.04570/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2408.04570","created_at":"2026-07-05T09:32:47.490222+00:00"},{"alias_kind":"arxiv_version","alias_value":"2408.04570v2","created_at":"2026-07-05T09:32:47.490222+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.04570","created_at":"2026-07-05T09:32:47.490222+00:00"},{"alias_kind":"pith_short_12","alias_value":"FY4FRGKGC3IM","created_at":"2026-07-05T09:32:47.490222+00:00"},{"alias_kind":"pith_short_16","alias_value":"FY4FRGKGC3IMF3N6","created_at":"2026-07-05T09:32:47.490222+00:00"},{"alias_kind":"pith_short_8","alias_value":"FY4FRGKG","created_at":"2026-07-05T09:32:47.490222+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.03324","citing_title":"Optimization of Epsilon-Greedy Exploration","ref_index":4,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FY4FRGKGC3IMF3N65GXEOMXLRI","json":"https://pith.science/pith/FY4FRGKGC3IMF3N65GXEOMXLRI.json","graph_json":"https://pith.science/api/pith-number/FY4FRGKGC3IMF3N65GXEOMXLRI/graph.json","events_json":"https://pith.science/api/pith-number/FY4FRGKGC3IMF3N65GXEOMXLRI/events.json","paper":"https://pith.science/paper/FY4FRGKG"},"agent_actions":{"view_html":"https://pith.science/pith/FY4FRGKGC3IMF3N65GXEOMXLRI","download_json":"https://pith.science/pith/FY4FRGKGC3IMF3N65GXEOMXLRI.json","view_paper":"https://pith.science/paper/FY4FRGKG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2408.04570&json=true","fetch_graph":"https://pith.science/api/pith-number/FY4FRGKGC3IMF3N65GXEOMXLRI/graph.json","fetch_events":"https://pith.science/api/pith-number/FY4FRGKGC3IMF3N65GXEOMXLRI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FY4FRGKGC3IMF3N65GXEOMXLRI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FY4FRGKGC3IMF3N65GXEOMXLRI/action/storage_attestation","attest_author":"https://pith.science/pith/FY4FRGKGC3IMF3N65GXEOMXLRI/action/author_attestation","sign_citation":"https://pith.science/pith/FY4FRGKGC3IMF3N65GXEOMXLRI/action/citation_signature","submit_replication":"https://pith.science/pith/FY4FRGKGC3IMF3N65GXEOMXLRI/action/replication_record"}},"created_at":"2026-07-05T09:32:47.490222+00:00","updated_at":"2026-07-05T09:32:47.490222+00:00"}