{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:345Z5MICH23SGS5OITIPEWFLXO","short_pith_number":"pith:345Z5MIC","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"},"canonical_sha256":"df3b9eb1023eb7234bae44d0f258abbb902e70503cc8a880be7c40658569d7c2","source":{"kind":"arxiv","id":"1806.02098","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.02098","created_at":"2026-07-05T01:04:44Z"},{"alias_kind":"arxiv_version","alias_value":"1806.02098v4","created_at":"2026-07-05T01:04:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.02098","created_at":"2026-07-05T01:04:44Z"},{"alias_kind":"pith_short_12","alias_value":"345Z5MICH23S","created_at":"2026-07-05T01:04:44Z"},{"alias_kind":"pith_short_16","alias_value":"345Z5MICH23SGS5O","created_at":"2026-07-05T01:04:44Z"},{"alias_kind":"pith_short_8","alias_value":"345Z5MIC","created_at":"2026-07-05T01:04:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:345Z5MICH23SGS5OITIPEWFLXO","target":"record","payload":{"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"},"canonical_sha256":"df3b9eb1023eb7234bae44d0f258abbb902e70503cc8a880be7c40658569d7c2","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"},"source_kind":"arxiv","source_id":"1806.02098","source_version":4,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T01:04:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EGJmSxo66Yv3LGpoqs0AICU377bsf2VvLL9cl+QZWKIfLwQaFUkzrixL/EJCplElSnCs6+MNq7WB7uT5tlD3Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T23:50:23.818895Z"},"content_sha256":"2ada271c3dbe9cc756ad543b7e149a022275836981ddbcd155ad24f21deac7ca","schema_version":"1.0","event_id":"sha256:2ada271c3dbe9cc756ad543b7e149a022275836981ddbcd155ad24f21deac7ca"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:345Z5MICH23SGS5OITIPEWFLXO","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T01:04:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J3BW2S7SJM19hikt+XAdLBEwvBqelR6EB2y2EgfyZcuJVNIr2p9K3YJZpwsGzXsHCZR3UJ/3nDUastQh90p9Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T23:50:23.819382Z"},"content_sha256":"e7d9897e36db2d292180f8d04f4139d68ed073119fbe0a3a35eb8df55b6d90a1","schema_version":"1.0","event_id":"sha256:e7d9897e36db2d292180f8d04f4139d68ed073119fbe0a3a35eb8df55b6d90a1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/345Z5MICH23SGS5OITIPEWFLXO/bundle.json","state_url":"https://pith.science/pith/345Z5MICH23SGS5OITIPEWFLXO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/345Z5MICH23SGS5OITIPEWFLXO/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-16T23:50:23Z","links":{"resolver":"https://pith.science/pith/345Z5MICH23SGS5OITIPEWFLXO","bundle":"https://pith.science/pith/345Z5MICH23SGS5OITIPEWFLXO/bundle.json","state":"https://pith.science/pith/345Z5MICH23SGS5OITIPEWFLXO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/345Z5MICH23SGS5OITIPEWFLXO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:345Z5MICH23SGS5OITIPEWFLXO","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"4f6bf4cbe209bbf762a83dd253f01726610b600523088127a8bcf386e4f59f63","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2018-06-06T10:24:07Z","title_canon_sha256":"7daebb85d12e29b11d5c5e25adb2b39b476e7292c1d6d207d94aa77a9e0d4bcd"},"schema_version":"1.0","source":{"id":"1806.02098","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.02098","created_at":"2026-07-05T01:04:44Z"},{"alias_kind":"arxiv_version","alias_value":"1806.02098v4","created_at":"2026-07-05T01:04:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.02098","created_at":"2026-07-05T01:04:44Z"},{"alias_kind":"pith_short_12","alias_value":"345Z5MICH23S","created_at":"2026-07-05T01:04:44Z"},{"alias_kind":"pith_short_16","alias_value":"345Z5MICH23SGS5O","created_at":"2026-07-05T01:04:44Z"},{"alias_kind":"pith_short_8","alias_value":"345Z5MIC","created_at":"2026-07-05T01:04:44Z"}],"graph_snapshots":[{"event_id":"sha256:e7d9897e36db2d292180f8d04f4139d68ed073119fbe0a3a35eb8df55b6d90a1","target":"graph","created_at":"2026-07-05T01:04:44Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1806.02098/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"El-Ghazali Talbi, Frank Nielsen, Nicolas Dupin","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2018-06-06T10:24:07Z","title":"k-medoids and p-median clustering are solvable in polynomial time for a 2d Pareto front"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.02098","kind":"arxiv","version":4},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:2ada271c3dbe9cc756ad543b7e149a022275836981ddbcd155ad24f21deac7ca","target":"record","created_at":"2026-07-05T01:04:44Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"4f6bf4cbe209bbf762a83dd253f01726610b600523088127a8bcf386e4f59f63","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2018-06-06T10:24:07Z","title_canon_sha256":"7daebb85d12e29b11d5c5e25adb2b39b476e7292c1d6d207d94aa77a9e0d4bcd"},"schema_version":"1.0","source":{"id":"1806.02098","kind":"arxiv","version":4}},"canonical_sha256":"df3b9eb1023eb7234bae44d0f258abbb902e70503cc8a880be7c40658569d7c2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"df3b9eb1023eb7234bae44d0f258abbb902e70503cc8a880be7c40658569d7c2","first_computed_at":"2026-07-05T01:04:44.363911Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:04:44.363911Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/PFzJQLNepfbgKqLRp2p1uaAWZCtW4NoMfDb15PAStZGEJYw1aYne4VfTkHeo3t8h128nm06XmjetU98aEkyCA==","signature_status":"signed_v1","signed_at":"2026-07-05T01:04:44.364348Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.02098","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2ada271c3dbe9cc756ad543b7e149a022275836981ddbcd155ad24f21deac7ca","sha256:e7d9897e36db2d292180f8d04f4139d68ed073119fbe0a3a35eb8df55b6d90a1"],"state_sha256":"6e880d0924b3ebcc0293e9982498c3d490ee1949f78df9206a3e19a68a42480b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"V3WNVQjYCeVj/t8dA+q6O9bamOCfClcstI++Lkiuvaavma9BgJcTQx6/nDDUoAC42IQ8eG6aPXALNcUFKCzADg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T23:50:23.824200Z","bundle_sha256":"adf78735e41797bc1bdbbe3be3a068ee7054c9bf3e6f70a9f161fb56f8398ee4"}}