{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:EKYD4KHOQPN5OMO4YJDI3PSDBX","short_pith_number":"pith:EKYD4KHO","canonical_record":{"source":{"id":"1501.05870","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2015-01-23T16:53:33Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"8e87c236a92d278dc6c3aff8a1f55ec5557b2bbd22b8eef3f0bd4c172d717dd6","abstract_canon_sha256":"4d6a30d9b0a9ae326df60ebb67ba95449c8065702fd4200257613ef7ce17439b"},"schema_version":"1.0"},"canonical_sha256":"22b03e28ee83dbd731dcc2468dbe430dc3c6475ae7be6374ef766414935bdb6f","source":{"kind":"arxiv","id":"1501.05870","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.05870","created_at":"2026-05-18T02:26:38Z"},{"alias_kind":"arxiv_version","alias_value":"1501.05870v2","created_at":"2026-05-18T02:26:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.05870","created_at":"2026-05-18T02:26:38Z"},{"alias_kind":"pith_short_12","alias_value":"EKYD4KHOQPN5","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"EKYD4KHOQPN5OMO4","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"EKYD4KHO","created_at":"2026-05-18T12:29:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:EKYD4KHOQPN5OMO4YJDI3PSDBX","target":"record","payload":{"canonical_record":{"source":{"id":"1501.05870","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2015-01-23T16:53:33Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"8e87c236a92d278dc6c3aff8a1f55ec5557b2bbd22b8eef3f0bd4c172d717dd6","abstract_canon_sha256":"4d6a30d9b0a9ae326df60ebb67ba95449c8065702fd4200257613ef7ce17439b"},"schema_version":"1.0"},"canonical_sha256":"22b03e28ee83dbd731dcc2468dbe430dc3c6475ae7be6374ef766414935bdb6f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:26:38.385618Z","signature_b64":"4GOWWj15CzB/Ou9PH18BcVz7rfotM9+qVnvyCEdRF/Aj9ow0MH1kQOj4EV/xECLREvl4S9QpqyrFNol129yBCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"22b03e28ee83dbd731dcc2468dbe430dc3c6475ae7be6374ef766414935bdb6f","last_reissued_at":"2026-05-18T02:26:38.385243Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:26:38.385243Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1501.05870","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-18T02:26:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ecs9n7TY1fwGG1OR2JH2n485YXhAmRwIUs5JxXwtYa/dztpD26iNp383tRhHIZ1uvJvWJQ1Pzn2RqofErFCzDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T21:00:50.685895Z"},"content_sha256":"0b49f41e45c77e7f2231d3ed9055630fb6be817bac5d580350d5da13272a9350","schema_version":"1.0","event_id":"sha256:0b49f41e45c77e7f2231d3ed9055630fb6be817bac5d580350d5da13272a9350"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:EKYD4KHOQPN5OMO4YJDI3PSDBX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Linear Programming Approach to Sequential Hypothesis Testing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"Abdelhak M. Zoubir, Michael Fauss","submitted_at":"2015-01-23T16:53:33Z","abstract_excerpt":"Under some mild Markov assumptions it is shown that the problem of designing optimal sequential tests for two simple hypotheses can be formulated as a linear program. The result is derived by investigating the Lagrangian dual of the sequential testing problem, which is an unconstrained optimal stopping problem, depending on two unknown Lagrangian multipliers. It is shown that the derivative of the optimal cost function with respect to these multipliers coincides with the error probabilities of the corresponding sequential test. This property is used to formulate an optimization problem that is"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.05870","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-18T02:26:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c+Vh3HJj1F4VTaaAWdmT7iiKtsyytjWVAcVu+I3bOO8Ksg2ZS8eAMGlC610bYVUCVUVe+5OSTB9VSVgrwi5EAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T21:00:50.686236Z"},"content_sha256":"21715c4aa286394aa5d72f97271a5191821cb321071e54b391ca3b7c73adb50d","schema_version":"1.0","event_id":"sha256:21715c4aa286394aa5d72f97271a5191821cb321071e54b391ca3b7c73adb50d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EKYD4KHOQPN5OMO4YJDI3PSDBX/bundle.json","state_url":"https://pith.science/pith/EKYD4KHOQPN5OMO4YJDI3PSDBX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EKYD4KHOQPN5OMO4YJDI3PSDBX/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-06-29T21:00:50Z","links":{"resolver":"https://pith.science/pith/EKYD4KHOQPN5OMO4YJDI3PSDBX","bundle":"https://pith.science/pith/EKYD4KHOQPN5OMO4YJDI3PSDBX/bundle.json","state":"https://pith.science/pith/EKYD4KHOQPN5OMO4YJDI3PSDBX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EKYD4KHOQPN5OMO4YJDI3PSDBX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:EKYD4KHOQPN5OMO4YJDI3PSDBX","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":"4d6a30d9b0a9ae326df60ebb67ba95449c8065702fd4200257613ef7ce17439b","cross_cats_sorted":["stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2015-01-23T16:53:33Z","title_canon_sha256":"8e87c236a92d278dc6c3aff8a1f55ec5557b2bbd22b8eef3f0bd4c172d717dd6"},"schema_version":"1.0","source":{"id":"1501.05870","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.05870","created_at":"2026-05-18T02:26:38Z"},{"alias_kind":"arxiv_version","alias_value":"1501.05870v2","created_at":"2026-05-18T02:26:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.05870","created_at":"2026-05-18T02:26:38Z"},{"alias_kind":"pith_short_12","alias_value":"EKYD4KHOQPN5","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"EKYD4KHOQPN5OMO4","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"EKYD4KHO","created_at":"2026-05-18T12:29:19Z"}],"graph_snapshots":[{"event_id":"sha256:21715c4aa286394aa5d72f97271a5191821cb321071e54b391ca3b7c73adb50d","target":"graph","created_at":"2026-05-18T02:26:38Z","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":"Under some mild Markov assumptions it is shown that the problem of designing optimal sequential tests for two simple hypotheses can be formulated as a linear program. The result is derived by investigating the Lagrangian dual of the sequential testing problem, which is an unconstrained optimal stopping problem, depending on two unknown Lagrangian multipliers. It is shown that the derivative of the optimal cost function with respect to these multipliers coincides with the error probabilities of the corresponding sequential test. This property is used to formulate an optimization problem that is","authors_text":"Abdelhak M. Zoubir, Michael Fauss","cross_cats":["stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2015-01-23T16:53:33Z","title":"A Linear Programming Approach to Sequential Hypothesis Testing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.05870","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:0b49f41e45c77e7f2231d3ed9055630fb6be817bac5d580350d5da13272a9350","target":"record","created_at":"2026-05-18T02:26:38Z","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":"4d6a30d9b0a9ae326df60ebb67ba95449c8065702fd4200257613ef7ce17439b","cross_cats_sorted":["stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2015-01-23T16:53:33Z","title_canon_sha256":"8e87c236a92d278dc6c3aff8a1f55ec5557b2bbd22b8eef3f0bd4c172d717dd6"},"schema_version":"1.0","source":{"id":"1501.05870","kind":"arxiv","version":2}},"canonical_sha256":"22b03e28ee83dbd731dcc2468dbe430dc3c6475ae7be6374ef766414935bdb6f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"22b03e28ee83dbd731dcc2468dbe430dc3c6475ae7be6374ef766414935bdb6f","first_computed_at":"2026-05-18T02:26:38.385243Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:26:38.385243Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4GOWWj15CzB/Ou9PH18BcVz7rfotM9+qVnvyCEdRF/Aj9ow0MH1kQOj4EV/xECLREvl4S9QpqyrFNol129yBCg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:26:38.385618Z","signed_message":"canonical_sha256_bytes"},"source_id":"1501.05870","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0b49f41e45c77e7f2231d3ed9055630fb6be817bac5d580350d5da13272a9350","sha256:21715c4aa286394aa5d72f97271a5191821cb321071e54b391ca3b7c73adb50d"],"state_sha256":"c5a16627ed2c50164ce12be01d6cf70e9705cefd328d64bb47a305737c98d3d2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tkPrkT8wWod6o8RZliVwen/m9Jy+JERGy8TiGps8x+D+jvbT48jmanZlawiqxd9jO0lA2UrkyVJbjJUqVrlqDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-29T21:00:50.688050Z","bundle_sha256":"f017a867cfffa2a1e8dcdf374b2a8cac3120f78c90406c374550745a5f2417f0"}}