{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:BVSDJUPFDQ3X7QDGRCFNJPN4BW","short_pith_number":"pith:BVSDJUPF","schema_version":"1.0","canonical_sha256":"0d6434d1e51c377fc066888ad4bdbc0db2d2df2ffdb91939d20004aeb20ee2a7","source":{"kind":"arxiv","id":"1705.06995","version":4},"attestation_state":"computed","paper":{"title":"Nearly second-order asymptotic optimality of sequential change-point detection with one-sample updates","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.TH"],"primary_cat":"math.ST","authors_text":"Huan Xu, Liyan Xie, Yang Cao, Yao Xie","submitted_at":"2017-05-19T13:53:14Z","abstract_excerpt":"Sequential change-point detection when the distribution parameters are unknown is a fundamental problem in statistics and machine learning. When the post-change parameters are unknown, we consider a set of detection procedures based on sequential likelihood ratios with non-anticipating estimators constructed using online convex optimization algorithms such as online mirror descent, which provides a more versatile approach to tackle complex situations where recursive maximum likelihood estimators cannot be found. When the underlying distributions belong to a exponential family and the estimator"},"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":"1705.06995","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2017-05-19T13:53:14Z","cross_cats_sorted":["cs.LG","stat.TH"],"title_canon_sha256":"6b315f0c8a1ec06001a9e3c86d5224c1ee0b116213180e30ad62e4d42325369c","abstract_canon_sha256":"93cbd00e0ad5b7f8bb687a217b47d957e84221acbf7aca58b7c475489b30279f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:28:55.700645Z","signature_b64":"OS3mDk29QspobauBuNyof4paf7hCCv/jB+2Mu/GfS9A2FBDd+nf2pvyoADXMMp5wbiBAAFrIiLrepFvBHbkGBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0d6434d1e51c377fc066888ad4bdbc0db2d2df2ffdb91939d20004aeb20ee2a7","last_reissued_at":"2026-05-18T00:28:55.699955Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:28:55.699955Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Nearly second-order asymptotic optimality of sequential change-point detection with one-sample updates","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.TH"],"primary_cat":"math.ST","authors_text":"Huan Xu, Liyan Xie, Yang Cao, Yao Xie","submitted_at":"2017-05-19T13:53:14Z","abstract_excerpt":"Sequential change-point detection when the distribution parameters are unknown is a fundamental problem in statistics and machine learning. When the post-change parameters are unknown, we consider a set of detection procedures based on sequential likelihood ratios with non-anticipating estimators constructed using online convex optimization algorithms such as online mirror descent, which provides a more versatile approach to tackle complex situations where recursive maximum likelihood estimators cannot be found. When the underlying distributions belong to a exponential family and the estimator"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.06995","kind":"arxiv","version":4},"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":"1705.06995","created_at":"2026-05-18T00:28:55.700051+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.06995v4","created_at":"2026-05-18T00:28:55.700051+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.06995","created_at":"2026-05-18T00:28:55.700051+00:00"},{"alias_kind":"pith_short_12","alias_value":"BVSDJUPFDQ3X","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_16","alias_value":"BVSDJUPFDQ3X7QDG","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_8","alias_value":"BVSDJUPF","created_at":"2026-05-18T12:31:08.081275+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/BVSDJUPFDQ3X7QDGRCFNJPN4BW","json":"https://pith.science/pith/BVSDJUPFDQ3X7QDGRCFNJPN4BW.json","graph_json":"https://pith.science/api/pith-number/BVSDJUPFDQ3X7QDGRCFNJPN4BW/graph.json","events_json":"https://pith.science/api/pith-number/BVSDJUPFDQ3X7QDGRCFNJPN4BW/events.json","paper":"https://pith.science/paper/BVSDJUPF"},"agent_actions":{"view_html":"https://pith.science/pith/BVSDJUPFDQ3X7QDGRCFNJPN4BW","download_json":"https://pith.science/pith/BVSDJUPFDQ3X7QDGRCFNJPN4BW.json","view_paper":"https://pith.science/paper/BVSDJUPF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.06995&json=true","fetch_graph":"https://pith.science/api/pith-number/BVSDJUPFDQ3X7QDGRCFNJPN4BW/graph.json","fetch_events":"https://pith.science/api/pith-number/BVSDJUPFDQ3X7QDGRCFNJPN4BW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BVSDJUPFDQ3X7QDGRCFNJPN4BW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BVSDJUPFDQ3X7QDGRCFNJPN4BW/action/storage_attestation","attest_author":"https://pith.science/pith/BVSDJUPFDQ3X7QDGRCFNJPN4BW/action/author_attestation","sign_citation":"https://pith.science/pith/BVSDJUPFDQ3X7QDGRCFNJPN4BW/action/citation_signature","submit_replication":"https://pith.science/pith/BVSDJUPFDQ3X7QDGRCFNJPN4BW/action/replication_record"}},"created_at":"2026-05-18T00:28:55.700051+00:00","updated_at":"2026-05-18T00:28:55.700051+00:00"}