{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:D2ZLUXXDKGNVN2YVFWSPB2A5A3","short_pith_number":"pith:D2ZLUXXD","schema_version":"1.0","canonical_sha256":"1eb2ba5ee3519b56eb152da4f0e81d06cdba89248c6db557a6e2303ba664efd9","source":{"kind":"arxiv","id":"1009.5168","version":2},"attestation_state":"computed","paper":{"title":"Efficient Clustering with Limited Distance Information","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Heiko Roglin, Konstantin Voevodski, Maria-Florina Balcan, Shang-Hua Teng, Yu Xia","submitted_at":"2010-09-27T06:29:35Z","abstract_excerpt":"Given a point set S and an unknown metric d on S, we study the problem of efficiently partitioning S into k clusters while querying few distances between the points. In our model we assume that we have access to one versus all queries that given a point s in S return the distances between s and all other points. We show that given a natural assumption about the structure of the instance, we can efficiently find an accurate clustering using only O(k) distance queries. Our algorithm uses an active selection strategy to choose a small set of points that we call landmarks, and considers only the d"},"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":"1009.5168","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-09-27T06:29:35Z","cross_cats_sorted":[],"title_canon_sha256":"a136ee2ef325a1f6ffda06baf08f920520dbeb16fc678033aecf49d914a1a884","abstract_canon_sha256":"30cbd11021b497578ebf49fb941b1e138b36041dbaff243b2e00a82763f9f7fc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:22:40.271109Z","signature_b64":"xFXVnBKDzB6i7kfvMvq2POdIrTdIhVGWGwDT11ZWq6RNOdzs1+E+HtsQsIRc1s4lqBOoTlXlHMyfc9nMdm1vBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1eb2ba5ee3519b56eb152da4f0e81d06cdba89248c6db557a6e2303ba664efd9","last_reissued_at":"2026-05-18T04:22:40.270475Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:22:40.270475Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Clustering with Limited Distance Information","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Heiko Roglin, Konstantin Voevodski, Maria-Florina Balcan, Shang-Hua Teng, Yu Xia","submitted_at":"2010-09-27T06:29:35Z","abstract_excerpt":"Given a point set S and an unknown metric d on S, we study the problem of efficiently partitioning S into k clusters while querying few distances between the points. In our model we assume that we have access to one versus all queries that given a point s in S return the distances between s and all other points. We show that given a natural assumption about the structure of the instance, we can efficiently find an accurate clustering using only O(k) distance queries. Our algorithm uses an active selection strategy to choose a small set of points that we call landmarks, and considers only the d"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.5168","kind":"arxiv","version":2},"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":"1009.5168","created_at":"2026-05-18T04:22:40.270567+00:00"},{"alias_kind":"arxiv_version","alias_value":"1009.5168v2","created_at":"2026-05-18T04:22:40.270567+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.5168","created_at":"2026-05-18T04:22:40.270567+00:00"},{"alias_kind":"pith_short_12","alias_value":"D2ZLUXXDKGNV","created_at":"2026-05-18T12:26:06.534383+00:00"},{"alias_kind":"pith_short_16","alias_value":"D2ZLUXXDKGNVN2YV","created_at":"2026-05-18T12:26:06.534383+00:00"},{"alias_kind":"pith_short_8","alias_value":"D2ZLUXXD","created_at":"2026-05-18T12:26:06.534383+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/D2ZLUXXDKGNVN2YVFWSPB2A5A3","json":"https://pith.science/pith/D2ZLUXXDKGNVN2YVFWSPB2A5A3.json","graph_json":"https://pith.science/api/pith-number/D2ZLUXXDKGNVN2YVFWSPB2A5A3/graph.json","events_json":"https://pith.science/api/pith-number/D2ZLUXXDKGNVN2YVFWSPB2A5A3/events.json","paper":"https://pith.science/paper/D2ZLUXXD"},"agent_actions":{"view_html":"https://pith.science/pith/D2ZLUXXDKGNVN2YVFWSPB2A5A3","download_json":"https://pith.science/pith/D2ZLUXXDKGNVN2YVFWSPB2A5A3.json","view_paper":"https://pith.science/paper/D2ZLUXXD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1009.5168&json=true","fetch_graph":"https://pith.science/api/pith-number/D2ZLUXXDKGNVN2YVFWSPB2A5A3/graph.json","fetch_events":"https://pith.science/api/pith-number/D2ZLUXXDKGNVN2YVFWSPB2A5A3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/D2ZLUXXDKGNVN2YVFWSPB2A5A3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/D2ZLUXXDKGNVN2YVFWSPB2A5A3/action/storage_attestation","attest_author":"https://pith.science/pith/D2ZLUXXDKGNVN2YVFWSPB2A5A3/action/author_attestation","sign_citation":"https://pith.science/pith/D2ZLUXXDKGNVN2YVFWSPB2A5A3/action/citation_signature","submit_replication":"https://pith.science/pith/D2ZLUXXDKGNVN2YVFWSPB2A5A3/action/replication_record"}},"created_at":"2026-05-18T04:22:40.270567+00:00","updated_at":"2026-05-18T04:22:40.270567+00:00"}