{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:SDLGBIASJJ5GUVR2FBP4JN4E5W","short_pith_number":"pith:SDLGBIAS","schema_version":"1.0","canonical_sha256":"90d660a0124a7a6a563a285fc4b784ed88acd481127d4a6fbf651b35c53a610e","source":{"kind":"arxiv","id":"1112.0826","version":5},"attestation_state":"computed","paper":{"title":"Clustering under Perturbation Resilience","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.LG","authors_text":"Maria Florina Balcan, Yingyu Liang","submitted_at":"2011-12-05T03:42:07Z","abstract_excerpt":"Motivated by the fact that distances between data points in many real-world clustering instances are often based on heuristic measures, Bilu and Linial~\\cite{BL} proposed analyzing objective based clustering problems under the assumption that the optimum clustering to the objective is preserved under small multiplicative perturbations to distances between points. The hope is that by exploiting the structure in such instances, one can overcome worst case hardness results.\n  In this paper, we provide several results within this framework. For center-based objectives, we present an algorithm that"},"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":"1112.0826","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2011-12-05T03:42:07Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"a8b5833d532611476be80d41290edbad5ea68dfe03d3675567abdd09d11b89b0","abstract_canon_sha256":"b5af97c1e1ea5a2e5d1865d7e9fee2b34e668f4d9be37137bcb6023f03504abf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:55:26.155867Z","signature_b64":"njfVOzI+j247ZlTcQJwPFaQtZ47lu95Og4gBrPTUgcfB5xoJTPXeF7ckbeHGkpbnAKP9xU+MGTXKQ0UMfPDWAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"90d660a0124a7a6a563a285fc4b784ed88acd481127d4a6fbf651b35c53a610e","last_reissued_at":"2026-05-18T00:55:26.155114Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:55:26.155114Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Clustering under Perturbation Resilience","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.LG","authors_text":"Maria Florina Balcan, Yingyu Liang","submitted_at":"2011-12-05T03:42:07Z","abstract_excerpt":"Motivated by the fact that distances between data points in many real-world clustering instances are often based on heuristic measures, Bilu and Linial~\\cite{BL} proposed analyzing objective based clustering problems under the assumption that the optimum clustering to the objective is preserved under small multiplicative perturbations to distances between points. The hope is that by exploiting the structure in such instances, one can overcome worst case hardness results.\n  In this paper, we provide several results within this framework. For center-based objectives, we present an algorithm that"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.0826","kind":"arxiv","version":5},"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":"1112.0826","created_at":"2026-05-18T00:55:26.155232+00:00"},{"alias_kind":"arxiv_version","alias_value":"1112.0826v5","created_at":"2026-05-18T00:55:26.155232+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.0826","created_at":"2026-05-18T00:55:26.155232+00:00"},{"alias_kind":"pith_short_12","alias_value":"SDLGBIASJJ5G","created_at":"2026-05-18T12:26:41.206345+00:00"},{"alias_kind":"pith_short_16","alias_value":"SDLGBIASJJ5GUVR2","created_at":"2026-05-18T12:26:41.206345+00:00"},{"alias_kind":"pith_short_8","alias_value":"SDLGBIAS","created_at":"2026-05-18T12:26:41.206345+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.07744","citing_title":"The Condition-Number Principle for Prototype Clustering","ref_index":8,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SDLGBIASJJ5GUVR2FBP4JN4E5W","json":"https://pith.science/pith/SDLGBIASJJ5GUVR2FBP4JN4E5W.json","graph_json":"https://pith.science/api/pith-number/SDLGBIASJJ5GUVR2FBP4JN4E5W/graph.json","events_json":"https://pith.science/api/pith-number/SDLGBIASJJ5GUVR2FBP4JN4E5W/events.json","paper":"https://pith.science/paper/SDLGBIAS"},"agent_actions":{"view_html":"https://pith.science/pith/SDLGBIASJJ5GUVR2FBP4JN4E5W","download_json":"https://pith.science/pith/SDLGBIASJJ5GUVR2FBP4JN4E5W.json","view_paper":"https://pith.science/paper/SDLGBIAS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1112.0826&json=true","fetch_graph":"https://pith.science/api/pith-number/SDLGBIASJJ5GUVR2FBP4JN4E5W/graph.json","fetch_events":"https://pith.science/api/pith-number/SDLGBIASJJ5GUVR2FBP4JN4E5W/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SDLGBIASJJ5GUVR2FBP4JN4E5W/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SDLGBIASJJ5GUVR2FBP4JN4E5W/action/storage_attestation","attest_author":"https://pith.science/pith/SDLGBIASJJ5GUVR2FBP4JN4E5W/action/author_attestation","sign_citation":"https://pith.science/pith/SDLGBIASJJ5GUVR2FBP4JN4E5W/action/citation_signature","submit_replication":"https://pith.science/pith/SDLGBIASJJ5GUVR2FBP4JN4E5W/action/replication_record"}},"created_at":"2026-05-18T00:55:26.155232+00:00","updated_at":"2026-05-18T00:55:26.155232+00:00"}