{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:4OXVE7V42MPYADO5NMCG3PZ6W7","short_pith_number":"pith:4OXVE7V4","schema_version":"1.0","canonical_sha256":"e3af527ebcd31f800ddd6b046dbf3eb7fc32356af14f34612142c3e2cf957307","source":{"kind":"arxiv","id":"1105.2322","version":1},"attestation_state":"computed","paper":{"title":"Optimal Multistage Sampling in a Boundary-Crossing Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"Jay Bartroff","submitted_at":"2011-05-11T21:08:00Z","abstract_excerpt":"Brownian motion with known positive drift is sampled in stages until it crosses a positive boundary $a$. A family of multistage samplers that control the expected overshoot over the boundary by varying the stage size at each stage is shown to be optimal for large $a$, minimizing a linear combination of overshoot and number of stages. Applications to hypothesis testing are discussed."},"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":"1105.2322","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2011-05-11T21:08:00Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"32fb4cd683a80c43f91919a012323e33f86140ed3f5cff943a6012e1769673d4","abstract_canon_sha256":"0acf99ce87fae348e29c5672ce4819da810d42d2d50a90781795ed728411daf5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:22:10.717166Z","signature_b64":"SGiRgqwY1PSfPySiqdGFUcxBtyJHU9iyFC6a6gnX2oA4kzP6jvLI1fy+6g0uOILEWqTeXZ2CkqZ3UsTOhtvZDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e3af527ebcd31f800ddd6b046dbf3eb7fc32356af14f34612142c3e2cf957307","last_reissued_at":"2026-05-18T04:22:10.716747Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:22:10.716747Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal Multistage Sampling in a Boundary-Crossing Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"Jay Bartroff","submitted_at":"2011-05-11T21:08:00Z","abstract_excerpt":"Brownian motion with known positive drift is sampled in stages until it crosses a positive boundary $a$. A family of multistage samplers that control the expected overshoot over the boundary by varying the stage size at each stage is shown to be optimal for large $a$, minimizing a linear combination of overshoot and number of stages. Applications to hypothesis testing are discussed."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.2322","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"1105.2322","created_at":"2026-05-18T04:22:10.716807+00:00"},{"alias_kind":"arxiv_version","alias_value":"1105.2322v1","created_at":"2026-05-18T04:22:10.716807+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.2322","created_at":"2026-05-18T04:22:10.716807+00:00"},{"alias_kind":"pith_short_12","alias_value":"4OXVE7V42MPY","created_at":"2026-05-18T12:26:20.644004+00:00"},{"alias_kind":"pith_short_16","alias_value":"4OXVE7V42MPYADO5","created_at":"2026-05-18T12:26:20.644004+00:00"},{"alias_kind":"pith_short_8","alias_value":"4OXVE7V4","created_at":"2026-05-18T12:26:20.644004+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4OXVE7V42MPYADO5NMCG3PZ6W7","json":"https://pith.science/pith/4OXVE7V42MPYADO5NMCG3PZ6W7.json","graph_json":"https://pith.science/api/pith-number/4OXVE7V42MPYADO5NMCG3PZ6W7/graph.json","events_json":"https://pith.science/api/pith-number/4OXVE7V42MPYADO5NMCG3PZ6W7/events.json","paper":"https://pith.science/paper/4OXVE7V4"},"agent_actions":{"view_html":"https://pith.science/pith/4OXVE7V42MPYADO5NMCG3PZ6W7","download_json":"https://pith.science/pith/4OXVE7V42MPYADO5NMCG3PZ6W7.json","view_paper":"https://pith.science/paper/4OXVE7V4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1105.2322&json=true","fetch_graph":"https://pith.science/api/pith-number/4OXVE7V42MPYADO5NMCG3PZ6W7/graph.json","fetch_events":"https://pith.science/api/pith-number/4OXVE7V42MPYADO5NMCG3PZ6W7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4OXVE7V42MPYADO5NMCG3PZ6W7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4OXVE7V42MPYADO5NMCG3PZ6W7/action/storage_attestation","attest_author":"https://pith.science/pith/4OXVE7V42MPYADO5NMCG3PZ6W7/action/author_attestation","sign_citation":"https://pith.science/pith/4OXVE7V42MPYADO5NMCG3PZ6W7/action/citation_signature","submit_replication":"https://pith.science/pith/4OXVE7V42MPYADO5NMCG3PZ6W7/action/replication_record"}},"created_at":"2026-05-18T04:22:10.716807+00:00","updated_at":"2026-05-18T04:22:10.716807+00:00"}