{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:MUORIZAYSG6SO75XR3PWJGDN4D","short_pith_number":"pith:MUORIZAY","canonical_record":{"source":{"id":"1410.3450","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2014-10-13T19:32:34Z","cross_cats_sorted":["cs.IT","math.IT","math.PR","stat.TH"],"title_canon_sha256":"caf03df7cdc4e3cf77582413102b1f9f2e92cb75c31417a367ec76491aad33bf","abstract_canon_sha256":"3736c4d26a0b0ab6119bc1956b653c167f8aebb5117cb41e07f390417a8c7d8c"},"schema_version":"1.0"},"canonical_sha256":"651d14641891bd277fb78edf64986de0f27418ddeb99a282f4bc00fa8a839fec","source":{"kind":"arxiv","id":"1410.3450","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.3450","created_at":"2026-05-18T02:40:11Z"},{"alias_kind":"arxiv_version","alias_value":"1410.3450v1","created_at":"2026-05-18T02:40:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.3450","created_at":"2026-05-18T02:40:11Z"},{"alias_kind":"pith_short_12","alias_value":"MUORIZAYSG6S","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_16","alias_value":"MUORIZAYSG6SO75X","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_8","alias_value":"MUORIZAY","created_at":"2026-05-18T12:28:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:MUORIZAYSG6SO75XR3PWJGDN4D","target":"record","payload":{"canonical_record":{"source":{"id":"1410.3450","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2014-10-13T19:32:34Z","cross_cats_sorted":["cs.IT","math.IT","math.PR","stat.TH"],"title_canon_sha256":"caf03df7cdc4e3cf77582413102b1f9f2e92cb75c31417a367ec76491aad33bf","abstract_canon_sha256":"3736c4d26a0b0ab6119bc1956b653c167f8aebb5117cb41e07f390417a8c7d8c"},"schema_version":"1.0"},"canonical_sha256":"651d14641891bd277fb78edf64986de0f27418ddeb99a282f4bc00fa8a839fec","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:40:11.277365Z","signature_b64":"6Q/acBvU3HKupc/a+Klsvo4b1U2lxN0muDZQjZ7YMdChShUl+6X2ij9R136BAoHl/1m6WWFeTwIR106qrmvXCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"651d14641891bd277fb78edf64986de0f27418ddeb99a282f4bc00fa8a839fec","last_reissued_at":"2026-05-18T02:40:11.276849Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:40:11.276849Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1410.3450","source_version":1,"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:40:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KtNiTBbOjV2UWTpG/dOAwp3DiUnMGvTbodjtmersjsbn2bj7bQwLBbntcXEk76+SAs4LtbXiMzVK3QUCe1A2Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T15:23:59.049796Z"},"content_sha256":"1d6618ed5455b1ec8eac9b4e73e503ae3bdb2307262f72b1a847d1ab05365503","schema_version":"1.0","event_id":"sha256:1d6618ed5455b1ec8eac9b4e73e503ae3bdb2307262f72b1a847d1ab05365503"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:MUORIZAYSG6SO75XR3PWJGDN4D","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Data-Efficient Minimax Quickest Change Detection with Composite Post-Change Distribution","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT","math.PR","stat.TH"],"primary_cat":"math.ST","authors_text":"Taposh Banerjee, Venugopal V. Veeravalli","submitted_at":"2014-10-13T19:32:34Z","abstract_excerpt":"The problem of quickest change detection is studied, where there is an additional constraint on the cost of observations used before the change point and where the post-change distribution is composite. Minimax formulations are proposed for this problem. It is assumed that the post-change family of distributions has a member which is least favorable in some sense. An algorithm is proposed in which on-off observation control is employed using the least favorable distribution, and a generalized likelihood ratio based approach is used for change detection. Under the additional condition that eith"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.3450","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"},"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:40:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PGkbNxWFlQl7KtKzfGP3M9vLLcvdQaWx578ZufTlibu2bbWE5b7cqVChBnTqrITC3QU0nDLLniAaldhSnw+TAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T15:23:59.050159Z"},"content_sha256":"4cf8f1d9fa1a5dec2d28267278a4c18d1be0fed26ab39d40024e4a6361224a8d","schema_version":"1.0","event_id":"sha256:4cf8f1d9fa1a5dec2d28267278a4c18d1be0fed26ab39d40024e4a6361224a8d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MUORIZAYSG6SO75XR3PWJGDN4D/bundle.json","state_url":"https://pith.science/pith/MUORIZAYSG6SO75XR3PWJGDN4D/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MUORIZAYSG6SO75XR3PWJGDN4D/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-04T15:23:59Z","links":{"resolver":"https://pith.science/pith/MUORIZAYSG6SO75XR3PWJGDN4D","bundle":"https://pith.science/pith/MUORIZAYSG6SO75XR3PWJGDN4D/bundle.json","state":"https://pith.science/pith/MUORIZAYSG6SO75XR3PWJGDN4D/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MUORIZAYSG6SO75XR3PWJGDN4D/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:MUORIZAYSG6SO75XR3PWJGDN4D","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":"3736c4d26a0b0ab6119bc1956b653c167f8aebb5117cb41e07f390417a8c7d8c","cross_cats_sorted":["cs.IT","math.IT","math.PR","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2014-10-13T19:32:34Z","title_canon_sha256":"caf03df7cdc4e3cf77582413102b1f9f2e92cb75c31417a367ec76491aad33bf"},"schema_version":"1.0","source":{"id":"1410.3450","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.3450","created_at":"2026-05-18T02:40:11Z"},{"alias_kind":"arxiv_version","alias_value":"1410.3450v1","created_at":"2026-05-18T02:40:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.3450","created_at":"2026-05-18T02:40:11Z"},{"alias_kind":"pith_short_12","alias_value":"MUORIZAYSG6S","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_16","alias_value":"MUORIZAYSG6SO75X","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_8","alias_value":"MUORIZAY","created_at":"2026-05-18T12:28:38Z"}],"graph_snapshots":[{"event_id":"sha256:4cf8f1d9fa1a5dec2d28267278a4c18d1be0fed26ab39d40024e4a6361224a8d","target":"graph","created_at":"2026-05-18T02:40:11Z","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":"The problem of quickest change detection is studied, where there is an additional constraint on the cost of observations used before the change point and where the post-change distribution is composite. Minimax formulations are proposed for this problem. It is assumed that the post-change family of distributions has a member which is least favorable in some sense. An algorithm is proposed in which on-off observation control is employed using the least favorable distribution, and a generalized likelihood ratio based approach is used for change detection. Under the additional condition that eith","authors_text":"Taposh Banerjee, Venugopal V. Veeravalli","cross_cats":["cs.IT","math.IT","math.PR","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2014-10-13T19:32:34Z","title":"Data-Efficient Minimax Quickest Change Detection with Composite Post-Change Distribution"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.3450","kind":"arxiv","version":1},"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:1d6618ed5455b1ec8eac9b4e73e503ae3bdb2307262f72b1a847d1ab05365503","target":"record","created_at":"2026-05-18T02:40:11Z","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":"3736c4d26a0b0ab6119bc1956b653c167f8aebb5117cb41e07f390417a8c7d8c","cross_cats_sorted":["cs.IT","math.IT","math.PR","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2014-10-13T19:32:34Z","title_canon_sha256":"caf03df7cdc4e3cf77582413102b1f9f2e92cb75c31417a367ec76491aad33bf"},"schema_version":"1.0","source":{"id":"1410.3450","kind":"arxiv","version":1}},"canonical_sha256":"651d14641891bd277fb78edf64986de0f27418ddeb99a282f4bc00fa8a839fec","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"651d14641891bd277fb78edf64986de0f27418ddeb99a282f4bc00fa8a839fec","first_computed_at":"2026-05-18T02:40:11.276849Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:40:11.276849Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6Q/acBvU3HKupc/a+Klsvo4b1U2lxN0muDZQjZ7YMdChShUl+6X2ij9R136BAoHl/1m6WWFeTwIR106qrmvXCw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:40:11.277365Z","signed_message":"canonical_sha256_bytes"},"source_id":"1410.3450","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1d6618ed5455b1ec8eac9b4e73e503ae3bdb2307262f72b1a847d1ab05365503","sha256:4cf8f1d9fa1a5dec2d28267278a4c18d1be0fed26ab39d40024e4a6361224a8d"],"state_sha256":"c2f30398e4598cfb3bbef4821210ea7b4a3a34f562d8df182246dc6246dff3a6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CMw0aidSTZArbGNw5AI1ZzjNO1Ow+fHxnnxTdbzUnrddIzO4GANgB38t819lT+/HjR7LrkVWnibhukFBdHnjCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T15:23:59.052418Z","bundle_sha256":"126de9bc09a819e23ffa32773c9d0df4df04713857d364155ffcc7055fce3959"}}