{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:VHMLSXIRACN6NWJ4UFKV5TYH26","short_pith_number":"pith:VHMLSXIR","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"},"canonical_sha256":"a9d8b95d11009be6d93ca1555ecf07d787c8f51c07b4ea76598e4b0e75010eb0","source":{"kind":"arxiv","id":"1110.0902","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1110.0902","created_at":"2026-05-18T03:57:14Z"},{"alias_kind":"arxiv_version","alias_value":"1110.0902v2","created_at":"2026-05-18T03:57:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.0902","created_at":"2026-05-18T03:57:14Z"},{"alias_kind":"pith_short_12","alias_value":"VHMLSXIRACN6","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_16","alias_value":"VHMLSXIRACN6NWJ4","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_8","alias_value":"VHMLSXIR","created_at":"2026-05-18T12:26:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:VHMLSXIRACN6NWJ4UFKV5TYH26","target":"record","payload":{"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"},"canonical_sha256":"a9d8b95d11009be6d93ca1555ecf07d787c8f51c07b4ea76598e4b0e75010eb0","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"},"source_kind":"arxiv","source_id":"1110.0902","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:57:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XzHe1xJsaei01/35sPs5+pbZNtYg0jsKNYLqT9SlesPpqs/WtAK5WaEl1yw1dKtlUjSnxrbvMrsbUdtNYmmWCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T14:32:05.343610Z"},"content_sha256":"8c68c8a2df0b31a0a493c2851631c5912126ff5f0fea3be11a8a05982b5d2125","schema_version":"1.0","event_id":"sha256:8c68c8a2df0b31a0a493c2851631c5912126ff5f0fea3be11a8a05982b5d2125"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:VHMLSXIRACN6NWJ4UFKV5TYH26","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:57:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ug0Jy/uo0rTb8pAEobPiChSbbo/HSS2CMahL9k9Sr18TDfH7GOGPwWh8Jjnl22rSiFZjRmoBmUs5X5VXwreWAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T14:32:05.344441Z"},"content_sha256":"fa30cf9222ae70b8864b5687de5e82f7867bc454698fa1d4e26096bf64c2159d","schema_version":"1.0","event_id":"sha256:fa30cf9222ae70b8864b5687de5e82f7867bc454698fa1d4e26096bf64c2159d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VHMLSXIRACN6NWJ4UFKV5TYH26/bundle.json","state_url":"https://pith.science/pith/VHMLSXIRACN6NWJ4UFKV5TYH26/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VHMLSXIRACN6NWJ4UFKV5TYH26/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-31T14:32:05Z","links":{"resolver":"https://pith.science/pith/VHMLSXIRACN6NWJ4UFKV5TYH26","bundle":"https://pith.science/pith/VHMLSXIRACN6NWJ4UFKV5TYH26/bundle.json","state":"https://pith.science/pith/VHMLSXIRACN6NWJ4UFKV5TYH26/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VHMLSXIRACN6NWJ4UFKV5TYH26/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:VHMLSXIRACN6NWJ4UFKV5TYH26","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"a0d390c7c0d815294c02814dbe72dcb2fb9903e93e852e5c57bc0120e8990e79","cross_cats_sorted":["stat.ME","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2011-10-05T06:14:13Z","title_canon_sha256":"dc8acd833c0c1549c179459f8c59f537cefc5d79c7b7e3d84a4f9a2736d73ebe"},"schema_version":"1.0","source":{"id":"1110.0902","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1110.0902","created_at":"2026-05-18T03:57:14Z"},{"alias_kind":"arxiv_version","alias_value":"1110.0902v2","created_at":"2026-05-18T03:57:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.0902","created_at":"2026-05-18T03:57:14Z"},{"alias_kind":"pith_short_12","alias_value":"VHMLSXIRACN6","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_16","alias_value":"VHMLSXIRACN6NWJ4","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_8","alias_value":"VHMLSXIR","created_at":"2026-05-18T12:26:44Z"}],"graph_snapshots":[{"event_id":"sha256:fa30cf9222ae70b8864b5687de5e82f7867bc454698fa1d4e26096bf64c2159d","target":"graph","created_at":"2026-05-18T03:57:14Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Alexander G. Tartakovsky, Georgios Fellouris","cross_cats":["stat.ME","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2011-10-05T06:14:13Z","title":"Nearly Minimax One-Sided Mixture-Based Sequential Tests"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.0902","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:8c68c8a2df0b31a0a493c2851631c5912126ff5f0fea3be11a8a05982b5d2125","target":"record","created_at":"2026-05-18T03:57:14Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"a0d390c7c0d815294c02814dbe72dcb2fb9903e93e852e5c57bc0120e8990e79","cross_cats_sorted":["stat.ME","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2011-10-05T06:14:13Z","title_canon_sha256":"dc8acd833c0c1549c179459f8c59f537cefc5d79c7b7e3d84a4f9a2736d73ebe"},"schema_version":"1.0","source":{"id":"1110.0902","kind":"arxiv","version":2}},"canonical_sha256":"a9d8b95d11009be6d93ca1555ecf07d787c8f51c07b4ea76598e4b0e75010eb0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a9d8b95d11009be6d93ca1555ecf07d787c8f51c07b4ea76598e4b0e75010eb0","first_computed_at":"2026-05-18T03:57:14.171908Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:57:14.171908Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"n42mVvYW8EiOdThdac137+zNI2GSWTwVqvv6pxw+4eNpfjH0nXSR1Zg32uB7206Cy1QKeHpYwaylgRG0C5IbAw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:57:14.172353Z","signed_message":"canonical_sha256_bytes"},"source_id":"1110.0902","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8c68c8a2df0b31a0a493c2851631c5912126ff5f0fea3be11a8a05982b5d2125","sha256:fa30cf9222ae70b8864b5687de5e82f7867bc454698fa1d4e26096bf64c2159d"],"state_sha256":"a6a6d7ba827278d94b92b98c9fab553f1adbccef6ef971c48d02386cfab00477"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f2ysimDrv6m54lHPjZm75pxl9OZtAVXJbu0+ascvV/QwTeBgdfHHNJWVa/crmhkUC2juTA9204I/eCaoA0w8AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T14:32:05.349777Z","bundle_sha256":"bb64e6bf0020eb745d5876874d84470c293332f393437a6104435ea02ebaa58f"}}