{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:6OB4S7Q36D4ROUYGCNQV343OZG","short_pith_number":"pith:6OB4S7Q3","schema_version":"1.0","canonical_sha256":"f383c97e1bf0f917530613615df36ec9a1f89ef93c904b1f17aed72e3882d61e","source":{"kind":"arxiv","id":"2111.08157","version":3},"attestation_state":"computed","paper":{"title":"Fine Stratification of Survey Experiments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.ST","stat.ME","stat.TH"],"primary_cat":"econ.EM","authors_text":"Max Cytrynbaum","submitted_at":"2021-11-16T00:42:28Z","abstract_excerpt":"This paper studies a two-stage model of experimentation, where the researcher first samples representative experimental participants from an eligible pool, then assigns each sampled unit to treatment or control, using matched $k$-tuples randomization at both stages. To implement such designs, we develop a fast new algorithm for matching units into $k$-tuples for any $k \\ge 2$ and any dimension of covariates. By surveying 200 recent experimental working papers, we estimate that our algorithm newly enables multivariate fine stratification with provable match quality guarantees for about 44\\% of "},"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":"2111.08157","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"econ.EM","submitted_at":"2021-11-16T00:42:28Z","cross_cats_sorted":["math.ST","stat.ME","stat.TH"],"title_canon_sha256":"4f3fdf5501ebcd64f8646eeeb45adaf2593952055f9bb59adbd149e86c3e7e0d","abstract_canon_sha256":"fb5ef2f16a5943da04c966007eb73908064a00d1c8998f86927ed44ea5c4bd8a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-12T01:09:02.832632Z","signature_b64":"RWH1tXTC1oO6oQg5YOIPknH7iCR2rBvJcUpDEJlj+itjHW0P9cfS0tOLhqP03hppvjUbF6XD62J0eboTC345AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f383c97e1bf0f917530613615df36ec9a1f89ef93c904b1f17aed72e3882d61e","last_reissued_at":"2026-06-12T01:09:02.831702Z","signature_status":"signed_v1","first_computed_at":"2026-06-12T01:09:02.831702Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fine Stratification of Survey Experiments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.ST","stat.ME","stat.TH"],"primary_cat":"econ.EM","authors_text":"Max Cytrynbaum","submitted_at":"2021-11-16T00:42:28Z","abstract_excerpt":"This paper studies a two-stage model of experimentation, where the researcher first samples representative experimental participants from an eligible pool, then assigns each sampled unit to treatment or control, using matched $k$-tuples randomization at both stages. To implement such designs, we develop a fast new algorithm for matching units into $k$-tuples for any $k \\ge 2$ and any dimension of covariates. By surveying 200 recent experimental working papers, we estimate that our algorithm newly enables multivariate fine stratification with provable match quality guarantees for about 44\\% of "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2111.08157","kind":"arxiv","version":3},"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/2111.08157/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":"2111.08157","created_at":"2026-06-12T01:09:02.831848+00:00"},{"alias_kind":"arxiv_version","alias_value":"2111.08157v3","created_at":"2026-06-12T01:09:02.831848+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2111.08157","created_at":"2026-06-12T01:09:02.831848+00:00"},{"alias_kind":"pith_short_12","alias_value":"6OB4S7Q36D4R","created_at":"2026-06-12T01:09:02.831848+00:00"},{"alias_kind":"pith_short_16","alias_value":"6OB4S7Q36D4ROUYG","created_at":"2026-06-12T01:09:02.831848+00:00"},{"alias_kind":"pith_short_8","alias_value":"6OB4S7Q3","created_at":"2026-06-12T01:09:02.831848+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"2205.02726","citing_title":"Asymptotic Efficiency Bounds for a Class of Experimental Designs","ref_index":8,"is_internal_anchor":true},{"citing_arxiv_id":"2604.09858","citing_title":"Coupling Designs for Randomized Experiments with Complex Treatments","ref_index":18,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6OB4S7Q36D4ROUYGCNQV343OZG","json":"https://pith.science/pith/6OB4S7Q36D4ROUYGCNQV343OZG.json","graph_json":"https://pith.science/api/pith-number/6OB4S7Q36D4ROUYGCNQV343OZG/graph.json","events_json":"https://pith.science/api/pith-number/6OB4S7Q36D4ROUYGCNQV343OZG/events.json","paper":"https://pith.science/paper/6OB4S7Q3"},"agent_actions":{"view_html":"https://pith.science/pith/6OB4S7Q36D4ROUYGCNQV343OZG","download_json":"https://pith.science/pith/6OB4S7Q36D4ROUYGCNQV343OZG.json","view_paper":"https://pith.science/paper/6OB4S7Q3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2111.08157&json=true","fetch_graph":"https://pith.science/api/pith-number/6OB4S7Q36D4ROUYGCNQV343OZG/graph.json","fetch_events":"https://pith.science/api/pith-number/6OB4S7Q36D4ROUYGCNQV343OZG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6OB4S7Q36D4ROUYGCNQV343OZG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6OB4S7Q36D4ROUYGCNQV343OZG/action/storage_attestation","attest_author":"https://pith.science/pith/6OB4S7Q36D4ROUYGCNQV343OZG/action/author_attestation","sign_citation":"https://pith.science/pith/6OB4S7Q36D4ROUYGCNQV343OZG/action/citation_signature","submit_replication":"https://pith.science/pith/6OB4S7Q36D4ROUYGCNQV343OZG/action/replication_record"}},"created_at":"2026-06-12T01:09:02.831848+00:00","updated_at":"2026-06-12T01:09:02.831848+00:00"}