{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:SHTTY6PY5GHLCMFSVQN2UHRWXJ","short_pith_number":"pith:SHTTY6PY","canonical_record":{"source":{"id":"1507.04227","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-07-15T14:15:01Z","cross_cats_sorted":[],"title_canon_sha256":"9251bb53ce748fdf8fb942295b8bc361df4d05fb7286096648480fc2af69096c","abstract_canon_sha256":"34b365310886195b6049c0287b390adb52dc21ba8aceeff1512e495f6e152702"},"schema_version":"1.0"},"canonical_sha256":"91e73c79f8e98eb130b2ac1baa1e36ba524326841d419afed18d73dc6a2e744a","source":{"kind":"arxiv","id":"1507.04227","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.04227","created_at":"2026-05-18T01:35:59Z"},{"alias_kind":"arxiv_version","alias_value":"1507.04227v2","created_at":"2026-05-18T01:35:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.04227","created_at":"2026-05-18T01:35:59Z"},{"alias_kind":"pith_short_12","alias_value":"SHTTY6PY5GHL","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_16","alias_value":"SHTTY6PY5GHLCMFS","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_8","alias_value":"SHTTY6PY","created_at":"2026-05-18T12:29:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:SHTTY6PY5GHLCMFSVQN2UHRWXJ","target":"record","payload":{"canonical_record":{"source":{"id":"1507.04227","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-07-15T14:15:01Z","cross_cats_sorted":[],"title_canon_sha256":"9251bb53ce748fdf8fb942295b8bc361df4d05fb7286096648480fc2af69096c","abstract_canon_sha256":"34b365310886195b6049c0287b390adb52dc21ba8aceeff1512e495f6e152702"},"schema_version":"1.0"},"canonical_sha256":"91e73c79f8e98eb130b2ac1baa1e36ba524326841d419afed18d73dc6a2e744a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:35:59.426487Z","signature_b64":"ilDtP5EHLhv0cc/3sW//otXWwSp82VKnJ5JyJMJOLcoPwRKWbr60zVyy9aZEScbVkmfaj8eD2kjQ+XbbSWP1Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"91e73c79f8e98eb130b2ac1baa1e36ba524326841d419afed18d73dc6a2e744a","last_reissued_at":"2026-05-18T01:35:59.425842Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:35:59.425842Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1507.04227","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-18T01:35:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o6p93VL1+JiJLJvyzU56WcSKCkuQ/vFa6byeAPe834ge0c6+ct01Y3nVKwJLGSfoxQJcIjyI9Guo59EthutNAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T17:30:50.493283Z"},"content_sha256":"9f6f11cff66ccf4b7ce28ef51973459277c3c62c248d1c0877e1baee4c0739fa","schema_version":"1.0","event_id":"sha256:9f6f11cff66ccf4b7ce28ef51973459277c3c62c248d1c0877e1baee4c0739fa"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:SHTTY6PY5GHLCMFSVQN2UHRWXJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A bi-criteria approximation algorithm for $k$ Means","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Justin Ward, Konstantin Makarychev, Maxim Sviridenko, Yury Makarychev","submitted_at":"2015-07-15T14:15:01Z","abstract_excerpt":"We consider the classical $k$-means clustering problem in the setting bi-criteria approximation, in which an algoithm is allowed to output $\\beta k > k$ clusters, and must produce a clustering with cost at most $\\alpha$ times the to the cost of the optimal set of $k$ clusters. We argue that this approach is natural in many settings, for which the exact number of clusters is a priori unknown, or unimportant up to a constant factor. We give new bi-criteria approximation algorithms, based on linear programming and local search, respectively, which attain a guarantee $\\alpha(\\beta)$ depending on t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.04227","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-18T01:35:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vZsIBooKjlaTfWUmxjVJ+fdGlVhAqFKFenhW10y2iWTZ5NYran9sHY9VtIe7J4ib8zABkmM6jqU/nvnBcNFWCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T17:30:50.493635Z"},"content_sha256":"5804bd313309e9b1f5d2294d7606e5930634fb5c4c045427e83ab18a34b0cce8","schema_version":"1.0","event_id":"sha256:5804bd313309e9b1f5d2294d7606e5930634fb5c4c045427e83ab18a34b0cce8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SHTTY6PY5GHLCMFSVQN2UHRWXJ/bundle.json","state_url":"https://pith.science/pith/SHTTY6PY5GHLCMFSVQN2UHRWXJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SHTTY6PY5GHLCMFSVQN2UHRWXJ/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-03T17:30:50Z","links":{"resolver":"https://pith.science/pith/SHTTY6PY5GHLCMFSVQN2UHRWXJ","bundle":"https://pith.science/pith/SHTTY6PY5GHLCMFSVQN2UHRWXJ/bundle.json","state":"https://pith.science/pith/SHTTY6PY5GHLCMFSVQN2UHRWXJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SHTTY6PY5GHLCMFSVQN2UHRWXJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:SHTTY6PY5GHLCMFSVQN2UHRWXJ","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":"34b365310886195b6049c0287b390adb52dc21ba8aceeff1512e495f6e152702","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-07-15T14:15:01Z","title_canon_sha256":"9251bb53ce748fdf8fb942295b8bc361df4d05fb7286096648480fc2af69096c"},"schema_version":"1.0","source":{"id":"1507.04227","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.04227","created_at":"2026-05-18T01:35:59Z"},{"alias_kind":"arxiv_version","alias_value":"1507.04227v2","created_at":"2026-05-18T01:35:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.04227","created_at":"2026-05-18T01:35:59Z"},{"alias_kind":"pith_short_12","alias_value":"SHTTY6PY5GHL","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_16","alias_value":"SHTTY6PY5GHLCMFS","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_8","alias_value":"SHTTY6PY","created_at":"2026-05-18T12:29:42Z"}],"graph_snapshots":[{"event_id":"sha256:5804bd313309e9b1f5d2294d7606e5930634fb5c4c045427e83ab18a34b0cce8","target":"graph","created_at":"2026-05-18T01:35:59Z","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 consider the classical $k$-means clustering problem in the setting bi-criteria approximation, in which an algoithm is allowed to output $\\beta k > k$ clusters, and must produce a clustering with cost at most $\\alpha$ times the to the cost of the optimal set of $k$ clusters. We argue that this approach is natural in many settings, for which the exact number of clusters is a priori unknown, or unimportant up to a constant factor. We give new bi-criteria approximation algorithms, based on linear programming and local search, respectively, which attain a guarantee $\\alpha(\\beta)$ depending on t","authors_text":"Justin Ward, Konstantin Makarychev, Maxim Sviridenko, Yury Makarychev","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-07-15T14:15:01Z","title":"A bi-criteria approximation algorithm for $k$ Means"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.04227","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:9f6f11cff66ccf4b7ce28ef51973459277c3c62c248d1c0877e1baee4c0739fa","target":"record","created_at":"2026-05-18T01:35:59Z","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":"34b365310886195b6049c0287b390adb52dc21ba8aceeff1512e495f6e152702","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-07-15T14:15:01Z","title_canon_sha256":"9251bb53ce748fdf8fb942295b8bc361df4d05fb7286096648480fc2af69096c"},"schema_version":"1.0","source":{"id":"1507.04227","kind":"arxiv","version":2}},"canonical_sha256":"91e73c79f8e98eb130b2ac1baa1e36ba524326841d419afed18d73dc6a2e744a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"91e73c79f8e98eb130b2ac1baa1e36ba524326841d419afed18d73dc6a2e744a","first_computed_at":"2026-05-18T01:35:59.425842Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:35:59.425842Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ilDtP5EHLhv0cc/3sW//otXWwSp82VKnJ5JyJMJOLcoPwRKWbr60zVyy9aZEScbVkmfaj8eD2kjQ+XbbSWP1Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:35:59.426487Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.04227","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9f6f11cff66ccf4b7ce28ef51973459277c3c62c248d1c0877e1baee4c0739fa","sha256:5804bd313309e9b1f5d2294d7606e5930634fb5c4c045427e83ab18a34b0cce8"],"state_sha256":"dbfdafac9385d69a53e6695eccc585cb2d621a0a84e1ab3982b16681e906f28d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"amV9h9514maF/69uQe7xfg9ywHwhZvTIKAup5ug7IHLXY47NCBseaNP87lhO4WNb+xvvs4r5EFng4NI7EoooBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T17:30:50.495516Z","bundle_sha256":"c6fd3b7bb73cb3e2cf0c7146726871d79912a3c9ae14d959dbd9a88feab5d0f2"}}