{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:323MP7U2OOOBE6LYB73LCZNISU","short_pith_number":"pith:323MP7U2","schema_version":"1.0","canonical_sha256":"deb6c7fe9a739c1279780ff6b165a8953992cda190ee181d539f2c058c0a6cf1","source":{"kind":"arxiv","id":"2407.08295","version":1},"attestation_state":"computed","paper":{"title":"Hybrid k-Clustering: Blending k-Median and k-Center","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.DS","authors_text":"Fedor V. Fomin, Meirav Zehavi, Petr A. Golovach, Saket Saurabh, Tanmay Inamdar","submitted_at":"2024-07-11T08:40:34Z","abstract_excerpt":"We propose a novel clustering model encompassing two well-known clustering models: k-center clustering and k-median clustering. In the Hybrid k-Clusetring problem, given a set P of points in R^d, an integer k, and a non-negative real r, our objective is to position k closed balls of radius r to minimize the sum of distances from points not covered by the balls to their closest balls. Equivalently, we seek an optimal L_1-fitting of a union of k balls of radius r to a set of points in the Euclidean space. When r=0, this corresponds to k-median; when the minimum sum is zero, indicating complete c"},"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":"2407.08295","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-07-11T08:40:34Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"809f533413f63a86802ea2ddb56713a0f193754d68e82c201df4c30dc8a8d936","abstract_canon_sha256":"78a9f21a743fe1ca6c5c60bf9ec0356cf1d1214ceb1787d6d053d80fcb7de594"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:42:46.388285Z","signature_b64":"tqsw9awHeuVpejVt20W4h/uzubchNFzrg8j3bdrYmiUkHlyDnlDh3Y1g6cAktYp8nxort26c4nyM7GBrrXKYCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"deb6c7fe9a739c1279780ff6b165a8953992cda190ee181d539f2c058c0a6cf1","last_reissued_at":"2026-07-05T08:42:46.387869Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:42:46.387869Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hybrid k-Clustering: Blending k-Median and k-Center","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.DS","authors_text":"Fedor V. Fomin, Meirav Zehavi, Petr A. Golovach, Saket Saurabh, Tanmay Inamdar","submitted_at":"2024-07-11T08:40:34Z","abstract_excerpt":"We propose a novel clustering model encompassing two well-known clustering models: k-center clustering and k-median clustering. In the Hybrid k-Clusetring problem, given a set P of points in R^d, an integer k, and a non-negative real r, our objective is to position k closed balls of radius r to minimize the sum of distances from points not covered by the balls to their closest balls. Equivalently, we seek an optimal L_1-fitting of a union of k balls of radius r to a set of points in the Euclidean space. When r=0, this corresponds to k-median; when the minimum sum is zero, indicating complete c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.08295","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/2407.08295/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":"2407.08295","created_at":"2026-07-05T08:42:46.387923+00:00"},{"alias_kind":"arxiv_version","alias_value":"2407.08295v1","created_at":"2026-07-05T08:42:46.387923+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.08295","created_at":"2026-07-05T08:42:46.387923+00:00"},{"alias_kind":"pith_short_12","alias_value":"323MP7U2OOOB","created_at":"2026-07-05T08:42:46.387923+00:00"},{"alias_kind":"pith_short_16","alias_value":"323MP7U2OOOBE6LY","created_at":"2026-07-05T08:42:46.387923+00:00"},{"alias_kind":"pith_short_8","alias_value":"323MP7U2","created_at":"2026-07-05T08:42:46.387923+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/323MP7U2OOOBE6LYB73LCZNISU","json":"https://pith.science/pith/323MP7U2OOOBE6LYB73LCZNISU.json","graph_json":"https://pith.science/api/pith-number/323MP7U2OOOBE6LYB73LCZNISU/graph.json","events_json":"https://pith.science/api/pith-number/323MP7U2OOOBE6LYB73LCZNISU/events.json","paper":"https://pith.science/paper/323MP7U2"},"agent_actions":{"view_html":"https://pith.science/pith/323MP7U2OOOBE6LYB73LCZNISU","download_json":"https://pith.science/pith/323MP7U2OOOBE6LYB73LCZNISU.json","view_paper":"https://pith.science/paper/323MP7U2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2407.08295&json=true","fetch_graph":"https://pith.science/api/pith-number/323MP7U2OOOBE6LYB73LCZNISU/graph.json","fetch_events":"https://pith.science/api/pith-number/323MP7U2OOOBE6LYB73LCZNISU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/323MP7U2OOOBE6LYB73LCZNISU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/323MP7U2OOOBE6LYB73LCZNISU/action/storage_attestation","attest_author":"https://pith.science/pith/323MP7U2OOOBE6LYB73LCZNISU/action/author_attestation","sign_citation":"https://pith.science/pith/323MP7U2OOOBE6LYB73LCZNISU/action/citation_signature","submit_replication":"https://pith.science/pith/323MP7U2OOOBE6LYB73LCZNISU/action/replication_record"}},"created_at":"2026-07-05T08:42:46.387923+00:00","updated_at":"2026-07-05T08:42:46.387923+00:00"}