{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:V336SWA6NGZ6Z73ADP2DSUVZGB","short_pith_number":"pith:V336SWA6","schema_version":"1.0","canonical_sha256":"aef7e9581e69b3ecff601bf43952b9306b75e1251ef3811989f248914b48bd9e","source":{"kind":"arxiv","id":"1711.01323","version":2},"attestation_state":"computed","paper":{"title":"Constant Approximation for $k$-Median and $k$-Means with Outliers via Iterative Rounding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ravishankar Krishnaswamy, Sai Sandeep, Shi Li","submitted_at":"2017-11-03T20:27:12Z","abstract_excerpt":"In this paper, we present a new iterative rounding framework for many clustering problems. Using this, we obtain an $(\\alpha_1 + \\epsilon \\leq 7.081 + \\epsilon)$-approximation algorithm for $k$-median with outliers, greatly improving upon the large implicit constant approximation ratio of Chen [Chen, SODA 2018]. For $k$-means with outliers, we give an $(\\alpha_2+\\epsilon \\leq 53.002 + \\epsilon)$-approximation, which is the first $O(1)$-approximation for this problem. The iterative algorithm framework is very versatile; we show how it can be used to give $\\alpha_1$- and $(\\alpha_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":"1711.01323","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-03T20:27:12Z","cross_cats_sorted":[],"title_canon_sha256":"3e090e21d53e45fa803a8ac1dd3fa084b925064f08b28f34a138e88de1f1e22d","abstract_canon_sha256":"be162eafdfc272608d1962f4923bebff7791e014941ccc8f55030ee2336a9d7f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:19:08.597240Z","signature_b64":"5UitvU73clgyJWfaS1PAveReMAZU618tjYEEoxGPbhSjEf7D84uWPFKqJW/0NtKCPo18sjqFuPvmlJub20cwDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aef7e9581e69b3ecff601bf43952b9306b75e1251ef3811989f248914b48bd9e","last_reissued_at":"2026-05-18T00:19:08.596491Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:19:08.596491Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Constant Approximation for $k$-Median and $k$-Means with Outliers via Iterative Rounding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ravishankar Krishnaswamy, Sai Sandeep, Shi Li","submitted_at":"2017-11-03T20:27:12Z","abstract_excerpt":"In this paper, we present a new iterative rounding framework for many clustering problems. Using this, we obtain an $(\\alpha_1 + \\epsilon \\leq 7.081 + \\epsilon)$-approximation algorithm for $k$-median with outliers, greatly improving upon the large implicit constant approximation ratio of Chen [Chen, SODA 2018]. For $k$-means with outliers, we give an $(\\alpha_2+\\epsilon \\leq 53.002 + \\epsilon)$-approximation, which is the first $O(1)$-approximation for this problem. The iterative algorithm framework is very versatile; we show how it can be used to give $\\alpha_1$- and $(\\alpha_1 + \\epsilon)$-"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.01323","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":"1711.01323","created_at":"2026-05-18T00:19:08.596607+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.01323v2","created_at":"2026-05-18T00:19:08.596607+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.01323","created_at":"2026-05-18T00:19:08.596607+00:00"},{"alias_kind":"pith_short_12","alias_value":"V336SWA6NGZ6","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_16","alias_value":"V336SWA6NGZ6Z73A","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_8","alias_value":"V336SWA6","created_at":"2026-05-18T12:31:49.984773+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/V336SWA6NGZ6Z73ADP2DSUVZGB","json":"https://pith.science/pith/V336SWA6NGZ6Z73ADP2DSUVZGB.json","graph_json":"https://pith.science/api/pith-number/V336SWA6NGZ6Z73ADP2DSUVZGB/graph.json","events_json":"https://pith.science/api/pith-number/V336SWA6NGZ6Z73ADP2DSUVZGB/events.json","paper":"https://pith.science/paper/V336SWA6"},"agent_actions":{"view_html":"https://pith.science/pith/V336SWA6NGZ6Z73ADP2DSUVZGB","download_json":"https://pith.science/pith/V336SWA6NGZ6Z73ADP2DSUVZGB.json","view_paper":"https://pith.science/paper/V336SWA6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.01323&json=true","fetch_graph":"https://pith.science/api/pith-number/V336SWA6NGZ6Z73ADP2DSUVZGB/graph.json","fetch_events":"https://pith.science/api/pith-number/V336SWA6NGZ6Z73ADP2DSUVZGB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/V336SWA6NGZ6Z73ADP2DSUVZGB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/V336SWA6NGZ6Z73ADP2DSUVZGB/action/storage_attestation","attest_author":"https://pith.science/pith/V336SWA6NGZ6Z73ADP2DSUVZGB/action/author_attestation","sign_citation":"https://pith.science/pith/V336SWA6NGZ6Z73ADP2DSUVZGB/action/citation_signature","submit_replication":"https://pith.science/pith/V336SWA6NGZ6Z73ADP2DSUVZGB/action/replication_record"}},"created_at":"2026-05-18T00:19:08.596607+00:00","updated_at":"2026-05-18T00:19:08.596607+00:00"}