{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:7T2WCXMLED6TRFG5XCE3G5RHHZ","short_pith_number":"pith:7T2WCXML","schema_version":"1.0","canonical_sha256":"fcf5615d8b20fd3894ddb889b376273e4b2500963ea31885ea76b0af723aaf55","source":{"kind":"arxiv","id":"2506.08110","version":1},"attestation_state":"computed","paper":{"title":"Fair Diversity Maximization with Few Representatives","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Florian Adriaens, Nikolaj Tatti","submitted_at":"2025-06-09T18:05:52Z","abstract_excerpt":"Diversity maximization problem is a well-studied problem where the goal is to find $k$ diverse items. Fair diversity maximization aims to select a diverse subset of $k$ items from a large dataset, while requiring that each group of items be well represented in the output. More formally, given a set of items with labels, our goal is to find $k$ items that maximize the minimum pairwise distance in the set, while maintaining that each label is represented within some budget. In many cases, one is only interested in selecting a handful (say a constant) number of items from each group. In such scen"},"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":"2506.08110","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-06-09T18:05:52Z","cross_cats_sorted":[],"title_canon_sha256":"90f050b3ae52077cc80f0ee5242d03c87a301b634d27c08d6a385dd7ce0055bb","abstract_canon_sha256":"52c580a88b6b48c90191c568e88d76dbf0982fa7366b3d76137b345b777a33aa"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:18:44.937458Z","signature_b64":"U0xIggNO0JFtnIoZNBpZgxI9Zvt361Gktj609jLbdbzJFkWt8TvRQ7qOIuB59w4iE6i6YR7Ah5pOC5Z6UTy8Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fcf5615d8b20fd3894ddb889b376273e4b2500963ea31885ea76b0af723aaf55","last_reissued_at":"2026-07-05T11:18:44.936999Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:18:44.936999Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fair Diversity Maximization with Few Representatives","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Florian Adriaens, Nikolaj Tatti","submitted_at":"2025-06-09T18:05:52Z","abstract_excerpt":"Diversity maximization problem is a well-studied problem where the goal is to find $k$ diverse items. Fair diversity maximization aims to select a diverse subset of $k$ items from a large dataset, while requiring that each group of items be well represented in the output. More formally, given a set of items with labels, our goal is to find $k$ items that maximize the minimum pairwise distance in the set, while maintaining that each label is represented within some budget. In many cases, one is only interested in selecting a handful (say a constant) number of items from each group. In such scen"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.08110","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/2506.08110/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":"2506.08110","created_at":"2026-07-05T11:18:44.937051+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.08110v1","created_at":"2026-07-05T11:18:44.937051+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.08110","created_at":"2026-07-05T11:18:44.937051+00:00"},{"alias_kind":"pith_short_12","alias_value":"7T2WCXMLED6T","created_at":"2026-07-05T11:18:44.937051+00:00"},{"alias_kind":"pith_short_16","alias_value":"7T2WCXMLED6TRFG5","created_at":"2026-07-05T11:18:44.937051+00:00"},{"alias_kind":"pith_short_8","alias_value":"7T2WCXML","created_at":"2026-07-05T11:18:44.937051+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/7T2WCXMLED6TRFG5XCE3G5RHHZ","json":"https://pith.science/pith/7T2WCXMLED6TRFG5XCE3G5RHHZ.json","graph_json":"https://pith.science/api/pith-number/7T2WCXMLED6TRFG5XCE3G5RHHZ/graph.json","events_json":"https://pith.science/api/pith-number/7T2WCXMLED6TRFG5XCE3G5RHHZ/events.json","paper":"https://pith.science/paper/7T2WCXML"},"agent_actions":{"view_html":"https://pith.science/pith/7T2WCXMLED6TRFG5XCE3G5RHHZ","download_json":"https://pith.science/pith/7T2WCXMLED6TRFG5XCE3G5RHHZ.json","view_paper":"https://pith.science/paper/7T2WCXML","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.08110&json=true","fetch_graph":"https://pith.science/api/pith-number/7T2WCXMLED6TRFG5XCE3G5RHHZ/graph.json","fetch_events":"https://pith.science/api/pith-number/7T2WCXMLED6TRFG5XCE3G5RHHZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7T2WCXMLED6TRFG5XCE3G5RHHZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7T2WCXMLED6TRFG5XCE3G5RHHZ/action/storage_attestation","attest_author":"https://pith.science/pith/7T2WCXMLED6TRFG5XCE3G5RHHZ/action/author_attestation","sign_citation":"https://pith.science/pith/7T2WCXMLED6TRFG5XCE3G5RHHZ/action/citation_signature","submit_replication":"https://pith.science/pith/7T2WCXMLED6TRFG5XCE3G5RHHZ/action/replication_record"}},"created_at":"2026-07-05T11:18:44.937051+00:00","updated_at":"2026-07-05T11:18:44.937051+00:00"}