{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:75RFUJGVPDWTQLV64LJNV3SQIQ","short_pith_number":"pith:75RFUJGV","schema_version":"1.0","canonical_sha256":"ff625a24d578ed382ebee2d2daee50440278189066c6c8fae47711a95d7c0186","source":{"kind":"arxiv","id":"1202.2849","version":2},"attestation_state":"computed","paper":{"title":"Nearly Optimal Change-Point Detection with an Application to Cybersecurity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.AP","stat.TH"],"primary_cat":"math.ST","authors_text":"Aleksey S. Polunchenko, Alexander G. Tartakovsky, Nitis Mukhopadhyay","submitted_at":"2012-02-13T20:59:32Z","abstract_excerpt":"We address the sequential change-point detection problem for the Gaussian model where baseline distribution is Gaussian with variance \\sigma^2 and mean \\mu such that \\sigma^2=a\\mu, where a>0 is a known constant; the change is in \\mu from one known value to another. First, we carry out a comparative performance analysis of four detection procedures: the CUSUM procedure, the Shiryaev-Roberts (SR) procedure, and two its modifications - the Shiryaev-Roberts-Pollak and Shiryaev-Roberts-r procedures. The performance is benchmarked via Pollak's maximal average delay to detection and Shiryaev's statio"},"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":"1202.2849","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2012-02-13T20:59:32Z","cross_cats_sorted":["stat.AP","stat.TH"],"title_canon_sha256":"b7c12f411062d8a417888ef5f57477687e362574b72d10fcc9007fa4bd536972","abstract_canon_sha256":"2f3b868fa3487d5b455bc841fded278547825bd3beb780aa348fd5605818a1ce"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:00:51.409470Z","signature_b64":"ak6VV6t4L4XsCDjmcdoYzVPsVWql7B09JyRNErZIcQxTuhZU5IL1Nb/iUb9zDC1fe0bksPmxyk8gg5iX9NywBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ff625a24d578ed382ebee2d2daee50440278189066c6c8fae47711a95d7c0186","last_reissued_at":"2026-05-18T04:00:51.408233Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:00:51.408233Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Nearly Optimal Change-Point Detection with an Application to Cybersecurity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.AP","stat.TH"],"primary_cat":"math.ST","authors_text":"Aleksey S. Polunchenko, Alexander G. Tartakovsky, Nitis Mukhopadhyay","submitted_at":"2012-02-13T20:59:32Z","abstract_excerpt":"We address the sequential change-point detection problem for the Gaussian model where baseline distribution is Gaussian with variance \\sigma^2 and mean \\mu such that \\sigma^2=a\\mu, where a>0 is a known constant; the change is in \\mu from one known value to another. First, we carry out a comparative performance analysis of four detection procedures: the CUSUM procedure, the Shiryaev-Roberts (SR) procedure, and two its modifications - the Shiryaev-Roberts-Pollak and Shiryaev-Roberts-r procedures. The performance is benchmarked via Pollak's maximal average delay to detection and Shiryaev's statio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.2849","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":"1202.2849","created_at":"2026-05-18T04:00:51.408351+00:00"},{"alias_kind":"arxiv_version","alias_value":"1202.2849v2","created_at":"2026-05-18T04:00:51.408351+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.2849","created_at":"2026-05-18T04:00:51.408351+00:00"},{"alias_kind":"pith_short_12","alias_value":"75RFUJGVPDWT","created_at":"2026-05-18T12:26:56.085431+00:00"},{"alias_kind":"pith_short_16","alias_value":"75RFUJGVPDWTQLV6","created_at":"2026-05-18T12:26:56.085431+00:00"},{"alias_kind":"pith_short_8","alias_value":"75RFUJGV","created_at":"2026-05-18T12:26:56.085431+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/75RFUJGVPDWTQLV64LJNV3SQIQ","json":"https://pith.science/pith/75RFUJGVPDWTQLV64LJNV3SQIQ.json","graph_json":"https://pith.science/api/pith-number/75RFUJGVPDWTQLV64LJNV3SQIQ/graph.json","events_json":"https://pith.science/api/pith-number/75RFUJGVPDWTQLV64LJNV3SQIQ/events.json","paper":"https://pith.science/paper/75RFUJGV"},"agent_actions":{"view_html":"https://pith.science/pith/75RFUJGVPDWTQLV64LJNV3SQIQ","download_json":"https://pith.science/pith/75RFUJGVPDWTQLV64LJNV3SQIQ.json","view_paper":"https://pith.science/paper/75RFUJGV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1202.2849&json=true","fetch_graph":"https://pith.science/api/pith-number/75RFUJGVPDWTQLV64LJNV3SQIQ/graph.json","fetch_events":"https://pith.science/api/pith-number/75RFUJGVPDWTQLV64LJNV3SQIQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/75RFUJGVPDWTQLV64LJNV3SQIQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/75RFUJGVPDWTQLV64LJNV3SQIQ/action/storage_attestation","attest_author":"https://pith.science/pith/75RFUJGVPDWTQLV64LJNV3SQIQ/action/author_attestation","sign_citation":"https://pith.science/pith/75RFUJGVPDWTQLV64LJNV3SQIQ/action/citation_signature","submit_replication":"https://pith.science/pith/75RFUJGVPDWTQLV64LJNV3SQIQ/action/replication_record"}},"created_at":"2026-05-18T04:00:51.408351+00:00","updated_at":"2026-05-18T04:00:51.408351+00:00"}