{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:V336SWA6NGZ6Z73ADP2DSUVZGB","short_pith_number":"pith:V336SWA6","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"},"canonical_sha256":"aef7e9581e69b3ecff601bf43952b9306b75e1251ef3811989f248914b48bd9e","source":{"kind":"arxiv","id":"1711.01323","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.01323","created_at":"2026-05-18T00:19:08Z"},{"alias_kind":"arxiv_version","alias_value":"1711.01323v2","created_at":"2026-05-18T00:19:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.01323","created_at":"2026-05-18T00:19:08Z"},{"alias_kind":"pith_short_12","alias_value":"V336SWA6NGZ6","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"V336SWA6NGZ6Z73A","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"V336SWA6","created_at":"2026-05-18T12:31:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:V336SWA6NGZ6Z73ADP2DSUVZGB","target":"record","payload":{"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"},"canonical_sha256":"aef7e9581e69b3ecff601bf43952b9306b75e1251ef3811989f248914b48bd9e","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"},"source_kind":"arxiv","source_id":"1711.01323","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:19:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PmUWvp/7xPwEPPVlbdIc4mTBz2XdIJGLoeWlJtz+pLv5qKl1R00BTo9VOJI0lK5H27MWbiven2mjWFvKzPTQAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T11:10:34.956791Z"},"content_sha256":"74e296dc6bf549cca43c1adebd69d50903700f193df1d6675baf2d963d4d6ac7","schema_version":"1.0","event_id":"sha256:74e296dc6bf549cca43c1adebd69d50903700f193df1d6675baf2d963d4d6ac7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:V336SWA6NGZ6Z73ADP2DSUVZGB","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:19:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MQK/CgIG77tr7wXYOPrXqvZBMyPCymkFzg1z0EXtrbaDhg+119RvJqjN5Icc5IPiCYRD0jBBF2FXvJg5QV2HDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T11:10:34.957341Z"},"content_sha256":"4b2956d9f117b0d5fe77041a64802ed27c8ca41ead9c909a14a763f57ff6dbe2","schema_version":"1.0","event_id":"sha256:4b2956d9f117b0d5fe77041a64802ed27c8ca41ead9c909a14a763f57ff6dbe2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/V336SWA6NGZ6Z73ADP2DSUVZGB/bundle.json","state_url":"https://pith.science/pith/V336SWA6NGZ6Z73ADP2DSUVZGB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/V336SWA6NGZ6Z73ADP2DSUVZGB/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-02T11:10:34Z","links":{"resolver":"https://pith.science/pith/V336SWA6NGZ6Z73ADP2DSUVZGB","bundle":"https://pith.science/pith/V336SWA6NGZ6Z73ADP2DSUVZGB/bundle.json","state":"https://pith.science/pith/V336SWA6NGZ6Z73ADP2DSUVZGB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/V336SWA6NGZ6Z73ADP2DSUVZGB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:V336SWA6NGZ6Z73ADP2DSUVZGB","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"be162eafdfc272608d1962f4923bebff7791e014941ccc8f55030ee2336a9d7f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-03T20:27:12Z","title_canon_sha256":"3e090e21d53e45fa803a8ac1dd3fa084b925064f08b28f34a138e88de1f1e22d"},"schema_version":"1.0","source":{"id":"1711.01323","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.01323","created_at":"2026-05-18T00:19:08Z"},{"alias_kind":"arxiv_version","alias_value":"1711.01323v2","created_at":"2026-05-18T00:19:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.01323","created_at":"2026-05-18T00:19:08Z"},{"alias_kind":"pith_short_12","alias_value":"V336SWA6NGZ6","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"V336SWA6NGZ6Z73A","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"V336SWA6","created_at":"2026-05-18T12:31:49Z"}],"graph_snapshots":[{"event_id":"sha256:4b2956d9f117b0d5fe77041a64802ed27c8ca41ead9c909a14a763f57ff6dbe2","target":"graph","created_at":"2026-05-18T00:19:08Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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)$-","authors_text":"Ravishankar Krishnaswamy, Sai Sandeep, Shi Li","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-03T20:27:12Z","title":"Constant Approximation for $k$-Median and $k$-Means with Outliers via Iterative Rounding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.01323","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:74e296dc6bf549cca43c1adebd69d50903700f193df1d6675baf2d963d4d6ac7","target":"record","created_at":"2026-05-18T00:19:08Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"be162eafdfc272608d1962f4923bebff7791e014941ccc8f55030ee2336a9d7f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-03T20:27:12Z","title_canon_sha256":"3e090e21d53e45fa803a8ac1dd3fa084b925064f08b28f34a138e88de1f1e22d"},"schema_version":"1.0","source":{"id":"1711.01323","kind":"arxiv","version":2}},"canonical_sha256":"aef7e9581e69b3ecff601bf43952b9306b75e1251ef3811989f248914b48bd9e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"aef7e9581e69b3ecff601bf43952b9306b75e1251ef3811989f248914b48bd9e","first_computed_at":"2026-05-18T00:19:08.596491Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:19:08.596491Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5UitvU73clgyJWfaS1PAveReMAZU618tjYEEoxGPbhSjEf7D84uWPFKqJW/0NtKCPo18sjqFuPvmlJub20cwDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:19:08.597240Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.01323","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:74e296dc6bf549cca43c1adebd69d50903700f193df1d6675baf2d963d4d6ac7","sha256:4b2956d9f117b0d5fe77041a64802ed27c8ca41ead9c909a14a763f57ff6dbe2"],"state_sha256":"7309c8cf336f3ca89826bebe1473567feb5cbf88965ed9c1dcd3ae68d5125074"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0x2WbhuOJ3d4lLvUQkXsdXw56jDv1gBq6ysCQjcXUI2oGKV4VKnjPhJZ+nox9LmFsF+L9/Ssy3++/0SEi1cbAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T11:10:34.960224Z","bundle_sha256":"3a434a3b6342dc24e0a3a08cfc13e09eab504998e3d517386f960d722bb117cd"}}