{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:25C5B6WMOFSEJMQ73NDHBU6IEQ","short_pith_number":"pith:25C5B6WM","schema_version":"1.0","canonical_sha256":"d745d0facc716444b21fdb4670d3c8243a4a85c93b6530f2e003664a5c28ecf8","source":{"kind":"arxiv","id":"1603.09535","version":2},"attestation_state":"computed","paper":{"title":"Local search yields approximation schemes for k-means and k-median in Euclidean and minor-free metrics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.DS","authors_text":"Claire Mathieu, Philip N. Klein, Vincent Cohen-Addad","submitted_at":"2016-03-31T11:40:07Z","abstract_excerpt":"We give the first polynomial-time approximation schemes (PTASs) for the following problems: (1) uniform facility location in edge-weighted planar graphs; (2) $k$-median and $k$-means in edge-weighted planar graphs; (3) $k$-means in Euclidean spaces of bounded dimension. Our first and second results extend to minor-closed families of graphs. All our results extend to cost functions that are the $p$-th power of the shortest-path distance. The algorithm is local search where the local neighborhood of a solution $S$ consists of all solutions obtained from $S$ by removing and adding $1/\\epsilon^{O("},"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":"1603.09535","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-03-31T11:40:07Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"537377b1bd95467d9a844f929d34b88cf5c7fbbea200c193ad2d901377fa4bea","abstract_canon_sha256":"56d60547911409f58e5871cff4062a6536a6bec5a948aecd6bcbcd7312f963c8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:17:32.272243Z","signature_b64":"gN5M8F1VTXZ1P7evvPXr79qIZ69O3VJgOcTT3ANf6z5wMOZ3p8zmbzU+cSFEpB/yW6HIy5cMsj40xGE+Dw8mDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d745d0facc716444b21fdb4670d3c8243a4a85c93b6530f2e003664a5c28ecf8","last_reissued_at":"2026-05-18T01:17:32.271480Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:17:32.271480Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Local search yields approximation schemes for k-means and k-median in Euclidean and minor-free metrics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.DS","authors_text":"Claire Mathieu, Philip N. Klein, Vincent Cohen-Addad","submitted_at":"2016-03-31T11:40:07Z","abstract_excerpt":"We give the first polynomial-time approximation schemes (PTASs) for the following problems: (1) uniform facility location in edge-weighted planar graphs; (2) $k$-median and $k$-means in edge-weighted planar graphs; (3) $k$-means in Euclidean spaces of bounded dimension. Our first and second results extend to minor-closed families of graphs. All our results extend to cost functions that are the $p$-th power of the shortest-path distance. The algorithm is local search where the local neighborhood of a solution $S$ consists of all solutions obtained from $S$ by removing and adding $1/\\epsilon^{O("},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.09535","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":"1603.09535","created_at":"2026-05-18T01:17:32.271593+00:00"},{"alias_kind":"arxiv_version","alias_value":"1603.09535v2","created_at":"2026-05-18T01:17:32.271593+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.09535","created_at":"2026-05-18T01:17:32.271593+00:00"},{"alias_kind":"pith_short_12","alias_value":"25C5B6WMOFSE","created_at":"2026-05-18T12:29:52.810259+00:00"},{"alias_kind":"pith_short_16","alias_value":"25C5B6WMOFSEJMQ7","created_at":"2026-05-18T12:29:52.810259+00:00"},{"alias_kind":"pith_short_8","alias_value":"25C5B6WM","created_at":"2026-05-18T12:29:52.810259+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/25C5B6WMOFSEJMQ73NDHBU6IEQ","json":"https://pith.science/pith/25C5B6WMOFSEJMQ73NDHBU6IEQ.json","graph_json":"https://pith.science/api/pith-number/25C5B6WMOFSEJMQ73NDHBU6IEQ/graph.json","events_json":"https://pith.science/api/pith-number/25C5B6WMOFSEJMQ73NDHBU6IEQ/events.json","paper":"https://pith.science/paper/25C5B6WM"},"agent_actions":{"view_html":"https://pith.science/pith/25C5B6WMOFSEJMQ73NDHBU6IEQ","download_json":"https://pith.science/pith/25C5B6WMOFSEJMQ73NDHBU6IEQ.json","view_paper":"https://pith.science/paper/25C5B6WM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1603.09535&json=true","fetch_graph":"https://pith.science/api/pith-number/25C5B6WMOFSEJMQ73NDHBU6IEQ/graph.json","fetch_events":"https://pith.science/api/pith-number/25C5B6WMOFSEJMQ73NDHBU6IEQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/25C5B6WMOFSEJMQ73NDHBU6IEQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/25C5B6WMOFSEJMQ73NDHBU6IEQ/action/storage_attestation","attest_author":"https://pith.science/pith/25C5B6WMOFSEJMQ73NDHBU6IEQ/action/author_attestation","sign_citation":"https://pith.science/pith/25C5B6WMOFSEJMQ73NDHBU6IEQ/action/citation_signature","submit_replication":"https://pith.science/pith/25C5B6WMOFSEJMQ73NDHBU6IEQ/action/replication_record"}},"created_at":"2026-05-18T01:17:32.271593+00:00","updated_at":"2026-05-18T01:17:32.271593+00:00"}