{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:BFSUZ3X2BRRSK6WEJBIFEB2KI5","short_pith_number":"pith:BFSUZ3X2","schema_version":"1.0","canonical_sha256":"09654ceefa0c63257ac4485052074a47787ed2c2e96fdaedb950814f70e343b8","source":{"kind":"arxiv","id":"1711.01171","version":1},"attestation_state":"computed","paper":{"title":"The Bane of Low-Dimensionality Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.DS","authors_text":"Alan Roytman, Arnaud de Mesmay, Eva Rotenberg, Vincent Cohen-Addad","submitted_at":"2017-11-03T14:05:48Z","abstract_excerpt":"In this paper, we give a conditional lower bound of $n^{\\Omega(k)}$ on running time for the classic k-median and k-means clustering objectives (where n is the size of the input), even in low-dimensional Euclidean space of dimension four, assuming the Exponential Time Hypothesis (ETH). We also consider k-median (and k-means) with penalties where each point need not be assigned to a center, in which case it must pay a penalty, and extend our lower bound to at least three-dimensional Euclidean space.\n  This stands in stark contrast to many other geometric problems such as the traveling salesman p"},"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":"1711.01171","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-03T14:05:48Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"84cd33fdf0a07a53899b0ea3d362520f4888c1ff89fb0010c3d7b992d9a2db64","abstract_canon_sha256":"c39f3f255c1a1ded0d38cd3542ea532f29218f9f581ca39479b2829586f54440"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:23.246476Z","signature_b64":"cdToMAcmdkdZpu/QIceTbNaI+5WSLBhAYU84ejgbK6OXdKVxvfUbU6xur6HWj2wsgl1dezXlxzX02tGvXz5fAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"09654ceefa0c63257ac4485052074a47787ed2c2e96fdaedb950814f70e343b8","last_reissued_at":"2026-05-18T00:31:23.245933Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:23.245933Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Bane of Low-Dimensionality Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.DS","authors_text":"Alan Roytman, Arnaud de Mesmay, Eva Rotenberg, Vincent Cohen-Addad","submitted_at":"2017-11-03T14:05:48Z","abstract_excerpt":"In this paper, we give a conditional lower bound of $n^{\\Omega(k)}$ on running time for the classic k-median and k-means clustering objectives (where n is the size of the input), even in low-dimensional Euclidean space of dimension four, assuming the Exponential Time Hypothesis (ETH). We also consider k-median (and k-means) with penalties where each point need not be assigned to a center, in which case it must pay a penalty, and extend our lower bound to at least three-dimensional Euclidean space.\n  This stands in stark contrast to many other geometric problems such as the traveling salesman p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.01171","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":"1711.01171","created_at":"2026-05-18T00:31:23.246024+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.01171v1","created_at":"2026-05-18T00:31:23.246024+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.01171","created_at":"2026-05-18T00:31:23.246024+00:00"},{"alias_kind":"pith_short_12","alias_value":"BFSUZ3X2BRRS","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_16","alias_value":"BFSUZ3X2BRRSK6WE","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_8","alias_value":"BFSUZ3X2","created_at":"2026-05-18T12:31:08.081275+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/BFSUZ3X2BRRSK6WEJBIFEB2KI5","json":"https://pith.science/pith/BFSUZ3X2BRRSK6WEJBIFEB2KI5.json","graph_json":"https://pith.science/api/pith-number/BFSUZ3X2BRRSK6WEJBIFEB2KI5/graph.json","events_json":"https://pith.science/api/pith-number/BFSUZ3X2BRRSK6WEJBIFEB2KI5/events.json","paper":"https://pith.science/paper/BFSUZ3X2"},"agent_actions":{"view_html":"https://pith.science/pith/BFSUZ3X2BRRSK6WEJBIFEB2KI5","download_json":"https://pith.science/pith/BFSUZ3X2BRRSK6WEJBIFEB2KI5.json","view_paper":"https://pith.science/paper/BFSUZ3X2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.01171&json=true","fetch_graph":"https://pith.science/api/pith-number/BFSUZ3X2BRRSK6WEJBIFEB2KI5/graph.json","fetch_events":"https://pith.science/api/pith-number/BFSUZ3X2BRRSK6WEJBIFEB2KI5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BFSUZ3X2BRRSK6WEJBIFEB2KI5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BFSUZ3X2BRRSK6WEJBIFEB2KI5/action/storage_attestation","attest_author":"https://pith.science/pith/BFSUZ3X2BRRSK6WEJBIFEB2KI5/action/author_attestation","sign_citation":"https://pith.science/pith/BFSUZ3X2BRRSK6WEJBIFEB2KI5/action/citation_signature","submit_replication":"https://pith.science/pith/BFSUZ3X2BRRSK6WEJBIFEB2KI5/action/replication_record"}},"created_at":"2026-05-18T00:31:23.246024+00:00","updated_at":"2026-05-18T00:31:23.246024+00:00"}