{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:SQDL2F7ZCNXNFHEFYRML33P76Q","short_pith_number":"pith:SQDL2F7Z","canonical_record":{"source":{"id":"1902.00632","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-02-02T03:03:01Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"9c830bac58aec83fe4c7bd7584d920d2111242312e1e3c883f3c6c285796b6d8","abstract_canon_sha256":"e726b43d479b2c0b116c2986f6e3495821bee58afde1a854ed4601a306201870"},"schema_version":"1.0"},"canonical_sha256":"9406bd17f9136ed29c85c458bdedfff42ba9e62f6de97f96b46978aa2545b053","source":{"kind":"arxiv","id":"1902.00632","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.00632","created_at":"2026-05-17T23:54:52Z"},{"alias_kind":"arxiv_version","alias_value":"1902.00632v1","created_at":"2026-05-17T23:54:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.00632","created_at":"2026-05-17T23:54:52Z"},{"alias_kind":"pith_short_12","alias_value":"SQDL2F7ZCNXN","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"SQDL2F7ZCNXNFHEF","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"SQDL2F7Z","created_at":"2026-05-18T12:33:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:SQDL2F7ZCNXNFHEFYRML33P76Q","target":"record","payload":{"canonical_record":{"source":{"id":"1902.00632","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-02-02T03:03:01Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"9c830bac58aec83fe4c7bd7584d920d2111242312e1e3c883f3c6c285796b6d8","abstract_canon_sha256":"e726b43d479b2c0b116c2986f6e3495821bee58afde1a854ed4601a306201870"},"schema_version":"1.0"},"canonical_sha256":"9406bd17f9136ed29c85c458bdedfff42ba9e62f6de97f96b46978aa2545b053","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:54:52.614396Z","signature_b64":"l8gEY71mUWn2Ng2xMyd8bIZv8n03hTbapa2eSjDvFX58jtEJO5tyn7KsuQfl/6HyBkehZa6FL86awMHSWibDAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9406bd17f9136ed29c85c458bdedfff42ba9e62f6de97f96b46978aa2545b053","last_reissued_at":"2026-05-17T23:54:52.613877Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:54:52.613877Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1902.00632","source_version":1,"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-17T23:54:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nFRwPrc4lz/nvtqaS9NL2d0GIGwc5fvuV6lLGLcnbIjLU6FxJo8kRXMrIBhnf3KVqWDSdOCLnlPhJ2dERrViBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T11:00:41.690163Z"},"content_sha256":"bc77952532442f2630b11e1cad3967417b640f10315eda4ac50e1715c5bc3c4e","schema_version":"1.0","event_id":"sha256:bc77952532442f2630b11e1cad3967417b640f10315eda4ac50e1715c5bc3c4e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:SQDL2F7ZCNXNFHEFYRML33P76Q","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient estimation of AUC in a sliding window","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Nikolaj Tatti","submitted_at":"2019-02-02T03:03:01Z","abstract_excerpt":"In many applications, monitoring area under the ROC curve (AUC) in a sliding window over a data stream is a natural way of detecting changes in the system. The drawback is that computing AUC in a sliding window is expensive, especially if the window size is large and the data flow is significant.\n  In this paper we propose a scheme for maintaining an approximate AUC in a sliding window of length $k$. More specifically, we propose an algorithm that, given $\\epsilon$, estimates AUC within $\\epsilon / 2$, and can maintain this estimate in $O((\\log k) / \\epsilon)$ time, per update, as the window s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.00632","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"},"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-17T23:54:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z9ZaYjJlIPPBfh3oEeUAL2OwiYoUocHL4+P473rAFQ/TPqQlBjmP3KRjvTBg58tO0xxq4PhyoseFg06L1yrhCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T11:00:41.690842Z"},"content_sha256":"dcdd694fa1253c9324a0bbf6c83139ba815697d54a574c798f895b0ef73f98f6","schema_version":"1.0","event_id":"sha256:dcdd694fa1253c9324a0bbf6c83139ba815697d54a574c798f895b0ef73f98f6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SQDL2F7ZCNXNFHEFYRML33P76Q/bundle.json","state_url":"https://pith.science/pith/SQDL2F7ZCNXNFHEFYRML33P76Q/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SQDL2F7ZCNXNFHEFYRML33P76Q/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-05-26T11:00:41Z","links":{"resolver":"https://pith.science/pith/SQDL2F7ZCNXNFHEFYRML33P76Q","bundle":"https://pith.science/pith/SQDL2F7ZCNXNFHEFYRML33P76Q/bundle.json","state":"https://pith.science/pith/SQDL2F7ZCNXNFHEFYRML33P76Q/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SQDL2F7ZCNXNFHEFYRML33P76Q/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:SQDL2F7ZCNXNFHEFYRML33P76Q","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":"e726b43d479b2c0b116c2986f6e3495821bee58afde1a854ed4601a306201870","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-02-02T03:03:01Z","title_canon_sha256":"9c830bac58aec83fe4c7bd7584d920d2111242312e1e3c883f3c6c285796b6d8"},"schema_version":"1.0","source":{"id":"1902.00632","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.00632","created_at":"2026-05-17T23:54:52Z"},{"alias_kind":"arxiv_version","alias_value":"1902.00632v1","created_at":"2026-05-17T23:54:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.00632","created_at":"2026-05-17T23:54:52Z"},{"alias_kind":"pith_short_12","alias_value":"SQDL2F7ZCNXN","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"SQDL2F7ZCNXNFHEF","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"SQDL2F7Z","created_at":"2026-05-18T12:33:27Z"}],"graph_snapshots":[{"event_id":"sha256:dcdd694fa1253c9324a0bbf6c83139ba815697d54a574c798f895b0ef73f98f6","target":"graph","created_at":"2026-05-17T23:54:52Z","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":"In many applications, monitoring area under the ROC curve (AUC) in a sliding window over a data stream is a natural way of detecting changes in the system. The drawback is that computing AUC in a sliding window is expensive, especially if the window size is large and the data flow is significant.\n  In this paper we propose a scheme for maintaining an approximate AUC in a sliding window of length $k$. More specifically, we propose an algorithm that, given $\\epsilon$, estimates AUC within $\\epsilon / 2$, and can maintain this estimate in $O((\\log k) / \\epsilon)$ time, per update, as the window s","authors_text":"Nikolaj Tatti","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-02-02T03:03:01Z","title":"Efficient estimation of AUC in a sliding window"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.00632","kind":"arxiv","version":1},"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:bc77952532442f2630b11e1cad3967417b640f10315eda4ac50e1715c5bc3c4e","target":"record","created_at":"2026-05-17T23:54:52Z","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":"e726b43d479b2c0b116c2986f6e3495821bee58afde1a854ed4601a306201870","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-02-02T03:03:01Z","title_canon_sha256":"9c830bac58aec83fe4c7bd7584d920d2111242312e1e3c883f3c6c285796b6d8"},"schema_version":"1.0","source":{"id":"1902.00632","kind":"arxiv","version":1}},"canonical_sha256":"9406bd17f9136ed29c85c458bdedfff42ba9e62f6de97f96b46978aa2545b053","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9406bd17f9136ed29c85c458bdedfff42ba9e62f6de97f96b46978aa2545b053","first_computed_at":"2026-05-17T23:54:52.613877Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:54:52.613877Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"l8gEY71mUWn2Ng2xMyd8bIZv8n03hTbapa2eSjDvFX58jtEJO5tyn7KsuQfl/6HyBkehZa6FL86awMHSWibDAw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:54:52.614396Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.00632","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bc77952532442f2630b11e1cad3967417b640f10315eda4ac50e1715c5bc3c4e","sha256:dcdd694fa1253c9324a0bbf6c83139ba815697d54a574c798f895b0ef73f98f6"],"state_sha256":"2593b6310a6f5979584288630433e0e6706804ac2c937d7452a9efff6cd16320"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x3VQQgFayEBBUbYbjZDQpmo7Q0G/RU2HykLKt/PUkiC1LsV7T/sQaXGqAxKMNJvH6mBi4+K/URGL/9Y3Vi9mBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T11:00:41.693995Z","bundle_sha256":"4228e996ca1fbeb83c13f5c0c797f755cdddbaef2e60ddfc6086e628297651b3"}}