{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:XMOGNPVYOJ7TNJ27RJQUBZ6LHE","short_pith_number":"pith:XMOGNPVY","schema_version":"1.0","canonical_sha256":"bb1c66beb8727f36a75f8a6140e7cb393c2068d7d87ba45e0b5879ca493df46f","source":{"kind":"arxiv","id":"1212.1829","version":1},"attestation_state":"computed","paper":{"title":"Efficient Computer Network Anomaly Detection by Changepoint Detection Methods","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.AP","authors_text":"Aleksey S. Polunchenko, Alexander G. Tartakovsky, Grigory Sokolov","submitted_at":"2012-12-08T19:16:07Z","abstract_excerpt":"We consider the problem of efficient on-line anomaly detection in computer network traffic. The problem is approached statistically, as that of sequential (quickest) changepoint detection. A multi-cyclic setting of quickest change detection is a natural fit for this problem. We propose a novel score-based multi-cyclic detection algorithm. The algorithm is based on the so-called Shiryaev-Roberts procedure. This procedure is as easy to employ in practice and as computationally inexpensive as the popular Cumulative Sum chart and the Exponentially Weighted Moving Average scheme. The likelihood rat"},"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":"1212.1829","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.AP","submitted_at":"2012-12-08T19:16:07Z","cross_cats_sorted":[],"title_canon_sha256":"3156b220a2156afa6f1916bdf64305e5238af0ef05b92436296c0c4d81f116e8","abstract_canon_sha256":"0eb229c1870e3a53414c081762a97d515c87d54fd98922dc00a60da3924bd886"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:17:56.995901Z","signature_b64":"DEmbpiy86f0eKi1qNhZ7PVF6OZgJVrYErnvp0ymLkANNIdI6Mlm4Jvjq0b81WZKNo3cYcFpXaqhXI3bNKM/IAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bb1c66beb8727f36a75f8a6140e7cb393c2068d7d87ba45e0b5879ca493df46f","last_reissued_at":"2026-05-18T03:17:56.995217Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:17:56.995217Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Computer Network Anomaly Detection by Changepoint Detection Methods","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.AP","authors_text":"Aleksey S. Polunchenko, Alexander G. Tartakovsky, Grigory Sokolov","submitted_at":"2012-12-08T19:16:07Z","abstract_excerpt":"We consider the problem of efficient on-line anomaly detection in computer network traffic. The problem is approached statistically, as that of sequential (quickest) changepoint detection. A multi-cyclic setting of quickest change detection is a natural fit for this problem. We propose a novel score-based multi-cyclic detection algorithm. The algorithm is based on the so-called Shiryaev-Roberts procedure. This procedure is as easy to employ in practice and as computationally inexpensive as the popular Cumulative Sum chart and the Exponentially Weighted Moving Average scheme. The likelihood rat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.1829","kind":"arxiv","version":1},"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":"1212.1829","created_at":"2026-05-18T03:17:56.995331+00:00"},{"alias_kind":"arxiv_version","alias_value":"1212.1829v1","created_at":"2026-05-18T03:17:56.995331+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.1829","created_at":"2026-05-18T03:17:56.995331+00:00"},{"alias_kind":"pith_short_12","alias_value":"XMOGNPVYOJ7T","created_at":"2026-05-18T12:27:27.928770+00:00"},{"alias_kind":"pith_short_16","alias_value":"XMOGNPVYOJ7TNJ27","created_at":"2026-05-18T12:27:27.928770+00:00"},{"alias_kind":"pith_short_8","alias_value":"XMOGNPVY","created_at":"2026-05-18T12:27:27.928770+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/XMOGNPVYOJ7TNJ27RJQUBZ6LHE","json":"https://pith.science/pith/XMOGNPVYOJ7TNJ27RJQUBZ6LHE.json","graph_json":"https://pith.science/api/pith-number/XMOGNPVYOJ7TNJ27RJQUBZ6LHE/graph.json","events_json":"https://pith.science/api/pith-number/XMOGNPVYOJ7TNJ27RJQUBZ6LHE/events.json","paper":"https://pith.science/paper/XMOGNPVY"},"agent_actions":{"view_html":"https://pith.science/pith/XMOGNPVYOJ7TNJ27RJQUBZ6LHE","download_json":"https://pith.science/pith/XMOGNPVYOJ7TNJ27RJQUBZ6LHE.json","view_paper":"https://pith.science/paper/XMOGNPVY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1212.1829&json=true","fetch_graph":"https://pith.science/api/pith-number/XMOGNPVYOJ7TNJ27RJQUBZ6LHE/graph.json","fetch_events":"https://pith.science/api/pith-number/XMOGNPVYOJ7TNJ27RJQUBZ6LHE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XMOGNPVYOJ7TNJ27RJQUBZ6LHE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XMOGNPVYOJ7TNJ27RJQUBZ6LHE/action/storage_attestation","attest_author":"https://pith.science/pith/XMOGNPVYOJ7TNJ27RJQUBZ6LHE/action/author_attestation","sign_citation":"https://pith.science/pith/XMOGNPVYOJ7TNJ27RJQUBZ6LHE/action/citation_signature","submit_replication":"https://pith.science/pith/XMOGNPVYOJ7TNJ27RJQUBZ6LHE/action/replication_record"}},"created_at":"2026-05-18T03:17:56.995331+00:00","updated_at":"2026-05-18T03:17:56.995331+00:00"}