{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:SK33G4ZEQLTFIOSK3VMWTNW6JN","short_pith_number":"pith:SK33G4ZE","canonical_record":{"source":{"id":"1701.06952","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2017-01-24T16:06:48Z","cross_cats_sorted":[],"title_canon_sha256":"058267e814697a5abc544d41a4f9dc63589e39c4f55b891b46ec001cabc766c4","abstract_canon_sha256":"517af0b359662e9926968d68f8d2d0489401ee2cff3ee5b58493c7913de9c244"},"schema_version":"1.0"},"canonical_sha256":"92b7b3732482e6543a4add5969b6de4b47e0153eeefe95a463c4610994f7dda5","source":{"kind":"arxiv","id":"1701.06952","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.06952","created_at":"2026-05-18T00:21:28Z"},{"alias_kind":"arxiv_version","alias_value":"1701.06952v2","created_at":"2026-05-18T00:21:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.06952","created_at":"2026-05-18T00:21:28Z"},{"alias_kind":"pith_short_12","alias_value":"SK33G4ZEQLTF","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"SK33G4ZEQLTFIOSK","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"SK33G4ZE","created_at":"2026-05-18T12:31:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:SK33G4ZEQLTFIOSK3VMWTNW6JN","target":"record","payload":{"canonical_record":{"source":{"id":"1701.06952","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2017-01-24T16:06:48Z","cross_cats_sorted":[],"title_canon_sha256":"058267e814697a5abc544d41a4f9dc63589e39c4f55b891b46ec001cabc766c4","abstract_canon_sha256":"517af0b359662e9926968d68f8d2d0489401ee2cff3ee5b58493c7913de9c244"},"schema_version":"1.0"},"canonical_sha256":"92b7b3732482e6543a4add5969b6de4b47e0153eeefe95a463c4610994f7dda5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:21:28.926166Z","signature_b64":"8DGSwy6qqCIJcFXPC/i8HxXrfz1jOLr5Ggquu54GigPaT57cn85FgtxloAOJ82QSUtU0MkENkSCGuRqGx0qMAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"92b7b3732482e6543a4add5969b6de4b47e0153eeefe95a463c4610994f7dda5","last_reissued_at":"2026-05-18T00:21:28.925508Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:21:28.925508Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1701.06952","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-18T00:21:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2Svkqt/MBF7cqPWMmUB6OMNT2k9qLbMUU2B1jxTFWXFqlH28jtvHhzMOzHt2rNGA7omZaj7+/ioqUQ6lHblhDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T16:56:34.821611Z"},"content_sha256":"81c4d4ff6c44ec91809c4a1b938ba0d1e9bc7dde1b9cc531f0867c0d0313cedb","schema_version":"1.0","event_id":"sha256:81c4d4ff6c44ec91809c4a1b938ba0d1e9bc7dde1b9cc531f0867c0d0313cedb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:SK33G4ZEQLTFIOSK3VMWTNW6JN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Robust Sequential Change-Point Detection by Convex Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ME","authors_text":"Yang Cao, Yao Xie","submitted_at":"2017-01-24T16:06:48Z","abstract_excerpt":"We address the computational challenge of finding the robust sequential change-point detection procedures when the pre- and post-change distributions are not completely specified. Earlier works [veeravalli 1994] and [Unnikrishnan 2011] establish the general conditions for robust procedures which include finding a pair of least favorable distributions (LFDs). However, in the multi-dimensional setting, it is hard to find such LFDs computationally. We present a method based on convex optimization that addresses this issue when the distributions are Gaussian with unknown parameters from pre-specif"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.06952","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-18T00:21:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xTGQuVRNQxdV3XND6Dpf2xQRmJFFxgeRIjlUPrcsVFE6y6mB6E30seXFhSBrC38AHas5hE0hvFHYeNkaLtOCCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T16:56:34.821955Z"},"content_sha256":"fee1bda1af7da3c7e04c1df144bac896bad6335800de6dbaae161cb56f311877","schema_version":"1.0","event_id":"sha256:fee1bda1af7da3c7e04c1df144bac896bad6335800de6dbaae161cb56f311877"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SK33G4ZEQLTFIOSK3VMWTNW6JN/bundle.json","state_url":"https://pith.science/pith/SK33G4ZEQLTFIOSK3VMWTNW6JN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SK33G4ZEQLTFIOSK3VMWTNW6JN/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-04T16:56:34Z","links":{"resolver":"https://pith.science/pith/SK33G4ZEQLTFIOSK3VMWTNW6JN","bundle":"https://pith.science/pith/SK33G4ZEQLTFIOSK3VMWTNW6JN/bundle.json","state":"https://pith.science/pith/SK33G4ZEQLTFIOSK3VMWTNW6JN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SK33G4ZEQLTFIOSK3VMWTNW6JN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:SK33G4ZEQLTFIOSK3VMWTNW6JN","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":"517af0b359662e9926968d68f8d2d0489401ee2cff3ee5b58493c7913de9c244","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2017-01-24T16:06:48Z","title_canon_sha256":"058267e814697a5abc544d41a4f9dc63589e39c4f55b891b46ec001cabc766c4"},"schema_version":"1.0","source":{"id":"1701.06952","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.06952","created_at":"2026-05-18T00:21:28Z"},{"alias_kind":"arxiv_version","alias_value":"1701.06952v2","created_at":"2026-05-18T00:21:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.06952","created_at":"2026-05-18T00:21:28Z"},{"alias_kind":"pith_short_12","alias_value":"SK33G4ZEQLTF","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"SK33G4ZEQLTFIOSK","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"SK33G4ZE","created_at":"2026-05-18T12:31:43Z"}],"graph_snapshots":[{"event_id":"sha256:fee1bda1af7da3c7e04c1df144bac896bad6335800de6dbaae161cb56f311877","target":"graph","created_at":"2026-05-18T00:21:28Z","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 address the computational challenge of finding the robust sequential change-point detection procedures when the pre- and post-change distributions are not completely specified. Earlier works [veeravalli 1994] and [Unnikrishnan 2011] establish the general conditions for robust procedures which include finding a pair of least favorable distributions (LFDs). However, in the multi-dimensional setting, it is hard to find such LFDs computationally. We present a method based on convex optimization that addresses this issue when the distributions are Gaussian with unknown parameters from pre-specif","authors_text":"Yang Cao, Yao Xie","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2017-01-24T16:06:48Z","title":"Robust Sequential Change-Point Detection by Convex Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.06952","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:81c4d4ff6c44ec91809c4a1b938ba0d1e9bc7dde1b9cc531f0867c0d0313cedb","target":"record","created_at":"2026-05-18T00:21:28Z","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":"517af0b359662e9926968d68f8d2d0489401ee2cff3ee5b58493c7913de9c244","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2017-01-24T16:06:48Z","title_canon_sha256":"058267e814697a5abc544d41a4f9dc63589e39c4f55b891b46ec001cabc766c4"},"schema_version":"1.0","source":{"id":"1701.06952","kind":"arxiv","version":2}},"canonical_sha256":"92b7b3732482e6543a4add5969b6de4b47e0153eeefe95a463c4610994f7dda5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"92b7b3732482e6543a4add5969b6de4b47e0153eeefe95a463c4610994f7dda5","first_computed_at":"2026-05-18T00:21:28.925508Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:21:28.925508Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8DGSwy6qqCIJcFXPC/i8HxXrfz1jOLr5Ggquu54GigPaT57cn85FgtxloAOJ82QSUtU0MkENkSCGuRqGx0qMAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:21:28.926166Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.06952","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:81c4d4ff6c44ec91809c4a1b938ba0d1e9bc7dde1b9cc531f0867c0d0313cedb","sha256:fee1bda1af7da3c7e04c1df144bac896bad6335800de6dbaae161cb56f311877"],"state_sha256":"008140bd9e1dd99957c58af7062a6a4e0a697f4aae1555b4122b63140ae0c186"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YwalToNWwa40UYJxpe28RNSwyB74HlFo1pi3zZqsEAB3ntDzPGMNOBmcsJ44QeQuN9Xq0rdNGgsOONd3nSjEBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T16:56:34.823897Z","bundle_sha256":"cfb55fc7a9b0f9a3815a4824ddc98168444af7756d516517d67f71b5855a3795"}}