{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:DVO54WUMAO6GBCRVPSIR343AZ2","short_pith_number":"pith:DVO54WUM","schema_version":"1.0","canonical_sha256":"1d5dde5a8c03bc608a357c911df360ceaa6fef492445850a0fc928bbc01edf61","source":{"kind":"arxiv","id":"1504.05553","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1504.05553","created_at":"2026-05-18T02:18:14.024275+00:00"},{"alias_kind":"arxiv_version","alias_value":"1504.05553v1","created_at":"2026-05-18T02:18:14.024275+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.05553","created_at":"2026-05-18T02:18:14.024275+00:00"},{"alias_kind":"pith_short_12","alias_value":"DVO54WUMAO6G","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_16","alias_value":"DVO54WUMAO6GBCRV","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_8","alias_value":"DVO54WUM","created_at":"2026-05-18T12:29:17.054201+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/DVO54WUMAO6GBCRVPSIR343AZ2","json":"https://pith.science/pith/DVO54WUMAO6GBCRVPSIR343AZ2.json","graph_json":"https://pith.science/api/pith-number/DVO54WUMAO6GBCRVPSIR343AZ2/graph.json","events_json":"https://pith.science/api/pith-number/DVO54WUMAO6GBCRVPSIR343AZ2/events.json","paper":"https://pith.science/paper/DVO54WUM"},"agent_actions":{"view_html":"https://pith.science/pith/DVO54WUMAO6GBCRVPSIR343AZ2","download_json":"https://pith.science/pith/DVO54WUMAO6GBCRVPSIR343AZ2.json","view_paper":"https://pith.science/paper/DVO54WUM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1504.05553&json=true","fetch_graph":"https://pith.science/api/pith-number/DVO54WUMAO6GBCRVPSIR343AZ2/graph.json","fetch_events":"https://pith.science/api/pith-number/DVO54WUMAO6GBCRVPSIR343AZ2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DVO54WUMAO6GBCRVPSIR343AZ2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DVO54WUMAO6GBCRVPSIR343AZ2/action/storage_attestation","attest_author":"https://pith.science/pith/DVO54WUMAO6GBCRVPSIR343AZ2/action/author_attestation","sign_citation":"https://pith.science/pith/DVO54WUMAO6GBCRVPSIR343AZ2/action/citation_signature","submit_replication":"https://pith.science/pith/DVO54WUMAO6GBCRVPSIR343AZ2/action/replication_record"}},"created_at":"2026-05-18T02:18:14.024275+00:00","updated_at":"2026-05-18T02:18:14.024275+00:00"}