{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:TIWDDJKPHXDLUPM3U6PENMEI2P","short_pith_number":"pith:TIWDDJKP","schema_version":"1.0","canonical_sha256":"9a2c31a54f3dc6ba3d9ba79e46b088d3ffe17583affefcc7e6e569dd77ddb9a2","source":{"kind":"arxiv","id":"1612.07516","version":3},"attestation_state":"computed","paper":{"title":"On Coreset Constructions for the Fuzzy $K$-Means Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.LG","authors_text":"Johannes Bl\\\"omer, Kathrin Bujna, Sascha Brauer","submitted_at":"2016-12-22T10:10:11Z","abstract_excerpt":"The fuzzy $K$-means problem is a popular generalization of the well-known $K$-means problem to soft clusterings. We present the first coresets for fuzzy $K$-means with size linear in the dimension, polynomial in the number of clusters, and poly-logarithmic in the number of points. We show that these coresets can be employed in the computation of a $(1+\\epsilon)$-approximation for fuzzy $K$-means, improving previously presented results. We further show that our coresets can be maintained in an insertion-only streaming setting, where data points arrive one-by-one."},"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":"1612.07516","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-12-22T10:10:11Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"d5959bdec9695d0efc09a308779ccc6a323b37fe757f623223fb9a46ff36baa3","abstract_canon_sha256":"e8a6658bc9c14660e2a06703547e078584a8dbe45b99096b06f8bcc54742f510"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:04:41.936879Z","signature_b64":"8QjTzpDCAOvLYj1kq1utr/kgwWvLlxpaAkrJyBS5YP09T8AA1/kghDAY24i039PExfhTxwKo/OPgeYbXkySKDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9a2c31a54f3dc6ba3d9ba79e46b088d3ffe17583affefcc7e6e569dd77ddb9a2","last_reissued_at":"2026-05-18T00:04:41.936112Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:04:41.936112Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Coreset Constructions for the Fuzzy $K$-Means Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.LG","authors_text":"Johannes Bl\\\"omer, Kathrin Bujna, Sascha Brauer","submitted_at":"2016-12-22T10:10:11Z","abstract_excerpt":"The fuzzy $K$-means problem is a popular generalization of the well-known $K$-means problem to soft clusterings. We present the first coresets for fuzzy $K$-means with size linear in the dimension, polynomial in the number of clusters, and poly-logarithmic in the number of points. We show that these coresets can be employed in the computation of a $(1+\\epsilon)$-approximation for fuzzy $K$-means, improving previously presented results. We further show that our coresets can be maintained in an insertion-only streaming setting, where data points arrive one-by-one."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.07516","kind":"arxiv","version":3},"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":"1612.07516","created_at":"2026-05-18T00:04:41.936226+00:00"},{"alias_kind":"arxiv_version","alias_value":"1612.07516v3","created_at":"2026-05-18T00:04:41.936226+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.07516","created_at":"2026-05-18T00:04:41.936226+00:00"},{"alias_kind":"pith_short_12","alias_value":"TIWDDJKPHXDL","created_at":"2026-05-18T12:30:44.179134+00:00"},{"alias_kind":"pith_short_16","alias_value":"TIWDDJKPHXDLUPM3","created_at":"2026-05-18T12:30:44.179134+00:00"},{"alias_kind":"pith_short_8","alias_value":"TIWDDJKP","created_at":"2026-05-18T12:30:44.179134+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/TIWDDJKPHXDLUPM3U6PENMEI2P","json":"https://pith.science/pith/TIWDDJKPHXDLUPM3U6PENMEI2P.json","graph_json":"https://pith.science/api/pith-number/TIWDDJKPHXDLUPM3U6PENMEI2P/graph.json","events_json":"https://pith.science/api/pith-number/TIWDDJKPHXDLUPM3U6PENMEI2P/events.json","paper":"https://pith.science/paper/TIWDDJKP"},"agent_actions":{"view_html":"https://pith.science/pith/TIWDDJKPHXDLUPM3U6PENMEI2P","download_json":"https://pith.science/pith/TIWDDJKPHXDLUPM3U6PENMEI2P.json","view_paper":"https://pith.science/paper/TIWDDJKP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1612.07516&json=true","fetch_graph":"https://pith.science/api/pith-number/TIWDDJKPHXDLUPM3U6PENMEI2P/graph.json","fetch_events":"https://pith.science/api/pith-number/TIWDDJKPHXDLUPM3U6PENMEI2P/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TIWDDJKPHXDLUPM3U6PENMEI2P/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TIWDDJKPHXDLUPM3U6PENMEI2P/action/storage_attestation","attest_author":"https://pith.science/pith/TIWDDJKPHXDLUPM3U6PENMEI2P/action/author_attestation","sign_citation":"https://pith.science/pith/TIWDDJKPHXDLUPM3U6PENMEI2P/action/citation_signature","submit_replication":"https://pith.science/pith/TIWDDJKPHXDLUPM3U6PENMEI2P/action/replication_record"}},"created_at":"2026-05-18T00:04:41.936226+00:00","updated_at":"2026-05-18T00:04:41.936226+00:00"}