{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:345Z5MICH23SGS5OITIPEWFLXO","short_pith_number":"pith:345Z5MIC","schema_version":"1.0","canonical_sha256":"df3b9eb1023eb7234bae44d0f258abbb902e70503cc8a880be7c40658569d7c2","source":{"kind":"arxiv","id":"1806.02098","version":4},"attestation_state":"computed","paper":{"title":"k-medoids and p-median clustering are solvable in polynomial time for a 2d Pareto front","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"El-Ghazali Talbi, Frank Nielsen, Nicolas Dupin","submitted_at":"2018-06-06T10:24:07Z","abstract_excerpt":"This paper examines a common extension of k-medoids and k-median clustering in the case of a two-dimensional Pareto front, as generated by bi-objective optimization approaches. A characterization of optimal clusters is provided, which allows to solve the optimization problems to optimality in polynomial time using a common dynamic programming algorithm. More precisely, having $N$ points to cluster in $K$ subsets, the complexity of the algorithm is proven in $O(N^3)$ time and $O(K.N)$ memory space when $K\\geqslant 3$, cases $K=2$ having a time complexity in $O(N^2)$. Furthermore, speeding-up th"},"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":"1806.02098","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2018-06-06T10:24:07Z","cross_cats_sorted":[],"title_canon_sha256":"7daebb85d12e29b11d5c5e25adb2b39b476e7292c1d6d207d94aa77a9e0d4bcd","abstract_canon_sha256":"4f6bf4cbe209bbf762a83dd253f01726610b600523088127a8bcf386e4f59f63"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:04:44.364348Z","signature_b64":"/PFzJQLNepfbgKqLRp2p1uaAWZCtW4NoMfDb15PAStZGEJYw1aYne4VfTkHeo3t8h128nm06XmjetU98aEkyCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"df3b9eb1023eb7234bae44d0f258abbb902e70503cc8a880be7c40658569d7c2","last_reissued_at":"2026-07-05T01:04:44.363911Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:04:44.363911Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"k-medoids and p-median clustering are solvable in polynomial time for a 2d Pareto front","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"El-Ghazali Talbi, Frank Nielsen, Nicolas Dupin","submitted_at":"2018-06-06T10:24:07Z","abstract_excerpt":"This paper examines a common extension of k-medoids and k-median clustering in the case of a two-dimensional Pareto front, as generated by bi-objective optimization approaches. A characterization of optimal clusters is provided, which allows to solve the optimization problems to optimality in polynomial time using a common dynamic programming algorithm. More precisely, having $N$ points to cluster in $K$ subsets, the complexity of the algorithm is proven in $O(N^3)$ time and $O(K.N)$ memory space when $K\\geqslant 3$, cases $K=2$ having a time complexity in $O(N^2)$. Furthermore, speeding-up th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.02098","kind":"arxiv","version":4},"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/1806.02098/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":"1806.02098","created_at":"2026-07-05T01:04:44.363975+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.02098v4","created_at":"2026-07-05T01:04:44.363975+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.02098","created_at":"2026-07-05T01:04:44.363975+00:00"},{"alias_kind":"pith_short_12","alias_value":"345Z5MICH23S","created_at":"2026-07-05T01:04:44.363975+00:00"},{"alias_kind":"pith_short_16","alias_value":"345Z5MICH23SGS5O","created_at":"2026-07-05T01:04:44.363975+00:00"},{"alias_kind":"pith_short_8","alias_value":"345Z5MIC","created_at":"2026-07-05T01:04:44.363975+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1908.09648","citing_title":"Planar p-center problems are solvable in polynomial time when clustering a Pareto Front","ref_index":16,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/345Z5MICH23SGS5OITIPEWFLXO","json":"https://pith.science/pith/345Z5MICH23SGS5OITIPEWFLXO.json","graph_json":"https://pith.science/api/pith-number/345Z5MICH23SGS5OITIPEWFLXO/graph.json","events_json":"https://pith.science/api/pith-number/345Z5MICH23SGS5OITIPEWFLXO/events.json","paper":"https://pith.science/paper/345Z5MIC"},"agent_actions":{"view_html":"https://pith.science/pith/345Z5MICH23SGS5OITIPEWFLXO","download_json":"https://pith.science/pith/345Z5MICH23SGS5OITIPEWFLXO.json","view_paper":"https://pith.science/paper/345Z5MIC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.02098&json=true","fetch_graph":"https://pith.science/api/pith-number/345Z5MICH23SGS5OITIPEWFLXO/graph.json","fetch_events":"https://pith.science/api/pith-number/345Z5MICH23SGS5OITIPEWFLXO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/345Z5MICH23SGS5OITIPEWFLXO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/345Z5MICH23SGS5OITIPEWFLXO/action/storage_attestation","attest_author":"https://pith.science/pith/345Z5MICH23SGS5OITIPEWFLXO/action/author_attestation","sign_citation":"https://pith.science/pith/345Z5MICH23SGS5OITIPEWFLXO/action/citation_signature","submit_replication":"https://pith.science/pith/345Z5MICH23SGS5OITIPEWFLXO/action/replication_record"}},"created_at":"2026-07-05T01:04:44.363975+00:00","updated_at":"2026-07-05T01:04:44.363975+00:00"}