{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:A24UXDIGI2CUCU6SFY2KLPETHU","short_pith_number":"pith:A24UXDIG","schema_version":"1.0","canonical_sha256":"06b94b8d0646854153d22e34a5bc933d02ced7fc48e8b46e0010413b4b632cbf","source":{"kind":"arxiv","id":"1706.03887","version":1},"attestation_state":"computed","paper":{"title":"Clustering High Dimensional Dynamic Data Streams","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Christian Sohler, Gereon Frahling, Harry Lang, Lin F. Yang, Vladimir Braverman","submitted_at":"2017-06-13T02:05:11Z","abstract_excerpt":"We present data streaming algorithms for the $k$-median problem in high-dimensional dynamic geometric data streams, i.e. streams allowing both insertions and deletions of points from a discrete Euclidean space $\\{1, 2, \\ldots \\Delta\\}^d$. Our algorithms use $k \\epsilon^{-2} poly(d \\log \\Delta)$ space/time and maintain with high probability a small weighted set of points (a coreset) such that for every set of $k$ centers the cost of the coreset $(1+\\epsilon)$-approximates the cost of the streamed point set. We also provide algorithms that guarantee only positive weights in the coreset with addi"},"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":"1706.03887","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-06-13T02:05:11Z","cross_cats_sorted":[],"title_canon_sha256":"20780d53120082d740e5ab96bb2dc0bcefaf901e11f0b94f39a4a1089d5bbc7b","abstract_canon_sha256":"3f68ae49ebe540ba267c7c70019b46d74ecd7a7096417ed283d65bbb6e3cf6ac"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:42:28.089273Z","signature_b64":"rbmLrCwtzHQx5NmU56fH260lZAh279dEN91vjk++YMj1F2d1xkNGZRyMI9C+yuFGNjPZp9rarlhEPB7STqr0BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"06b94b8d0646854153d22e34a5bc933d02ced7fc48e8b46e0010413b4b632cbf","last_reissued_at":"2026-05-18T00:42:28.088705Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:42:28.088705Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Clustering High Dimensional Dynamic Data Streams","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Christian Sohler, Gereon Frahling, Harry Lang, Lin F. Yang, Vladimir Braverman","submitted_at":"2017-06-13T02:05:11Z","abstract_excerpt":"We present data streaming algorithms for the $k$-median problem in high-dimensional dynamic geometric data streams, i.e. streams allowing both insertions and deletions of points from a discrete Euclidean space $\\{1, 2, \\ldots \\Delta\\}^d$. Our algorithms use $k \\epsilon^{-2} poly(d \\log \\Delta)$ space/time and maintain with high probability a small weighted set of points (a coreset) such that for every set of $k$ centers the cost of the coreset $(1+\\epsilon)$-approximates the cost of the streamed point set. We also provide algorithms that guarantee only positive weights in the coreset with addi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.03887","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":"1706.03887","created_at":"2026-05-18T00:42:28.088795+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.03887v1","created_at":"2026-05-18T00:42:28.088795+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.03887","created_at":"2026-05-18T00:42:28.088795+00:00"},{"alias_kind":"pith_short_12","alias_value":"A24UXDIGI2CU","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_16","alias_value":"A24UXDIGI2CUCU6S","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_8","alias_value":"A24UXDIG","created_at":"2026-05-18T12:31:05.417338+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/A24UXDIGI2CUCU6SFY2KLPETHU","json":"https://pith.science/pith/A24UXDIGI2CUCU6SFY2KLPETHU.json","graph_json":"https://pith.science/api/pith-number/A24UXDIGI2CUCU6SFY2KLPETHU/graph.json","events_json":"https://pith.science/api/pith-number/A24UXDIGI2CUCU6SFY2KLPETHU/events.json","paper":"https://pith.science/paper/A24UXDIG"},"agent_actions":{"view_html":"https://pith.science/pith/A24UXDIGI2CUCU6SFY2KLPETHU","download_json":"https://pith.science/pith/A24UXDIGI2CUCU6SFY2KLPETHU.json","view_paper":"https://pith.science/paper/A24UXDIG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.03887&json=true","fetch_graph":"https://pith.science/api/pith-number/A24UXDIGI2CUCU6SFY2KLPETHU/graph.json","fetch_events":"https://pith.science/api/pith-number/A24UXDIGI2CUCU6SFY2KLPETHU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/A24UXDIGI2CUCU6SFY2KLPETHU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/A24UXDIGI2CUCU6SFY2KLPETHU/action/storage_attestation","attest_author":"https://pith.science/pith/A24UXDIGI2CUCU6SFY2KLPETHU/action/author_attestation","sign_citation":"https://pith.science/pith/A24UXDIGI2CUCU6SFY2KLPETHU/action/citation_signature","submit_replication":"https://pith.science/pith/A24UXDIGI2CUCU6SFY2KLPETHU/action/replication_record"}},"created_at":"2026-05-18T00:42:28.088795+00:00","updated_at":"2026-05-18T00:42:28.088795+00:00"}