{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:GJ6XH7YS7ZFAELNHENSL257REK","short_pith_number":"pith:GJ6XH7YS","schema_version":"1.0","canonical_sha256":"327d73ff12fe4a022da72364bd77f122b6aecdcc48127eff49a7ea8cf3244b13","source":{"kind":"arxiv","id":"1811.02288","version":1},"attestation_state":"computed","paper":{"title":"High Dimensional Clustering with $r$-nets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Alain Ryser, Georgia Avarikioti, Roger Wattenhofer, Yuyi Wang","submitted_at":"2018-11-06T11:13:09Z","abstract_excerpt":"Clustering, a fundamental task in data science and machine learning, groups a set of objects in such a way that objects in the same cluster are closer to each other than to those in other clusters. In this paper, we consider a well-known structure, so-called $r$-nets, which rigorously captures the properties of clustering. We devise algorithms that improve the run-time of approximating $r$-nets in high-dimensional spaces with $\\ell_1$ and $\\ell_2$ metrics from $\\tilde{O}(dn^{2-\\Theta(\\sqrt{\\epsilon})})$ to $\\tilde{O}(dn + n^{2-\\alpha})$, where $\\alpha = \\Omega({\\epsilon^{1/3}}/{\\log(1/\\epsilon"},"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":"1811.02288","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-11-06T11:13:09Z","cross_cats_sorted":[],"title_canon_sha256":"1ed74ec5f6cf7bad36478d6e53ef3816fbfa7560b88bc3c1214d56b4ba425eea","abstract_canon_sha256":"33ef236d85582989ba581dec446ba7da1021e61d073cd52b604604a6e1ce69eb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:24.630388Z","signature_b64":"T9lKAfsWJegmadtjktRM6zgz3y8NTxbNUfHzsiTTWnX7uSa2bNoU36MbuoIyPMjkQcZjfdP0w4kmggymwEJ0AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"327d73ff12fe4a022da72364bd77f122b6aecdcc48127eff49a7ea8cf3244b13","last_reissued_at":"2026-05-18T00:01:24.629893Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:24.629893Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"High Dimensional Clustering with $r$-nets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Alain Ryser, Georgia Avarikioti, Roger Wattenhofer, Yuyi Wang","submitted_at":"2018-11-06T11:13:09Z","abstract_excerpt":"Clustering, a fundamental task in data science and machine learning, groups a set of objects in such a way that objects in the same cluster are closer to each other than to those in other clusters. In this paper, we consider a well-known structure, so-called $r$-nets, which rigorously captures the properties of clustering. We devise algorithms that improve the run-time of approximating $r$-nets in high-dimensional spaces with $\\ell_1$ and $\\ell_2$ metrics from $\\tilde{O}(dn^{2-\\Theta(\\sqrt{\\epsilon})})$ to $\\tilde{O}(dn + n^{2-\\alpha})$, where $\\alpha = \\Omega({\\epsilon^{1/3}}/{\\log(1/\\epsilon"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.02288","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":"1811.02288","created_at":"2026-05-18T00:01:24.629969+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.02288v1","created_at":"2026-05-18T00:01:24.629969+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.02288","created_at":"2026-05-18T00:01:24.629969+00:00"},{"alias_kind":"pith_short_12","alias_value":"GJ6XH7YS7ZFA","created_at":"2026-05-18T12:32:25.280505+00:00"},{"alias_kind":"pith_short_16","alias_value":"GJ6XH7YS7ZFAELNH","created_at":"2026-05-18T12:32:25.280505+00:00"},{"alias_kind":"pith_short_8","alias_value":"GJ6XH7YS","created_at":"2026-05-18T12:32:25.280505+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/GJ6XH7YS7ZFAELNHENSL257REK","json":"https://pith.science/pith/GJ6XH7YS7ZFAELNHENSL257REK.json","graph_json":"https://pith.science/api/pith-number/GJ6XH7YS7ZFAELNHENSL257REK/graph.json","events_json":"https://pith.science/api/pith-number/GJ6XH7YS7ZFAELNHENSL257REK/events.json","paper":"https://pith.science/paper/GJ6XH7YS"},"agent_actions":{"view_html":"https://pith.science/pith/GJ6XH7YS7ZFAELNHENSL257REK","download_json":"https://pith.science/pith/GJ6XH7YS7ZFAELNHENSL257REK.json","view_paper":"https://pith.science/paper/GJ6XH7YS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.02288&json=true","fetch_graph":"https://pith.science/api/pith-number/GJ6XH7YS7ZFAELNHENSL257REK/graph.json","fetch_events":"https://pith.science/api/pith-number/GJ6XH7YS7ZFAELNHENSL257REK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GJ6XH7YS7ZFAELNHENSL257REK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GJ6XH7YS7ZFAELNHENSL257REK/action/storage_attestation","attest_author":"https://pith.science/pith/GJ6XH7YS7ZFAELNHENSL257REK/action/author_attestation","sign_citation":"https://pith.science/pith/GJ6XH7YS7ZFAELNHENSL257REK/action/citation_signature","submit_replication":"https://pith.science/pith/GJ6XH7YS7ZFAELNHENSL257REK/action/replication_record"}},"created_at":"2026-05-18T00:01:24.629969+00:00","updated_at":"2026-05-18T00:01:24.629969+00:00"}