{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:LLDTDSXD73FZTHB4QNGR3K43GL","short_pith_number":"pith:LLDTDSXD","schema_version":"1.0","canonical_sha256":"5ac731cae3fecb999c3c834d1dab9b32d8ff845cdc035490991ac12410ddb86a","source":{"kind":"arxiv","id":"1806.05127","version":7},"attestation_state":"computed","paper":{"title":"Stratification Trees for Adaptive Randomization in Randomized Controlled Trials","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ME"],"primary_cat":"econ.EM","authors_text":"Max Tabord-Meehan","submitted_at":"2018-06-13T16:03:00Z","abstract_excerpt":"This paper proposes an adaptive randomization procedure for two-stage randomized controlled trials. The method uses data from a first-wave experiment in order to determine how to stratify in a second wave of the experiment, where the objective is to minimize the variance of an estimator for the average treatment effect (ATE). We consider selection from a class of stratified randomization procedures which we call stratification trees: these are procedures whose strata can be represented as decision trees, with differing treatment assignment probabilities across strata. By using the first wave t"},"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":"1806.05127","kind":"arxiv","version":7},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"econ.EM","submitted_at":"2018-06-13T16:03:00Z","cross_cats_sorted":["stat.ME"],"title_canon_sha256":"fd7967eed2180d51238ba00aa4adcaf2f491546af093b6a2cbfc57b3bc17c2e6","abstract_canon_sha256":"735ae5f0f9b4ddd97a6db9b91d64749cb497cbaf6e1a5e268dd8d612641d2cb5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:37:14.060108Z","signature_b64":"NXj+mZx3gIUQQ/LYAzidferZ8zKE5XR8UyRsxf4YYTX55KNEjsuCRzTDaSPZ89C3sDVxupANmbzSVK7EYJTyAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5ac731cae3fecb999c3c834d1dab9b32d8ff845cdc035490991ac12410ddb86a","last_reissued_at":"2026-07-05T04:37:14.059682Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:37:14.059682Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Stratification Trees for Adaptive Randomization in Randomized Controlled Trials","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ME"],"primary_cat":"econ.EM","authors_text":"Max Tabord-Meehan","submitted_at":"2018-06-13T16:03:00Z","abstract_excerpt":"This paper proposes an adaptive randomization procedure for two-stage randomized controlled trials. The method uses data from a first-wave experiment in order to determine how to stratify in a second wave of the experiment, where the objective is to minimize the variance of an estimator for the average treatment effect (ATE). We consider selection from a class of stratified randomization procedures which we call stratification trees: these are procedures whose strata can be represented as decision trees, with differing treatment assignment probabilities across strata. By using the first wave t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.05127","kind":"arxiv","version":7},"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/1806.05127/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":"1806.05127","created_at":"2026-07-05T04:37:14.059735+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.05127v7","created_at":"2026-07-05T04:37:14.059735+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.05127","created_at":"2026-07-05T04:37:14.059735+00:00"},{"alias_kind":"pith_short_12","alias_value":"LLDTDSXD73FZ","created_at":"2026-07-05T04:37:14.059735+00:00"},{"alias_kind":"pith_short_16","alias_value":"LLDTDSXD73FZTHB4","created_at":"2026-07-05T04:37:14.059735+00:00"},{"alias_kind":"pith_short_8","alias_value":"LLDTDSXD","created_at":"2026-07-05T04:37:14.059735+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2205.02726","citing_title":"Asymptotic Efficiency Bounds for a Class of Experimental Designs","ref_index":17,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LLDTDSXD73FZTHB4QNGR3K43GL","json":"https://pith.science/pith/LLDTDSXD73FZTHB4QNGR3K43GL.json","graph_json":"https://pith.science/api/pith-number/LLDTDSXD73FZTHB4QNGR3K43GL/graph.json","events_json":"https://pith.science/api/pith-number/LLDTDSXD73FZTHB4QNGR3K43GL/events.json","paper":"https://pith.science/paper/LLDTDSXD"},"agent_actions":{"view_html":"https://pith.science/pith/LLDTDSXD73FZTHB4QNGR3K43GL","download_json":"https://pith.science/pith/LLDTDSXD73FZTHB4QNGR3K43GL.json","view_paper":"https://pith.science/paper/LLDTDSXD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.05127&json=true","fetch_graph":"https://pith.science/api/pith-number/LLDTDSXD73FZTHB4QNGR3K43GL/graph.json","fetch_events":"https://pith.science/api/pith-number/LLDTDSXD73FZTHB4QNGR3K43GL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LLDTDSXD73FZTHB4QNGR3K43GL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LLDTDSXD73FZTHB4QNGR3K43GL/action/storage_attestation","attest_author":"https://pith.science/pith/LLDTDSXD73FZTHB4QNGR3K43GL/action/author_attestation","sign_citation":"https://pith.science/pith/LLDTDSXD73FZTHB4QNGR3K43GL/action/citation_signature","submit_replication":"https://pith.science/pith/LLDTDSXD73FZTHB4QNGR3K43GL/action/replication_record"}},"created_at":"2026-07-05T04:37:14.059735+00:00","updated_at":"2026-07-05T04:37:14.059735+00:00"}