{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:G7CN2GVGDBYI6AASLK7YFVYRYX","short_pith_number":"pith:G7CN2GVG","canonical_record":{"source":{"id":"1612.07925","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-12-23T10:34:53Z","cross_cats_sorted":[],"title_canon_sha256":"1de77d9abe71eeda38039a7167ff80c01c36037ddc4f5ee1d129c324b1467e1b","abstract_canon_sha256":"147f169472e1d672fd65dac1f85875450ab8671bb6e7dc4793eec2c806d8d9d3"},"schema_version":"1.0"},"canonical_sha256":"37c4dd1aa618708f00125abf82d711c5d412aa46ae28b453d1178e5474d3a9f6","source":{"kind":"arxiv","id":"1612.07925","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.07925","created_at":"2026-05-18T00:46:48Z"},{"alias_kind":"arxiv_version","alias_value":"1612.07925v2","created_at":"2026-05-18T00:46:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.07925","created_at":"2026-05-18T00:46:48Z"},{"alias_kind":"pith_short_12","alias_value":"G7CN2GVGDBYI","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"G7CN2GVGDBYI6AAS","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"G7CN2GVG","created_at":"2026-05-18T12:30:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:G7CN2GVGDBYI6AASLK7YFVYRYX","target":"record","payload":{"canonical_record":{"source":{"id":"1612.07925","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-12-23T10:34:53Z","cross_cats_sorted":[],"title_canon_sha256":"1de77d9abe71eeda38039a7167ff80c01c36037ddc4f5ee1d129c324b1467e1b","abstract_canon_sha256":"147f169472e1d672fd65dac1f85875450ab8671bb6e7dc4793eec2c806d8d9d3"},"schema_version":"1.0"},"canonical_sha256":"37c4dd1aa618708f00125abf82d711c5d412aa46ae28b453d1178e5474d3a9f6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:48.620078Z","signature_b64":"1h3tgYna47z5i0u1/RBrP8LwoZCj6P0udw43FUdapljjU62/2GbyoBlRagsugtXXQ3EMTpZqNpepWn0GRj9qDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"37c4dd1aa618708f00125abf82d711c5d412aa46ae28b453d1178e5474d3a9f6","last_reissued_at":"2026-05-18T00:46:48.619382Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:48.619382Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1612.07925","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:46:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x/hP75Owjhv3lATu5N+NxfTCC59GMSl9wCiTkTgDlSUmrKVQzAEWOGAT2poLbtrnHOMVOQ1xO+kn3/M5SEYbDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T12:58:59.970196Z"},"content_sha256":"ac3d228b77a527646e2d9bdb94ed8a3e03f15098d0cd994bca0f828abe36a58c","schema_version":"1.0","event_id":"sha256:ac3d228b77a527646e2d9bdb94ed8a3e03f15098d0cd994bca0f828abe36a58c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:G7CN2GVGDBYI6AASLK7YFVYRYX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Better Guarantees for k-Means and Euclidean k-Median by Primal-Dual Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ashkan Norouzi-Fard, Justin Ward, Ola Svensson, Sara Ahmadian","submitted_at":"2016-12-23T10:34:53Z","abstract_excerpt":"Clustering is a classic topic in optimization with $k$-means being one of the most fundamental such problems. In the absence of any restrictions on the input, the best known algorithm for $k$-means with a provable guarantee is a simple local search heuristic yielding an approximation guarantee of $9+\\epsilon$, a ratio that is known to be tight with respect to such methods.\n  We overcome this barrier by presenting a new primal-dual approach that allows us to (1) exploit the geometric structure of $k$-means and (2) to satisfy the hard constraint that at most $k$ clusters are selected without det"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.07925","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:46:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YAQKjNDMajQxcZ8HtRTjYQcm068D7THvVxyBE7GHIyl05rJ7jBKosPjqCwfGTxXKhWwSUHs6/fyCQ+BD8dQYBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T12:58:59.970653Z"},"content_sha256":"5173bbd4848967f9a7eb642dd8f36c1c309335fa786b421425c7b69cbfa50142","schema_version":"1.0","event_id":"sha256:5173bbd4848967f9a7eb642dd8f36c1c309335fa786b421425c7b69cbfa50142"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/G7CN2GVGDBYI6AASLK7YFVYRYX/bundle.json","state_url":"https://pith.science/pith/G7CN2GVGDBYI6AASLK7YFVYRYX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/G7CN2GVGDBYI6AASLK7YFVYRYX/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-27T12:58:59Z","links":{"resolver":"https://pith.science/pith/G7CN2GVGDBYI6AASLK7YFVYRYX","bundle":"https://pith.science/pith/G7CN2GVGDBYI6AASLK7YFVYRYX/bundle.json","state":"https://pith.science/pith/G7CN2GVGDBYI6AASLK7YFVYRYX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/G7CN2GVGDBYI6AASLK7YFVYRYX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:G7CN2GVGDBYI6AASLK7YFVYRYX","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":"147f169472e1d672fd65dac1f85875450ab8671bb6e7dc4793eec2c806d8d9d3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-12-23T10:34:53Z","title_canon_sha256":"1de77d9abe71eeda38039a7167ff80c01c36037ddc4f5ee1d129c324b1467e1b"},"schema_version":"1.0","source":{"id":"1612.07925","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.07925","created_at":"2026-05-18T00:46:48Z"},{"alias_kind":"arxiv_version","alias_value":"1612.07925v2","created_at":"2026-05-18T00:46:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.07925","created_at":"2026-05-18T00:46:48Z"},{"alias_kind":"pith_short_12","alias_value":"G7CN2GVGDBYI","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"G7CN2GVGDBYI6AAS","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"G7CN2GVG","created_at":"2026-05-18T12:30:15Z"}],"graph_snapshots":[{"event_id":"sha256:5173bbd4848967f9a7eb642dd8f36c1c309335fa786b421425c7b69cbfa50142","target":"graph","created_at":"2026-05-18T00:46:48Z","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":"Clustering is a classic topic in optimization with $k$-means being one of the most fundamental such problems. In the absence of any restrictions on the input, the best known algorithm for $k$-means with a provable guarantee is a simple local search heuristic yielding an approximation guarantee of $9+\\epsilon$, a ratio that is known to be tight with respect to such methods.\n  We overcome this barrier by presenting a new primal-dual approach that allows us to (1) exploit the geometric structure of $k$-means and (2) to satisfy the hard constraint that at most $k$ clusters are selected without det","authors_text":"Ashkan Norouzi-Fard, Justin Ward, Ola Svensson, Sara Ahmadian","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-12-23T10:34:53Z","title":"Better Guarantees for k-Means and Euclidean k-Median by Primal-Dual Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.07925","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:ac3d228b77a527646e2d9bdb94ed8a3e03f15098d0cd994bca0f828abe36a58c","target":"record","created_at":"2026-05-18T00:46:48Z","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":"147f169472e1d672fd65dac1f85875450ab8671bb6e7dc4793eec2c806d8d9d3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-12-23T10:34:53Z","title_canon_sha256":"1de77d9abe71eeda38039a7167ff80c01c36037ddc4f5ee1d129c324b1467e1b"},"schema_version":"1.0","source":{"id":"1612.07925","kind":"arxiv","version":2}},"canonical_sha256":"37c4dd1aa618708f00125abf82d711c5d412aa46ae28b453d1178e5474d3a9f6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"37c4dd1aa618708f00125abf82d711c5d412aa46ae28b453d1178e5474d3a9f6","first_computed_at":"2026-05-18T00:46:48.619382Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:46:48.619382Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1h3tgYna47z5i0u1/RBrP8LwoZCj6P0udw43FUdapljjU62/2GbyoBlRagsugtXXQ3EMTpZqNpepWn0GRj9qDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:46:48.620078Z","signed_message":"canonical_sha256_bytes"},"source_id":"1612.07925","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ac3d228b77a527646e2d9bdb94ed8a3e03f15098d0cd994bca0f828abe36a58c","sha256:5173bbd4848967f9a7eb642dd8f36c1c309335fa786b421425c7b69cbfa50142"],"state_sha256":"70bac968604a933df9d1f6d10c8aaeb9a333f6aed0f12fc4c710760118e2d6c8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Wyp7iSVztVVJLQ0dCQxLmIBkpBeE9l82XOTvxGboggS3QcT/jO5iiA4os0YWQv4Plq/RRj1M9UzY+TOW+QP6AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T12:58:59.976365Z","bundle_sha256":"5cc98f73cf1fa70de0b3a75f6bde8f168d712a51a87eee160243501cef4bdaec"}}