{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:HM6GHZQERPWAUOMJQKJYNJB7XY","short_pith_number":"pith:HM6GHZQE","schema_version":"1.0","canonical_sha256":"3b3c63e6048bec0a3989829386a43fbe3b897a6fb7ecf25275b284a69199b1e5","source":{"kind":"arxiv","id":"1107.2379","version":5},"attestation_state":"computed","paper":{"title":"Data Stability in Clustering: A Closer Look","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.LG","authors_text":"Lev Reyzin, Shalev Ben-David","submitted_at":"2011-07-12T19:27:12Z","abstract_excerpt":"We consider the model introduced by Bilu and Linial (2010), who study problems for which the optimal clustering does not change when distances are perturbed. They show that even when a problem is NP-hard, it is sometimes possible to obtain efficient algorithms for instances resilient to certain multiplicative perturbations, e.g. on the order of $O(\\sqrt{n})$ for max-cut clustering. Awasthi et al. (2010) consider center-based objectives, and Balcan and Liang (2011) analyze the $k$-median and min-sum objectives, giving efficient algorithms for instances resilient to certain constant multiplicati"},"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":"1107.2379","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2011-07-12T19:27:12Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"e3a7d3aadce85494c157f860447a9a904fcf491266044d26ad6ab7cffe8d68e9","abstract_canon_sha256":"a3a8d714fffa8009ebc2ab681e867353d1dba56ff833eba3d050c611012355dc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:44:00.752189Z","signature_b64":"DTWufMNxIkD12gAZTT4TUTC45qUcQqP9pEUzoGCghV6wrLqtm9vXdJCXuOw/Sjiq8BJZAX/XxFbbWrMeiF8lCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3b3c63e6048bec0a3989829386a43fbe3b897a6fb7ecf25275b284a69199b1e5","last_reissued_at":"2026-05-18T02:44:00.751752Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:44:00.751752Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Data Stability in Clustering: A Closer Look","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.LG","authors_text":"Lev Reyzin, Shalev Ben-David","submitted_at":"2011-07-12T19:27:12Z","abstract_excerpt":"We consider the model introduced by Bilu and Linial (2010), who study problems for which the optimal clustering does not change when distances are perturbed. They show that even when a problem is NP-hard, it is sometimes possible to obtain efficient algorithms for instances resilient to certain multiplicative perturbations, e.g. on the order of $O(\\sqrt{n})$ for max-cut clustering. Awasthi et al. (2010) consider center-based objectives, and Balcan and Liang (2011) analyze the $k$-median and min-sum objectives, giving efficient algorithms for instances resilient to certain constant multiplicati"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.2379","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":"1107.2379","created_at":"2026-05-18T02:44:00.751809+00:00"},{"alias_kind":"arxiv_version","alias_value":"1107.2379v5","created_at":"2026-05-18T02:44:00.751809+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.2379","created_at":"2026-05-18T02:44:00.751809+00:00"},{"alias_kind":"pith_short_12","alias_value":"HM6GHZQERPWA","created_at":"2026-05-18T12:26:30.835961+00:00"},{"alias_kind":"pith_short_16","alias_value":"HM6GHZQERPWAUOMJ","created_at":"2026-05-18T12:26:30.835961+00:00"},{"alias_kind":"pith_short_8","alias_value":"HM6GHZQE","created_at":"2026-05-18T12:26:30.835961+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/HM6GHZQERPWAUOMJQKJYNJB7XY","json":"https://pith.science/pith/HM6GHZQERPWAUOMJQKJYNJB7XY.json","graph_json":"https://pith.science/api/pith-number/HM6GHZQERPWAUOMJQKJYNJB7XY/graph.json","events_json":"https://pith.science/api/pith-number/HM6GHZQERPWAUOMJQKJYNJB7XY/events.json","paper":"https://pith.science/paper/HM6GHZQE"},"agent_actions":{"view_html":"https://pith.science/pith/HM6GHZQERPWAUOMJQKJYNJB7XY","download_json":"https://pith.science/pith/HM6GHZQERPWAUOMJQKJYNJB7XY.json","view_paper":"https://pith.science/paper/HM6GHZQE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1107.2379&json=true","fetch_graph":"https://pith.science/api/pith-number/HM6GHZQERPWAUOMJQKJYNJB7XY/graph.json","fetch_events":"https://pith.science/api/pith-number/HM6GHZQERPWAUOMJQKJYNJB7XY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HM6GHZQERPWAUOMJQKJYNJB7XY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HM6GHZQERPWAUOMJQKJYNJB7XY/action/storage_attestation","attest_author":"https://pith.science/pith/HM6GHZQERPWAUOMJQKJYNJB7XY/action/author_attestation","sign_citation":"https://pith.science/pith/HM6GHZQERPWAUOMJQKJYNJB7XY/action/citation_signature","submit_replication":"https://pith.science/pith/HM6GHZQERPWAUOMJQKJYNJB7XY/action/replication_record"}},"created_at":"2026-05-18T02:44:00.751809+00:00","updated_at":"2026-05-18T02:44:00.751809+00:00"}