{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:DVO54WUMAO6GBCRVPSIR343AZ2","short_pith_number":"pith:DVO54WUM","canonical_record":{"source":{"id":"1504.05553","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-21T19:07:42Z","cross_cats_sorted":[],"title_canon_sha256":"c5082dca41c348e182f758f092b46aeea0822f9e9f365943336c463c68b9678a","abstract_canon_sha256":"c57422eb74fd82d664d01fbddf3c26994d861c761348f5f19fb2bcfc513b22bf"},"schema_version":"1.0"},"canonical_sha256":"1d5dde5a8c03bc608a357c911df360ceaa6fef492445850a0fc928bbc01edf61","source":{"kind":"arxiv","id":"1504.05553","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.05553","created_at":"2026-05-18T02:18:14Z"},{"alias_kind":"arxiv_version","alias_value":"1504.05553v1","created_at":"2026-05-18T02:18:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.05553","created_at":"2026-05-18T02:18:14Z"},{"alias_kind":"pith_short_12","alias_value":"DVO54WUMAO6G","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"DVO54WUMAO6GBCRV","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"DVO54WUM","created_at":"2026-05-18T12:29:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:DVO54WUMAO6GBCRVPSIR343AZ2","target":"record","payload":{"canonical_record":{"source":{"id":"1504.05553","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-21T19:07:42Z","cross_cats_sorted":[],"title_canon_sha256":"c5082dca41c348e182f758f092b46aeea0822f9e9f365943336c463c68b9678a","abstract_canon_sha256":"c57422eb74fd82d664d01fbddf3c26994d861c761348f5f19fb2bcfc513b22bf"},"schema_version":"1.0"},"canonical_sha256":"1d5dde5a8c03bc608a357c911df360ceaa6fef492445850a0fc928bbc01edf61","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:18:14.024604Z","signature_b64":"gxfirQ+xLLbwnHeu6JFNqe2X1hSbp2bXjv/2zEWlS8n2tgBg0UzpyXVnG/oHSK6tQFiy9QqgF+HyXlm1KzhsDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1d5dde5a8c03bc608a357c911df360ceaa6fef492445850a0fc928bbc01edf61","last_reissued_at":"2026-05-18T02:18:14.024214Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:18:14.024214Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1504.05553","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-18T02:18:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fu4nKgxlcS21aLy+VsQ5soowy/gRUnJ4/P2QHNdkUtD6//Z9IAtYPQOKUwWFZP51/YI2QfgzztvLgrH3hFHGBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T12:59:00.243450Z"},"content_sha256":"ac5b18597f866890562a7875783438302c637e318cb798b8bc601a0f605c114e","schema_version":"1.0","event_id":"sha256:ac5b18597f866890562a7875783438302c637e318cb798b8bc601a0f605c114e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:DVO54WUMAO6GBCRVPSIR343AZ2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Unified Approach for Clustering Problems on Sliding Windows","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Harry Lang, Keith Levin, Morteza Monemizadeh, Vladimir Braverman","submitted_at":"2015-04-21T19:07:42Z","abstract_excerpt":"We explore clustering problems in the streaming sliding window model in both general metric spaces and Euclidean space. We present the first polylogarithmic space $O(1)$-approximation to the metric $k$-median and metric $k$-means problems in the sliding window model, answering the main open problem posed by Babcock, Datar, Motwani and O'Callaghan, which has remained unanswered for over a decade. Our algorithm uses $O(k^3 \\log^6 n)$ space and $\\operatorname{poly}(k, \\log n)$ update time. This is an exponential improvement on the space required by the technique due to Babcock, et al. We introduc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.05553","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-18T02:18:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0mLZfszYr4lBab8W8kHXt9lndiUT8g2LJo8hXyKF/EA3YZs7VN3Rsi7UF3gfKW5EZ04KgG0xgz6X+fB1pWGrAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T12:59:00.243834Z"},"content_sha256":"87f87beb70c753879395d23817a5b55b9552e7fa148f710d9a9a4481175c4e5c","schema_version":"1.0","event_id":"sha256:87f87beb70c753879395d23817a5b55b9552e7fa148f710d9a9a4481175c4e5c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DVO54WUMAO6GBCRVPSIR343AZ2/bundle.json","state_url":"https://pith.science/pith/DVO54WUMAO6GBCRVPSIR343AZ2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DVO54WUMAO6GBCRVPSIR343AZ2/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-26T12:59:00Z","links":{"resolver":"https://pith.science/pith/DVO54WUMAO6GBCRVPSIR343AZ2","bundle":"https://pith.science/pith/DVO54WUMAO6GBCRVPSIR343AZ2/bundle.json","state":"https://pith.science/pith/DVO54WUMAO6GBCRVPSIR343AZ2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DVO54WUMAO6GBCRVPSIR343AZ2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:DVO54WUMAO6GBCRVPSIR343AZ2","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":"c57422eb74fd82d664d01fbddf3c26994d861c761348f5f19fb2bcfc513b22bf","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-21T19:07:42Z","title_canon_sha256":"c5082dca41c348e182f758f092b46aeea0822f9e9f365943336c463c68b9678a"},"schema_version":"1.0","source":{"id":"1504.05553","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.05553","created_at":"2026-05-18T02:18:14Z"},{"alias_kind":"arxiv_version","alias_value":"1504.05553v1","created_at":"2026-05-18T02:18:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.05553","created_at":"2026-05-18T02:18:14Z"},{"alias_kind":"pith_short_12","alias_value":"DVO54WUMAO6G","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"DVO54WUMAO6GBCRV","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"DVO54WUM","created_at":"2026-05-18T12:29:17Z"}],"graph_snapshots":[{"event_id":"sha256:87f87beb70c753879395d23817a5b55b9552e7fa148f710d9a9a4481175c4e5c","target":"graph","created_at":"2026-05-18T02:18:14Z","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":"We explore clustering problems in the streaming sliding window model in both general metric spaces and Euclidean space. We present the first polylogarithmic space $O(1)$-approximation to the metric $k$-median and metric $k$-means problems in the sliding window model, answering the main open problem posed by Babcock, Datar, Motwani and O'Callaghan, which has remained unanswered for over a decade. Our algorithm uses $O(k^3 \\log^6 n)$ space and $\\operatorname{poly}(k, \\log n)$ update time. This is an exponential improvement on the space required by the technique due to Babcock, et al. We introduc","authors_text":"Harry Lang, Keith Levin, Morteza Monemizadeh, Vladimir Braverman","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-21T19:07:42Z","title":"A Unified Approach for Clustering Problems on Sliding Windows"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.05553","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:ac5b18597f866890562a7875783438302c637e318cb798b8bc601a0f605c114e","target":"record","created_at":"2026-05-18T02:18:14Z","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":"c57422eb74fd82d664d01fbddf3c26994d861c761348f5f19fb2bcfc513b22bf","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-21T19:07:42Z","title_canon_sha256":"c5082dca41c348e182f758f092b46aeea0822f9e9f365943336c463c68b9678a"},"schema_version":"1.0","source":{"id":"1504.05553","kind":"arxiv","version":1}},"canonical_sha256":"1d5dde5a8c03bc608a357c911df360ceaa6fef492445850a0fc928bbc01edf61","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1d5dde5a8c03bc608a357c911df360ceaa6fef492445850a0fc928bbc01edf61","first_computed_at":"2026-05-18T02:18:14.024214Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:18:14.024214Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gxfirQ+xLLbwnHeu6JFNqe2X1hSbp2bXjv/2zEWlS8n2tgBg0UzpyXVnG/oHSK6tQFiy9QqgF+HyXlm1KzhsDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:18:14.024604Z","signed_message":"canonical_sha256_bytes"},"source_id":"1504.05553","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ac5b18597f866890562a7875783438302c637e318cb798b8bc601a0f605c114e","sha256:87f87beb70c753879395d23817a5b55b9552e7fa148f710d9a9a4481175c4e5c"],"state_sha256":"923d1a61eec2e2c9f95c8b8cc059611ed6623aa4762e13113f9e280c6d90a8b4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lbFPH18EJMpclkl4qBiTbwpVJNzC9jGwJT9FD49scg7fEclKQrGqEBW+RCfpl8q4wRl9RZqdiWKecC/zoU2ZAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T12:59:00.246835Z","bundle_sha256":"092488c99d76fc2dd047c8834907edb8afcd21506d8f644426e79ba8254fe6db"}}