{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:Q4TZJRRNHNVN6CBTTYFR3FT4OH","short_pith_number":"pith:Q4TZJRRN","canonical_record":{"source":{"id":"1510.02903","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2015-10-10T09:53:21Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"234551fc60c9d78d9094daa21fdd3e09cf4df177f5101b470bc0d911143710d1","abstract_canon_sha256":"29dbada3bb555072cb1d1d4011698eea9d7639d4962ec356507f36945c51d55e"},"schema_version":"1.0"},"canonical_sha256":"872794c62d3b6adf08339e0b1d967c71e5f686d988103ee5e517083a036dc7d9","source":{"kind":"arxiv","id":"1510.02903","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.02903","created_at":"2026-05-18T01:22:50Z"},{"alias_kind":"arxiv_version","alias_value":"1510.02903v2","created_at":"2026-05-18T01:22:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.02903","created_at":"2026-05-18T01:22:50Z"},{"alias_kind":"pith_short_12","alias_value":"Q4TZJRRNHNVN","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"Q4TZJRRNHNVN6CBT","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"Q4TZJRRN","created_at":"2026-05-18T12:29:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:Q4TZJRRNHNVN6CBTTYFR3FT4OH","target":"record","payload":{"canonical_record":{"source":{"id":"1510.02903","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2015-10-10T09:53:21Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"234551fc60c9d78d9094daa21fdd3e09cf4df177f5101b470bc0d911143710d1","abstract_canon_sha256":"29dbada3bb555072cb1d1d4011698eea9d7639d4962ec356507f36945c51d55e"},"schema_version":"1.0"},"canonical_sha256":"872794c62d3b6adf08339e0b1d967c71e5f686d988103ee5e517083a036dc7d9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:22:50.382460Z","signature_b64":"anuNlEeZHe2CRGAgAobva0zLBsaQfYpyZXZULH8KUKDMBaJVuMfEIVATStglMWWRzWYesPrwsAnhN6hdfETiBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"872794c62d3b6adf08339e0b1d967c71e5f686d988103ee5e517083a036dc7d9","last_reissued_at":"2026-05-18T01:22:50.382014Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:22:50.382014Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1510.02903","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-18T01:22:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/UkZPNtGoJB3TgwIxmLmshPmeU6Vkf/R3ZShVZEqmGpiI3OSLLyzW92S35YRii3yeAAwPtSamQct6ktM+d7/Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T11:41:50.207417Z"},"content_sha256":"f2c05d31c187950212ffcbe8f6446c8b0620e94ccd09c27af23c796ddb3eaadf","schema_version":"1.0","event_id":"sha256:f2c05d31c187950212ffcbe8f6446c8b0620e94ccd09c27af23c796ddb3eaadf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:Q4TZJRRNHNVN6CBTTYFR3FT4OH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Asymptotically Optimal Pointwise and Minimax Quickest Change-point Detection for Dependent Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"Alexander G. Tartakovsky, Serguei M. Pergamenchtchikov","submitted_at":"2015-10-10T09:53:21Z","abstract_excerpt":"We consider the quickest change-point detection problem in pointwise and minimax settings for general dependent data models. Two new classes of sequential detection procedures associated with the maximal \"local\" probability of a false alarm within a period of some fixed length are introduced. For these classes of detection procedures, we consider two popular risks: the expected positive part of the delay to detection and the conditional delay to detection. Under very general conditions for the observations, we show that the popular Shiryaev--Roberts procedure is asymptotically optimal, as the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.02903","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-18T01:22:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Y73jY/Z7Cj+voMOL2BFkd5FgXU3lIVU3HMYPMzkVFyZj6Ttv+BCNt5OBG9C5TcFPPH86r4B7QqbZH0gQl0XvCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T11:41:50.207764Z"},"content_sha256":"f6f7d574442432397b07427c2f50c639f1a2063e744cc972a59b1dce829ccfb4","schema_version":"1.0","event_id":"sha256:f6f7d574442432397b07427c2f50c639f1a2063e744cc972a59b1dce829ccfb4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Q4TZJRRNHNVN6CBTTYFR3FT4OH/bundle.json","state_url":"https://pith.science/pith/Q4TZJRRNHNVN6CBTTYFR3FT4OH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Q4TZJRRNHNVN6CBTTYFR3FT4OH/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-01T11:41:50Z","links":{"resolver":"https://pith.science/pith/Q4TZJRRNHNVN6CBTTYFR3FT4OH","bundle":"https://pith.science/pith/Q4TZJRRNHNVN6CBTTYFR3FT4OH/bundle.json","state":"https://pith.science/pith/Q4TZJRRNHNVN6CBTTYFR3FT4OH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Q4TZJRRNHNVN6CBTTYFR3FT4OH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:Q4TZJRRNHNVN6CBTTYFR3FT4OH","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":"29dbada3bb555072cb1d1d4011698eea9d7639d4962ec356507f36945c51d55e","cross_cats_sorted":["stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2015-10-10T09:53:21Z","title_canon_sha256":"234551fc60c9d78d9094daa21fdd3e09cf4df177f5101b470bc0d911143710d1"},"schema_version":"1.0","source":{"id":"1510.02903","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.02903","created_at":"2026-05-18T01:22:50Z"},{"alias_kind":"arxiv_version","alias_value":"1510.02903v2","created_at":"2026-05-18T01:22:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.02903","created_at":"2026-05-18T01:22:50Z"},{"alias_kind":"pith_short_12","alias_value":"Q4TZJRRNHNVN","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"Q4TZJRRNHNVN6CBT","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"Q4TZJRRN","created_at":"2026-05-18T12:29:37Z"}],"graph_snapshots":[{"event_id":"sha256:f6f7d574442432397b07427c2f50c639f1a2063e744cc972a59b1dce829ccfb4","target":"graph","created_at":"2026-05-18T01:22:50Z","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 consider the quickest change-point detection problem in pointwise and minimax settings for general dependent data models. Two new classes of sequential detection procedures associated with the maximal \"local\" probability of a false alarm within a period of some fixed length are introduced. For these classes of detection procedures, we consider two popular risks: the expected positive part of the delay to detection and the conditional delay to detection. Under very general conditions for the observations, we show that the popular Shiryaev--Roberts procedure is asymptotically optimal, as the ","authors_text":"Alexander G. Tartakovsky, Serguei M. Pergamenchtchikov","cross_cats":["stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2015-10-10T09:53:21Z","title":"Asymptotically Optimal Pointwise and Minimax Quickest Change-point Detection for Dependent Data"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.02903","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:f2c05d31c187950212ffcbe8f6446c8b0620e94ccd09c27af23c796ddb3eaadf","target":"record","created_at":"2026-05-18T01:22:50Z","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":"29dbada3bb555072cb1d1d4011698eea9d7639d4962ec356507f36945c51d55e","cross_cats_sorted":["stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2015-10-10T09:53:21Z","title_canon_sha256":"234551fc60c9d78d9094daa21fdd3e09cf4df177f5101b470bc0d911143710d1"},"schema_version":"1.0","source":{"id":"1510.02903","kind":"arxiv","version":2}},"canonical_sha256":"872794c62d3b6adf08339e0b1d967c71e5f686d988103ee5e517083a036dc7d9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"872794c62d3b6adf08339e0b1d967c71e5f686d988103ee5e517083a036dc7d9","first_computed_at":"2026-05-18T01:22:50.382014Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:22:50.382014Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"anuNlEeZHe2CRGAgAobva0zLBsaQfYpyZXZULH8KUKDMBaJVuMfEIVATStglMWWRzWYesPrwsAnhN6hdfETiBA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:22:50.382460Z","signed_message":"canonical_sha256_bytes"},"source_id":"1510.02903","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f2c05d31c187950212ffcbe8f6446c8b0620e94ccd09c27af23c796ddb3eaadf","sha256:f6f7d574442432397b07427c2f50c639f1a2063e744cc972a59b1dce829ccfb4"],"state_sha256":"932764c46390ebdf24d33d521379afcb0a6077730d11d0f28060a65525ebea06"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Z/MbBnaq9OU/u6jOHv70LerVV5hSb75t8BCPUh7jgq4CYA8H2aPxvIpJZN+jMyw61ft4uVgL5C/Imh2NflHHAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T11:41:50.209697Z","bundle_sha256":"f92fb22c1c3a3af49ed3e97f7e69f81b5b075dc7f26878c8384f182e68d15b1c"}}