{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:5EFZ25C6LFRB3A4GQYKJEHICDZ","short_pith_number":"pith:5EFZ25C6","canonical_record":{"source":{"id":"1607.06442","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-07-21T19:37:04Z","cross_cats_sorted":[],"title_canon_sha256":"5d57b2e61b644a5a117531fc2675abce23d5a6401f6f3ede8ac7e4d488c1112a","abstract_canon_sha256":"13a6b7f316876143e3e32d70b597284c2fc5be4881e4e36a027ffa9cf278f3bf"},"schema_version":"1.0"},"canonical_sha256":"e90b9d745e59621d83868614921d021e6d3e0b100286445e5b5e2f6ca2d18619","source":{"kind":"arxiv","id":"1607.06442","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.06442","created_at":"2026-05-18T01:10:41Z"},{"alias_kind":"arxiv_version","alias_value":"1607.06442v1","created_at":"2026-05-18T01:10:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.06442","created_at":"2026-05-18T01:10:41Z"},{"alias_kind":"pith_short_12","alias_value":"5EFZ25C6LFRB","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"5EFZ25C6LFRB3A4G","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"5EFZ25C6","created_at":"2026-05-18T12:30:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:5EFZ25C6LFRB3A4GQYKJEHICDZ","target":"record","payload":{"canonical_record":{"source":{"id":"1607.06442","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-07-21T19:37:04Z","cross_cats_sorted":[],"title_canon_sha256":"5d57b2e61b644a5a117531fc2675abce23d5a6401f6f3ede8ac7e4d488c1112a","abstract_canon_sha256":"13a6b7f316876143e3e32d70b597284c2fc5be4881e4e36a027ffa9cf278f3bf"},"schema_version":"1.0"},"canonical_sha256":"e90b9d745e59621d83868614921d021e6d3e0b100286445e5b5e2f6ca2d18619","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:10:41.828641Z","signature_b64":"i1eSf3PH8GVjuwoV8la89CBNBA7Amb6pLFyAAOllEo8PKspr0wxy2YKx1b8GYEHRpMiddmiKuKZ9B4nKvjzjBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e90b9d745e59621d83868614921d021e6d3e0b100286445e5b5e2f6ca2d18619","last_reissued_at":"2026-05-18T01:10:41.828187Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:10:41.828187Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1607.06442","source_version":1,"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-18T01:10:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"j+eStGEZFjVi51VqLyCE44iAuE6VP9vP+ecc2B/zp8AgonDClppfRhb3IzXJdWOCY2SIoH36A2rfH/aT7YYFAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T06:31:11.847442Z"},"content_sha256":"b38550d35f19be54f1c54da7295b824764a92e00f77841c08cc3068dd54fe14a","schema_version":"1.0","event_id":"sha256:b38550d35f19be54f1c54da7295b824764a92e00f77841c08cc3068dd54fe14a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:5EFZ25C6LFRB3A4GQYKJEHICDZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Metric Perturbation Resilience","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Konstantin Makarychev, Yury Makarychev","submitted_at":"2016-07-21T19:37:04Z","abstract_excerpt":"We study the notion of perturbation resilience introduced by Bilu and Linial (2010) and Awasthi, Blum, and Sheffet (2012). A clustering problem is $\\alpha$-perturbation resilient if the optimal clustering does not change when we perturb all distances by a factor of at most $\\alpha$. We consider a class of clustering problems with center-based objectives, which includes such problems as k-means, k-median, and k-center, and give an exact algorithm for clustering 2-perturbation resilient instances. Our result improves upon the result of Balcan and Liang (2016), who gave an algorithm for clusterin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.06442","kind":"arxiv","version":1},"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-18T01:10:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0PQvPXXVLp2V2088empTuNmn8NgSLDEWvDDHFoxybo2uSX7+ijnkEqNcd/0c9b41p+iN/1I25/KDUe73f4YNCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T06:31:11.848086Z"},"content_sha256":"8c1eb936c6bf4412ba77cd0897e4e255863450f4c7e855658caf3dd8f1047fa0","schema_version":"1.0","event_id":"sha256:8c1eb936c6bf4412ba77cd0897e4e255863450f4c7e855658caf3dd8f1047fa0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5EFZ25C6LFRB3A4GQYKJEHICDZ/bundle.json","state_url":"https://pith.science/pith/5EFZ25C6LFRB3A4GQYKJEHICDZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5EFZ25C6LFRB3A4GQYKJEHICDZ/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-05-27T06:31:11Z","links":{"resolver":"https://pith.science/pith/5EFZ25C6LFRB3A4GQYKJEHICDZ","bundle":"https://pith.science/pith/5EFZ25C6LFRB3A4GQYKJEHICDZ/bundle.json","state":"https://pith.science/pith/5EFZ25C6LFRB3A4GQYKJEHICDZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5EFZ25C6LFRB3A4GQYKJEHICDZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:5EFZ25C6LFRB3A4GQYKJEHICDZ","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":"13a6b7f316876143e3e32d70b597284c2fc5be4881e4e36a027ffa9cf278f3bf","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-07-21T19:37:04Z","title_canon_sha256":"5d57b2e61b644a5a117531fc2675abce23d5a6401f6f3ede8ac7e4d488c1112a"},"schema_version":"1.0","source":{"id":"1607.06442","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.06442","created_at":"2026-05-18T01:10:41Z"},{"alias_kind":"arxiv_version","alias_value":"1607.06442v1","created_at":"2026-05-18T01:10:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.06442","created_at":"2026-05-18T01:10:41Z"},{"alias_kind":"pith_short_12","alias_value":"5EFZ25C6LFRB","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"5EFZ25C6LFRB3A4G","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"5EFZ25C6","created_at":"2026-05-18T12:30:01Z"}],"graph_snapshots":[{"event_id":"sha256:8c1eb936c6bf4412ba77cd0897e4e255863450f4c7e855658caf3dd8f1047fa0","target":"graph","created_at":"2026-05-18T01:10:41Z","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":"We study the notion of perturbation resilience introduced by Bilu and Linial (2010) and Awasthi, Blum, and Sheffet (2012). A clustering problem is $\\alpha$-perturbation resilient if the optimal clustering does not change when we perturb all distances by a factor of at most $\\alpha$. We consider a class of clustering problems with center-based objectives, which includes such problems as k-means, k-median, and k-center, and give an exact algorithm for clustering 2-perturbation resilient instances. Our result improves upon the result of Balcan and Liang (2016), who gave an algorithm for clusterin","authors_text":"Konstantin Makarychev, Yury Makarychev","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-07-21T19:37:04Z","title":"Metric Perturbation Resilience"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.06442","kind":"arxiv","version":1},"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:b38550d35f19be54f1c54da7295b824764a92e00f77841c08cc3068dd54fe14a","target":"record","created_at":"2026-05-18T01:10:41Z","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":"13a6b7f316876143e3e32d70b597284c2fc5be4881e4e36a027ffa9cf278f3bf","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-07-21T19:37:04Z","title_canon_sha256":"5d57b2e61b644a5a117531fc2675abce23d5a6401f6f3ede8ac7e4d488c1112a"},"schema_version":"1.0","source":{"id":"1607.06442","kind":"arxiv","version":1}},"canonical_sha256":"e90b9d745e59621d83868614921d021e6d3e0b100286445e5b5e2f6ca2d18619","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e90b9d745e59621d83868614921d021e6d3e0b100286445e5b5e2f6ca2d18619","first_computed_at":"2026-05-18T01:10:41.828187Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:10:41.828187Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"i1eSf3PH8GVjuwoV8la89CBNBA7Amb6pLFyAAOllEo8PKspr0wxy2YKx1b8GYEHRpMiddmiKuKZ9B4nKvjzjBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:10:41.828641Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.06442","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b38550d35f19be54f1c54da7295b824764a92e00f77841c08cc3068dd54fe14a","sha256:8c1eb936c6bf4412ba77cd0897e4e255863450f4c7e855658caf3dd8f1047fa0"],"state_sha256":"7f1362847d5bdda6b1fb737dc7ad70df9d12d958c329b242f1a682b2a4b0ccce"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Wvfp6kCzwe5Tq0+j+kMkK3BZqGXWriAaNN4YxR2oZgHbVEE5kL23gu00BIPOWc28aak4SVEVIQgA++AQO1tnAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T06:31:11.851628Z","bundle_sha256":"23cc3d43d0bcaea681b07a6ae25c538e57028f0a39c97fd0aee095aee0721b6f"}}