{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:GOCNZANIT3LQ7SBCCJI57TJ6EO","short_pith_number":"pith:GOCNZANI","schema_version":"1.0","canonical_sha256":"3384dc81a89ed70fc8221251dfcd3e23a23336fb11aeea0641c7017895a7c700","source":{"kind":"arxiv","id":"2111.10912","version":1},"attestation_state":"computed","paper":{"title":"Johnson Coverage Hypothesis: Inapproximability of k-means and k-median in L_p metrics","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CG","cs.DS","cs.LG"],"primary_cat":"cs.CC","authors_text":"Euiwoong Lee, Karthik C. S., Vincent Cohen-Addad","submitted_at":"2021-11-21T22:42:42Z","abstract_excerpt":"K-median and k-means are the two most popular objectives for clustering algorithms. Despite intensive effort, a good understanding of the approximability of these objectives, particularly in $\\ell_p$-metrics, remains a major open problem. In this paper, we significantly improve upon the hardness of approximation factors known in literature for these objectives in $\\ell_p$-metrics.\n  We introduce a new hypothesis called the Johnson Coverage Hypothesis (JCH), which roughly asserts that the well-studied max k-coverage problem on set systems is hard to approximate to a factor greater than 1-1/e, e"},"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":"2111.10912","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2021-11-21T22:42:42Z","cross_cats_sorted":["cs.CG","cs.DS","cs.LG"],"title_canon_sha256":"5b2780634fa503a8c206bd21946eb3c5bd70119ebcf6fc26229b35e01eabaf12","abstract_canon_sha256":"c5130ebd453f132c54c1dff74f62272c88cb751705def0cb54079640816b44b3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:33:58.198771Z","signature_b64":"MxXGvc/wfzFVxrkKZT0UwTkDD2+QoqCjx5nkviqoa2Lh20ZyCNnvbRF5iipXB76cgLIpt3gFXCqrAislm/PeBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3384dc81a89ed70fc8221251dfcd3e23a23336fb11aeea0641c7017895a7c700","last_reissued_at":"2026-07-05T03:33:58.198281Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:33:58.198281Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Johnson Coverage Hypothesis: Inapproximability of k-means and k-median in L_p metrics","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CG","cs.DS","cs.LG"],"primary_cat":"cs.CC","authors_text":"Euiwoong Lee, Karthik C. S., Vincent Cohen-Addad","submitted_at":"2021-11-21T22:42:42Z","abstract_excerpt":"K-median and k-means are the two most popular objectives for clustering algorithms. Despite intensive effort, a good understanding of the approximability of these objectives, particularly in $\\ell_p$-metrics, remains a major open problem. In this paper, we significantly improve upon the hardness of approximation factors known in literature for these objectives in $\\ell_p$-metrics.\n  We introduce a new hypothesis called the Johnson Coverage Hypothesis (JCH), which roughly asserts that the well-studied max k-coverage problem on set systems is hard to approximate to a factor greater than 1-1/e, e"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2111.10912","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/2111.10912/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":"2111.10912","created_at":"2026-07-05T03:33:58.198344+00:00"},{"alias_kind":"arxiv_version","alias_value":"2111.10912v1","created_at":"2026-07-05T03:33:58.198344+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2111.10912","created_at":"2026-07-05T03:33:58.198344+00:00"},{"alias_kind":"pith_short_12","alias_value":"GOCNZANIT3LQ","created_at":"2026-07-05T03:33:58.198344+00:00"},{"alias_kind":"pith_short_16","alias_value":"GOCNZANIT3LQ7SBC","created_at":"2026-07-05T03:33:58.198344+00:00"},{"alias_kind":"pith_short_8","alias_value":"GOCNZANI","created_at":"2026-07-05T03:33:58.198344+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.13533","citing_title":"Learning Augmented Graph $k$-Clustering","ref_index":2021,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GOCNZANIT3LQ7SBCCJI57TJ6EO","json":"https://pith.science/pith/GOCNZANIT3LQ7SBCCJI57TJ6EO.json","graph_json":"https://pith.science/api/pith-number/GOCNZANIT3LQ7SBCCJI57TJ6EO/graph.json","events_json":"https://pith.science/api/pith-number/GOCNZANIT3LQ7SBCCJI57TJ6EO/events.json","paper":"https://pith.science/paper/GOCNZANI"},"agent_actions":{"view_html":"https://pith.science/pith/GOCNZANIT3LQ7SBCCJI57TJ6EO","download_json":"https://pith.science/pith/GOCNZANIT3LQ7SBCCJI57TJ6EO.json","view_paper":"https://pith.science/paper/GOCNZANI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2111.10912&json=true","fetch_graph":"https://pith.science/api/pith-number/GOCNZANIT3LQ7SBCCJI57TJ6EO/graph.json","fetch_events":"https://pith.science/api/pith-number/GOCNZANIT3LQ7SBCCJI57TJ6EO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GOCNZANIT3LQ7SBCCJI57TJ6EO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GOCNZANIT3LQ7SBCCJI57TJ6EO/action/storage_attestation","attest_author":"https://pith.science/pith/GOCNZANIT3LQ7SBCCJI57TJ6EO/action/author_attestation","sign_citation":"https://pith.science/pith/GOCNZANIT3LQ7SBCCJI57TJ6EO/action/citation_signature","submit_replication":"https://pith.science/pith/GOCNZANIT3LQ7SBCCJI57TJ6EO/action/replication_record"}},"created_at":"2026-07-05T03:33:58.198344+00:00","updated_at":"2026-07-05T03:33:58.198344+00:00"}