{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:SK33G4ZEQLTFIOSK3VMWTNW6JN","short_pith_number":"pith:SK33G4ZE","schema_version":"1.0","canonical_sha256":"92b7b3732482e6543a4add5969b6de4b47e0153eeefe95a463c4610994f7dda5","source":{"kind":"arxiv","id":"1701.06952","version":2},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1701.06952","created_at":"2026-05-18T00:21:28.925610+00:00"},{"alias_kind":"arxiv_version","alias_value":"1701.06952v2","created_at":"2026-05-18T00:21:28.925610+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.06952","created_at":"2026-05-18T00:21:28.925610+00:00"},{"alias_kind":"pith_short_12","alias_value":"SK33G4ZEQLTF","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_16","alias_value":"SK33G4ZEQLTFIOSK","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_8","alias_value":"SK33G4ZE","created_at":"2026-05-18T12:31:43.269735+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SK33G4ZEQLTFIOSK3VMWTNW6JN","json":"https://pith.science/pith/SK33G4ZEQLTFIOSK3VMWTNW6JN.json","graph_json":"https://pith.science/api/pith-number/SK33G4ZEQLTFIOSK3VMWTNW6JN/graph.json","events_json":"https://pith.science/api/pith-number/SK33G4ZEQLTFIOSK3VMWTNW6JN/events.json","paper":"https://pith.science/paper/SK33G4ZE"},"agent_actions":{"view_html":"https://pith.science/pith/SK33G4ZEQLTFIOSK3VMWTNW6JN","download_json":"https://pith.science/pith/SK33G4ZEQLTFIOSK3VMWTNW6JN.json","view_paper":"https://pith.science/paper/SK33G4ZE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1701.06952&json=true","fetch_graph":"https://pith.science/api/pith-number/SK33G4ZEQLTFIOSK3VMWTNW6JN/graph.json","fetch_events":"https://pith.science/api/pith-number/SK33G4ZEQLTFIOSK3VMWTNW6JN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SK33G4ZEQLTFIOSK3VMWTNW6JN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SK33G4ZEQLTFIOSK3VMWTNW6JN/action/storage_attestation","attest_author":"https://pith.science/pith/SK33G4ZEQLTFIOSK3VMWTNW6JN/action/author_attestation","sign_citation":"https://pith.science/pith/SK33G4ZEQLTFIOSK3VMWTNW6JN/action/citation_signature","submit_replication":"https://pith.science/pith/SK33G4ZEQLTFIOSK3VMWTNW6JN/action/replication_record"}},"created_at":"2026-05-18T00:21:28.925610+00:00","updated_at":"2026-05-18T00:21:28.925610+00:00"}