{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:VHMLSXIRACN6NWJ4UFKV5TYH26","short_pith_number":"pith:VHMLSXIR","schema_version":"1.0","canonical_sha256":"a9d8b95d11009be6d93ca1555ecf07d787c8f51c07b4ea76598e4b0e75010eb0","source":{"kind":"arxiv","id":"1110.0902","version":2},"attestation_state":"computed","paper":{"title":"Nearly Minimax One-Sided Mixture-Based Sequential Tests","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ME","stat.TH"],"primary_cat":"math.ST","authors_text":"Alexander G. Tartakovsky, Georgios Fellouris","submitted_at":"2011-10-05T06:14:13Z","abstract_excerpt":"We focus on one-sided, mixture-based stopping rules for the problem of sequential testing a simple null hypothesis against a composite alternative. For the latter, we consider two cases---either a discrete alternative or a continuous alternative that can be embedded into an exponential family. For each case, we find a mixture-based stopping rule that is nearly minimax in the sense of minimizing the maximal Kullback-Leibler information. The proof of this result is based on finding an almost Bayes rule for an appropriate sequential decision problem and on high-order asymptotic approximations for"},"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":"1110.0902","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2011-10-05T06:14:13Z","cross_cats_sorted":["stat.ME","stat.TH"],"title_canon_sha256":"dc8acd833c0c1549c179459f8c59f537cefc5d79c7b7e3d84a4f9a2736d73ebe","abstract_canon_sha256":"a0d390c7c0d815294c02814dbe72dcb2fb9903e93e852e5c57bc0120e8990e79"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:57:14.172353Z","signature_b64":"n42mVvYW8EiOdThdac137+zNI2GSWTwVqvv6pxw+4eNpfjH0nXSR1Zg32uB7206Cy1QKeHpYwaylgRG0C5IbAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a9d8b95d11009be6d93ca1555ecf07d787c8f51c07b4ea76598e4b0e75010eb0","last_reissued_at":"2026-05-18T03:57:14.171908Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:57:14.171908Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Nearly Minimax One-Sided Mixture-Based Sequential Tests","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ME","stat.TH"],"primary_cat":"math.ST","authors_text":"Alexander G. Tartakovsky, Georgios Fellouris","submitted_at":"2011-10-05T06:14:13Z","abstract_excerpt":"We focus on one-sided, mixture-based stopping rules for the problem of sequential testing a simple null hypothesis against a composite alternative. For the latter, we consider two cases---either a discrete alternative or a continuous alternative that can be embedded into an exponential family. For each case, we find a mixture-based stopping rule that is nearly minimax in the sense of minimizing the maximal Kullback-Leibler information. The proof of this result is based on finding an almost Bayes rule for an appropriate sequential decision problem and on high-order asymptotic approximations for"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.0902","kind":"arxiv","version":2},"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":"1110.0902","created_at":"2026-05-18T03:57:14.171968+00:00"},{"alias_kind":"arxiv_version","alias_value":"1110.0902v2","created_at":"2026-05-18T03:57:14.171968+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.0902","created_at":"2026-05-18T03:57:14.171968+00:00"},{"alias_kind":"pith_short_12","alias_value":"VHMLSXIRACN6","created_at":"2026-05-18T12:26:44.992195+00:00"},{"alias_kind":"pith_short_16","alias_value":"VHMLSXIRACN6NWJ4","created_at":"2026-05-18T12:26:44.992195+00:00"},{"alias_kind":"pith_short_8","alias_value":"VHMLSXIR","created_at":"2026-05-18T12:26:44.992195+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/VHMLSXIRACN6NWJ4UFKV5TYH26","json":"https://pith.science/pith/VHMLSXIRACN6NWJ4UFKV5TYH26.json","graph_json":"https://pith.science/api/pith-number/VHMLSXIRACN6NWJ4UFKV5TYH26/graph.json","events_json":"https://pith.science/api/pith-number/VHMLSXIRACN6NWJ4UFKV5TYH26/events.json","paper":"https://pith.science/paper/VHMLSXIR"},"agent_actions":{"view_html":"https://pith.science/pith/VHMLSXIRACN6NWJ4UFKV5TYH26","download_json":"https://pith.science/pith/VHMLSXIRACN6NWJ4UFKV5TYH26.json","view_paper":"https://pith.science/paper/VHMLSXIR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1110.0902&json=true","fetch_graph":"https://pith.science/api/pith-number/VHMLSXIRACN6NWJ4UFKV5TYH26/graph.json","fetch_events":"https://pith.science/api/pith-number/VHMLSXIRACN6NWJ4UFKV5TYH26/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VHMLSXIRACN6NWJ4UFKV5TYH26/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VHMLSXIRACN6NWJ4UFKV5TYH26/action/storage_attestation","attest_author":"https://pith.science/pith/VHMLSXIRACN6NWJ4UFKV5TYH26/action/author_attestation","sign_citation":"https://pith.science/pith/VHMLSXIRACN6NWJ4UFKV5TYH26/action/citation_signature","submit_replication":"https://pith.science/pith/VHMLSXIRACN6NWJ4UFKV5TYH26/action/replication_record"}},"created_at":"2026-05-18T03:57:14.171968+00:00","updated_at":"2026-05-18T03:57:14.171968+00:00"}