{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:5DXSST7SQCK6EJJESYK23YHFWM","short_pith_number":"pith:5DXSST7S","schema_version":"1.0","canonical_sha256":"e8ef294ff28095e225249615ade0e5b31e64da9812ee511f7c5fa1b91d025d72","source":{"kind":"arxiv","id":"1605.05590","version":4},"attestation_state":"computed","paper":{"title":"MapReduce and Streaming Algorithms for Diversity Maximization in Metric Spaces of Bounded Doubling Dimension","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Andrea Pietracaprina, Eli Upfal, Geppino Pucci, Matteo Ceccarello","submitted_at":"2016-05-18T14:11:31Z","abstract_excerpt":"Given a dataset of points in a metric space and an integer $k$, a diversity maximization problem requires determining a subset of $k$ points maximizing some diversity objective measure, e.g., the minimum or the average distance between two points in the subset. Diversity maximization is computationally hard, hence only approximate solutions can be hoped for. Although its applications are mainly in massive data analysis, most of the past research on diversity maximization focused on the sequential setting. In this work we present space and pass/round-efficient diversity maximization algorithms "},"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":"1605.05590","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-05-18T14:11:31Z","cross_cats_sorted":[],"title_canon_sha256":"50fd0919bf8b5772064b0670e61b939416182339db901ebdebe38dc2506d38f7","abstract_canon_sha256":"e7db7c848e1339c5296f0db4f617de06a2ae0be51f9bd99a7c1fd897615f426a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:52:23.329440Z","signature_b64":"fhTLRaBBYGFjAFHcozyyvMK+VUABckPUH6zrUiyTlsnHxPtVS96dF+t4q5JJevBu7U47NV7xNtR2DB2xykm5AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e8ef294ff28095e225249615ade0e5b31e64da9812ee511f7c5fa1b91d025d72","last_reissued_at":"2026-05-18T00:52:23.328911Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:52:23.328911Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"MapReduce and Streaming Algorithms for Diversity Maximization in Metric Spaces of Bounded Doubling Dimension","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Andrea Pietracaprina, Eli Upfal, Geppino Pucci, Matteo Ceccarello","submitted_at":"2016-05-18T14:11:31Z","abstract_excerpt":"Given a dataset of points in a metric space and an integer $k$, a diversity maximization problem requires determining a subset of $k$ points maximizing some diversity objective measure, e.g., the minimum or the average distance between two points in the subset. Diversity maximization is computationally hard, hence only approximate solutions can be hoped for. Although its applications are mainly in massive data analysis, most of the past research on diversity maximization focused on the sequential setting. In this work we present space and pass/round-efficient diversity maximization algorithms "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.05590","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":""},"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":"1605.05590","created_at":"2026-05-18T00:52:23.328997+00:00"},{"alias_kind":"arxiv_version","alias_value":"1605.05590v4","created_at":"2026-05-18T00:52:23.328997+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.05590","created_at":"2026-05-18T00:52:23.328997+00:00"},{"alias_kind":"pith_short_12","alias_value":"5DXSST7SQCK6","created_at":"2026-05-18T12:30:01.593930+00:00"},{"alias_kind":"pith_short_16","alias_value":"5DXSST7SQCK6EJJE","created_at":"2026-05-18T12:30:01.593930+00:00"},{"alias_kind":"pith_short_8","alias_value":"5DXSST7S","created_at":"2026-05-18T12:30:01.593930+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/5DXSST7SQCK6EJJESYK23YHFWM","json":"https://pith.science/pith/5DXSST7SQCK6EJJESYK23YHFWM.json","graph_json":"https://pith.science/api/pith-number/5DXSST7SQCK6EJJESYK23YHFWM/graph.json","events_json":"https://pith.science/api/pith-number/5DXSST7SQCK6EJJESYK23YHFWM/events.json","paper":"https://pith.science/paper/5DXSST7S"},"agent_actions":{"view_html":"https://pith.science/pith/5DXSST7SQCK6EJJESYK23YHFWM","download_json":"https://pith.science/pith/5DXSST7SQCK6EJJESYK23YHFWM.json","view_paper":"https://pith.science/paper/5DXSST7S","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1605.05590&json=true","fetch_graph":"https://pith.science/api/pith-number/5DXSST7SQCK6EJJESYK23YHFWM/graph.json","fetch_events":"https://pith.science/api/pith-number/5DXSST7SQCK6EJJESYK23YHFWM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5DXSST7SQCK6EJJESYK23YHFWM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5DXSST7SQCK6EJJESYK23YHFWM/action/storage_attestation","attest_author":"https://pith.science/pith/5DXSST7SQCK6EJJESYK23YHFWM/action/author_attestation","sign_citation":"https://pith.science/pith/5DXSST7SQCK6EJJESYK23YHFWM/action/citation_signature","submit_replication":"https://pith.science/pith/5DXSST7SQCK6EJJESYK23YHFWM/action/replication_record"}},"created_at":"2026-05-18T00:52:23.328997+00:00","updated_at":"2026-05-18T00:52:23.328997+00:00"}