{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:L7T3G5PYY3UNG5DW7MBFDXDHO3","short_pith_number":"pith:L7T3G5PY","schema_version":"1.0","canonical_sha256":"5fe7b375f8c6e8d37476fb0251dc6776e175d537cc8607b81cd8baf0370c101a","source":{"kind":"arxiv","id":"1911.03764","version":6},"attestation_state":"computed","paper":{"title":"Optimal Experimental Design for Staggered Rollouts","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ME","stat.ML"],"primary_cat":"econ.EM","authors_text":"Guido Imbens, Mohsen Bayati, Ruoxuan Xiong, Susan Athey","submitted_at":"2019-11-09T19:46:29Z","abstract_excerpt":"In this paper, we study the design and analysis of experiments conducted on a set of units over multiple time periods where the starting time of the treatment may vary by unit. The design problem involves selecting an initial treatment time for each unit in order to most precisely estimate both the instantaneous and cumulative effects of the treatment. We first consider non-adaptive experiments, where all treatment assignment decisions are made prior to the start of the experiment. For this case, we show that the optimization problem is generally NP-hard, and we propose a near-optimal solution"},"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":"1911.03764","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"econ.EM","submitted_at":"2019-11-09T19:46:29Z","cross_cats_sorted":["stat.ME","stat.ML"],"title_canon_sha256":"ae7cf83ae33d92bd60e20aa1e32623c9294c16eb8eef59c173d601e2e46ac3f4","abstract_canon_sha256":"38826fb5439fd7aca28728bd73397f8382b0b9a08779dc450acf17ee2de53c12"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:54:10.348704Z","signature_b64":"VcuL8uuzOWMT+zLXlHtSbPsjuXXVY22iAKfvBn5/bUQsQqt24+/kwq/E9V/0wNxQ/Iq3dmC/3k9Z2nBD5zqjDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5fe7b375f8c6e8d37476fb0251dc6776e175d537cc8607b81cd8baf0370c101a","last_reissued_at":"2026-07-05T06:54:10.348102Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:54:10.348102Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal Experimental Design for Staggered Rollouts","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ME","stat.ML"],"primary_cat":"econ.EM","authors_text":"Guido Imbens, Mohsen Bayati, Ruoxuan Xiong, Susan Athey","submitted_at":"2019-11-09T19:46:29Z","abstract_excerpt":"In this paper, we study the design and analysis of experiments conducted on a set of units over multiple time periods where the starting time of the treatment may vary by unit. The design problem involves selecting an initial treatment time for each unit in order to most precisely estimate both the instantaneous and cumulative effects of the treatment. We first consider non-adaptive experiments, where all treatment assignment decisions are made prior to the start of the experiment. For this case, we show that the optimization problem is generally NP-hard, and we propose a near-optimal solution"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1911.03764","kind":"arxiv","version":6},"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/1911.03764/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":"1911.03764","created_at":"2026-07-05T06:54:10.348173+00:00"},{"alias_kind":"arxiv_version","alias_value":"1911.03764v6","created_at":"2026-07-05T06:54:10.348173+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1911.03764","created_at":"2026-07-05T06:54:10.348173+00:00"},{"alias_kind":"pith_short_12","alias_value":"L7T3G5PYY3UN","created_at":"2026-07-05T06:54:10.348173+00:00"},{"alias_kind":"pith_short_16","alias_value":"L7T3G5PYY3UNG5DW","created_at":"2026-07-05T06:54:10.348173+00:00"},{"alias_kind":"pith_short_8","alias_value":"L7T3G5PY","created_at":"2026-07-05T06:54:10.348173+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.29641","citing_title":"Experimentation for Different Scheduling Policies on Queues: Mixed Differences-in-Q Estimators Based on Little's Law","ref_index":8,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/L7T3G5PYY3UNG5DW7MBFDXDHO3","json":"https://pith.science/pith/L7T3G5PYY3UNG5DW7MBFDXDHO3.json","graph_json":"https://pith.science/api/pith-number/L7T3G5PYY3UNG5DW7MBFDXDHO3/graph.json","events_json":"https://pith.science/api/pith-number/L7T3G5PYY3UNG5DW7MBFDXDHO3/events.json","paper":"https://pith.science/paper/L7T3G5PY"},"agent_actions":{"view_html":"https://pith.science/pith/L7T3G5PYY3UNG5DW7MBFDXDHO3","download_json":"https://pith.science/pith/L7T3G5PYY3UNG5DW7MBFDXDHO3.json","view_paper":"https://pith.science/paper/L7T3G5PY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1911.03764&json=true","fetch_graph":"https://pith.science/api/pith-number/L7T3G5PYY3UNG5DW7MBFDXDHO3/graph.json","fetch_events":"https://pith.science/api/pith-number/L7T3G5PYY3UNG5DW7MBFDXDHO3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/L7T3G5PYY3UNG5DW7MBFDXDHO3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/L7T3G5PYY3UNG5DW7MBFDXDHO3/action/storage_attestation","attest_author":"https://pith.science/pith/L7T3G5PYY3UNG5DW7MBFDXDHO3/action/author_attestation","sign_citation":"https://pith.science/pith/L7T3G5PYY3UNG5DW7MBFDXDHO3/action/citation_signature","submit_replication":"https://pith.science/pith/L7T3G5PYY3UNG5DW7MBFDXDHO3/action/replication_record"}},"created_at":"2026-07-05T06:54:10.348173+00:00","updated_at":"2026-07-05T06:54:10.348173+00:00"}