{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:7T2WCXMLED6TRFG5XCE3G5RHHZ","short_pith_number":"pith:7T2WCXML","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"},"canonical_sha256":"fcf5615d8b20fd3894ddb889b376273e4b2500963ea31885ea76b0af723aaf55","source":{"kind":"arxiv","id":"2506.08110","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.08110","created_at":"2026-07-05T11:18:44Z"},{"alias_kind":"arxiv_version","alias_value":"2506.08110v1","created_at":"2026-07-05T11:18:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.08110","created_at":"2026-07-05T11:18:44Z"},{"alias_kind":"pith_short_12","alias_value":"7T2WCXMLED6T","created_at":"2026-07-05T11:18:44Z"},{"alias_kind":"pith_short_16","alias_value":"7T2WCXMLED6TRFG5","created_at":"2026-07-05T11:18:44Z"},{"alias_kind":"pith_short_8","alias_value":"7T2WCXML","created_at":"2026-07-05T11:18:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:7T2WCXMLED6TRFG5XCE3G5RHHZ","target":"record","payload":{"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"},"canonical_sha256":"fcf5615d8b20fd3894ddb889b376273e4b2500963ea31885ea76b0af723aaf55","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"},"source_kind":"arxiv","source_id":"2506.08110","source_version":1,"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-05T11:18:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"y/VTfqiJhURGVe1iMS8iyPv8mLjqsP/FSlTxAXraT440dI6j7u/UvZ/PilAQiabLZWZ2QyL08rHwtLLtahezDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T01:15:56.812521Z"},"content_sha256":"c2e406380586b8aca2d963faf164d08d45ece71330a468142f472853baf15107","schema_version":"1.0","event_id":"sha256:c2e406380586b8aca2d963faf164d08d45ece71330a468142f472853baf15107"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:7T2WCXMLED6TRFG5XCE3G5RHHZ","target":"graph","payload":{"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"},"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-05T11:18:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jnr9VqMy0LmGb1KOJJ6wUYB0FsataxhlfC/J9rIUN3dR0GHpOqQiYFcYttHBN6ypQm6rMGkGoi0Cvhpll472Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T01:15:56.812991Z"},"content_sha256":"917af581b8a98309a8ea7121072b9997f03e82e0aff36167e7dbde175be2c762","schema_version":"1.0","event_id":"sha256:917af581b8a98309a8ea7121072b9997f03e82e0aff36167e7dbde175be2c762"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7T2WCXMLED6TRFG5XCE3G5RHHZ/bundle.json","state_url":"https://pith.science/pith/7T2WCXMLED6TRFG5XCE3G5RHHZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7T2WCXMLED6TRFG5XCE3G5RHHZ/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-08T01:15:56Z","links":{"resolver":"https://pith.science/pith/7T2WCXMLED6TRFG5XCE3G5RHHZ","bundle":"https://pith.science/pith/7T2WCXMLED6TRFG5XCE3G5RHHZ/bundle.json","state":"https://pith.science/pith/7T2WCXMLED6TRFG5XCE3G5RHHZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7T2WCXMLED6TRFG5XCE3G5RHHZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:7T2WCXMLED6TRFG5XCE3G5RHHZ","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":"52c580a88b6b48c90191c568e88d76dbf0982fa7366b3d76137b345b777a33aa","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-06-09T18:05:52Z","title_canon_sha256":"90f050b3ae52077cc80f0ee5242d03c87a301b634d27c08d6a385dd7ce0055bb"},"schema_version":"1.0","source":{"id":"2506.08110","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.08110","created_at":"2026-07-05T11:18:44Z"},{"alias_kind":"arxiv_version","alias_value":"2506.08110v1","created_at":"2026-07-05T11:18:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.08110","created_at":"2026-07-05T11:18:44Z"},{"alias_kind":"pith_short_12","alias_value":"7T2WCXMLED6T","created_at":"2026-07-05T11:18:44Z"},{"alias_kind":"pith_short_16","alias_value":"7T2WCXMLED6TRFG5","created_at":"2026-07-05T11:18:44Z"},{"alias_kind":"pith_short_8","alias_value":"7T2WCXML","created_at":"2026-07-05T11:18:44Z"}],"graph_snapshots":[{"event_id":"sha256:917af581b8a98309a8ea7121072b9997f03e82e0aff36167e7dbde175be2c762","target":"graph","created_at":"2026-07-05T11:18: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/2506.08110/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Florian Adriaens, Nikolaj Tatti","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-06-09T18:05:52Z","title":"Fair Diversity Maximization with Few Representatives"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.08110","kind":"arxiv","version":1},"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:c2e406380586b8aca2d963faf164d08d45ece71330a468142f472853baf15107","target":"record","created_at":"2026-07-05T11:18: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":"52c580a88b6b48c90191c568e88d76dbf0982fa7366b3d76137b345b777a33aa","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2025-06-09T18:05:52Z","title_canon_sha256":"90f050b3ae52077cc80f0ee5242d03c87a301b634d27c08d6a385dd7ce0055bb"},"schema_version":"1.0","source":{"id":"2506.08110","kind":"arxiv","version":1}},"canonical_sha256":"fcf5615d8b20fd3894ddb889b376273e4b2500963ea31885ea76b0af723aaf55","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fcf5615d8b20fd3894ddb889b376273e4b2500963ea31885ea76b0af723aaf55","first_computed_at":"2026-07-05T11:18:44.936999Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:18:44.936999Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"U0xIggNO0JFtnIoZNBpZgxI9Zvt361Gktj609jLbdbzJFkWt8TvRQ7qOIuB59w4iE6i6YR7Ah5pOC5Z6UTy8Dw==","signature_status":"signed_v1","signed_at":"2026-07-05T11:18:44.937458Z","signed_message":"canonical_sha256_bytes"},"source_id":"2506.08110","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c2e406380586b8aca2d963faf164d08d45ece71330a468142f472853baf15107","sha256:917af581b8a98309a8ea7121072b9997f03e82e0aff36167e7dbde175be2c762"],"state_sha256":"e77bfe4523a5539deb2bdb8b37ae31c09cedd64a1a9ed903b9021e195260c02c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Fid5kSJUExji1u5uAAMmQWMUjtoKz9lMeemzK3ID1pItge4ckkN00htIl5ELgU8A9ng59fMfuI99C4wBQ33qBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T01:15:56.816203Z","bundle_sha256":"839d91545b88147c1c79f03db3931e0dc6e745ba2c038aa895be30dc0ec085fa"}}