{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:EQVP3M3P5COJCI4ZTQIEMZ4OI4","short_pith_number":"pith:EQVP3M3P","schema_version":"1.0","canonical_sha256":"242afdb36fe89c9123999c1046678e4734b71681e1f2aefedd09c928401e1104","source":{"kind":"arxiv","id":"2303.11582","version":4},"attestation_state":"computed","paper":{"title":"Adaptive Experimentation at Scale: A Computational Framework for Flexible Batches","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Ethan Che, Hongseok Namkoong","submitted_at":"2023-03-21T04:17:03Z","abstract_excerpt":"Standard bandit algorithms that assume continual reallocation of measurement effort are challenging to implement due to delayed feedback and infrastructural/organizational difficulties. Motivated by practical instances involving a handful of reallocation epochs in which outcomes are measured in batches, we develop a computation-driven adaptive experimentation framework that can flexibly handle batching. Our main observation is that normal approximations, which are universal in statistical inference, can also guide the design of adaptive algorithms. By deriving a Gaussian sequential 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":"2303.11582","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-03-21T04:17:03Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"d8ae4f73295c39964620bd0d2ac79aa8310e504b5db5d1033da5943278d7aa98","abstract_canon_sha256":"1fe59ec2e78758ed86729e050d65d8ddd8c04ff01625e9d4a00a6a23311fd37d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:41:13.986230Z","signature_b64":"VrEnD6XsMqUXGrwWDM4EpG3ygmx/1DC3D1NPSM/uoPrOZBrvF/QTPqO+VLKgbXEGdhZ4QmLxpSrbh+a3nnViDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"242afdb36fe89c9123999c1046678e4734b71681e1f2aefedd09c928401e1104","last_reissued_at":"2026-07-05T06:41:13.985787Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:41:13.985787Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Adaptive Experimentation at Scale: A Computational Framework for Flexible Batches","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Ethan Che, Hongseok Namkoong","submitted_at":"2023-03-21T04:17:03Z","abstract_excerpt":"Standard bandit algorithms that assume continual reallocation of measurement effort are challenging to implement due to delayed feedback and infrastructural/organizational difficulties. Motivated by practical instances involving a handful of reallocation epochs in which outcomes are measured in batches, we develop a computation-driven adaptive experimentation framework that can flexibly handle batching. Our main observation is that normal approximations, which are universal in statistical inference, can also guide the design of adaptive algorithms. By deriving a Gaussian sequential experiment,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2303.11582","kind":"arxiv","version":4},"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/2303.11582/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":"2303.11582","created_at":"2026-07-05T06:41:13.985845+00:00"},{"alias_kind":"arxiv_version","alias_value":"2303.11582v4","created_at":"2026-07-05T06:41:13.985845+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2303.11582","created_at":"2026-07-05T06:41:13.985845+00:00"},{"alias_kind":"pith_short_12","alias_value":"EQVP3M3P5COJ","created_at":"2026-07-05T06:41:13.985845+00:00"},{"alias_kind":"pith_short_16","alias_value":"EQVP3M3P5COJCI4Z","created_at":"2026-07-05T06:41:13.985845+00:00"},{"alias_kind":"pith_short_8","alias_value":"EQVP3M3P","created_at":"2026-07-05T06:41:13.985845+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.13531","citing_title":"When Representative Samples Produce Worse Outcomes: Scale-up Decisions and Testing in Small-Budget RCTs","ref_index":67,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EQVP3M3P5COJCI4ZTQIEMZ4OI4","json":"https://pith.science/pith/EQVP3M3P5COJCI4ZTQIEMZ4OI4.json","graph_json":"https://pith.science/api/pith-number/EQVP3M3P5COJCI4ZTQIEMZ4OI4/graph.json","events_json":"https://pith.science/api/pith-number/EQVP3M3P5COJCI4ZTQIEMZ4OI4/events.json","paper":"https://pith.science/paper/EQVP3M3P"},"agent_actions":{"view_html":"https://pith.science/pith/EQVP3M3P5COJCI4ZTQIEMZ4OI4","download_json":"https://pith.science/pith/EQVP3M3P5COJCI4ZTQIEMZ4OI4.json","view_paper":"https://pith.science/paper/EQVP3M3P","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2303.11582&json=true","fetch_graph":"https://pith.science/api/pith-number/EQVP3M3P5COJCI4ZTQIEMZ4OI4/graph.json","fetch_events":"https://pith.science/api/pith-number/EQVP3M3P5COJCI4ZTQIEMZ4OI4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EQVP3M3P5COJCI4ZTQIEMZ4OI4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EQVP3M3P5COJCI4ZTQIEMZ4OI4/action/storage_attestation","attest_author":"https://pith.science/pith/EQVP3M3P5COJCI4ZTQIEMZ4OI4/action/author_attestation","sign_citation":"https://pith.science/pith/EQVP3M3P5COJCI4ZTQIEMZ4OI4/action/citation_signature","submit_replication":"https://pith.science/pith/EQVP3M3P5COJCI4ZTQIEMZ4OI4/action/replication_record"}},"created_at":"2026-07-05T06:41:13.985845+00:00","updated_at":"2026-07-05T06:41:13.985845+00:00"}