{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:WVUUSMF3TW2LDHUMN4T232CR7J","short_pith_number":"pith:WVUUSMF3","schema_version":"1.0","canonical_sha256":"b5694930bb9db4b19e8c6f27ade851fa66721170f49576491baca8bdf138d5ba","source":{"kind":"arxiv","id":"2011.04221","version":1},"attestation_state":"computed","paper":{"title":"Hardness of Approximation of Euclidean $k$-Median","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","cs.DS","cs.LG"],"primary_cat":"cs.CC","authors_text":"Anup Bhattacharya, Dishant Goyal, Ragesh Jaiswal","submitted_at":"2020-11-09T06:50:34Z","abstract_excerpt":"The Euclidean $k$-median problem is defined in the following manner: given a set $\\mathcal{X}$ of $n$ points in $\\mathbb{R}^{d}$, and an integer $k$, find a set $C \\subset \\mathbb{R}^{d}$ of $k$ points (called centers) such that the cost function $\\Phi(C,\\mathcal{X}) \\equiv \\sum_{x \\in \\mathcal{X}} \\min_{c \\in C} \\|x-c\\|_{2}$ is minimized. The Euclidean $k$-means problem is defined similarly by replacing the distance with squared distance in the cost function. Various hardness of approximation results are known for the Euclidean $k$-means problem. However, no hardness of approximation results "},"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":"2011.04221","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2020-11-09T06:50:34Z","cross_cats_sorted":["cs.CG","cs.DS","cs.LG"],"title_canon_sha256":"0a3a3fcb5a421b858de39fcdd9068972b7803acd44676d525bf0eb864dae9daf","abstract_canon_sha256":"bf0a2d32203e0595d5fe35c3d5d003cbb67e0feaeea811be7362960c1ddd6275"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:38:14.046459Z","signature_b64":"s3wNPLGiY7F9jnTWwGPnb5f56jZ31PMCgcn/FueF3ozpsJ1+zhsWWS1ax27tMygz74HiXluw/KbKZDvLB25zAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b5694930bb9db4b19e8c6f27ade851fa66721170f49576491baca8bdf138d5ba","last_reissued_at":"2026-07-05T03:38:14.046059Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:38:14.046059Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hardness of Approximation of Euclidean $k$-Median","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG","cs.DS","cs.LG"],"primary_cat":"cs.CC","authors_text":"Anup Bhattacharya, Dishant Goyal, Ragesh Jaiswal","submitted_at":"2020-11-09T06:50:34Z","abstract_excerpt":"The Euclidean $k$-median problem is defined in the following manner: given a set $\\mathcal{X}$ of $n$ points in $\\mathbb{R}^{d}$, and an integer $k$, find a set $C \\subset \\mathbb{R}^{d}$ of $k$ points (called centers) such that the cost function $\\Phi(C,\\mathcal{X}) \\equiv \\sum_{x \\in \\mathcal{X}} \\min_{c \\in C} \\|x-c\\|_{2}$ is minimized. The Euclidean $k$-means problem is defined similarly by replacing the distance with squared distance in the cost function. Various hardness of approximation results are known for the Euclidean $k$-means problem. However, no hardness of approximation results "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2011.04221","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2011.04221/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":"2011.04221","created_at":"2026-07-05T03:38:14.046116+00:00"},{"alias_kind":"arxiv_version","alias_value":"2011.04221v1","created_at":"2026-07-05T03:38:14.046116+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2011.04221","created_at":"2026-07-05T03:38:14.046116+00:00"},{"alias_kind":"pith_short_12","alias_value":"WVUUSMF3TW2L","created_at":"2026-07-05T03:38:14.046116+00:00"},{"alias_kind":"pith_short_16","alias_value":"WVUUSMF3TW2LDHUM","created_at":"2026-07-05T03:38:14.046116+00:00"},{"alias_kind":"pith_short_8","alias_value":"WVUUSMF3","created_at":"2026-07-05T03:38:14.046116+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2508.10345","citing_title":"Welfare-Centric Clustering","ref_index":12,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WVUUSMF3TW2LDHUMN4T232CR7J","json":"https://pith.science/pith/WVUUSMF3TW2LDHUMN4T232CR7J.json","graph_json":"https://pith.science/api/pith-number/WVUUSMF3TW2LDHUMN4T232CR7J/graph.json","events_json":"https://pith.science/api/pith-number/WVUUSMF3TW2LDHUMN4T232CR7J/events.json","paper":"https://pith.science/paper/WVUUSMF3"},"agent_actions":{"view_html":"https://pith.science/pith/WVUUSMF3TW2LDHUMN4T232CR7J","download_json":"https://pith.science/pith/WVUUSMF3TW2LDHUMN4T232CR7J.json","view_paper":"https://pith.science/paper/WVUUSMF3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2011.04221&json=true","fetch_graph":"https://pith.science/api/pith-number/WVUUSMF3TW2LDHUMN4T232CR7J/graph.json","fetch_events":"https://pith.science/api/pith-number/WVUUSMF3TW2LDHUMN4T232CR7J/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WVUUSMF3TW2LDHUMN4T232CR7J/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WVUUSMF3TW2LDHUMN4T232CR7J/action/storage_attestation","attest_author":"https://pith.science/pith/WVUUSMF3TW2LDHUMN4T232CR7J/action/author_attestation","sign_citation":"https://pith.science/pith/WVUUSMF3TW2LDHUMN4T232CR7J/action/citation_signature","submit_replication":"https://pith.science/pith/WVUUSMF3TW2LDHUMN4T232CR7J/action/replication_record"}},"created_at":"2026-07-05T03:38:14.046116+00:00","updated_at":"2026-07-05T03:38:14.046116+00:00"}