{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:SU4TZMB6UTVLHDKTTVB7DB2EP3","short_pith_number":"pith:SU4TZMB6","schema_version":"1.0","canonical_sha256":"95393cb03ea4eab38d539d43f187447edcebf3ed0ab839cff795d429c41ad2d1","source":{"kind":"arxiv","id":"1809.09521","version":1},"attestation_state":"computed","paper":{"title":"Diversity maximization in doubling metrics","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Alfonso Cevallos, Friedrich Eisenbrand, Sarah Morell","submitted_at":"2018-09-25T14:46:05Z","abstract_excerpt":"Diversity maximization is an important geometric optimization problem with many applications in recommender systems, machine learning or search engines among others. A typical diversification problem is as follows: Given a finite metric space $(X,d)$ and a parameter $k \\in \\mathbb{N}$, find a subset of $k$ elements of $X$ that has maximum diversity. There are many functions that measure diversity. One of the most popular measures, called remote-clique, is the sum of the pairwise distances of the chosen elements. In this paper, we present novel results on three widely used diversity measures: R"},"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":"1809.09521","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2018-09-25T14:46:05Z","cross_cats_sorted":[],"title_canon_sha256":"3135b4e7448a7164e0cf7321b3422062903fb9663ba40d1369cc8ee68a981987","abstract_canon_sha256":"d35d71bbed46748507395640229160195972806352b3299260ac85bd4434b6cd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:04:50.909792Z","signature_b64":"CueZiWSSQRXUqQaMlJF1Mfoey3own/MmoiWRshhXfmLjPQDYQwbAODGD3+sT1zh/f5Pk03X00oamoP7idEDxAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"95393cb03ea4eab38d539d43f187447edcebf3ed0ab839cff795d429c41ad2d1","last_reissued_at":"2026-05-18T00:04:50.909201Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:04:50.909201Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Diversity maximization in doubling metrics","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Alfonso Cevallos, Friedrich Eisenbrand, Sarah Morell","submitted_at":"2018-09-25T14:46:05Z","abstract_excerpt":"Diversity maximization is an important geometric optimization problem with many applications in recommender systems, machine learning or search engines among others. A typical diversification problem is as follows: Given a finite metric space $(X,d)$ and a parameter $k \\in \\mathbb{N}$, find a subset of $k$ elements of $X$ that has maximum diversity. There are many functions that measure diversity. One of the most popular measures, called remote-clique, is the sum of the pairwise distances of the chosen elements. In this paper, we present novel results on three widely used diversity measures: R"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.09521","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":""},"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":"1809.09521","created_at":"2026-05-18T00:04:50.909289+00:00"},{"alias_kind":"arxiv_version","alias_value":"1809.09521v1","created_at":"2026-05-18T00:04:50.909289+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.09521","created_at":"2026-05-18T00:04:50.909289+00:00"},{"alias_kind":"pith_short_12","alias_value":"SU4TZMB6UTVL","created_at":"2026-05-18T12:32:53.628368+00:00"},{"alias_kind":"pith_short_16","alias_value":"SU4TZMB6UTVLHDKT","created_at":"2026-05-18T12:32:53.628368+00:00"},{"alias_kind":"pith_short_8","alias_value":"SU4TZMB6","created_at":"2026-05-18T12:32:53.628368+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/SU4TZMB6UTVLHDKTTVB7DB2EP3","json":"https://pith.science/pith/SU4TZMB6UTVLHDKTTVB7DB2EP3.json","graph_json":"https://pith.science/api/pith-number/SU4TZMB6UTVLHDKTTVB7DB2EP3/graph.json","events_json":"https://pith.science/api/pith-number/SU4TZMB6UTVLHDKTTVB7DB2EP3/events.json","paper":"https://pith.science/paper/SU4TZMB6"},"agent_actions":{"view_html":"https://pith.science/pith/SU4TZMB6UTVLHDKTTVB7DB2EP3","download_json":"https://pith.science/pith/SU4TZMB6UTVLHDKTTVB7DB2EP3.json","view_paper":"https://pith.science/paper/SU4TZMB6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1809.09521&json=true","fetch_graph":"https://pith.science/api/pith-number/SU4TZMB6UTVLHDKTTVB7DB2EP3/graph.json","fetch_events":"https://pith.science/api/pith-number/SU4TZMB6UTVLHDKTTVB7DB2EP3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SU4TZMB6UTVLHDKTTVB7DB2EP3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SU4TZMB6UTVLHDKTTVB7DB2EP3/action/storage_attestation","attest_author":"https://pith.science/pith/SU4TZMB6UTVLHDKTTVB7DB2EP3/action/author_attestation","sign_citation":"https://pith.science/pith/SU4TZMB6UTVLHDKTTVB7DB2EP3/action/citation_signature","submit_replication":"https://pith.science/pith/SU4TZMB6UTVLHDKTTVB7DB2EP3/action/replication_record"}},"created_at":"2026-05-18T00:04:50.909289+00:00","updated_at":"2026-05-18T00:04:50.909289+00:00"}