{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:VB6BLIQL6CAVV244OAUY24AN2N","short_pith_number":"pith:VB6BLIQL","schema_version":"1.0","canonical_sha256":"a87c15a20bf0815aeb9c70298d700dd376ee2bf8e3e6d140d35016598145a3d9","source":{"kind":"arxiv","id":"2503.10972","version":2},"attestation_state":"computed","paper":{"title":"A $(2+\\varepsilon)$-Approximation Algorithm for Metric $k$-Median","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Chris Schwiegelshohn, Euiwoong Lee, Fabrizio Grandoni, Ola Svensson, Vincent Cohen-Addad","submitted_at":"2025-03-14T00:36:26Z","abstract_excerpt":"In the classical NP-hard metric $k$-median problem, we are given a set of $n$ clients and centers with metric distances between them, along with an integer parameter $k\\geq 1$. The objective is to select a subset of $k$ open centers that minimizes the total distance from each client to its closest open center.\n  In their seminal work, Jain, Mahdian, Markakis, Saberi, and Vazirani presented the Greedy algorithm for facility location, which implies a $2$-approximation algorithm for $k$-median that opens $k$ centers in expectation. Since then, substantial research has aimed at narrowing the gap b"},"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":"2503.10972","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-03-14T00:36:26Z","cross_cats_sorted":[],"title_canon_sha256":"4a73537cdf616f7f455ce1d7cbdb130f7b3f135071b59cbaa9262a2509f60dc4","abstract_canon_sha256":"a58b65a9702a1d271d7cc73e51c5aadf614a782cd9e58a2ce08469623d4c0e73"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-21T01:04:13.333001Z","signature_b64":"oa5wMzcssIiJg4leqxiO+RfapPmU0ENvYPM9IwttVoNiGOIGTSxiYdDd18KyKDDYqMsltPis5wdmsA2EG0hzDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a87c15a20bf0815aeb9c70298d700dd376ee2bf8e3e6d140d35016598145a3d9","last_reissued_at":"2026-05-21T01:04:13.332233Z","signature_status":"signed_v1","first_computed_at":"2026-05-21T01:04:13.332233Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A $(2+\\varepsilon)$-Approximation Algorithm for Metric $k$-Median","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Chris Schwiegelshohn, Euiwoong Lee, Fabrizio Grandoni, Ola Svensson, Vincent Cohen-Addad","submitted_at":"2025-03-14T00:36:26Z","abstract_excerpt":"In the classical NP-hard metric $k$-median problem, we are given a set of $n$ clients and centers with metric distances between them, along with an integer parameter $k\\geq 1$. The objective is to select a subset of $k$ open centers that minimizes the total distance from each client to its closest open center.\n  In their seminal work, Jain, Mahdian, Markakis, Saberi, and Vazirani presented the Greedy algorithm for facility location, which implies a $2$-approximation algorithm for $k$-median that opens $k$ centers in expectation. Since then, substantial research has aimed at narrowing the gap b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.10972","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2503.10972/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2503.10972","created_at":"2026-05-21T01:04:13.332360+00:00"},{"alias_kind":"arxiv_version","alias_value":"2503.10972v2","created_at":"2026-05-21T01:04:13.332360+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.10972","created_at":"2026-05-21T01:04:13.332360+00:00"},{"alias_kind":"pith_short_12","alias_value":"VB6BLIQL6CAV","created_at":"2026-05-21T01:04:13.332360+00:00"},{"alias_kind":"pith_short_16","alias_value":"VB6BLIQL6CAVV244","created_at":"2026-05-21T01:04:13.332360+00:00"},{"alias_kind":"pith_short_8","alias_value":"VB6BLIQL","created_at":"2026-05-21T01:04:13.332360+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/VB6BLIQL6CAVV244OAUY24AN2N","json":"https://pith.science/pith/VB6BLIQL6CAVV244OAUY24AN2N.json","graph_json":"https://pith.science/api/pith-number/VB6BLIQL6CAVV244OAUY24AN2N/graph.json","events_json":"https://pith.science/api/pith-number/VB6BLIQL6CAVV244OAUY24AN2N/events.json","paper":"https://pith.science/paper/VB6BLIQL"},"agent_actions":{"view_html":"https://pith.science/pith/VB6BLIQL6CAVV244OAUY24AN2N","download_json":"https://pith.science/pith/VB6BLIQL6CAVV244OAUY24AN2N.json","view_paper":"https://pith.science/paper/VB6BLIQL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2503.10972&json=true","fetch_graph":"https://pith.science/api/pith-number/VB6BLIQL6CAVV244OAUY24AN2N/graph.json","fetch_events":"https://pith.science/api/pith-number/VB6BLIQL6CAVV244OAUY24AN2N/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VB6BLIQL6CAVV244OAUY24AN2N/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VB6BLIQL6CAVV244OAUY24AN2N/action/storage_attestation","attest_author":"https://pith.science/pith/VB6BLIQL6CAVV244OAUY24AN2N/action/author_attestation","sign_citation":"https://pith.science/pith/VB6BLIQL6CAVV244OAUY24AN2N/action/citation_signature","submit_replication":"https://pith.science/pith/VB6BLIQL6CAVV244OAUY24AN2N/action/replication_record"}},"created_at":"2026-05-21T01:04:13.332360+00:00","updated_at":"2026-05-21T01:04:13.332360+00:00"}